./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/mix053.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_670dfbfa-750d-4394-a19d-2d77acdc8718/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_670dfbfa-750d-4394-a19d-2d77acdc8718/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_670dfbfa-750d-4394-a19d-2d77acdc8718/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_670dfbfa-750d-4394-a19d-2d77acdc8718/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix053.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_670dfbfa-750d-4394-a19d-2d77acdc8718/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_670dfbfa-750d-4394-a19d-2d77acdc8718/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 998817f829569afa1d1e3eda89c2594d280c8ae81957c207a6b68804966cf3a6 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-28 20:38:28,686 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-28 20:38:28,748 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_670dfbfa-750d-4394-a19d-2d77acdc8718/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-28 20:38:28,753 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-28 20:38:28,754 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-28 20:38:28,778 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-28 20:38:28,779 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-28 20:38:28,779 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-28 20:38:28,780 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-28 20:38:28,781 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-28 20:38:28,781 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-28 20:38:28,782 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-28 20:38:28,782 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-28 20:38:28,783 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-28 20:38:28,783 INFO L153 SettingsManager]: * Use SBE=true [2023-11-28 20:38:28,784 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-28 20:38:28,785 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-28 20:38:28,785 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-28 20:38:28,786 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-28 20:38:28,786 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-28 20:38:28,787 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-28 20:38:28,788 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-28 20:38:28,789 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-28 20:38:28,789 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-28 20:38:28,790 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-28 20:38:28,790 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-28 20:38:28,791 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-28 20:38:28,791 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-28 20:38:28,792 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-28 20:38:28,792 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-28 20:38:28,792 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-28 20:38:28,793 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-28 20:38:28,793 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-28 20:38:28,793 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-28 20:38:28,794 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-28 20:38:28,794 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-28 20:38:28,794 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-28 20:38:28,794 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-28 20:38:28,794 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-28 20:38:28,795 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-28 20:38:28,795 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-28 20:38:28,795 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_670dfbfa-750d-4394-a19d-2d77acdc8718/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_670dfbfa-750d-4394-a19d-2d77acdc8718/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 -> 998817f829569afa1d1e3eda89c2594d280c8ae81957c207a6b68804966cf3a6 [2023-11-28 20:38:28,990 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-28 20:38:29,010 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-28 20:38:29,013 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-28 20:38:29,014 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-28 20:38:29,014 INFO L274 PluginConnector]: CDTParser initialized [2023-11-28 20:38:29,016 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_670dfbfa-750d-4394-a19d-2d77acdc8718/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/pthread-wmm/mix053.opt.i [2023-11-28 20:38:31,749 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-28 20:38:31,962 INFO L384 CDTParser]: Found 1 translation units. [2023-11-28 20:38:31,963 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_670dfbfa-750d-4394-a19d-2d77acdc8718/sv-benchmarks/c/pthread-wmm/mix053.opt.i [2023-11-28 20:38:31,978 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_670dfbfa-750d-4394-a19d-2d77acdc8718/bin/uautomizer-verify-BQ2R08f2Ya/data/4270c7252/7d67c1564052448ba9a20c2842894f64/FLAGd703a344d [2023-11-28 20:38:31,989 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_670dfbfa-750d-4394-a19d-2d77acdc8718/bin/uautomizer-verify-BQ2R08f2Ya/data/4270c7252/7d67c1564052448ba9a20c2842894f64 [2023-11-28 20:38:31,991 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-28 20:38:31,992 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-28 20:38:31,993 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-28 20:38:31,993 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-28 20:38:31,997 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-28 20:38:31,998 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:38:31" (1/1) ... [2023-11-28 20:38:31,999 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a6361a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:38:31, skipping insertion in model container [2023-11-28 20:38:31,999 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:38:31" (1/1) ... [2023-11-28 20:38:32,056 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-28 20:38:32,396 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-28 20:38:32,408 INFO L202 MainTranslator]: Completed pre-run [2023-11-28 20:38:32,465 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-28 20:38:32,501 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-28 20:38:32,501 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-28 20:38:32,509 INFO L206 MainTranslator]: Completed translation [2023-11-28 20:38:32,509 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:38:32 WrapperNode [2023-11-28 20:38:32,510 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-28 20:38:32,511 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-28 20:38:32,511 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-28 20:38:32,511 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-28 20:38:32,519 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:38:32" (1/1) ... [2023-11-28 20:38:32,536 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:38:32" (1/1) ... [2023-11-28 20:38:32,565 INFO L138 Inliner]: procedures = 177, calls = 68, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 148 [2023-11-28 20:38:32,565 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-28 20:38:32,566 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-28 20:38:32,566 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-28 20:38:32,566 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-28 20:38:32,578 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:38:32" (1/1) ... [2023-11-28 20:38:32,578 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:38:32" (1/1) ... [2023-11-28 20:38:32,583 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:38:32" (1/1) ... [2023-11-28 20:38:32,602 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-28 20:38:32,602 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:38:32" (1/1) ... [2023-11-28 20:38:32,602 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:38:32" (1/1) ... [2023-11-28 20:38:32,612 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:38:32" (1/1) ... [2023-11-28 20:38:32,615 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:38:32" (1/1) ... [2023-11-28 20:38:32,618 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:38:32" (1/1) ... [2023-11-28 20:38:32,620 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:38:32" (1/1) ... [2023-11-28 20:38:32,624 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-28 20:38:32,625 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-28 20:38:32,625 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-28 20:38:32,625 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-28 20:38:32,626 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:38:32" (1/1) ... [2023-11-28 20:38:32,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-28 20:38:32,643 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_670dfbfa-750d-4394-a19d-2d77acdc8718/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 20:38:32,655 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_670dfbfa-750d-4394-a19d-2d77acdc8718/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-28 20:38:32,661 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_670dfbfa-750d-4394-a19d-2d77acdc8718/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-28 20:38:32,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-28 20:38:32,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-28 20:38:32,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-28 20:38:32,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-11-28 20:38:32,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2023-11-28 20:38:32,694 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-28 20:38:32,695 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-28 20:38:32,695 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-28 20:38:32,695 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-28 20:38:32,695 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-28 20:38:32,695 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-28 20:38:32,696 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-28 20:38:32,696 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-28 20:38:32,696 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-28 20:38:32,696 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-28 20:38:32,697 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-11-28 20:38:32,697 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-11-28 20:38:32,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-28 20:38:32,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-28 20:38:32,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-28 20:38:32,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-11-28 20:38:32,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2023-11-28 20:38:32,698 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-28 20:38:32,698 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-28 20:38:32,699 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-28 20:38:32,700 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-28 20:38:32,853 INFO L241 CfgBuilder]: Building ICFG [2023-11-28 20:38:32,855 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-28 20:38:33,144 INFO L282 CfgBuilder]: Performing block encoding [2023-11-28 20:38:33,307 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-28 20:38:33,307 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-28 20:38:33,307 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:38:33 BoogieIcfgContainer [2023-11-28 20:38:33,307 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-28 20:38:33,309 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-28 20:38:33,310 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-28 20:38:33,313 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-28 20:38:33,313 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 08:38:31" (1/3) ... [2023-11-28 20:38:33,314 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@702f7c34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 08:38:33, skipping insertion in model container [2023-11-28 20:38:33,314 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:38:32" (2/3) ... [2023-11-28 20:38:33,314 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@702f7c34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 08:38:33, skipping insertion in model container [2023-11-28 20:38:33,314 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:38:33" (3/3) ... [2023-11-28 20:38:33,315 INFO L112 eAbstractionObserver]: Analyzing ICFG mix053.opt.i [2023-11-28 20:38:33,333 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-28 20:38:33,333 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2023-11-28 20:38:33,333 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-28 20:38:33,384 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-28 20:38:33,418 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 76 places, 65 transitions, 146 flow [2023-11-28 20:38:33,452 INFO L124 PetriNetUnfolderBase]: 2/61 cut-off events. [2023-11-28 20:38:33,453 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-28 20:38:33,456 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74 conditions, 61 events. 2/61 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 129 event pairs, 0 based on Foata normal form. 0/48 useless extension candidates. Maximal degree in co-relation 62. Up to 2 conditions per place. [2023-11-28 20:38:33,457 INFO L82 GeneralOperation]: Start removeDead. Operand has 76 places, 65 transitions, 146 flow [2023-11-28 20:38:33,461 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 72 places, 61 transitions, 134 flow [2023-11-28 20:38:33,471 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-28 20:38:33,477 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;@441219e7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-28 20:38:33,477 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-11-28 20:38:33,480 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-28 20:38:33,481 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-11-28 20:38:33,481 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-28 20:38:33,481 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:38:33,481 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-28 20:38:33,482 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-28 20:38:33,486 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:38:33,486 INFO L85 PathProgramCache]: Analyzing trace with hash 12921, now seen corresponding path program 1 times [2023-11-28 20:38:33,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:38:33,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656568018] [2023-11-28 20:38:33,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:38:33,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:38:33,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:38:33,723 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-28 20:38:33,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:38:33,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656568018] [2023-11-28 20:38:33,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656568018] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:38:33,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:38:33,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-28 20:38:33,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173855515] [2023-11-28 20:38:33,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:38:33,736 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 20:38:33,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:38:33,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 20:38:33,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 20:38:33,794 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 65 [2023-11-28 20:38:33,797 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 61 transitions, 134 flow. Second operand has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:38:33,797 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:38:33,797 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 65 [2023-11-28 20:38:33,798 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:38:34,310 INFO L124 PetriNetUnfolderBase]: 1175/2175 cut-off events. [2023-11-28 20:38:34,310 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2023-11-28 20:38:34,321 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3912 conditions, 2175 events. 1175/2175 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 17078 event pairs, 879 based on Foata normal form. 120/2110 useless extension candidates. Maximal degree in co-relation 3897. Up to 1277 conditions per place. [2023-11-28 20:38:34,340 INFO L140 encePairwiseOnDemand]: 60/65 looper letters, 30 selfloop transitions, 2 changer transitions 0/65 dead transitions. [2023-11-28 20:38:34,340 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 65 transitions, 206 flow [2023-11-28 20:38:34,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 20:38:34,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-28 20:38:34,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 146 transitions. [2023-11-28 20:38:34,353 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7487179487179487 [2023-11-28 20:38:34,354 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 146 transitions. [2023-11-28 20:38:34,354 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 146 transitions. [2023-11-28 20:38:34,355 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:38:34,358 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 146 transitions. [2023-11-28 20:38:34,360 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:38:34,364 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 65.0) internal successors, (260), 4 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:38:34,364 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 65.0) internal successors, (260), 4 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:38:34,366 INFO L175 Difference]: Start difference. First operand has 72 places, 61 transitions, 134 flow. Second operand 3 states and 146 transitions. [2023-11-28 20:38:34,367 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 65 transitions, 206 flow [2023-11-28 20:38:34,370 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 65 transitions, 202 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-28 20:38:34,373 INFO L231 Difference]: Finished difference. Result has 68 places, 57 transitions, 126 flow [2023-11-28 20:38:34,375 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, 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-28 20:38:34,379 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -4 predicate places. [2023-11-28 20:38:34,379 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 57 transitions, 126 flow [2023-11-28 20:38:34,380 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:38:34,380 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:38:34,380 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-28 20:38:34,380 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-28 20:38:34,380 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-28 20:38:34,381 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:38:34,381 INFO L85 PathProgramCache]: Analyzing trace with hash 12922, now seen corresponding path program 1 times [2023-11-28 20:38:34,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:38:34,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705500401] [2023-11-28 20:38:34,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:38:34,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:38:34,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:38:34,480 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-28 20:38:34,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:38:34,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705500401] [2023-11-28 20:38:34,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705500401] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:38:34,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:38:34,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-28 20:38:34,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487606483] [2023-11-28 20:38:34,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:38:34,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 20:38:34,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:38:34,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 20:38:34,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 20:38:34,504 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 65 [2023-11-28 20:38:34,504 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 57 transitions, 126 flow. Second operand has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:38:34,504 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:38:34,504 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 65 [2023-11-28 20:38:34,504 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:38:34,920 INFO L124 PetriNetUnfolderBase]: 1175/2174 cut-off events. [2023-11-28 20:38:34,920 INFO L125 PetriNetUnfolderBase]: For 60/60 co-relation queries the response was YES. [2023-11-28 20:38:34,926 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3968 conditions, 2174 events. 1175/2174 cut-off events. For 60/60 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 17010 event pairs, 879 based on Foata normal form. 1/1990 useless extension candidates. Maximal degree in co-relation 3957. Up to 1276 conditions per place. [2023-11-28 20:38:34,942 INFO L140 encePairwiseOnDemand]: 62/65 looper letters, 29 selfloop transitions, 2 changer transitions 0/64 dead transitions. [2023-11-28 20:38:34,942 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 64 transitions, 202 flow [2023-11-28 20:38:34,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 20:38:34,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-28 20:38:34,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 146 transitions. [2023-11-28 20:38:34,945 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7487179487179487 [2023-11-28 20:38:34,945 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 146 transitions. [2023-11-28 20:38:34,945 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 146 transitions. [2023-11-28 20:38:34,946 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:38:34,946 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 146 transitions. [2023-11-28 20:38:34,947 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:38:34,948 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 65.0) internal successors, (260), 4 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:38:34,949 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 65.0) internal successors, (260), 4 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:38:34,949 INFO L175 Difference]: Start difference. First operand has 68 places, 57 transitions, 126 flow. Second operand 3 states and 146 transitions. [2023-11-28 20:38:34,949 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 64 transitions, 202 flow [2023-11-28 20:38:34,954 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 64 transitions, 198 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-28 20:38:34,956 INFO L231 Difference]: Finished difference. Result has 67 places, 56 transitions, 124 flow [2023-11-28 20:38:34,956 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, 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-28 20:38:34,957 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -5 predicate places. [2023-11-28 20:38:34,957 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 56 transitions, 124 flow [2023-11-28 20:38:34,957 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:38:34,957 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:38:34,958 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-28 20:38:34,958 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-28 20:38:34,958 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-28 20:38:34,958 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:38:34,959 INFO L85 PathProgramCache]: Analyzing trace with hash 385334006, now seen corresponding path program 1 times [2023-11-28 20:38:34,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:38:34,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844944467] [2023-11-28 20:38:34,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:38:34,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:38:34,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:38:35,021 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-28 20:38:35,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:38:35,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844944467] [2023-11-28 20:38:35,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844944467] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:38:35,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:38:35,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-28 20:38:35,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657302828] [2023-11-28 20:38:35,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:38:35,023 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 20:38:35,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:38:35,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 20:38:35,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 20:38:35,042 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 65 [2023-11-28 20:38:35,043 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 56 transitions, 124 flow. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:38:35,043 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:38:35,043 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 65 [2023-11-28 20:38:35,043 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:38:35,400 INFO L124 PetriNetUnfolderBase]: 1176/2173 cut-off events. [2023-11-28 20:38:35,400 INFO L125 PetriNetUnfolderBase]: For 60/60 co-relation queries the response was YES. [2023-11-28 20:38:35,406 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3970 conditions, 2173 events. 1176/2173 cut-off events. For 60/60 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 16949 event pairs, 742 based on Foata normal form. 0/1992 useless extension candidates. Maximal degree in co-relation 3959. Up to 1276 conditions per place. [2023-11-28 20:38:35,422 INFO L140 encePairwiseOnDemand]: 62/65 looper letters, 30 selfloop transitions, 2 changer transitions 0/63 dead transitions. [2023-11-28 20:38:35,422 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 63 transitions, 202 flow [2023-11-28 20:38:35,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 20:38:35,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-28 20:38:35,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 144 transitions. [2023-11-28 20:38:35,424 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7384615384615385 [2023-11-28 20:38:35,424 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 144 transitions. [2023-11-28 20:38:35,424 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 144 transitions. [2023-11-28 20:38:35,424 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:38:35,424 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 144 transitions. [2023-11-28 20:38:35,425 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:38:35,426 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 65.0) internal successors, (260), 4 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:38:35,426 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 65.0) internal successors, (260), 4 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:38:35,427 INFO L175 Difference]: Start difference. First operand has 67 places, 56 transitions, 124 flow. Second operand 3 states and 144 transitions. [2023-11-28 20:38:35,427 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 63 transitions, 202 flow [2023-11-28 20:38:35,430 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 63 transitions, 198 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-28 20:38:35,432 INFO L231 Difference]: Finished difference. Result has 66 places, 55 transitions, 122 flow [2023-11-28 20:38:35,432 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, 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-28 20:38:35,433 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -6 predicate places. [2023-11-28 20:38:35,433 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 55 transitions, 122 flow [2023-11-28 20:38:35,433 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:38:35,433 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:38:35,433 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-28 20:38:35,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-28 20:38:35,434 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-28 20:38:35,434 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:38:35,434 INFO L85 PathProgramCache]: Analyzing trace with hash 385334007, now seen corresponding path program 1 times [2023-11-28 20:38:35,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:38:35,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993391313] [2023-11-28 20:38:35,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:38:35,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:38:35,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:38:35,511 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-28 20:38:35,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:38:35,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993391313] [2023-11-28 20:38:35,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993391313] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:38:35,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:38:35,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-28 20:38:35,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051307469] [2023-11-28 20:38:35,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:38:35,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 20:38:35,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:38:35,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 20:38:35,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 20:38:35,531 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 65 [2023-11-28 20:38:35,531 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 55 transitions, 122 flow. Second operand has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:38:35,531 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:38:35,531 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 65 [2023-11-28 20:38:35,531 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:38:35,881 INFO L124 PetriNetUnfolderBase]: 1175/2170 cut-off events. [2023-11-28 20:38:35,882 INFO L125 PetriNetUnfolderBase]: For 61/61 co-relation queries the response was YES. [2023-11-28 20:38:35,886 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3965 conditions, 2170 events. 1175/2170 cut-off events. For 61/61 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 16861 event pairs, 742 based on Foata normal form. 2/1992 useless extension candidates. Maximal degree in co-relation 3955. Up to 1273 conditions per place. [2023-11-28 20:38:35,901 INFO L140 encePairwiseOnDemand]: 62/65 looper letters, 29 selfloop transitions, 2 changer transitions 0/62 dead transitions. [2023-11-28 20:38:35,901 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 62 transitions, 198 flow [2023-11-28 20:38:35,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 20:38:35,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-28 20:38:35,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 146 transitions. [2023-11-28 20:38:35,903 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7487179487179487 [2023-11-28 20:38:35,903 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 146 transitions. [2023-11-28 20:38:35,904 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 146 transitions. [2023-11-28 20:38:35,904 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:38:35,904 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 146 transitions. [2023-11-28 20:38:35,905 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:38:35,906 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 65.0) internal successors, (260), 4 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:38:35,906 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 65.0) internal successors, (260), 4 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:38:35,906 INFO L175 Difference]: Start difference. First operand has 66 places, 55 transitions, 122 flow. Second operand 3 states and 146 transitions. [2023-11-28 20:38:35,906 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 62 transitions, 198 flow [2023-11-28 20:38:35,909 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 62 transitions, 194 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-28 20:38:35,910 INFO L231 Difference]: Finished difference. Result has 65 places, 54 transitions, 120 flow [2023-11-28 20:38:35,910 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, 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-28 20:38:35,911 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -7 predicate places. [2023-11-28 20:38:35,911 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 54 transitions, 120 flow [2023-11-28 20:38:35,911 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:38:35,912 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:38:35,912 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:38:35,912 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-28 20:38:35,912 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-28 20:38:35,913 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:38:35,913 INFO L85 PathProgramCache]: Analyzing trace with hash -961801491, now seen corresponding path program 1 times [2023-11-28 20:38:35,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:38:35,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795848939] [2023-11-28 20:38:35,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:38:35,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:38:35,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:38:35,966 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-28 20:38:35,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:38:35,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795848939] [2023-11-28 20:38:35,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795848939] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:38:35,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:38:35,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-28 20:38:35,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653740175] [2023-11-28 20:38:35,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:38:35,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 20:38:35,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:38:35,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 20:38:35,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 20:38:35,985 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 65 [2023-11-28 20:38:35,986 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 54 transitions, 120 flow. Second operand has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:38:35,986 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:38:35,986 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 65 [2023-11-28 20:38:35,986 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:38:36,324 INFO L124 PetriNetUnfolderBase]: 1179/2163 cut-off events. [2023-11-28 20:38:36,324 INFO L125 PetriNetUnfolderBase]: For 61/61 co-relation queries the response was YES. [2023-11-28 20:38:36,329 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3966 conditions, 2163 events. 1179/2163 cut-off events. For 61/61 co-relation queries the response was YES. Maximal size of possible extension queue 191. Compared 16859 event pairs, 880 based on Foata normal form. 0/1995 useless extension candidates. Maximal degree in co-relation 3956. Up to 1272 conditions per place. [2023-11-28 20:38:36,342 INFO L140 encePairwiseOnDemand]: 62/65 looper letters, 30 selfloop transitions, 2 changer transitions 0/61 dead transitions. [2023-11-28 20:38:36,343 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 61 transitions, 198 flow [2023-11-28 20:38:36,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 20:38:36,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-28 20:38:36,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 144 transitions. [2023-11-28 20:38:36,344 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7384615384615385 [2023-11-28 20:38:36,344 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 144 transitions. [2023-11-28 20:38:36,344 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 144 transitions. [2023-11-28 20:38:36,345 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:38:36,345 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 144 transitions. [2023-11-28 20:38:36,345 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:38:36,346 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 65.0) internal successors, (260), 4 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:38:36,347 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 65.0) internal successors, (260), 4 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:38:36,347 INFO L175 Difference]: Start difference. First operand has 65 places, 54 transitions, 120 flow. Second operand 3 states and 144 transitions. [2023-11-28 20:38:36,347 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 61 transitions, 198 flow [2023-11-28 20:38:36,349 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 61 transitions, 194 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-28 20:38:36,350 INFO L231 Difference]: Finished difference. Result has 64 places, 53 transitions, 118 flow [2023-11-28 20:38:36,351 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, 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-28 20:38:36,351 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -8 predicate places. [2023-11-28 20:38:36,352 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 53 transitions, 118 flow [2023-11-28 20:38:36,352 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:38:36,352 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:38:36,352 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:38:36,352 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-28 20:38:36,352 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-28 20:38:36,353 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:38:36,353 INFO L85 PathProgramCache]: Analyzing trace with hash -961801490, now seen corresponding path program 1 times [2023-11-28 20:38:36,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:38:36,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868399642] [2023-11-28 20:38:36,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:38:36,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:38:36,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:38:36,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-28 20:38:36,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:38:36,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868399642] [2023-11-28 20:38:36,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868399642] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:38:36,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:38:36,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-28 20:38:36,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821088090] [2023-11-28 20:38:36,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:38:36,430 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 20:38:36,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:38:36,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 20:38:36,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 20:38:36,447 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 65 [2023-11-28 20:38:36,448 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 53 transitions, 118 flow. Second operand has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:38:36,448 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:38:36,448 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 65 [2023-11-28 20:38:36,448 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:38:36,764 INFO L124 PetriNetUnfolderBase]: 1175/2159 cut-off events. [2023-11-28 20:38:36,764 INFO L125 PetriNetUnfolderBase]: For 62/62 co-relation queries the response was YES. [2023-11-28 20:38:36,768 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3956 conditions, 2159 events. 1175/2159 cut-off events. For 62/62 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 17117 event pairs, 876 based on Foata normal form. 4/1995 useless extension candidates. Maximal degree in co-relation 3946. Up to 1264 conditions per place. [2023-11-28 20:38:36,780 INFO L140 encePairwiseOnDemand]: 62/65 looper letters, 29 selfloop transitions, 2 changer transitions 0/60 dead transitions. [2023-11-28 20:38:36,780 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 60 transitions, 194 flow [2023-11-28 20:38:36,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 20:38:36,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-28 20:38:36,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 146 transitions. [2023-11-28 20:38:36,782 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7487179487179487 [2023-11-28 20:38:36,782 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 146 transitions. [2023-11-28 20:38:36,782 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 146 transitions. [2023-11-28 20:38:36,782 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:38:36,782 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 146 transitions. [2023-11-28 20:38:36,783 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:38:36,784 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 65.0) internal successors, (260), 4 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:38:36,784 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 65.0) internal successors, (260), 4 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:38:36,785 INFO L175 Difference]: Start difference. First operand has 64 places, 53 transitions, 118 flow. Second operand 3 states and 146 transitions. [2023-11-28 20:38:36,785 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 60 transitions, 194 flow [2023-11-28 20:38:36,787 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 60 transitions, 190 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-28 20:38:36,788 INFO L231 Difference]: Finished difference. Result has 63 places, 52 transitions, 116 flow [2023-11-28 20:38:36,788 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, 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-28 20:38:36,789 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -9 predicate places. [2023-11-28 20:38:36,789 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 52 transitions, 116 flow [2023-11-28 20:38:36,789 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:38:36,790 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:38:36,790 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:38:36,790 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-28 20:38:36,790 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-28 20:38:36,790 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:38:36,791 INFO L85 PathProgramCache]: Analyzing trace with hash -1300981319, now seen corresponding path program 1 times [2023-11-28 20:38:36,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:38:36,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564026687] [2023-11-28 20:38:36,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:38:36,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:38:36,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:38:36,876 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-28 20:38:36,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:38:36,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564026687] [2023-11-28 20:38:36,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564026687] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:38:36,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:38:36,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-28 20:38:36,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792021769] [2023-11-28 20:38:36,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:38:36,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 20:38:36,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:38:36,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 20:38:36,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 20:38:36,896 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 65 [2023-11-28 20:38:36,897 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 52 transitions, 116 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-28 20:38:36,897 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:38:36,897 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 65 [2023-11-28 20:38:36,897 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:38:37,242 INFO L124 PetriNetUnfolderBase]: 1175/2150 cut-off events. [2023-11-28 20:38:37,242 INFO L125 PetriNetUnfolderBase]: For 62/62 co-relation queries the response was YES. [2023-11-28 20:38:37,246 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3947 conditions, 2150 events. 1175/2150 cut-off events. For 62/62 co-relation queries the response was YES. Maximal size of possible extension queue 191. Compared 16368 event pairs, 459 based on Foata normal form. 12/2011 useless extension candidates. Maximal degree in co-relation 3937. Up to 1232 conditions per place. [2023-11-28 20:38:37,258 INFO L140 encePairwiseOnDemand]: 62/65 looper letters, 29 selfloop transitions, 2 changer transitions 0/59 dead transitions. [2023-11-28 20:38:37,258 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 59 transitions, 192 flow [2023-11-28 20:38:37,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 20:38:37,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-28 20:38:37,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 146 transitions. [2023-11-28 20:38:37,259 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7487179487179487 [2023-11-28 20:38:37,260 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 146 transitions. [2023-11-28 20:38:37,260 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 146 transitions. [2023-11-28 20:38:37,260 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:38:37,260 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 146 transitions. [2023-11-28 20:38:37,261 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:38:37,262 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 65.0) internal successors, (260), 4 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:38:37,262 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 65.0) internal successors, (260), 4 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:38:37,262 INFO L175 Difference]: Start difference. First operand has 63 places, 52 transitions, 116 flow. Second operand 3 states and 146 transitions. [2023-11-28 20:38:37,262 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 59 transitions, 192 flow [2023-11-28 20:38:37,263 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 59 transitions, 188 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-28 20:38:37,264 INFO L231 Difference]: Finished difference. Result has 62 places, 51 transitions, 114 flow [2023-11-28 20:38:37,265 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, 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=114, PETRI_PLACES=62, PETRI_TRANSITIONS=51} [2023-11-28 20:38:37,265 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -10 predicate places. [2023-11-28 20:38:37,266 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 51 transitions, 114 flow [2023-11-28 20:38:37,266 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-28 20:38:37,266 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:38:37,266 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:38:37,266 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-28 20:38:37,267 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-28 20:38:37,267 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:38:37,267 INFO L85 PathProgramCache]: Analyzing trace with hash -1300981320, now seen corresponding path program 1 times [2023-11-28 20:38:37,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:38:37,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619376615] [2023-11-28 20:38:37,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:38:37,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:38:37,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:38:37,317 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-28 20:38:37,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:38:37,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619376615] [2023-11-28 20:38:37,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619376615] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:38:37,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:38:37,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-28 20:38:37,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860813479] [2023-11-28 20:38:37,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:38:37,318 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 20:38:37,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:38:37,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 20:38:37,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 20:38:37,336 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 65 [2023-11-28 20:38:37,336 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 51 transitions, 114 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-28 20:38:37,336 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:38:37,336 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 65 [2023-11-28 20:38:37,337 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:38:37,655 INFO L124 PetriNetUnfolderBase]: 1195/2158 cut-off events. [2023-11-28 20:38:37,655 INFO L125 PetriNetUnfolderBase]: For 68/68 co-relation queries the response was YES. [2023-11-28 20:38:37,660 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3995 conditions, 2158 events. 1195/2158 cut-off events. For 68/68 co-relation queries the response was YES. Maximal size of possible extension queue 193. Compared 16382 event pairs, 459 based on Foata normal form. 0/2009 useless extension candidates. Maximal degree in co-relation 3985. Up to 1264 conditions per place. [2023-11-28 20:38:37,671 INFO L140 encePairwiseOnDemand]: 62/65 looper letters, 30 selfloop transitions, 2 changer transitions 0/58 dead transitions. [2023-11-28 20:38:37,671 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 58 transitions, 192 flow [2023-11-28 20:38:37,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 20:38:37,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-28 20:38:37,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 144 transitions. [2023-11-28 20:38:37,673 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7384615384615385 [2023-11-28 20:38:37,673 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 144 transitions. [2023-11-28 20:38:37,673 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 144 transitions. [2023-11-28 20:38:37,673 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:38:37,673 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 144 transitions. [2023-11-28 20:38:37,674 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:38:37,675 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 65.0) internal successors, (260), 4 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:38:37,675 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 65.0) internal successors, (260), 4 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:38:37,675 INFO L175 Difference]: Start difference. First operand has 62 places, 51 transitions, 114 flow. Second operand 3 states and 144 transitions. [2023-11-28 20:38:37,675 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 58 transitions, 192 flow [2023-11-28 20:38:37,676 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 58 transitions, 188 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-28 20:38:37,677 INFO L231 Difference]: Finished difference. Result has 61 places, 50 transitions, 112 flow [2023-11-28 20:38:37,678 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, 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=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=112, PETRI_PLACES=61, PETRI_TRANSITIONS=50} [2023-11-28 20:38:37,678 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -11 predicate places. [2023-11-28 20:38:37,678 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 50 transitions, 112 flow [2023-11-28 20:38:37,679 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-28 20:38:37,679 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:38:37,679 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:38:37,679 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-28 20:38:37,679 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-28 20:38:37,680 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:38:37,680 INFO L85 PathProgramCache]: Analyzing trace with hash 250786631, now seen corresponding path program 1 times [2023-11-28 20:38:37,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:38:37,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691709201] [2023-11-28 20:38:37,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:38:37,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:38:37,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:38:37,814 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-28 20:38:37,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:38:37,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691709201] [2023-11-28 20:38:37,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691709201] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:38:37,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:38:37,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-28 20:38:37,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788420237] [2023-11-28 20:38:37,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:38:37,816 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 20:38:37,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:38:37,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 20:38:37,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 20:38:37,817 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 65 [2023-11-28 20:38:37,817 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 50 transitions, 112 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-28 20:38:37,817 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:38:37,817 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 65 [2023-11-28 20:38:37,817 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:38:38,078 INFO L124 PetriNetUnfolderBase]: 931/1678 cut-off events. [2023-11-28 20:38:38,079 INFO L125 PetriNetUnfolderBase]: For 56/56 co-relation queries the response was YES. [2023-11-28 20:38:38,082 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3131 conditions, 1678 events. 931/1678 cut-off events. For 56/56 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 11988 event pairs, 199 based on Foata normal form. 0/1649 useless extension candidates. Maximal degree in co-relation 3121. Up to 1021 conditions per place. [2023-11-28 20:38:38,089 INFO L140 encePairwiseOnDemand]: 62/65 looper letters, 29 selfloop transitions, 2 changer transitions 2/60 dead transitions. [2023-11-28 20:38:38,089 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 60 transitions, 200 flow [2023-11-28 20:38:38,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 20:38:38,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-28 20:38:38,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 151 transitions. [2023-11-28 20:38:38,090 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7743589743589744 [2023-11-28 20:38:38,090 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 151 transitions. [2023-11-28 20:38:38,091 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 151 transitions. [2023-11-28 20:38:38,091 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:38:38,091 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 151 transitions. [2023-11-28 20:38:38,092 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:38:38,092 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 65.0) internal successors, (260), 4 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:38:38,092 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 65.0) internal successors, (260), 4 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:38:38,092 INFO L175 Difference]: Start difference. First operand has 61 places, 50 transitions, 112 flow. Second operand 3 states and 151 transitions. [2023-11-28 20:38:38,093 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 60 transitions, 200 flow [2023-11-28 20:38:38,093 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 60 transitions, 194 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-28 20:38:38,094 INFO L231 Difference]: Finished difference. Result has 60 places, 48 transitions, 108 flow [2023-11-28 20:38:38,094 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=108, PETRI_PLACES=60, PETRI_TRANSITIONS=48} [2023-11-28 20:38:38,095 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -12 predicate places. [2023-11-28 20:38:38,095 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 48 transitions, 108 flow [2023-11-28 20:38:38,096 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-28 20:38:38,096 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:38:38,096 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-28 20:38:38,096 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-28 20:38:38,096 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-28 20:38:38,096 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:38:38,097 INFO L85 PathProgramCache]: Analyzing trace with hash -1894899788, now seen corresponding path program 1 times [2023-11-28 20:38:38,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:38:38,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103929677] [2023-11-28 20:38:38,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:38:38,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:38:38,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:38:38,778 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-28 20:38:38,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:38:38,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103929677] [2023-11-28 20:38:38,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103929677] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:38:38,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:38:38,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-28 20:38:38,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315669327] [2023-11-28 20:38:38,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:38:38,780 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-28 20:38:38,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:38:38,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-28 20:38:38,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-11-28 20:38:38,983 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 65 [2023-11-28 20:38:38,984 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 48 transitions, 108 flow. Second operand has 9 states, 9 states have (on average 34.77777777777778) internal successors, (313), 9 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:38:38,984 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:38:38,984 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 65 [2023-11-28 20:38:38,984 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:38:39,352 INFO L124 PetriNetUnfolderBase]: 819/1494 cut-off events. [2023-11-28 20:38:39,352 INFO L125 PetriNetUnfolderBase]: For 84/84 co-relation queries the response was YES. [2023-11-28 20:38:39,355 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2817 conditions, 1494 events. 819/1494 cut-off events. For 84/84 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 10110 event pairs, 528 based on Foata normal form. 48/1517 useless extension candidates. Maximal degree in co-relation 2805. Up to 980 conditions per place. [2023-11-28 20:38:39,361 INFO L140 encePairwiseOnDemand]: 59/65 looper letters, 25 selfloop transitions, 4 changer transitions 8/61 dead transitions. [2023-11-28 20:38:39,362 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 61 transitions, 210 flow [2023-11-28 20:38:39,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-28 20:38:39,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-28 20:38:39,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 269 transitions. [2023-11-28 20:38:39,364 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5912087912087912 [2023-11-28 20:38:39,364 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 269 transitions. [2023-11-28 20:38:39,364 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 269 transitions. [2023-11-28 20:38:39,364 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:38:39,364 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 269 transitions. [2023-11-28 20:38:39,365 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 38.42857142857143) internal successors, (269), 7 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:38:39,367 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 65.0) internal successors, (520), 8 states have internal predecessors, (520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:38:39,367 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 65.0) internal successors, (520), 8 states have internal predecessors, (520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:38:39,367 INFO L175 Difference]: Start difference. First operand has 60 places, 48 transitions, 108 flow. Second operand 7 states and 269 transitions. [2023-11-28 20:38:39,367 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 61 transitions, 210 flow [2023-11-28 20:38:39,368 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 61 transitions, 204 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-28 20:38:39,369 INFO L231 Difference]: Finished difference. Result has 62 places, 46 transitions, 108 flow [2023-11-28 20:38:39,370 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=108, PETRI_PLACES=62, PETRI_TRANSITIONS=46} [2023-11-28 20:38:39,370 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -10 predicate places. [2023-11-28 20:38:39,370 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 46 transitions, 108 flow [2023-11-28 20:38:39,371 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 34.77777777777778) internal successors, (313), 9 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:38:39,371 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:38:39,371 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-28 20:38:39,371 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-28 20:38:39,371 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-28 20:38:39,372 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:38:39,372 INFO L85 PathProgramCache]: Analyzing trace with hash -1894898538, now seen corresponding path program 1 times [2023-11-28 20:38:39,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:38:39,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64788257] [2023-11-28 20:38:39,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:38:39,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:38:39,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:38:39,604 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-28 20:38:39,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:38:39,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64788257] [2023-11-28 20:38:39,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64788257] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:38:39,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:38:39,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-28 20:38:39,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068313244] [2023-11-28 20:38:39,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:38:39,605 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-28 20:38:39,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:38:39,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-28 20:38:39,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-28 20:38:39,620 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 65 [2023-11-28 20:38:39,621 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 46 transitions, 108 flow. Second operand has 5 states, 5 states have (on average 34.8) internal successors, (174), 5 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:38:39,621 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:38:39,621 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 65 [2023-11-28 20:38:39,621 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:38:41,420 INFO L124 PetriNetUnfolderBase]: 12981/19959 cut-off events. [2023-11-28 20:38:41,420 INFO L125 PetriNetUnfolderBase]: For 82/82 co-relation queries the response was YES. [2023-11-28 20:38:41,450 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38072 conditions, 19959 events. 12981/19959 cut-off events. For 82/82 co-relation queries the response was YES. Maximal size of possible extension queue 1219. Compared 154459 event pairs, 2970 based on Foata normal form. 0/19324 useless extension candidates. Maximal degree in co-relation 38061. Up to 6477 conditions per place. [2023-11-28 20:38:41,537 INFO L140 encePairwiseOnDemand]: 54/65 looper letters, 40 selfloop transitions, 7 changer transitions 79/145 dead transitions. [2023-11-28 20:38:41,538 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 145 transitions, 566 flow [2023-11-28 20:38:41,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-28 20:38:41,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-28 20:38:41,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 416 transitions. [2023-11-28 20:38:41,540 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7111111111111111 [2023-11-28 20:38:41,540 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 416 transitions. [2023-11-28 20:38:41,540 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 416 transitions. [2023-11-28 20:38:41,540 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:38:41,541 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 416 transitions. [2023-11-28 20:38:41,542 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-28 20:38:41,543 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 65.0) internal successors, (650), 10 states have internal predecessors, (650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:38:41,544 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 65.0) internal successors, (650), 10 states have internal predecessors, (650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:38:41,544 INFO L175 Difference]: Start difference. First operand has 62 places, 46 transitions, 108 flow. Second operand 9 states and 416 transitions. [2023-11-28 20:38:41,544 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 145 transitions, 566 flow [2023-11-28 20:38:41,545 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 145 transitions, 556 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-28 20:38:41,548 INFO L231 Difference]: Finished difference. Result has 72 places, 51 transitions, 197 flow [2023-11-28 20:38:41,548 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=101, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=197, PETRI_PLACES=72, PETRI_TRANSITIONS=51} [2023-11-28 20:38:41,549 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 0 predicate places. [2023-11-28 20:38:41,549 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 51 transitions, 197 flow [2023-11-28 20:38:41,549 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 34.8) internal successors, (174), 5 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:38:41,549 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:38:41,549 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-28 20:38:41,549 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-28 20:38:41,549 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-28 20:38:41,550 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:38:41,550 INFO L85 PathProgramCache]: Analyzing trace with hash -1316577643, now seen corresponding path program 1 times [2023-11-28 20:38:41,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:38:41,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110515018] [2023-11-28 20:38:41,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:38:41,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:38:41,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:38:41,739 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-28 20:38:41,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:38:41,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110515018] [2023-11-28 20:38:41,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110515018] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:38:41,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:38:41,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-28 20:38:41,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366979385] [2023-11-28 20:38:41,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:38:41,740 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-28 20:38:41,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:38:41,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-28 20:38:41,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-28 20:38:41,756 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 65 [2023-11-28 20:38:41,757 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 51 transitions, 197 flow. Second operand has 6 states, 6 states have (on average 34.5) internal successors, (207), 6 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:38:41,757 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:38:41,757 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 65 [2023-11-28 20:38:41,757 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:38:43,523 INFO L124 PetriNetUnfolderBase]: 9622/16136 cut-off events. [2023-11-28 20:38:43,523 INFO L125 PetriNetUnfolderBase]: For 23157/23163 co-relation queries the response was YES. [2023-11-28 20:38:43,561 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46905 conditions, 16136 events. 9622/16136 cut-off events. For 23157/23163 co-relation queries the response was YES. Maximal size of possible extension queue 974. Compared 133470 event pairs, 901 based on Foata normal form. 394/16427 useless extension candidates. Maximal degree in co-relation 46886. Up to 5776 conditions per place. [2023-11-28 20:38:43,619 INFO L140 encePairwiseOnDemand]: 55/65 looper letters, 55 selfloop transitions, 11 changer transitions 78/163 dead transitions. [2023-11-28 20:38:43,619 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 163 transitions, 1047 flow [2023-11-28 20:38:43,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-28 20:38:43,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-28 20:38:43,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 454 transitions. [2023-11-28 20:38:43,622 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6984615384615385 [2023-11-28 20:38:43,622 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 454 transitions. [2023-11-28 20:38:43,623 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 454 transitions. [2023-11-28 20:38:43,623 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:38:43,623 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 454 transitions. [2023-11-28 20:38:43,625 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 45.4) internal successors, (454), 10 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:38:43,627 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 65.0) internal successors, (715), 11 states have internal predecessors, (715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:38:43,628 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 65.0) internal successors, (715), 11 states have internal predecessors, (715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:38:43,628 INFO L175 Difference]: Start difference. First operand has 72 places, 51 transitions, 197 flow. Second operand 10 states and 454 transitions. [2023-11-28 20:38:43,628 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 163 transitions, 1047 flow [2023-11-28 20:38:43,760 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 163 transitions, 917 flow, removed 31 selfloop flow, removed 4 redundant places. [2023-11-28 20:38:43,763 INFO L231 Difference]: Finished difference. Result has 79 places, 58 transitions, 295 flow [2023-11-28 20:38:43,763 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=171, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=295, PETRI_PLACES=79, PETRI_TRANSITIONS=58} [2023-11-28 20:38:43,764 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 7 predicate places. [2023-11-28 20:38:43,764 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 58 transitions, 295 flow [2023-11-28 20:38:43,765 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 34.5) internal successors, (207), 6 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:38:43,765 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:38:43,765 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-28 20:38:43,765 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-28 20:38:43,765 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-28 20:38:43,766 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:38:43,766 INFO L85 PathProgramCache]: Analyzing trace with hash -114747947, now seen corresponding path program 1 times [2023-11-28 20:38:43,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:38:43,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572310040] [2023-11-28 20:38:43,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:38:43,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:38:43,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:38:43,938 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-28 20:38:43,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:38:43,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572310040] [2023-11-28 20:38:43,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572310040] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:38:43,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:38:43,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-28 20:38:43,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765824234] [2023-11-28 20:38:43,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:38:43,940 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-28 20:38:43,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:38:43,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-28 20:38:43,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-28 20:38:43,953 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 65 [2023-11-28 20:38:43,954 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 58 transitions, 295 flow. Second operand has 6 states, 6 states have (on average 34.5) internal successors, (207), 6 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:38:43,954 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:38:43,954 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 65 [2023-11-28 20:38:43,954 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:38:45,667 INFO L124 PetriNetUnfolderBase]: 8838/14365 cut-off events. [2023-11-28 20:38:45,667 INFO L125 PetriNetUnfolderBase]: For 40753/40753 co-relation queries the response was YES. [2023-11-28 20:38:45,703 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47140 conditions, 14365 events. 8838/14365 cut-off events. For 40753/40753 co-relation queries the response was YES. Maximal size of possible extension queue 852. Compared 111249 event pairs, 1681 based on Foata normal form. 314/14551 useless extension candidates. Maximal degree in co-relation 47114. Up to 5604 conditions per place. [2023-11-28 20:38:45,748 INFO L140 encePairwiseOnDemand]: 55/65 looper letters, 60 selfloop transitions, 17 changer transitions 64/160 dead transitions. [2023-11-28 20:38:45,748 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 160 transitions, 1097 flow [2023-11-28 20:38:45,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-28 20:38:45,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-28 20:38:45,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 452 transitions. [2023-11-28 20:38:45,751 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6953846153846154 [2023-11-28 20:38:45,751 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 452 transitions. [2023-11-28 20:38:45,751 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 452 transitions. [2023-11-28 20:38:45,752 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:38:45,752 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 452 transitions. [2023-11-28 20:38:45,753 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 45.2) internal successors, (452), 10 states have internal predecessors, (452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:38:45,755 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 65.0) internal successors, (715), 11 states have internal predecessors, (715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:38:45,755 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 65.0) internal successors, (715), 11 states have internal predecessors, (715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:38:45,756 INFO L175 Difference]: Start difference. First operand has 79 places, 58 transitions, 295 flow. Second operand 10 states and 452 transitions. [2023-11-28 20:38:45,756 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 160 transitions, 1097 flow [2023-11-28 20:38:45,854 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 160 transitions, 1069 flow, removed 14 selfloop flow, removed 0 redundant places. [2023-11-28 20:38:45,856 INFO L231 Difference]: Finished difference. Result has 90 places, 65 transitions, 429 flow [2023-11-28 20:38:45,856 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=287, PETRI_DIFFERENCE_MINUEND_PLACES=73, 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=10, PETRI_FLOW=429, PETRI_PLACES=90, PETRI_TRANSITIONS=65} [2023-11-28 20:38:45,857 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 18 predicate places. [2023-11-28 20:38:45,857 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 65 transitions, 429 flow [2023-11-28 20:38:45,857 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 34.5) internal successors, (207), 6 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:38:45,858 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:38:45,858 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-28 20:38:45,858 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-28 20:38:45,858 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-28 20:38:45,858 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:38:45,858 INFO L85 PathProgramCache]: Analyzing trace with hash 1755664630, now seen corresponding path program 1 times [2023-11-28 20:38:45,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:38:45,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104474292] [2023-11-28 20:38:45,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:38:45,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:38:45,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:38:45,970 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-28 20:38:45,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:38:45,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104474292] [2023-11-28 20:38:45,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104474292] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:38:45,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:38:45,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-28 20:38:45,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459070198] [2023-11-28 20:38:45,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:38:45,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-28 20:38:45,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:38:45,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-28 20:38:45,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-28 20:38:45,981 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 65 [2023-11-28 20:38:45,981 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 65 transitions, 429 flow. Second operand has 4 states, 4 states have (on average 37.5) internal successors, (150), 4 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-28 20:38:45,981 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:38:45,981 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 65 [2023-11-28 20:38:45,982 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:38:48,781 INFO L124 PetriNetUnfolderBase]: 15751/24606 cut-off events. [2023-11-28 20:38:48,781 INFO L125 PetriNetUnfolderBase]: For 49514/53057 co-relation queries the response was YES. [2023-11-28 20:38:48,892 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68341 conditions, 24606 events. 15751/24606 cut-off events. For 49514/53057 co-relation queries the response was YES. Maximal size of possible extension queue 1267. Compared 191956 event pairs, 2544 based on Foata normal form. 1292/24963 useless extension candidates. Maximal degree in co-relation 68305. Up to 13651 conditions per place. [2023-11-28 20:38:48,971 INFO L140 encePairwiseOnDemand]: 58/65 looper letters, 48 selfloop transitions, 6 changer transitions 0/93 dead transitions. [2023-11-28 20:38:48,971 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 93 transitions, 630 flow [2023-11-28 20:38:48,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-28 20:38:48,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-28 20:38:48,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 189 transitions. [2023-11-28 20:38:48,973 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7269230769230769 [2023-11-28 20:38:48,973 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 189 transitions. [2023-11-28 20:38:48,973 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 189 transitions. [2023-11-28 20:38:48,973 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:38:48,973 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 189 transitions. [2023-11-28 20:38:48,974 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 47.25) internal successors, (189), 4 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:38:48,975 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 65.0) internal successors, (325), 5 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:38:48,975 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 65.0) internal successors, (325), 5 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:38:48,975 INFO L175 Difference]: Start difference. First operand has 90 places, 65 transitions, 429 flow. Second operand 4 states and 189 transitions. [2023-11-28 20:38:48,975 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 93 transitions, 630 flow [2023-11-28 20:38:49,220 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 93 transitions, 586 flow, removed 22 selfloop flow, removed 10 redundant places. [2023-11-28 20:38:49,222 INFO L231 Difference]: Finished difference. Result has 79 places, 70 transitions, 431 flow [2023-11-28 20:38:49,222 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=385, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=431, PETRI_PLACES=79, PETRI_TRANSITIONS=70} [2023-11-28 20:38:49,222 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 7 predicate places. [2023-11-28 20:38:49,223 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 70 transitions, 431 flow [2023-11-28 20:38:49,223 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.5) internal successors, (150), 4 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-28 20:38:49,223 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:38:49,223 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] [2023-11-28 20:38:49,223 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-28 20:38:49,223 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-28 20:38:49,223 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:38:49,223 INFO L85 PathProgramCache]: Analyzing trace with hash -420442082, now seen corresponding path program 1 times [2023-11-28 20:38:49,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:38:49,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775372207] [2023-11-28 20:38:49,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:38:49,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:38:49,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:38:49,362 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-28 20:38:49,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:38:49,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775372207] [2023-11-28 20:38:49,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775372207] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:38:49,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:38:49,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-28 20:38:49,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742470960] [2023-11-28 20:38:49,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:38:49,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-28 20:38:49,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:38:49,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-28 20:38:49,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-28 20:38:49,373 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 65 [2023-11-28 20:38:49,373 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 70 transitions, 431 flow. Second operand has 5 states, 5 states have (on average 38.0) internal successors, (190), 5 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:38:49,373 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:38:49,373 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 65 [2023-11-28 20:38:49,374 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:38:52,606 INFO L124 PetriNetUnfolderBase]: 17629/29855 cut-off events. [2023-11-28 20:38:52,606 INFO L125 PetriNetUnfolderBase]: For 56078/58801 co-relation queries the response was YES. [2023-11-28 20:38:52,740 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88468 conditions, 29855 events. 17629/29855 cut-off events. For 56078/58801 co-relation queries the response was YES. Maximal size of possible extension queue 1769. Compared 272034 event pairs, 7656 based on Foata normal form. 1299/28182 useless extension candidates. Maximal degree in co-relation 88438. Up to 9833 conditions per place. [2023-11-28 20:38:52,981 INFO L140 encePairwiseOnDemand]: 60/65 looper letters, 71 selfloop transitions, 13 changer transitions 6/126 dead transitions. [2023-11-28 20:38:52,981 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 126 transitions, 853 flow [2023-11-28 20:38:52,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-28 20:38:52,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-28 20:38:52,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 322 transitions. [2023-11-28 20:38:52,983 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7076923076923077 [2023-11-28 20:38:52,983 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 322 transitions. [2023-11-28 20:38:52,983 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 322 transitions. [2023-11-28 20:38:52,983 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:38:52,983 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 322 transitions. [2023-11-28 20:38:52,984 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 46.0) internal successors, (322), 7 states have internal predecessors, (322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:38:52,985 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 65.0) internal successors, (520), 8 states have internal predecessors, (520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:38:52,986 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 65.0) internal successors, (520), 8 states have internal predecessors, (520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:38:52,986 INFO L175 Difference]: Start difference. First operand has 79 places, 70 transitions, 431 flow. Second operand 7 states and 322 transitions. [2023-11-28 20:38:52,986 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 126 transitions, 853 flow [2023-11-28 20:38:53,078 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 126 transitions, 847 flow, removed 2 selfloop flow, removed 1 redundant places. [2023-11-28 20:38:53,080 INFO L231 Difference]: Finished difference. Result has 89 places, 73 transitions, 506 flow [2023-11-28 20:38:53,080 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=425, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=506, PETRI_PLACES=89, PETRI_TRANSITIONS=73} [2023-11-28 20:38:53,081 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 17 predicate places. [2023-11-28 20:38:53,081 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 73 transitions, 506 flow [2023-11-28 20:38:53,081 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 38.0) internal successors, (190), 5 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:38:53,081 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:38:53,081 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] [2023-11-28 20:38:53,081 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-28 20:38:53,081 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-28 20:38:53,082 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:38:53,082 INFO L85 PathProgramCache]: Analyzing trace with hash -1307357984, now seen corresponding path program 1 times [2023-11-28 20:38:53,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:38:53,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704691710] [2023-11-28 20:38:53,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:38:53,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:38:53,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:38:53,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 20:38:53,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:38:53,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704691710] [2023-11-28 20:38:53,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704691710] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:38:53,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:38:53,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-28 20:38:53,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231367217] [2023-11-28 20:38:53,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:38:53,261 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-28 20:38:53,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:38:53,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-28 20:38:53,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-28 20:38:53,268 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 65 [2023-11-28 20:38:53,269 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 73 transitions, 506 flow. Second operand has 5 states, 5 states have (on average 37.0) internal successors, (185), 5 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:38:53,269 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:38:53,269 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 65 [2023-11-28 20:38:53,269 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:38:57,188 INFO L124 PetriNetUnfolderBase]: 21657/33440 cut-off events. [2023-11-28 20:38:57,188 INFO L125 PetriNetUnfolderBase]: For 56154/61210 co-relation queries the response was YES. [2023-11-28 20:38:57,316 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98919 conditions, 33440 events. 21657/33440 cut-off events. For 56154/61210 co-relation queries the response was YES. Maximal size of possible extension queue 1750. Compared 264465 event pairs, 2412 based on Foata normal form. 1990/34335 useless extension candidates. Maximal degree in co-relation 98884. Up to 15261 conditions per place. [2023-11-28 20:38:57,389 INFO L140 encePairwiseOnDemand]: 58/65 looper letters, 62 selfloop transitions, 10 changer transitions 3/114 dead transitions. [2023-11-28 20:38:57,389 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 114 transitions, 811 flow [2023-11-28 20:38:57,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-28 20:38:57,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-28 20:38:57,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 240 transitions. [2023-11-28 20:38:57,391 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7384615384615385 [2023-11-28 20:38:57,391 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 240 transitions. [2023-11-28 20:38:57,391 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 240 transitions. [2023-11-28 20:38:57,391 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:38:57,392 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 240 transitions. [2023-11-28 20:38:57,392 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 48.0) internal successors, (240), 5 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:38:57,393 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 65.0) internal successors, (390), 6 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:38:57,393 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 65.0) internal successors, (390), 6 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:38:57,393 INFO L175 Difference]: Start difference. First operand has 89 places, 73 transitions, 506 flow. Second operand 5 states and 240 transitions. [2023-11-28 20:38:57,394 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 114 transitions, 811 flow [2023-11-28 20:38:57,652 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 114 transitions, 789 flow, removed 7 selfloop flow, removed 1 redundant places. [2023-11-28 20:38:57,653 INFO L231 Difference]: Finished difference. Result has 94 places, 75 transitions, 521 flow [2023-11-28 20:38:57,653 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=484, PETRI_DIFFERENCE_MINUEND_PLACES=88, 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=521, PETRI_PLACES=94, PETRI_TRANSITIONS=75} [2023-11-28 20:38:57,654 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 22 predicate places. [2023-11-28 20:38:57,654 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 75 transitions, 521 flow [2023-11-28 20:38:57,654 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 37.0) internal successors, (185), 5 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:38:57,654 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:38:57,654 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-28 20:38:57,654 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-28 20:38:57,655 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-28 20:38:57,655 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:38:57,655 INFO L85 PathProgramCache]: Analyzing trace with hash -996004008, now seen corresponding path program 1 times [2023-11-28 20:38:57,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:38:57,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447077010] [2023-11-28 20:38:57,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:38:57,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:38:57,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:38:57,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 20:38:57,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:38:57,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447077010] [2023-11-28 20:38:57,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447077010] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:38:57,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:38:57,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-28 20:38:57,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289502473] [2023-11-28 20:38:57,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:38:57,845 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-28 20:38:57,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:38:57,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-28 20:38:57,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-28 20:38:57,850 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 65 [2023-11-28 20:38:57,851 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 75 transitions, 521 flow. Second operand has 6 states, 6 states have (on average 36.833333333333336) internal successors, (221), 6 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:38:57,851 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:38:57,851 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 65 [2023-11-28 20:38:57,851 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:39:00,367 INFO L124 PetriNetUnfolderBase]: 15465/23708 cut-off events. [2023-11-28 20:39:00,367 INFO L125 PetriNetUnfolderBase]: For 44879/51611 co-relation queries the response was YES. [2023-11-28 20:39:00,663 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77434 conditions, 23708 events. 15465/23708 cut-off events. For 44879/51611 co-relation queries the response was YES. Maximal size of possible extension queue 1384. Compared 178326 event pairs, 894 based on Foata normal form. 1452/24341 useless extension candidates. Maximal degree in co-relation 77396. Up to 7676 conditions per place. [2023-11-28 20:39:00,722 INFO L140 encePairwiseOnDemand]: 58/65 looper letters, 74 selfloop transitions, 14 changer transitions 0/127 dead transitions. [2023-11-28 20:39:00,722 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 127 transitions, 913 flow [2023-11-28 20:39:00,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-28 20:39:00,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-28 20:39:00,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 289 transitions. [2023-11-28 20:39:00,724 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7410256410256411 [2023-11-28 20:39:00,725 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 289 transitions. [2023-11-28 20:39:00,725 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 289 transitions. [2023-11-28 20:39:00,725 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:39:00,725 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 289 transitions. [2023-11-28 20:39:00,726 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 48.166666666666664) internal successors, (289), 6 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:39:00,727 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 65.0) internal successors, (455), 7 states have internal predecessors, (455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:39:00,727 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 65.0) internal successors, (455), 7 states have internal predecessors, (455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:39:00,727 INFO L175 Difference]: Start difference. First operand has 94 places, 75 transitions, 521 flow. Second operand 6 states and 289 transitions. [2023-11-28 20:39:00,727 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 127 transitions, 913 flow [2023-11-28 20:39:00,772 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 127 transitions, 889 flow, removed 8 selfloop flow, removed 4 redundant places. [2023-11-28 20:39:00,774 INFO L231 Difference]: Finished difference. Result has 95 places, 80 transitions, 583 flow [2023-11-28 20:39:00,774 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=498, PETRI_DIFFERENCE_MINUEND_PLACES=88, 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=583, PETRI_PLACES=95, PETRI_TRANSITIONS=80} [2023-11-28 20:39:00,774 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 23 predicate places. [2023-11-28 20:39:00,774 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 80 transitions, 583 flow [2023-11-28 20:39:00,775 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 36.833333333333336) internal successors, (221), 6 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:39:00,775 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:39:00,775 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-28 20:39:00,775 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-28 20:39:00,775 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-28 20:39:00,775 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:39:00,775 INFO L85 PathProgramCache]: Analyzing trace with hash 681059801, now seen corresponding path program 1 times [2023-11-28 20:39:00,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:39:00,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833849564] [2023-11-28 20:39:00,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:39:00,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:39:00,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:00,986 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-28 20:39:00,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:39:00,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833849564] [2023-11-28 20:39:00,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833849564] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:39:00,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:39:00,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-28 20:39:00,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907387196] [2023-11-28 20:39:00,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:39:00,988 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-28 20:39:00,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:39:00,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-28 20:39:00,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-28 20:39:00,994 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 65 [2023-11-28 20:39:00,995 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 80 transitions, 583 flow. Second operand has 7 states, 7 states have (on average 36.57142857142857) internal successors, (256), 7 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:39:00,995 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:39:00,995 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 65 [2023-11-28 20:39:00,995 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:39:03,648 INFO L124 PetriNetUnfolderBase]: 13433/20324 cut-off events. [2023-11-28 20:39:03,648 INFO L125 PetriNetUnfolderBase]: For 58336/65351 co-relation queries the response was YES. [2023-11-28 20:39:03,728 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73115 conditions, 20324 events. 13433/20324 cut-off events. For 58336/65351 co-relation queries the response was YES. Maximal size of possible extension queue 1384. Compared 151427 event pairs, 794 based on Foata normal form. 902/20431 useless extension candidates. Maximal degree in co-relation 73077. Up to 7676 conditions per place. [2023-11-28 20:39:03,760 INFO L140 encePairwiseOnDemand]: 58/65 looper letters, 68 selfloop transitions, 18 changer transitions 1/124 dead transitions. [2023-11-28 20:39:03,760 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 124 transitions, 900 flow [2023-11-28 20:39:03,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-28 20:39:03,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-28 20:39:03,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 322 transitions. [2023-11-28 20:39:03,762 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7076923076923077 [2023-11-28 20:39:03,762 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 322 transitions. [2023-11-28 20:39:03,762 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 322 transitions. [2023-11-28 20:39:03,763 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:39:03,763 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 322 transitions. [2023-11-28 20:39:03,764 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 46.0) internal successors, (322), 7 states have internal predecessors, (322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:39:03,765 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 65.0) internal successors, (520), 8 states have internal predecessors, (520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:39:03,765 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 65.0) internal successors, (520), 8 states have internal predecessors, (520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:39:03,765 INFO L175 Difference]: Start difference. First operand has 95 places, 80 transitions, 583 flow. Second operand 7 states and 322 transitions. [2023-11-28 20:39:03,765 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 124 transitions, 900 flow [2023-11-28 20:39:03,982 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 124 transitions, 836 flow, removed 24 selfloop flow, removed 8 redundant places. [2023-11-28 20:39:03,984 INFO L231 Difference]: Finished difference. Result has 94 places, 79 transitions, 563 flow [2023-11-28 20:39:03,984 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=508, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=563, PETRI_PLACES=94, PETRI_TRANSITIONS=79} [2023-11-28 20:39:03,985 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 22 predicate places. [2023-11-28 20:39:03,985 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 79 transitions, 563 flow [2023-11-28 20:39:03,985 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 36.57142857142857) internal successors, (256), 7 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:39:03,985 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:39:03,985 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] [2023-11-28 20:39:03,985 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-28 20:39:03,985 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-28 20:39:03,986 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:39:03,986 INFO L85 PathProgramCache]: Analyzing trace with hash -56671998, now seen corresponding path program 1 times [2023-11-28 20:39:03,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:39:03,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073306199] [2023-11-28 20:39:03,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:39:03,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:39:04,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:04,192 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-28 20:39:04,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:39:04,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073306199] [2023-11-28 20:39:04,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073306199] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:39:04,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:39:04,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-28 20:39:04,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875222621] [2023-11-28 20:39:04,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:39:04,194 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-28 20:39:04,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:39:04,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-28 20:39:04,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-28 20:39:04,202 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 65 [2023-11-28 20:39:04,202 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 79 transitions, 563 flow. Second operand has 6 states, 6 states have (on average 38.166666666666664) internal successors, (229), 6 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:39:04,202 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:39:04,202 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 65 [2023-11-28 20:39:04,202 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:39:06,309 INFO L124 PetriNetUnfolderBase]: 11255/20908 cut-off events. [2023-11-28 20:39:06,309 INFO L125 PetriNetUnfolderBase]: For 50746/54922 co-relation queries the response was YES. [2023-11-28 20:39:06,416 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67806 conditions, 20908 events. 11255/20908 cut-off events. For 50746/54922 co-relation queries the response was YES. Maximal size of possible extension queue 1661. Compared 202547 event pairs, 3349 based on Foata normal form. 563/18850 useless extension candidates. Maximal degree in co-relation 67771. Up to 7250 conditions per place. [2023-11-28 20:39:06,445 INFO L140 encePairwiseOnDemand]: 60/65 looper letters, 47 selfloop transitions, 5 changer transitions 12/116 dead transitions. [2023-11-28 20:39:06,445 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 116 transitions, 845 flow [2023-11-28 20:39:06,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-28 20:39:06,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-28 20:39:06,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 267 transitions. [2023-11-28 20:39:06,446 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6846153846153846 [2023-11-28 20:39:06,446 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 267 transitions. [2023-11-28 20:39:06,446 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 267 transitions. [2023-11-28 20:39:06,446 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:39:06,447 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 267 transitions. [2023-11-28 20:39:06,447 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 44.5) internal successors, (267), 6 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:39:06,448 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 65.0) internal successors, (455), 7 states have internal predecessors, (455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:39:06,448 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 65.0) internal successors, (455), 7 states have internal predecessors, (455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:39:06,448 INFO L175 Difference]: Start difference. First operand has 94 places, 79 transitions, 563 flow. Second operand 6 states and 267 transitions. [2023-11-28 20:39:06,448 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 116 transitions, 845 flow [2023-11-28 20:39:07,182 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 116 transitions, 758 flow, removed 32 selfloop flow, removed 7 redundant places. [2023-11-28 20:39:07,184 INFO L231 Difference]: Finished difference. Result has 95 places, 82 transitions, 544 flow [2023-11-28 20:39:07,184 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=490, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=544, PETRI_PLACES=95, PETRI_TRANSITIONS=82} [2023-11-28 20:39:07,185 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 23 predicate places. [2023-11-28 20:39:07,185 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 82 transitions, 544 flow [2023-11-28 20:39:07,185 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 38.166666666666664) internal successors, (229), 6 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:39:07,185 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:39:07,185 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] [2023-11-28 20:39:07,185 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-28 20:39:07,186 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-28 20:39:07,186 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:39:07,186 INFO L85 PathProgramCache]: Analyzing trace with hash 523393254, now seen corresponding path program 2 times [2023-11-28 20:39:07,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:39:07,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17321754] [2023-11-28 20:39:07,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:39:07,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:39:07,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:07,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-28 20:39:07,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:39:07,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17321754] [2023-11-28 20:39:07,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17321754] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:39:07,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:39:07,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-28 20:39:07,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846415410] [2023-11-28 20:39:07,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:39:07,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-28 20:39:07,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:39:07,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-28 20:39:07,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-28 20:39:07,778 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 65 [2023-11-28 20:39:07,779 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 82 transitions, 544 flow. Second operand has 7 states, 7 states have (on average 35.142857142857146) internal successors, (246), 7 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:39:07,779 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:39:07,779 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 65 [2023-11-28 20:39:07,779 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:39:12,259 INFO L124 PetriNetUnfolderBase]: 24415/43238 cut-off events. [2023-11-28 20:39:12,259 INFO L125 PetriNetUnfolderBase]: For 106734/111665 co-relation queries the response was YES. [2023-11-28 20:39:12,522 INFO L83 FinitePrefix]: Finished finitePrefix Result has 136188 conditions, 43238 events. 24415/43238 cut-off events. For 106734/111665 co-relation queries the response was YES. Maximal size of possible extension queue 3509. Compared 441563 event pairs, 5100 based on Foata normal form. 455/39383 useless extension candidates. Maximal degree in co-relation 136153. Up to 8969 conditions per place. [2023-11-28 20:39:12,559 INFO L140 encePairwiseOnDemand]: 52/65 looper letters, 39 selfloop transitions, 24 changer transitions 75/173 dead transitions. [2023-11-28 20:39:12,559 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 173 transitions, 1405 flow [2023-11-28 20:39:12,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-28 20:39:12,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-28 20:39:12,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 390 transitions. [2023-11-28 20:39:12,561 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2023-11-28 20:39:12,561 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 390 transitions. [2023-11-28 20:39:12,561 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 390 transitions. [2023-11-28 20:39:12,562 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:39:12,562 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 390 transitions. [2023-11-28 20:39:12,563 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 43.333333333333336) internal successors, (390), 9 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:39:12,565 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 65.0) internal successors, (650), 10 states have internal predecessors, (650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:39:12,565 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 65.0) internal successors, (650), 10 states have internal predecessors, (650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:39:12,565 INFO L175 Difference]: Start difference. First operand has 95 places, 82 transitions, 544 flow. Second operand 9 states and 390 transitions. [2023-11-28 20:39:12,565 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 173 transitions, 1405 flow [2023-11-28 20:39:15,734 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 173 transitions, 1398 flow, removed 3 selfloop flow, removed 3 redundant places. [2023-11-28 20:39:15,736 INFO L231 Difference]: Finished difference. Result has 103 places, 80 transitions, 574 flow [2023-11-28 20:39:15,736 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=539, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=574, PETRI_PLACES=103, PETRI_TRANSITIONS=80} [2023-11-28 20:39:15,736 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 31 predicate places. [2023-11-28 20:39:15,736 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 80 transitions, 574 flow [2023-11-28 20:39:15,736 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 35.142857142857146) internal successors, (246), 7 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:39:15,737 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:39:15,737 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] [2023-11-28 20:39:15,737 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-28 20:39:15,737 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-28 20:39:15,737 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:39:15,737 INFO L85 PathProgramCache]: Analyzing trace with hash 1514704426, now seen corresponding path program 3 times [2023-11-28 20:39:15,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:39:15,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132483794] [2023-11-28 20:39:15,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:39:15,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:39:15,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:15,897 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-28 20:39:15,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:39:15,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132483794] [2023-11-28 20:39:15,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132483794] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:39:15,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:39:15,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-28 20:39:15,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793509011] [2023-11-28 20:39:15,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:39:15,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-28 20:39:15,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:39:15,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-28 20:39:15,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-28 20:39:15,905 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 65 [2023-11-28 20:39:15,906 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 80 transitions, 574 flow. Second operand has 5 states, 5 states have (on average 38.8) internal successors, (194), 5 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:39:15,906 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:39:15,906 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 65 [2023-11-28 20:39:15,906 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:39:16,531 INFO L124 PetriNetUnfolderBase]: 3137/5889 cut-off events. [2023-11-28 20:39:16,531 INFO L125 PetriNetUnfolderBase]: For 10094/10353 co-relation queries the response was YES. [2023-11-28 20:39:16,553 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17315 conditions, 5889 events. 3137/5889 cut-off events. For 10094/10353 co-relation queries the response was YES. Maximal size of possible extension queue 507. Compared 48000 event pairs, 1613 based on Foata normal form. 68/5004 useless extension candidates. Maximal degree in co-relation 17276. Up to 2627 conditions per place. [2023-11-28 20:39:16,558 INFO L140 encePairwiseOnDemand]: 60/65 looper letters, 26 selfloop transitions, 2 changer transitions 34/100 dead transitions. [2023-11-28 20:39:16,558 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 100 transitions, 772 flow [2023-11-28 20:39:16,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-28 20:39:16,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-28 20:39:16,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 219 transitions. [2023-11-28 20:39:16,560 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6738461538461539 [2023-11-28 20:39:16,560 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 219 transitions. [2023-11-28 20:39:16,560 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 219 transitions. [2023-11-28 20:39:16,560 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:39:16,560 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 219 transitions. [2023-11-28 20:39:16,561 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 43.8) internal successors, (219), 5 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-28 20:39:16,562 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 65.0) internal successors, (390), 6 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:39:16,562 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 65.0) internal successors, (390), 6 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:39:16,562 INFO L175 Difference]: Start difference. First operand has 103 places, 80 transitions, 574 flow. Second operand 5 states and 219 transitions. [2023-11-28 20:39:16,562 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 100 transitions, 772 flow [2023-11-28 20:39:16,611 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 100 transitions, 677 flow, removed 15 selfloop flow, removed 11 redundant places. [2023-11-28 20:39:16,612 INFO L231 Difference]: Finished difference. Result has 96 places, 63 transitions, 344 flow [2023-11-28 20:39:16,613 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=493, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=344, PETRI_PLACES=96, PETRI_TRANSITIONS=63} [2023-11-28 20:39:16,613 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 24 predicate places. [2023-11-28 20:39:16,613 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 63 transitions, 344 flow [2023-11-28 20:39:16,613 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 38.8) internal successors, (194), 5 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:39:16,613 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:39:16,613 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] [2023-11-28 20:39:16,613 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-11-28 20:39:16,614 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-28 20:39:16,614 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:39:16,614 INFO L85 PathProgramCache]: Analyzing trace with hash 466132794, now seen corresponding path program 4 times [2023-11-28 20:39:16,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:39:16,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291493013] [2023-11-28 20:39:16,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:39:16,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:39:16,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-28 20:39:16,650 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-28 20:39:16,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-28 20:39:16,723 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-28 20:39:16,723 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-28 20:39:16,724 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2023-11-28 20:39:16,726 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2023-11-28 20:39:16,727 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2023-11-28 20:39:16,727 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2023-11-28 20:39:16,727 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2023-11-28 20:39:16,728 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2023-11-28 20:39:16,728 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2023-11-28 20:39:16,728 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2023-11-28 20:39:16,728 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2023-11-28 20:39:16,728 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2023-11-28 20:39:16,729 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2023-11-28 20:39:16,729 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2023-11-28 20:39:16,729 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2023-11-28 20:39:16,729 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2023-11-28 20:39:16,729 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2023-11-28 20:39:16,729 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2023-11-28 20:39:16,730 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-11-28 20:39:16,730 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:39:16,736 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-28 20:39:16,736 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-28 20:39:16,793 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-28 20:39:16,795 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-28 20:39:16,796 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-28 20:39:16,797 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated [2023-11-28 20:39:16,810 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-28 20:39:16,811 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-28 20:39:16,822 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 08:39:16 BasicIcfg [2023-11-28 20:39:16,822 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-28 20:39:16,823 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-28 20:39:16,823 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-28 20:39:16,823 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-28 20:39:16,824 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:38:33" (3/4) ... [2023-11-28 20:39:16,825 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-28 20:39:16,826 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-28 20:39:16,827 INFO L158 Benchmark]: Toolchain (without parser) took 44834.60ms. Allocated memory was 167.8MB in the beginning and 6.1GB in the end (delta: 5.9GB). Free memory was 129.0MB in the beginning and 1.9GB in the end (delta: -1.8GB). Peak memory consumption was 4.1GB. Max. memory is 16.1GB. [2023-11-28 20:39:16,827 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 117.4MB. Free memory is still 67.5MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-28 20:39:16,827 INFO L158 Benchmark]: CACSL2BoogieTranslator took 516.93ms. Allocated memory is still 167.8MB. Free memory was 129.0MB in the beginning and 105.4MB in the end (delta: 23.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2023-11-28 20:39:16,827 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.69ms. Allocated memory is still 167.8MB. Free memory was 105.4MB in the beginning and 102.8MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-28 20:39:16,828 INFO L158 Benchmark]: Boogie Preprocessor took 58.24ms. Allocated memory is still 167.8MB. Free memory was 102.8MB in the beginning and 99.7MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-28 20:39:16,828 INFO L158 Benchmark]: RCFGBuilder took 682.66ms. Allocated memory is still 167.8MB. Free memory was 99.7MB in the beginning and 108.8MB in the end (delta: -9.1MB). Peak memory consumption was 29.7MB. Max. memory is 16.1GB. [2023-11-28 20:39:16,828 INFO L158 Benchmark]: TraceAbstraction took 43513.07ms. Allocated memory was 167.8MB in the beginning and 6.1GB in the end (delta: 5.9GB). Free memory was 107.9MB in the beginning and 1.9GB in the end (delta: -1.8GB). Peak memory consumption was 4.1GB. Max. memory is 16.1GB. [2023-11-28 20:39:16,829 INFO L158 Benchmark]: Witness Printer took 3.19ms. Allocated memory is still 6.1GB. Free memory is still 1.9GB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-28 20:39:16,830 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.18ms. Allocated memory is still 117.4MB. Free memory is still 67.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 516.93ms. Allocated memory is still 167.8MB. Free memory was 129.0MB in the beginning and 105.4MB in the end (delta: 23.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.69ms. Allocated memory is still 167.8MB. Free memory was 105.4MB in the beginning and 102.8MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 58.24ms. Allocated memory is still 167.8MB. Free memory was 102.8MB in the beginning and 99.7MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 682.66ms. Allocated memory is still 167.8MB. Free memory was 99.7MB in the beginning and 108.8MB in the end (delta: -9.1MB). Peak memory consumption was 29.7MB. Max. memory is 16.1GB. * TraceAbstraction took 43513.07ms. Allocated memory was 167.8MB in the beginning and 6.1GB in the end (delta: 5.9GB). Free memory was 107.9MB in the beginning and 1.9GB in the end (delta: -1.8GB). Peak memory consumption was 4.1GB. Max. memory is 16.1GB. * Witness Printer took 3.19ms. Allocated memory is still 6.1GB. Free memory is still 1.9GB. 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_p2_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int a = 0; [L717] 0 _Bool main$tmp_guard0; [L718] 0 _Bool main$tmp_guard1; [L720] 0 int x = 0; [L722] 0 int y = 0; [L724] 0 int z = 0; [L725] 0 _Bool z$flush_delayed; [L726] 0 int z$mem_tmp; [L727] 0 _Bool z$r_buff0_thd0; [L728] 0 _Bool z$r_buff0_thd1; [L729] 0 _Bool z$r_buff0_thd2; [L730] 0 _Bool z$r_buff0_thd3; [L731] 0 _Bool z$r_buff0_thd4; [L732] 0 _Bool z$r_buff1_thd0; [L733] 0 _Bool z$r_buff1_thd1; [L734] 0 _Bool z$r_buff1_thd2; [L735] 0 _Bool z$r_buff1_thd3; [L736] 0 _Bool z$r_buff1_thd4; [L737] 0 _Bool z$read_delayed; [L738] 0 int *z$read_delayed_var; [L739] 0 int z$w_buff0; [L740] 0 _Bool z$w_buff0_used; [L741] 0 int z$w_buff1; [L742] 0 _Bool z$w_buff1_used; [L743] 0 _Bool weak$$choice0; [L744] 0 _Bool weak$$choice2; [L844] 0 pthread_t t1413; [L845] FCALL, FORK 0 pthread_create(&t1413, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1413={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] [L846] 0 pthread_t t1414; [L847] FCALL, FORK 0 pthread_create(&t1414, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1413={5:0}, t1414={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] [L848] 0 pthread_t t1415; [L849] FCALL, FORK 0 pthread_create(&t1415, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1413={5:0}, t1414={6:0}, t1415={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] [L850] 0 pthread_t t1416; [L851] FCALL, FORK 0 pthread_create(&t1416, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1413={5:0}, t1414={6:0}, t1415={7:0}, t1416={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] [L806] 4 z$w_buff1 = z$w_buff0 [L807] 4 z$w_buff0 = 1 [L808] 4 z$w_buff1_used = z$w_buff0_used [L809] 4 z$w_buff0_used = (_Bool)1 [L810] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L810] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L811] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L812] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L813] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L814] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L815] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L816] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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] [L819] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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] [L748] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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] [L751] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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] [L763] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, 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] [L766] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, 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] [L778] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, 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] [L781] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L782] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L783] 3 z$flush_delayed = weak$$choice2 [L784] 3 z$mem_tmp = z [L785] 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) [L786] 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)) [L787] 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)) [L788] 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)) [L789] 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)) [L790] 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)) [L791] 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)) [L792] 3 __unbuffered_p2_EAX = z [L793] 3 z = z$flush_delayed ? z$mem_tmp : z [L794] 3 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, 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] [L822] 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) [L823] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L824] 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 [L825] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L826] 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_p2_EAX=0, __unbuffered_p3_EAX=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, 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] [L829] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, 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] [L756] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, 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] [L771] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, 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] [L799] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, 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] [L853] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [__unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1413={5:0}, t1414={6:0}, t1415={7:0}, t1416={3:0}, weak$$choice2=1, x=2, 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] [L855] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L855] RET 0 assume_abort_if_not(main$tmp_guard0) [L857] 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) [L858] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L859] 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 [L860] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L861] 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_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1413={5:0}, t1414={6:0}, t1415={7:0}, t1416={3:0}, weak$$choice2=1, x=2, 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] [L864] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 0) VAL [__unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1413={5:0}, t1414={6:0}, t1415={7:0}, t1416={3:0}, weak$$choice2=1, x=2, 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] [L866] 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_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=2, 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", "mix053.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [__unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=2, 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: 842]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 849]: 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: 847]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 845]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 851]: 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, 97 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: 43.3s, OverallIterations: 22, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 39.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1154 SdHoareTripleChecker+Valid, 2.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 980 mSDsluCounter, 376 SdHoareTripleChecker+Invalid, 2.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 276 mSDsCounter, 76 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2624 IncrementalHoareTripleChecker+Invalid, 2700 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 76 mSolverCounterUnsat, 100 mSDtfsCounter, 2624 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 113 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=583occurred in iteration=17, InterpolantAutomatonStates: 112, 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.3s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 466 NumberOfCodeBlocks, 466 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 404 ConstructedInterpolants, 0 QuantifiedInterpolants, 2170 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 21 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-28 20:39:16,851 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_670dfbfa-750d-4394-a19d-2d77acdc8718/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-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_670dfbfa-750d-4394-a19d-2d77acdc8718/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_670dfbfa-750d-4394-a19d-2d77acdc8718/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_670dfbfa-750d-4394-a19d-2d77acdc8718/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_670dfbfa-750d-4394-a19d-2d77acdc8718/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix053.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_670dfbfa-750d-4394-a19d-2d77acdc8718/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_670dfbfa-750d-4394-a19d-2d77acdc8718/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 998817f829569afa1d1e3eda89c2594d280c8ae81957c207a6b68804966cf3a6 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-28 20:39:19,027 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-28 20:39:19,091 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_670dfbfa-750d-4394-a19d-2d77acdc8718/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-11-28 20:39:19,105 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-28 20:39:19,106 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-28 20:39:19,134 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-28 20:39:19,135 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-28 20:39:19,136 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-28 20:39:19,136 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-28 20:39:19,137 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-28 20:39:19,138 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-28 20:39:19,138 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-28 20:39:19,139 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-28 20:39:19,140 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-28 20:39:19,140 INFO L153 SettingsManager]: * Use SBE=true [2023-11-28 20:39:19,141 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-28 20:39:19,141 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-28 20:39:19,142 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-28 20:39:19,143 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-28 20:39:19,143 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-28 20:39:19,143 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-28 20:39:19,144 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-28 20:39:19,145 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-28 20:39:19,145 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-28 20:39:19,146 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-28 20:39:19,146 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-28 20:39:19,146 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-28 20:39:19,147 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-28 20:39:19,147 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-28 20:39:19,147 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-28 20:39:19,148 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-28 20:39:19,148 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-28 20:39:19,149 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-28 20:39:19,149 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-28 20:39:19,149 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-28 20:39:19,149 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-28 20:39:19,150 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-28 20:39:19,150 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-28 20:39:19,150 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-28 20:39:19,150 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-28 20:39:19,151 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-28 20:39:19,151 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-28 20:39:19,151 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-28 20:39:19,151 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-28 20:39:19,152 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_670dfbfa-750d-4394-a19d-2d77acdc8718/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_670dfbfa-750d-4394-a19d-2d77acdc8718/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 -> 998817f829569afa1d1e3eda89c2594d280c8ae81957c207a6b68804966cf3a6 [2023-11-28 20:39:19,424 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-28 20:39:19,445 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-28 20:39:19,448 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-28 20:39:19,449 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-28 20:39:19,450 INFO L274 PluginConnector]: CDTParser initialized [2023-11-28 20:39:19,451 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_670dfbfa-750d-4394-a19d-2d77acdc8718/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/pthread-wmm/mix053.opt.i [2023-11-28 20:39:22,206 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-28 20:39:22,464 INFO L384 CDTParser]: Found 1 translation units. [2023-11-28 20:39:22,465 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_670dfbfa-750d-4394-a19d-2d77acdc8718/sv-benchmarks/c/pthread-wmm/mix053.opt.i [2023-11-28 20:39:22,481 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_670dfbfa-750d-4394-a19d-2d77acdc8718/bin/uautomizer-verify-BQ2R08f2Ya/data/80685244f/a59e5f08287543c0b8bd052570b2a136/FLAG2eaab7707 [2023-11-28 20:39:22,496 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_670dfbfa-750d-4394-a19d-2d77acdc8718/bin/uautomizer-verify-BQ2R08f2Ya/data/80685244f/a59e5f08287543c0b8bd052570b2a136 [2023-11-28 20:39:22,498 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-28 20:39:22,500 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-28 20:39:22,501 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-28 20:39:22,501 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-28 20:39:22,506 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-28 20:39:22,507 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:39:22" (1/1) ... [2023-11-28 20:39:22,508 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64e2d2b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:39:22, skipping insertion in model container [2023-11-28 20:39:22,508 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:39:22" (1/1) ... [2023-11-28 20:39:22,555 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-28 20:39:22,906 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-28 20:39:22,921 INFO L202 MainTranslator]: Completed pre-run [2023-11-28 20:39:22,987 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-28 20:39:23,042 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-28 20:39:23,042 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-28 20:39:23,048 INFO L206 MainTranslator]: Completed translation [2023-11-28 20:39:23,049 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:39:23 WrapperNode [2023-11-28 20:39:23,049 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-28 20:39:23,050 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-28 20:39:23,050 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-28 20:39:23,050 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-28 20:39:23,056 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:39:23" (1/1) ... [2023-11-28 20:39:23,075 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:39:23" (1/1) ... [2023-11-28 20:39:23,102 INFO L138 Inliner]: procedures = 180, calls = 68, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 149 [2023-11-28 20:39:23,102 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-28 20:39:23,103 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-28 20:39:23,103 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-28 20:39:23,103 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-28 20:39:23,112 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:39:23" (1/1) ... [2023-11-28 20:39:23,112 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:39:23" (1/1) ... [2023-11-28 20:39:23,116 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:39:23" (1/1) ... [2023-11-28 20:39:23,134 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-28 20:39:23,134 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:39:23" (1/1) ... [2023-11-28 20:39:23,134 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:39:23" (1/1) ... [2023-11-28 20:39:23,145 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:39:23" (1/1) ... [2023-11-28 20:39:23,148 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:39:23" (1/1) ... [2023-11-28 20:39:23,151 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:39:23" (1/1) ... [2023-11-28 20:39:23,154 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:39:23" (1/1) ... [2023-11-28 20:39:23,159 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-28 20:39:23,160 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-28 20:39:23,160 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-28 20:39:23,160 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-28 20:39:23,161 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:39:23" (1/1) ... [2023-11-28 20:39:23,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-28 20:39:23,179 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_670dfbfa-750d-4394-a19d-2d77acdc8718/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 20:39:23,189 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_670dfbfa-750d-4394-a19d-2d77acdc8718/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-28 20:39:23,197 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_670dfbfa-750d-4394-a19d-2d77acdc8718/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-28 20:39:23,221 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-28 20:39:23,221 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-28 20:39:23,222 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-28 20:39:23,222 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-28 20:39:23,222 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-11-28 20:39:23,222 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-11-28 20:39:23,222 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2023-11-28 20:39:23,223 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2023-11-28 20:39:23,223 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2023-11-28 20:39:23,223 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-28 20:39:23,223 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-11-28 20:39:23,224 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-11-28 20:39:23,224 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2023-11-28 20:39:23,224 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2023-11-28 20:39:23,224 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-28 20:39:23,225 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-28 20:39:23,225 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-28 20:39:23,225 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-28 20:39:23,225 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-28 20:39:23,226 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-28 20:39:23,226 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-11-28 20:39:23,226 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-11-28 20:39:23,226 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-28 20:39:23,227 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-28 20:39:23,227 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-28 20:39:23,229 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-28 20:39:23,394 INFO L241 CfgBuilder]: Building ICFG [2023-11-28 20:39:23,397 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-28 20:39:23,752 INFO L282 CfgBuilder]: Performing block encoding [2023-11-28 20:39:23,917 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-28 20:39:23,917 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-28 20:39:23,917 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:39:23 BoogieIcfgContainer [2023-11-28 20:39:23,918 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-28 20:39:23,919 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-28 20:39:23,919 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-28 20:39:23,922 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-28 20:39:23,922 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 08:39:22" (1/3) ... [2023-11-28 20:39:23,922 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64b8a2e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 08:39:23, skipping insertion in model container [2023-11-28 20:39:23,923 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:39:23" (2/3) ... [2023-11-28 20:39:23,923 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64b8a2e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 08:39:23, skipping insertion in model container [2023-11-28 20:39:23,923 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:39:23" (3/3) ... [2023-11-28 20:39:23,924 INFO L112 eAbstractionObserver]: Analyzing ICFG mix053.opt.i [2023-11-28 20:39:23,938 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-28 20:39:23,939 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2023-11-28 20:39:23,939 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-28 20:39:23,990 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-28 20:39:24,017 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 76 places, 65 transitions, 146 flow [2023-11-28 20:39:24,046 INFO L124 PetriNetUnfolderBase]: 2/61 cut-off events. [2023-11-28 20:39:24,046 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-28 20:39:24,050 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74 conditions, 61 events. 2/61 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 129 event pairs, 0 based on Foata normal form. 0/48 useless extension candidates. Maximal degree in co-relation 62. Up to 2 conditions per place. [2023-11-28 20:39:24,050 INFO L82 GeneralOperation]: Start removeDead. Operand has 76 places, 65 transitions, 146 flow [2023-11-28 20:39:24,055 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 72 places, 61 transitions, 134 flow [2023-11-28 20:39:24,065 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-28 20:39:24,071 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;@663630d4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-28 20:39:24,072 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-11-28 20:39:24,075 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-28 20:39:24,075 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-11-28 20:39:24,075 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-28 20:39:24,076 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:39:24,076 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-28 20:39:24,077 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-28 20:39:24,081 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:39:24,082 INFO L85 PathProgramCache]: Analyzing trace with hash 12985, now seen corresponding path program 1 times [2023-11-28 20:39:24,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 20:39:24,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1432533986] [2023-11-28 20:39:24,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:39:24,092 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-28 20:39:24,092 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_670dfbfa-750d-4394-a19d-2d77acdc8718/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 20:39:24,120 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_670dfbfa-750d-4394-a19d-2d77acdc8718/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-28 20:39:24,121 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_670dfbfa-750d-4394-a19d-2d77acdc8718/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-28 20:39:24,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:24,237 INFO L262 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-28 20:39:24,240 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:39:24,291 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-28 20:39:24,301 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-28 20:39:24,301 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 20:39:24,302 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 20:39:24,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1432533986] [2023-11-28 20:39:24,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1432533986] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:39:24,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:39:24,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-28 20:39:24,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260692476] [2023-11-28 20:39:24,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:39:24,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 20:39:24,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 20:39:24,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 20:39:24,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 20:39:24,382 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 65 [2023-11-28 20:39:24,384 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 61 transitions, 134 flow. Second operand has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:39:24,384 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:39:24,385 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 65 [2023-11-28 20:39:24,386 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:39:24,949 INFO L124 PetriNetUnfolderBase]: 1175/2175 cut-off events. [2023-11-28 20:39:24,949 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2023-11-28 20:39:24,959 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3912 conditions, 2175 events. 1175/2175 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 17078 event pairs, 879 based on Foata normal form. 120/2110 useless extension candidates. Maximal degree in co-relation 3897. Up to 1277 conditions per place. [2023-11-28 20:39:24,978 INFO L140 encePairwiseOnDemand]: 60/65 looper letters, 30 selfloop transitions, 2 changer transitions 0/65 dead transitions. [2023-11-28 20:39:24,978 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 65 transitions, 206 flow [2023-11-28 20:39:24,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 20:39:24,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-28 20:39:24,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 146 transitions. [2023-11-28 20:39:24,991 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7487179487179487 [2023-11-28 20:39:24,992 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 146 transitions. [2023-11-28 20:39:24,992 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 146 transitions. [2023-11-28 20:39:24,993 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:39:24,995 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 146 transitions. [2023-11-28 20:39:24,998 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:39:25,002 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 65.0) internal successors, (260), 4 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:39:25,002 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 65.0) internal successors, (260), 4 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:39:25,004 INFO L175 Difference]: Start difference. First operand has 72 places, 61 transitions, 134 flow. Second operand 3 states and 146 transitions. [2023-11-28 20:39:25,005 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 65 transitions, 206 flow [2023-11-28 20:39:25,008 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 65 transitions, 202 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-28 20:39:25,011 INFO L231 Difference]: Finished difference. Result has 68 places, 57 transitions, 126 flow [2023-11-28 20:39:25,014 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, 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-28 20:39:25,017 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -4 predicate places. [2023-11-28 20:39:25,017 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 57 transitions, 126 flow [2023-11-28 20:39:25,018 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:39:25,018 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:39:25,018 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-28 20:39:25,024 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_670dfbfa-750d-4394-a19d-2d77acdc8718/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-28 20:39:25,218 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_670dfbfa-750d-4394-a19d-2d77acdc8718/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-28 20:39:25,219 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-28 20:39:25,219 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:39:25,220 INFO L85 PathProgramCache]: Analyzing trace with hash 12986, now seen corresponding path program 1 times [2023-11-28 20:39:25,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 20:39:25,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1102544861] [2023-11-28 20:39:25,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:39:25,220 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-28 20:39:25,221 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_670dfbfa-750d-4394-a19d-2d77acdc8718/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 20:39:25,222 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_670dfbfa-750d-4394-a19d-2d77acdc8718/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-28 20:39:25,223 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_670dfbfa-750d-4394-a19d-2d77acdc8718/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-28 20:39:25,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:25,296 INFO L262 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-28 20:39:25,297 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:39:25,306 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-28 20:39:25,318 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-28 20:39:25,318 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 20:39:25,318 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 20:39:25,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1102544861] [2023-11-28 20:39:25,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1102544861] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:39:25,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:39:25,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-28 20:39:25,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405887024] [2023-11-28 20:39:25,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:39:25,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 20:39:25,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 20:39:25,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 20:39:25,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 20:39:25,370 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 65 [2023-11-28 20:39:25,370 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 57 transitions, 126 flow. Second operand has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:39:25,370 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:39:25,371 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 65 [2023-11-28 20:39:25,371 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:39:25,727 INFO L124 PetriNetUnfolderBase]: 1175/2174 cut-off events. [2023-11-28 20:39:25,727 INFO L125 PetriNetUnfolderBase]: For 60/60 co-relation queries the response was YES. [2023-11-28 20:39:25,730 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3968 conditions, 2174 events. 1175/2174 cut-off events. For 60/60 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 17010 event pairs, 879 based on Foata normal form. 1/1990 useless extension candidates. Maximal degree in co-relation 3957. Up to 1276 conditions per place. [2023-11-28 20:39:25,743 INFO L140 encePairwiseOnDemand]: 62/65 looper letters, 29 selfloop transitions, 2 changer transitions 0/64 dead transitions. [2023-11-28 20:39:25,743 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 64 transitions, 202 flow [2023-11-28 20:39:25,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 20:39:25,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-28 20:39:25,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 146 transitions. [2023-11-28 20:39:25,745 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7487179487179487 [2023-11-28 20:39:25,746 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 146 transitions. [2023-11-28 20:39:25,746 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 146 transitions. [2023-11-28 20:39:25,746 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:39:25,747 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 146 transitions. [2023-11-28 20:39:25,748 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:39:25,749 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 65.0) internal successors, (260), 4 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:39:25,749 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 65.0) internal successors, (260), 4 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:39:25,749 INFO L175 Difference]: Start difference. First operand has 68 places, 57 transitions, 126 flow. Second operand 3 states and 146 transitions. [2023-11-28 20:39:25,749 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 64 transitions, 202 flow [2023-11-28 20:39:25,753 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 64 transitions, 198 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-28 20:39:25,755 INFO L231 Difference]: Finished difference. Result has 67 places, 56 transitions, 124 flow [2023-11-28 20:39:25,755 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, 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-28 20:39:25,755 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -5 predicate places. [2023-11-28 20:39:25,755 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 56 transitions, 124 flow [2023-11-28 20:39:25,756 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:39:25,756 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:39:25,756 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-28 20:39:25,758 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_670dfbfa-750d-4394-a19d-2d77acdc8718/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-28 20:39:25,956 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_670dfbfa-750d-4394-a19d-2d77acdc8718/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-28 20:39:25,957 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-28 20:39:25,957 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:39:25,957 INFO L85 PathProgramCache]: Analyzing trace with hash 387242616, now seen corresponding path program 1 times [2023-11-28 20:39:25,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 20:39:25,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [255857473] [2023-11-28 20:39:25,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:39:25,959 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-28 20:39:25,959 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_670dfbfa-750d-4394-a19d-2d77acdc8718/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 20:39:25,960 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_670dfbfa-750d-4394-a19d-2d77acdc8718/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-28 20:39:25,961 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_670dfbfa-750d-4394-a19d-2d77acdc8718/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-28 20:39:26,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:26,043 INFO L262 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-28 20:39:26,045 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:39:26,050 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-28 20:39:26,055 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-28 20:39:26,056 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 20:39:26,056 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 20:39:26,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [255857473] [2023-11-28 20:39:26,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [255857473] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:39:26,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:39:26,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-28 20:39:26,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117261838] [2023-11-28 20:39:26,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:39:26,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 20:39:26,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 20:39:26,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 20:39:26,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 20:39:26,092 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 65 [2023-11-28 20:39:26,093 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 56 transitions, 124 flow. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:39:26,093 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:39:26,093 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 65 [2023-11-28 20:39:26,093 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:39:26,494 INFO L124 PetriNetUnfolderBase]: 1176/2172 cut-off events. [2023-11-28 20:39:26,494 INFO L125 PetriNetUnfolderBase]: For 60/60 co-relation queries the response was YES. [2023-11-28 20:39:26,499 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3969 conditions, 2172 events. 1176/2172 cut-off events. For 60/60 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 17062 event pairs, 879 based on Foata normal form. 0/1991 useless extension candidates. Maximal degree in co-relation 3958. Up to 1276 conditions per place. [2023-11-28 20:39:26,516 INFO L140 encePairwiseOnDemand]: 62/65 looper letters, 30 selfloop transitions, 2 changer transitions 0/63 dead transitions. [2023-11-28 20:39:26,516 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 63 transitions, 202 flow [2023-11-28 20:39:26,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 20:39:26,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-28 20:39:26,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 144 transitions. [2023-11-28 20:39:26,519 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7384615384615385 [2023-11-28 20:39:26,519 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 144 transitions. [2023-11-28 20:39:26,519 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 144 transitions. [2023-11-28 20:39:26,519 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:39:26,519 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 144 transitions. [2023-11-28 20:39:26,520 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:39:26,522 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 65.0) internal successors, (260), 4 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:39:26,522 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 65.0) internal successors, (260), 4 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:39:26,522 INFO L175 Difference]: Start difference. First operand has 67 places, 56 transitions, 124 flow. Second operand 3 states and 144 transitions. [2023-11-28 20:39:26,522 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 63 transitions, 202 flow [2023-11-28 20:39:26,526 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 63 transitions, 198 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-28 20:39:26,528 INFO L231 Difference]: Finished difference. Result has 66 places, 55 transitions, 122 flow [2023-11-28 20:39:26,528 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, 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-28 20:39:26,529 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -6 predicate places. [2023-11-28 20:39:26,529 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 55 transitions, 122 flow [2023-11-28 20:39:26,530 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:39:26,530 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:39:26,530 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-28 20:39:26,533 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_670dfbfa-750d-4394-a19d-2d77acdc8718/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-28 20:39:26,730 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_670dfbfa-750d-4394-a19d-2d77acdc8718/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-28 20:39:26,731 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-28 20:39:26,731 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:39:26,732 INFO L85 PathProgramCache]: Analyzing trace with hash 387242617, now seen corresponding path program 1 times [2023-11-28 20:39:26,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 20:39:26,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [981270878] [2023-11-28 20:39:26,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:39:26,732 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-28 20:39:26,732 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_670dfbfa-750d-4394-a19d-2d77acdc8718/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 20:39:26,733 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_670dfbfa-750d-4394-a19d-2d77acdc8718/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-28 20:39:26,734 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_670dfbfa-750d-4394-a19d-2d77acdc8718/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-28 20:39:26,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:26,818 INFO L262 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-28 20:39:26,819 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:39:26,830 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-28 20:39:26,840 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-28 20:39:26,840 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 20:39:26,840 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 20:39:26,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [981270878] [2023-11-28 20:39:26,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [981270878] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:39:26,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:39:26,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-28 20:39:26,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327469560] [2023-11-28 20:39:26,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:39:26,842 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 20:39:26,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 20:39:26,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 20:39:26,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 20:39:26,887 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 65 [2023-11-28 20:39:26,887 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 55 transitions, 122 flow. Second operand has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:39:26,887 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:39:26,887 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 65 [2023-11-28 20:39:26,887 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:39:27,269 INFO L124 PetriNetUnfolderBase]: 1175/2169 cut-off events. [2023-11-28 20:39:27,269 INFO L125 PetriNetUnfolderBase]: For 61/61 co-relation queries the response was YES. [2023-11-28 20:39:27,274 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3964 conditions, 2169 events. 1175/2169 cut-off events. For 61/61 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 17056 event pairs, 878 based on Foata normal form. 2/1991 useless extension candidates. Maximal degree in co-relation 3954. Up to 1273 conditions per place. [2023-11-28 20:39:27,290 INFO L140 encePairwiseOnDemand]: 62/65 looper letters, 29 selfloop transitions, 2 changer transitions 0/62 dead transitions. [2023-11-28 20:39:27,290 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 62 transitions, 198 flow [2023-11-28 20:39:27,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 20:39:27,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-28 20:39:27,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 146 transitions. [2023-11-28 20:39:27,316 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7487179487179487 [2023-11-28 20:39:27,316 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 146 transitions. [2023-11-28 20:39:27,316 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 146 transitions. [2023-11-28 20:39:27,316 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:39:27,316 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 146 transitions. [2023-11-28 20:39:27,317 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:39:27,318 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 65.0) internal successors, (260), 4 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:39:27,319 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 65.0) internal successors, (260), 4 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:39:27,319 INFO L175 Difference]: Start difference. First operand has 66 places, 55 transitions, 122 flow. Second operand 3 states and 146 transitions. [2023-11-28 20:39:27,319 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 62 transitions, 198 flow [2023-11-28 20:39:27,322 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 62 transitions, 194 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-28 20:39:27,323 INFO L231 Difference]: Finished difference. Result has 65 places, 54 transitions, 120 flow [2023-11-28 20:39:27,324 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, 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-28 20:39:27,325 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -7 predicate places. [2023-11-28 20:39:27,325 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 54 transitions, 120 flow [2023-11-28 20:39:27,325 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:39:27,325 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:39:27,325 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:39:27,328 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_670dfbfa-750d-4394-a19d-2d77acdc8718/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-28 20:39:27,526 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_670dfbfa-750d-4394-a19d-2d77acdc8718/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-28 20:39:27,526 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-28 20:39:27,526 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:39:27,526 INFO L85 PathProgramCache]: Analyzing trace with hash 63026157, now seen corresponding path program 1 times [2023-11-28 20:39:27,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 20:39:27,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [956515428] [2023-11-28 20:39:27,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:39:27,527 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-28 20:39:27,527 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_670dfbfa-750d-4394-a19d-2d77acdc8718/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 20:39:27,528 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_670dfbfa-750d-4394-a19d-2d77acdc8718/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-28 20:39:27,529 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_670dfbfa-750d-4394-a19d-2d77acdc8718/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-28 20:39:27,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:27,634 INFO L262 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-28 20:39:27,635 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:39:27,641 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-28 20:39:27,646 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-28 20:39:27,647 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 20:39:27,647 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 20:39:27,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [956515428] [2023-11-28 20:39:27,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [956515428] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:39:27,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:39:27,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-28 20:39:27,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690133803] [2023-11-28 20:39:27,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:39:27,648 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 20:39:27,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 20:39:27,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 20:39:27,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 20:39:27,676 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 65 [2023-11-28 20:39:27,676 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 54 transitions, 120 flow. Second operand has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:39:27,676 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:39:27,676 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 65 [2023-11-28 20:39:27,676 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:39:27,973 INFO L124 PetriNetUnfolderBase]: 1179/2163 cut-off events. [2023-11-28 20:39:27,973 INFO L125 PetriNetUnfolderBase]: For 61/61 co-relation queries the response was YES. [2023-11-28 20:39:27,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3966 conditions, 2163 events. 1179/2163 cut-off events. For 61/61 co-relation queries the response was YES. Maximal size of possible extension queue 191. Compared 16859 event pairs, 880 based on Foata normal form. 0/1995 useless extension candidates. Maximal degree in co-relation 3956. Up to 1272 conditions per place. [2023-11-28 20:39:27,992 INFO L140 encePairwiseOnDemand]: 62/65 looper letters, 30 selfloop transitions, 2 changer transitions 0/61 dead transitions. [2023-11-28 20:39:27,992 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 61 transitions, 198 flow [2023-11-28 20:39:27,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 20:39:27,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-28 20:39:27,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 144 transitions. [2023-11-28 20:39:27,994 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7384615384615385 [2023-11-28 20:39:27,994 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 144 transitions. [2023-11-28 20:39:27,994 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 144 transitions. [2023-11-28 20:39:27,994 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:39:27,994 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 144 transitions. [2023-11-28 20:39:27,995 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:39:27,995 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 65.0) internal successors, (260), 4 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:39:27,996 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 65.0) internal successors, (260), 4 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:39:27,996 INFO L175 Difference]: Start difference. First operand has 65 places, 54 transitions, 120 flow. Second operand 3 states and 144 transitions. [2023-11-28 20:39:27,996 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 61 transitions, 198 flow [2023-11-28 20:39:27,998 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 61 transitions, 194 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-28 20:39:27,999 INFO L231 Difference]: Finished difference. Result has 64 places, 53 transitions, 118 flow [2023-11-28 20:39:27,999 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, 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-28 20:39:28,000 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -8 predicate places. [2023-11-28 20:39:28,000 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 53 transitions, 118 flow [2023-11-28 20:39:28,000 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:39:28,000 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:39:28,000 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:39:28,003 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_670dfbfa-750d-4394-a19d-2d77acdc8718/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-28 20:39:28,200 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_670dfbfa-750d-4394-a19d-2d77acdc8718/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-28 20:39:28,201 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-28 20:39:28,201 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:39:28,201 INFO L85 PathProgramCache]: Analyzing trace with hash 63026158, now seen corresponding path program 1 times [2023-11-28 20:39:28,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 20:39:28,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [909356879] [2023-11-28 20:39:28,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:39:28,202 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-28 20:39:28,202 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_670dfbfa-750d-4394-a19d-2d77acdc8718/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 20:39:28,203 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_670dfbfa-750d-4394-a19d-2d77acdc8718/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-28 20:39:28,203 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_670dfbfa-750d-4394-a19d-2d77acdc8718/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-28 20:39:28,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:28,276 INFO L262 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-28 20:39:28,277 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:39:28,285 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-28 20:39:28,295 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-28 20:39:28,296 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 20:39:28,296 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 20:39:28,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [909356879] [2023-11-28 20:39:28,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [909356879] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:39:28,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:39:28,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-28 20:39:28,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992904132] [2023-11-28 20:39:28,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:39:28,297 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 20:39:28,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 20:39:28,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 20:39:28,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 20:39:28,336 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 65 [2023-11-28 20:39:28,337 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 53 transitions, 118 flow. Second operand has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:39:28,337 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:39:28,337 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 65 [2023-11-28 20:39:28,337 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:39:28,645 INFO L124 PetriNetUnfolderBase]: 1175/2159 cut-off events. [2023-11-28 20:39:28,645 INFO L125 PetriNetUnfolderBase]: For 62/62 co-relation queries the response was YES. [2023-11-28 20:39:28,649 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3956 conditions, 2159 events. 1175/2159 cut-off events. For 62/62 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 17117 event pairs, 876 based on Foata normal form. 4/1995 useless extension candidates. Maximal degree in co-relation 3946. Up to 1264 conditions per place. [2023-11-28 20:39:28,660 INFO L140 encePairwiseOnDemand]: 62/65 looper letters, 29 selfloop transitions, 2 changer transitions 0/60 dead transitions. [2023-11-28 20:39:28,660 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 60 transitions, 194 flow [2023-11-28 20:39:28,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 20:39:28,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-28 20:39:28,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 146 transitions. [2023-11-28 20:39:28,662 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7487179487179487 [2023-11-28 20:39:28,662 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 146 transitions. [2023-11-28 20:39:28,662 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 146 transitions. [2023-11-28 20:39:28,662 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:39:28,662 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 146 transitions. [2023-11-28 20:39:28,663 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:39:28,664 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 65.0) internal successors, (260), 4 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:39:28,664 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 65.0) internal successors, (260), 4 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:39:28,664 INFO L175 Difference]: Start difference. First operand has 64 places, 53 transitions, 118 flow. Second operand 3 states and 146 transitions. [2023-11-28 20:39:28,665 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 60 transitions, 194 flow [2023-11-28 20:39:28,667 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 60 transitions, 190 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-28 20:39:28,669 INFO L231 Difference]: Finished difference. Result has 63 places, 52 transitions, 116 flow [2023-11-28 20:39:28,670 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, 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-28 20:39:28,670 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -9 predicate places. [2023-11-28 20:39:28,671 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 52 transitions, 116 flow [2023-11-28 20:39:28,671 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:39:28,671 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:39:28,671 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:39:28,676 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_670dfbfa-750d-4394-a19d-2d77acdc8718/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-28 20:39:28,874 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_670dfbfa-750d-4394-a19d-2d77acdc8718/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-28 20:39:28,874 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-28 20:39:28,875 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:39:28,875 INFO L85 PathProgramCache]: Analyzing trace with hash 711942267, now seen corresponding path program 1 times [2023-11-28 20:39:28,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 20:39:28,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [587241817] [2023-11-28 20:39:28,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:39:28,876 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-28 20:39:28,876 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_670dfbfa-750d-4394-a19d-2d77acdc8718/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 20:39:28,877 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_670dfbfa-750d-4394-a19d-2d77acdc8718/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-28 20:39:28,877 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_670dfbfa-750d-4394-a19d-2d77acdc8718/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-28 20:39:28,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:28,965 INFO L262 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-28 20:39:28,967 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:39:28,976 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-28 20:39:28,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 20:39:28,986 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 20:39:28,986 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 20:39:28,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [587241817] [2023-11-28 20:39:28,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [587241817] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:39:28,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:39:28,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-28 20:39:28,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185946703] [2023-11-28 20:39:28,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:39:28,987 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 20:39:28,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 20:39:28,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 20:39:28,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 20:39:29,028 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 65 [2023-11-28 20:39:29,028 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 52 transitions, 116 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-28 20:39:29,029 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:39:29,029 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 65 [2023-11-28 20:39:29,029 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:39:29,294 INFO L124 PetriNetUnfolderBase]: 1175/2150 cut-off events. [2023-11-28 20:39:29,294 INFO L125 PetriNetUnfolderBase]: For 62/62 co-relation queries the response was YES. [2023-11-28 20:39:29,297 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3947 conditions, 2150 events. 1175/2150 cut-off events. For 62/62 co-relation queries the response was YES. Maximal size of possible extension queue 191. Compared 16412 event pairs, 459 based on Foata normal form. 12/2011 useless extension candidates. Maximal degree in co-relation 3937. Up to 1232 conditions per place. [2023-11-28 20:39:29,307 INFO L140 encePairwiseOnDemand]: 62/65 looper letters, 29 selfloop transitions, 2 changer transitions 0/59 dead transitions. [2023-11-28 20:39:29,307 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 59 transitions, 192 flow [2023-11-28 20:39:29,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 20:39:29,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-28 20:39:29,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 146 transitions. [2023-11-28 20:39:29,309 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7487179487179487 [2023-11-28 20:39:29,309 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 146 transitions. [2023-11-28 20:39:29,309 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 146 transitions. [2023-11-28 20:39:29,309 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:39:29,309 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 146 transitions. [2023-11-28 20:39:29,310 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:39:29,311 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 65.0) internal successors, (260), 4 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:39:29,311 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 65.0) internal successors, (260), 4 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:39:29,311 INFO L175 Difference]: Start difference. First operand has 63 places, 52 transitions, 116 flow. Second operand 3 states and 146 transitions. [2023-11-28 20:39:29,311 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 59 transitions, 192 flow [2023-11-28 20:39:29,313 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 59 transitions, 188 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-28 20:39:29,314 INFO L231 Difference]: Finished difference. Result has 62 places, 51 transitions, 114 flow [2023-11-28 20:39:29,314 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, 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=114, PETRI_PLACES=62, PETRI_TRANSITIONS=51} [2023-11-28 20:39:29,315 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -10 predicate places. [2023-11-28 20:39:29,315 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 51 transitions, 114 flow [2023-11-28 20:39:29,315 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-28 20:39:29,315 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:39:29,315 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:39:29,319 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_670dfbfa-750d-4394-a19d-2d77acdc8718/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)] Forceful destruction successful, exit code 0 [2023-11-28 20:39:29,516 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_670dfbfa-750d-4394-a19d-2d77acdc8718/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-28 20:39:29,516 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-28 20:39:29,516 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:39:29,516 INFO L85 PathProgramCache]: Analyzing trace with hash 711942266, now seen corresponding path program 1 times [2023-11-28 20:39:29,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 20:39:29,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1469711179] [2023-11-28 20:39:29,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:39:29,517 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-28 20:39:29,517 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_670dfbfa-750d-4394-a19d-2d77acdc8718/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 20:39:29,518 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_670dfbfa-750d-4394-a19d-2d77acdc8718/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-28 20:39:29,520 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_670dfbfa-750d-4394-a19d-2d77acdc8718/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-28 20:39:29,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:29,602 INFO L262 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-28 20:39:29,603 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:39:29,608 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-28 20:39:29,613 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-28 20:39:29,613 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 20:39:29,613 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 20:39:29,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1469711179] [2023-11-28 20:39:29,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1469711179] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:39:29,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:39:29,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-28 20:39:29,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955847464] [2023-11-28 20:39:29,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:39:29,614 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 20:39:29,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 20:39:29,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 20:39:29,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 20:39:29,639 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 65 [2023-11-28 20:39:29,639 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 51 transitions, 114 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-28 20:39:29,639 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:39:29,640 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 65 [2023-11-28 20:39:29,640 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:39:29,887 INFO L124 PetriNetUnfolderBase]: 1195/2130 cut-off events. [2023-11-28 20:39:29,888 INFO L125 PetriNetUnfolderBase]: For 68/68 co-relation queries the response was YES. [2023-11-28 20:39:29,891 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3967 conditions, 2130 events. 1195/2130 cut-off events. For 68/68 co-relation queries the response was YES. Maximal size of possible extension queue 190. Compared 15514 event pairs, 777 based on Foata normal form. 0/1995 useless extension candidates. Maximal degree in co-relation 3957. Up to 1264 conditions per place. [2023-11-28 20:39:29,901 INFO L140 encePairwiseOnDemand]: 62/65 looper letters, 30 selfloop transitions, 2 changer transitions 0/58 dead transitions. [2023-11-28 20:39:29,901 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 58 transitions, 192 flow [2023-11-28 20:39:29,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 20:39:29,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-28 20:39:29,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 144 transitions. [2023-11-28 20:39:29,902 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7384615384615385 [2023-11-28 20:39:29,902 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 144 transitions. [2023-11-28 20:39:29,902 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 144 transitions. [2023-11-28 20:39:29,903 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:39:29,903 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 144 transitions. [2023-11-28 20:39:29,903 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:39:29,904 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 65.0) internal successors, (260), 4 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:39:29,904 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 65.0) internal successors, (260), 4 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:39:29,904 INFO L175 Difference]: Start difference. First operand has 62 places, 51 transitions, 114 flow. Second operand 3 states and 144 transitions. [2023-11-28 20:39:29,904 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 58 transitions, 192 flow [2023-11-28 20:39:29,906 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 58 transitions, 188 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-28 20:39:29,906 INFO L231 Difference]: Finished difference. Result has 61 places, 50 transitions, 112 flow [2023-11-28 20:39:29,907 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, 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=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=112, PETRI_PLACES=61, PETRI_TRANSITIONS=50} [2023-11-28 20:39:29,907 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -11 predicate places. [2023-11-28 20:39:29,908 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 50 transitions, 112 flow [2023-11-28 20:39:29,908 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-28 20:39:29,908 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:39:29,908 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:39:29,911 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_670dfbfa-750d-4394-a19d-2d77acdc8718/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-28 20:39:30,111 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_670dfbfa-750d-4394-a19d-2d77acdc8718/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-28 20:39:30,112 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-28 20:39:30,112 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:39:30,112 INFO L85 PathProgramCache]: Analyzing trace with hash 923952391, now seen corresponding path program 1 times [2023-11-28 20:39:30,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 20:39:30,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1921533448] [2023-11-28 20:39:30,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:39:30,113 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-28 20:39:30,113 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_670dfbfa-750d-4394-a19d-2d77acdc8718/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 20:39:30,114 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_670dfbfa-750d-4394-a19d-2d77acdc8718/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-28 20:39:30,114 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_670dfbfa-750d-4394-a19d-2d77acdc8718/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-28 20:39:30,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:30,204 INFO L262 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-28 20:39:30,206 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:39:30,228 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-28 20:39:30,228 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 20:39:30,228 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 20:39:30,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1921533448] [2023-11-28 20:39:30,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1921533448] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:39:30,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:39:30,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-28 20:39:30,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964575239] [2023-11-28 20:39:30,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:39:30,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 20:39:30,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 20:39:30,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 20:39:30,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 20:39:30,230 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 65 [2023-11-28 20:39:30,231 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 50 transitions, 112 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-28 20:39:30,231 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:39:30,231 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 65 [2023-11-28 20:39:30,231 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:39:30,447 INFO L124 PetriNetUnfolderBase]: 931/1678 cut-off events. [2023-11-28 20:39:30,447 INFO L125 PetriNetUnfolderBase]: For 56/56 co-relation queries the response was YES. [2023-11-28 20:39:30,451 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3131 conditions, 1678 events. 931/1678 cut-off events. For 56/56 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 12045 event pairs, 199 based on Foata normal form. 0/1649 useless extension candidates. Maximal degree in co-relation 3121. Up to 1021 conditions per place. [2023-11-28 20:39:30,458 INFO L140 encePairwiseOnDemand]: 62/65 looper letters, 29 selfloop transitions, 2 changer transitions 2/60 dead transitions. [2023-11-28 20:39:30,458 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 60 transitions, 200 flow [2023-11-28 20:39:30,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 20:39:30,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-28 20:39:30,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 151 transitions. [2023-11-28 20:39:30,460 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7743589743589744 [2023-11-28 20:39:30,460 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 151 transitions. [2023-11-28 20:39:30,460 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 151 transitions. [2023-11-28 20:39:30,460 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:39:30,460 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 151 transitions. [2023-11-28 20:39:30,461 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:39:30,462 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 65.0) internal successors, (260), 4 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:39:30,462 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 65.0) internal successors, (260), 4 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:39:30,462 INFO L175 Difference]: Start difference. First operand has 61 places, 50 transitions, 112 flow. Second operand 3 states and 151 transitions. [2023-11-28 20:39:30,462 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 60 transitions, 200 flow [2023-11-28 20:39:30,463 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 60 transitions, 194 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-28 20:39:30,464 INFO L231 Difference]: Finished difference. Result has 60 places, 48 transitions, 108 flow [2023-11-28 20:39:30,464 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=108, PETRI_PLACES=60, PETRI_TRANSITIONS=48} [2023-11-28 20:39:30,465 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -12 predicate places. [2023-11-28 20:39:30,465 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 48 transitions, 108 flow [2023-11-28 20:39:30,465 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-28 20:39:30,466 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:39:30,466 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-28 20:39:30,469 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_670dfbfa-750d-4394-a19d-2d77acdc8718/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-28 20:39:30,666 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_670dfbfa-750d-4394-a19d-2d77acdc8718/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-28 20:39:30,667 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-28 20:39:30,667 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:39:30,667 INFO L85 PathProgramCache]: Analyzing trace with hash -599114442, now seen corresponding path program 1 times [2023-11-28 20:39:30,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 20:39:30,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1260121288] [2023-11-28 20:39:30,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:39:30,668 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-28 20:39:30,668 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_670dfbfa-750d-4394-a19d-2d77acdc8718/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 20:39:30,669 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_670dfbfa-750d-4394-a19d-2d77acdc8718/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-28 20:39:30,670 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_670dfbfa-750d-4394-a19d-2d77acdc8718/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-28 20:39:30,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:30,782 INFO L262 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-28 20:39:30,783 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:39:30,813 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-28 20:39:30,813 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 20:39:30,813 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 20:39:30,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1260121288] [2023-11-28 20:39:30,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1260121288] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:39:30,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:39:30,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-28 20:39:30,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145304094] [2023-11-28 20:39:30,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:39:30,814 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-28 20:39:30,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 20:39:30,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-28 20:39:30,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-28 20:39:30,822 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 65 [2023-11-28 20:39:30,823 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 48 transitions, 108 flow. Second operand has 4 states, 4 states have (on average 37.5) internal successors, (150), 4 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-28 20:39:30,823 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:39:30,823 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 65 [2023-11-28 20:39:30,823 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:39:31,427 INFO L124 PetriNetUnfolderBase]: 4352/6923 cut-off events. [2023-11-28 20:39:31,427 INFO L125 PetriNetUnfolderBase]: For 312/312 co-relation queries the response was YES. [2023-11-28 20:39:31,435 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13370 conditions, 6923 events. 4352/6923 cut-off events. For 312/312 co-relation queries the response was YES. Maximal size of possible extension queue 464. Compared 50161 event pairs, 536 based on Foata normal form. 180/7092 useless extension candidates. Maximal degree in co-relation 13359. Up to 4015 conditions per place. [2023-11-28 20:39:31,463 INFO L140 encePairwiseOnDemand]: 58/65 looper letters, 45 selfloop transitions, 6 changer transitions 1/74 dead transitions. [2023-11-28 20:39:31,463 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 74 transitions, 274 flow [2023-11-28 20:39:31,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-28 20:39:31,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-28 20:39:31,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 190 transitions. [2023-11-28 20:39:31,465 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7307692307692307 [2023-11-28 20:39:31,465 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 190 transitions. [2023-11-28 20:39:31,465 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 190 transitions. [2023-11-28 20:39:31,465 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:39:31,465 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 190 transitions. [2023-11-28 20:39:31,466 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 47.5) internal successors, (190), 4 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:39:31,467 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 65.0) internal successors, (325), 5 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:39:31,467 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 65.0) internal successors, (325), 5 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:39:31,467 INFO L175 Difference]: Start difference. First operand has 60 places, 48 transitions, 108 flow. Second operand 4 states and 190 transitions. [2023-11-28 20:39:31,468 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 74 transitions, 274 flow [2023-11-28 20:39:31,469 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 74 transitions, 266 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-28 20:39:31,470 INFO L231 Difference]: Finished difference. Result has 62 places, 52 transitions, 146 flow [2023-11-28 20:39:31,470 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=146, PETRI_PLACES=62, PETRI_TRANSITIONS=52} [2023-11-28 20:39:31,471 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -10 predicate places. [2023-11-28 20:39:31,471 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 52 transitions, 146 flow [2023-11-28 20:39:31,472 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.5) internal successors, (150), 4 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-28 20:39:31,472 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:39:31,472 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-28 20:39:31,475 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_670dfbfa-750d-4394-a19d-2d77acdc8718/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)] Ended with exit code 0 [2023-11-28 20:39:31,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_670dfbfa-750d-4394-a19d-2d77acdc8718/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-28 20:39:31,675 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-28 20:39:31,675 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:39:31,676 INFO L85 PathProgramCache]: Analyzing trace with hash -647799043, now seen corresponding path program 1 times [2023-11-28 20:39:31,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 20:39:31,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1693656222] [2023-11-28 20:39:31,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:39:31,676 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-28 20:39:31,676 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_670dfbfa-750d-4394-a19d-2d77acdc8718/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 20:39:31,677 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_670dfbfa-750d-4394-a19d-2d77acdc8718/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-28 20:39:31,678 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_670dfbfa-750d-4394-a19d-2d77acdc8718/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-28 20:39:31,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:31,793 INFO L262 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-28 20:39:31,794 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:39:31,836 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-28 20:39:31,836 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 20:39:31,836 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 20:39:31,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1693656222] [2023-11-28 20:39:31,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1693656222] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:39:31,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:39:31,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-28 20:39:31,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223057608] [2023-11-28 20:39:31,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:39:31,837 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-28 20:39:31,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 20:39:31,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-28 20:39:31,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-28 20:39:31,845 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 65 [2023-11-28 20:39:31,846 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 52 transitions, 146 flow. Second operand has 5 states, 5 states have (on average 37.0) internal successors, (185), 5 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:39:31,846 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:39:31,846 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 65 [2023-11-28 20:39:31,846 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:39:32,387 INFO L124 PetriNetUnfolderBase]: 3648/5839 cut-off events. [2023-11-28 20:39:32,388 INFO L125 PetriNetUnfolderBase]: For 1505/1505 co-relation queries the response was YES. [2023-11-28 20:39:32,395 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13102 conditions, 5839 events. 3648/5839 cut-off events. For 1505/1505 co-relation queries the response was YES. Maximal size of possible extension queue 403. Compared 40559 event pairs, 192 based on Foata normal form. 174/6002 useless extension candidates. Maximal degree in co-relation 13089. Up to 3097 conditions per place. [2023-11-28 20:39:32,410 INFO L140 encePairwiseOnDemand]: 58/65 looper letters, 57 selfloop transitions, 10 changer transitions 1/90 dead transitions. [2023-11-28 20:39:32,410 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 90 transitions, 387 flow [2023-11-28 20:39:32,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-28 20:39:32,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-28 20:39:32,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 240 transitions. [2023-11-28 20:39:32,412 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7384615384615385 [2023-11-28 20:39:32,412 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 240 transitions. [2023-11-28 20:39:32,412 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 240 transitions. [2023-11-28 20:39:32,412 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:39:32,412 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 240 transitions. [2023-11-28 20:39:32,413 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 48.0) internal successors, (240), 5 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:39:32,414 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 65.0) internal successors, (390), 6 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:39:32,414 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 65.0) internal successors, (390), 6 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:39:32,414 INFO L175 Difference]: Start difference. First operand has 62 places, 52 transitions, 146 flow. Second operand 5 states and 240 transitions. [2023-11-28 20:39:32,414 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 90 transitions, 387 flow [2023-11-28 20:39:32,416 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 90 transitions, 376 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-11-28 20:39:32,417 INFO L231 Difference]: Finished difference. Result has 66 places, 56 transitions, 198 flow [2023-11-28 20:39:32,417 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=137, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=198, PETRI_PLACES=66, PETRI_TRANSITIONS=56} [2023-11-28 20:39:32,418 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -6 predicate places. [2023-11-28 20:39:32,418 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 56 transitions, 198 flow [2023-11-28 20:39:32,418 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 37.0) internal successors, (185), 5 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:39:32,418 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:39:32,418 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-28 20:39:32,421 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_670dfbfa-750d-4394-a19d-2d77acdc8718/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-28 20:39:32,618 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_670dfbfa-750d-4394-a19d-2d77acdc8718/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-28 20:39:32,619 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-28 20:39:32,619 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:39:32,619 INFO L85 PathProgramCache]: Analyzing trace with hash -1043518052, now seen corresponding path program 1 times [2023-11-28 20:39:32,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 20:39:32,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2070834941] [2023-11-28 20:39:32,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:39:32,620 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-28 20:39:32,620 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_670dfbfa-750d-4394-a19d-2d77acdc8718/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 20:39:32,621 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_670dfbfa-750d-4394-a19d-2d77acdc8718/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-28 20:39:32,622 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_670dfbfa-750d-4394-a19d-2d77acdc8718/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-28 20:39:32,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:32,721 INFO L262 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-28 20:39:32,723 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:39:32,776 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-28 20:39:32,776 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 20:39:32,777 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 20:39:32,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2070834941] [2023-11-28 20:39:32,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2070834941] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:39:32,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:39:32,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-28 20:39:32,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260982846] [2023-11-28 20:39:32,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:39:32,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-28 20:39:32,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 20:39:32,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-28 20:39:32,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-28 20:39:32,803 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 65 [2023-11-28 20:39:32,804 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 56 transitions, 198 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-28 20:39:32,804 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:39:32,804 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 65 [2023-11-28 20:39:32,804 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:39:33,333 INFO L124 PetriNetUnfolderBase]: 2373/3782 cut-off events. [2023-11-28 20:39:33,333 INFO L125 PetriNetUnfolderBase]: For 2818/2818 co-relation queries the response was YES. [2023-11-28 20:39:33,338 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9592 conditions, 3782 events. 2373/3782 cut-off events. For 2818/2818 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 22935 event pairs, 69 based on Foata normal form. 140/3911 useless extension candidates. Maximal degree in co-relation 9577. Up to 1465 conditions per place. [2023-11-28 20:39:33,348 INFO L140 encePairwiseOnDemand]: 58/65 looper letters, 67 selfloop transitions, 14 changer transitions 1/104 dead transitions. [2023-11-28 20:39:33,349 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 104 transitions, 506 flow [2023-11-28 20:39:33,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-28 20:39:33,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-28 20:39:33,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 288 transitions. [2023-11-28 20:39:33,350 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7384615384615385 [2023-11-28 20:39:33,351 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 288 transitions. [2023-11-28 20:39:33,351 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 288 transitions. [2023-11-28 20:39:33,351 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:39:33,351 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 288 transitions. [2023-11-28 20:39:33,352 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 48.0) internal successors, (288), 6 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:39:33,353 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 65.0) internal successors, (455), 7 states have internal predecessors, (455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:39:33,353 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 65.0) internal successors, (455), 7 states have internal predecessors, (455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:39:33,353 INFO L175 Difference]: Start difference. First operand has 66 places, 56 transitions, 198 flow. Second operand 6 states and 288 transitions. [2023-11-28 20:39:33,353 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 104 transitions, 506 flow [2023-11-28 20:39:33,359 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 104 transitions, 476 flow, removed 5 selfloop flow, removed 4 redundant places. [2023-11-28 20:39:33,360 INFO L231 Difference]: Finished difference. Result has 69 places, 60 transitions, 248 flow [2023-11-28 20:39:33,361 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=171, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=248, PETRI_PLACES=69, PETRI_TRANSITIONS=60} [2023-11-28 20:39:33,361 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -3 predicate places. [2023-11-28 20:39:33,361 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 60 transitions, 248 flow [2023-11-28 20:39:33,362 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-28 20:39:33,362 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:39:33,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, 1, 1, 1] [2023-11-28 20:39:33,365 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_670dfbfa-750d-4394-a19d-2d77acdc8718/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-28 20:39:33,562 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_670dfbfa-750d-4394-a19d-2d77acdc8718/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-28 20:39:33,562 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-28 20:39:33,563 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:39:33,563 INFO L85 PathProgramCache]: Analyzing trace with hash -182667961, now seen corresponding path program 1 times [2023-11-28 20:39:33,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 20:39:33,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [462280317] [2023-11-28 20:39:33,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:39:33,563 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-28 20:39:33,563 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_670dfbfa-750d-4394-a19d-2d77acdc8718/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 20:39:33,564 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_670dfbfa-750d-4394-a19d-2d77acdc8718/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-28 20:39:33,565 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_670dfbfa-750d-4394-a19d-2d77acdc8718/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-28 20:39:33,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:33,674 INFO L262 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-28 20:39:33,675 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:39:33,746 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-28 20:39:33,746 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 20:39:33,747 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 20:39:33,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [462280317] [2023-11-28 20:39:33,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [462280317] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:39:33,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:39:33,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-28 20:39:33,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675716871] [2023-11-28 20:39:33,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:39:33,748 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-28 20:39:33,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 20:39:33,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-28 20:39:33,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-28 20:39:33,758 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 65 [2023-11-28 20:39:33,758 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 60 transitions, 248 flow. Second operand has 7 states, 7 states have (on average 36.57142857142857) internal successors, (256), 7 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:39:33,758 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:39:33,759 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 65 [2023-11-28 20:39:33,759 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:39:34,173 INFO L124 PetriNetUnfolderBase]: 1385/2110 cut-off events. [2023-11-28 20:39:34,173 INFO L125 PetriNetUnfolderBase]: For 3006/3006 co-relation queries the response was YES. [2023-11-28 20:39:34,176 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6169 conditions, 2110 events. 1385/2110 cut-off events. For 3006/3006 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 10496 event pairs, 39 based on Foata normal form. 72/2171 useless extension candidates. Maximal degree in co-relation 6153. Up to 668 conditions per place. [2023-11-28 20:39:34,183 INFO L140 encePairwiseOnDemand]: 58/65 looper letters, 61 selfloop transitions, 18 changer transitions 1/102 dead transitions. [2023-11-28 20:39:34,183 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 102 transitions, 508 flow [2023-11-28 20:39:34,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-28 20:39:34,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-28 20:39:34,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 320 transitions. [2023-11-28 20:39:34,185 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7032967032967034 [2023-11-28 20:39:34,185 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 320 transitions. [2023-11-28 20:39:34,185 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 320 transitions. [2023-11-28 20:39:34,185 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:39:34,186 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 320 transitions. [2023-11-28 20:39:34,187 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 45.714285714285715) internal successors, (320), 7 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:39:34,188 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 65.0) internal successors, (520), 8 states have internal predecessors, (520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:39:34,189 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 65.0) internal successors, (520), 8 states have internal predecessors, (520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:39:34,189 INFO L175 Difference]: Start difference. First operand has 69 places, 60 transitions, 248 flow. Second operand 7 states and 320 transitions. [2023-11-28 20:39:34,189 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 102 transitions, 508 flow [2023-11-28 20:39:34,197 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 102 transitions, 462 flow, removed 9 selfloop flow, removed 5 redundant places. [2023-11-28 20:39:34,199 INFO L231 Difference]: Finished difference. Result has 72 places, 60 transitions, 258 flow [2023-11-28 20:39:34,199 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=205, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=258, PETRI_PLACES=72, PETRI_TRANSITIONS=60} [2023-11-28 20:39:34,199 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 0 predicate places. [2023-11-28 20:39:34,199 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 60 transitions, 258 flow [2023-11-28 20:39:34,200 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 36.57142857142857) internal successors, (256), 7 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:39:34,200 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:39:34,200 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] [2023-11-28 20:39:34,203 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_670dfbfa-750d-4394-a19d-2d77acdc8718/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)] Forceful destruction successful, exit code 0 [2023-11-28 20:39:34,400 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_670dfbfa-750d-4394-a19d-2d77acdc8718/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-28 20:39:34,400 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-28 20:39:34,401 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:39:34,401 INFO L85 PathProgramCache]: Analyzing trace with hash 1834248000, now seen corresponding path program 1 times [2023-11-28 20:39:34,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 20:39:34,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2004220410] [2023-11-28 20:39:34,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:39:34,401 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-28 20:39:34,401 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_670dfbfa-750d-4394-a19d-2d77acdc8718/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 20:39:34,402 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_670dfbfa-750d-4394-a19d-2d77acdc8718/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-28 20:39:34,403 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_670dfbfa-750d-4394-a19d-2d77acdc8718/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-28 20:39:34,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:34,582 INFO L262 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 18 conjunts are in the unsatisfiable core [2023-11-28 20:39:34,585 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:39:35,547 WARN L876 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~#t1416~0#1.base_47| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#t1414~0#1.base_63| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#t1413~0#1.base_51| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#t1415~0#1.base_55| (_ BitVec 32))) (let ((.cse0 (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t1413~0#1.base_51| (_ bv1 1)))) (let ((.cse1 (store .cse0 |v_ULTIMATE.start_main_~#t1414~0#1.base_63| (_ bv1 1)))) (and (= (select .cse0 |v_ULTIMATE.start_main_~#t1414~0#1.base_63|) (_ bv0 1)) (= (select .cse1 |v_ULTIMATE.start_main_~#t1415~0#1.base_55|) (_ bv0 1)) (= (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t1413~0#1.base_51|) (_ bv0 1)) (= (_ bv0 1) (select (store .cse1 |v_ULTIMATE.start_main_~#t1415~0#1.base_55| (_ bv1 1)) |v_ULTIMATE.start_main_~#t1416~0#1.base_47|)) (= (store (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t1413~0#1.base_51| (_ bv0 1)) |v_ULTIMATE.start_main_~#t1414~0#1.base_63| (_ bv0 1)) |v_ULTIMATE.start_main_~#t1415~0#1.base_55| (_ bv0 1)) |v_ULTIMATE.start_main_~#t1416~0#1.base_47| (_ bv0 1)) |c_#valid|))))) is different from true [2023-11-28 20:39:35,548 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-28 20:39:35,549 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 20:39:35,549 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 20:39:35,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2004220410] [2023-11-28 20:39:35,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2004220410] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:39:35,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:39:35,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-28 20:39:35,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663311294] [2023-11-28 20:39:35,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:39:35,550 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-28 20:39:35,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 20:39:35,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-28 20:39:35,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=22, Unknown=1, NotChecked=8, Total=42 [2023-11-28 20:39:35,663 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 65 [2023-11-28 20:39:35,664 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 60 transitions, 258 flow. Second operand has 7 states, 7 states have (on average 29.0) internal successors, (203), 7 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:39:35,664 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:39:35,664 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 65 [2023-11-28 20:39:35,664 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:39:36,059 INFO L124 PetriNetUnfolderBase]: 669/1239 cut-off events. [2023-11-28 20:39:36,060 INFO L125 PetriNetUnfolderBase]: For 485/511 co-relation queries the response was YES. [2023-11-28 20:39:36,062 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2727 conditions, 1239 events. 669/1239 cut-off events. For 485/511 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 7038 event pairs, 131 based on Foata normal form. 16/1114 useless extension candidates. Maximal degree in co-relation 2709. Up to 814 conditions per place. [2023-11-28 20:39:36,065 INFO L140 encePairwiseOnDemand]: 55/65 looper letters, 32 selfloop transitions, 9 changer transitions 0/75 dead transitions. [2023-11-28 20:39:36,066 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 75 transitions, 370 flow [2023-11-28 20:39:36,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-28 20:39:36,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-28 20:39:36,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 224 transitions. [2023-11-28 20:39:36,067 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49230769230769234 [2023-11-28 20:39:36,067 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 224 transitions. [2023-11-28 20:39:36,067 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 224 transitions. [2023-11-28 20:39:36,068 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:39:36,068 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 224 transitions. [2023-11-28 20:39:36,068 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 32.0) internal successors, (224), 7 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:39:36,069 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 65.0) internal successors, (520), 8 states have internal predecessors, (520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:39:36,069 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 65.0) internal successors, (520), 8 states have internal predecessors, (520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:39:36,069 INFO L175 Difference]: Start difference. First operand has 72 places, 60 transitions, 258 flow. Second operand 7 states and 224 transitions. [2023-11-28 20:39:36,069 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 75 transitions, 370 flow [2023-11-28 20:39:36,071 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 75 transitions, 274 flow, removed 17 selfloop flow, removed 10 redundant places. [2023-11-28 20:39:36,072 INFO L231 Difference]: Finished difference. Result has 69 places, 64 transitions, 203 flow [2023-11-28 20:39:36,072 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=203, PETRI_PLACES=69, PETRI_TRANSITIONS=64} [2023-11-28 20:39:36,073 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -3 predicate places. [2023-11-28 20:39:36,073 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 64 transitions, 203 flow [2023-11-28 20:39:36,073 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 29.0) internal successors, (203), 7 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:39:36,073 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:39:36,073 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] [2023-11-28 20:39:36,077 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_670dfbfa-750d-4394-a19d-2d77acdc8718/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)] Forceful destruction successful, exit code 0 [2023-11-28 20:39:36,274 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_670dfbfa-750d-4394-a19d-2d77acdc8718/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-28 20:39:36,274 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-28 20:39:36,274 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:39:36,274 INFO L85 PathProgramCache]: Analyzing trace with hash -1391429972, now seen corresponding path program 1 times [2023-11-28 20:39:36,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 20:39:36,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1862049066] [2023-11-28 20:39:36,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:39:36,275 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-28 20:39:36,275 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_670dfbfa-750d-4394-a19d-2d77acdc8718/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 20:39:36,276 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_670dfbfa-750d-4394-a19d-2d77acdc8718/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-28 20:39:36,276 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_670dfbfa-750d-4394-a19d-2d77acdc8718/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-28 20:39:36,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:36,398 INFO L262 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-28 20:39:36,399 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:39:36,452 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-28 20:39:36,452 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 20:39:36,452 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 20:39:36,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1862049066] [2023-11-28 20:39:36,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1862049066] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:39:36,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:39:36,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-28 20:39:36,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976215443] [2023-11-28 20:39:36,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:39:36,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-28 20:39:36,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 20:39:36,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-28 20:39:36,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-28 20:39:36,463 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 65 [2023-11-28 20:39:36,463 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 64 transitions, 203 flow. Second operand has 5 states, 5 states have (on average 39.8) internal successors, (199), 5 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:39:36,463 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:39:36,463 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 65 [2023-11-28 20:39:36,464 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:39:36,843 INFO L124 PetriNetUnfolderBase]: 1818/3182 cut-off events. [2023-11-28 20:39:36,843 INFO L125 PetriNetUnfolderBase]: For 1125/1285 co-relation queries the response was YES. [2023-11-28 20:39:36,850 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7716 conditions, 3182 events. 1818/3182 cut-off events. For 1125/1285 co-relation queries the response was YES. Maximal size of possible extension queue 185. Compared 19995 event pairs, 730 based on Foata normal form. 16/2942 useless extension candidates. Maximal degree in co-relation 7703. Up to 1371 conditions per place. [2023-11-28 20:39:36,859 INFO L140 encePairwiseOnDemand]: 59/65 looper letters, 53 selfloop transitions, 5 changer transitions 0/94 dead transitions. [2023-11-28 20:39:36,859 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 94 transitions, 426 flow [2023-11-28 20:39:36,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-28 20:39:36,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-28 20:39:36,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 231 transitions. [2023-11-28 20:39:36,861 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7107692307692308 [2023-11-28 20:39:36,861 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 231 transitions. [2023-11-28 20:39:36,861 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 231 transitions. [2023-11-28 20:39:36,861 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:39:36,861 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 231 transitions. [2023-11-28 20:39:36,862 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 46.2) internal successors, (231), 5 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:39:36,862 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 65.0) internal successors, (390), 6 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:39:36,863 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 65.0) internal successors, (390), 6 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:39:36,863 INFO L175 Difference]: Start difference. First operand has 69 places, 64 transitions, 203 flow. Second operand 5 states and 231 transitions. [2023-11-28 20:39:36,863 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 94 transitions, 426 flow [2023-11-28 20:39:36,865 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 94 transitions, 404 flow, removed 0 selfloop flow, removed 5 redundant places. [2023-11-28 20:39:36,866 INFO L231 Difference]: Finished difference. Result has 71 places, 68 transitions, 228 flow [2023-11-28 20:39:36,866 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=228, PETRI_PLACES=71, PETRI_TRANSITIONS=68} [2023-11-28 20:39:36,867 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -1 predicate places. [2023-11-28 20:39:36,867 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 68 transitions, 228 flow [2023-11-28 20:39:36,867 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 39.8) internal successors, (199), 5 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:39:36,867 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:39:36,867 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] [2023-11-28 20:39:36,871 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_670dfbfa-750d-4394-a19d-2d77acdc8718/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-28 20:39:37,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_670dfbfa-750d-4394-a19d-2d77acdc8718/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-28 20:39:37,071 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-28 20:39:37,071 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:39:37,071 INFO L85 PathProgramCache]: Analyzing trace with hash 807969392, now seen corresponding path program 2 times [2023-11-28 20:39:37,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 20:39:37,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1342237632] [2023-11-28 20:39:37,072 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-28 20:39:37,072 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-28 20:39:37,072 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_670dfbfa-750d-4394-a19d-2d77acdc8718/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 20:39:37,073 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_670dfbfa-750d-4394-a19d-2d77acdc8718/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-28 20:39:37,073 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_670dfbfa-750d-4394-a19d-2d77acdc8718/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-28 20:39:37,200 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-28 20:39:37,200 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-28 20:39:37,205 INFO L262 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 11 conjunts are in the unsatisfiable core [2023-11-28 20:39:37,207 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:39:37,329 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-28 20:39:37,330 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 20:39:37,330 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 20:39:37,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1342237632] [2023-11-28 20:39:37,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1342237632] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:39:37,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:39:37,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-28 20:39:37,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110974035] [2023-11-28 20:39:37,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:39:37,331 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-28 20:39:37,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 20:39:37,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-28 20:39:37,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-28 20:39:37,343 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 65 [2023-11-28 20:39:37,344 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 68 transitions, 228 flow. Second operand has 8 states, 8 states have (on average 40.125) internal successors, (321), 8 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:39:37,344 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:39:37,344 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 65 [2023-11-28 20:39:37,344 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:39:37,867 INFO L124 PetriNetUnfolderBase]: 2072/3734 cut-off events. [2023-11-28 20:39:37,867 INFO L125 PetriNetUnfolderBase]: For 1610/1642 co-relation queries the response was YES. [2023-11-28 20:39:37,873 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9452 conditions, 3734 events. 2072/3734 cut-off events. For 1610/1642 co-relation queries the response was YES. Maximal size of possible extension queue 226. Compared 24117 event pairs, 533 based on Foata normal form. 16/3471 useless extension candidates. Maximal degree in co-relation 9437. Up to 1925 conditions per place. [2023-11-28 20:39:37,883 INFO L140 encePairwiseOnDemand]: 56/65 looper letters, 57 selfloop transitions, 12 changer transitions 0/108 dead transitions. [2023-11-28 20:39:37,883 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 108 transitions, 522 flow [2023-11-28 20:39:37,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-28 20:39:37,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-28 20:39:37,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 398 transitions. [2023-11-28 20:39:37,885 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6803418803418804 [2023-11-28 20:39:37,885 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 398 transitions. [2023-11-28 20:39:37,885 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 398 transitions. [2023-11-28 20:39:37,886 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:39:37,886 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 398 transitions. [2023-11-28 20:39:37,886 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 44.22222222222222) internal successors, (398), 9 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:39:37,887 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 65.0) internal successors, (650), 10 states have internal predecessors, (650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:39:37,888 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 65.0) internal successors, (650), 10 states have internal predecessors, (650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:39:37,888 INFO L175 Difference]: Start difference. First operand has 71 places, 68 transitions, 228 flow. Second operand 9 states and 398 transitions. [2023-11-28 20:39:37,888 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 108 transitions, 522 flow [2023-11-28 20:39:37,892 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 108 transitions, 520 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-28 20:39:37,893 INFO L231 Difference]: Finished difference. Result has 82 places, 76 transitions, 320 flow [2023-11-28 20:39:37,893 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=320, PETRI_PLACES=82, PETRI_TRANSITIONS=76} [2023-11-28 20:39:37,894 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 10 predicate places. [2023-11-28 20:39:37,894 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 76 transitions, 320 flow [2023-11-28 20:39:37,894 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 40.125) internal successors, (321), 8 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:39:37,894 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:39:37,894 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] [2023-11-28 20:39:37,897 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_670dfbfa-750d-4394-a19d-2d77acdc8718/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)] Forceful destruction successful, exit code 0 [2023-11-28 20:39:38,095 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_670dfbfa-750d-4394-a19d-2d77acdc8718/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-28 20:39:38,095 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-28 20:39:38,095 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:39:38,095 INFO L85 PathProgramCache]: Analyzing trace with hash -855450842, now seen corresponding path program 3 times [2023-11-28 20:39:38,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 20:39:38,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [572212831] [2023-11-28 20:39:38,095 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-28 20:39:38,096 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-28 20:39:38,096 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_670dfbfa-750d-4394-a19d-2d77acdc8718/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 20:39:38,096 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_670dfbfa-750d-4394-a19d-2d77acdc8718/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-28 20:39:38,097 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_670dfbfa-750d-4394-a19d-2d77acdc8718/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-28 20:39:38,196 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-11-28 20:39:38,196 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-28 20:39:38,200 INFO L262 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-28 20:39:38,201 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:39:38,228 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-28 20:39:38,228 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 20:39:38,228 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 20:39:38,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [572212831] [2023-11-28 20:39:38,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [572212831] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:39:38,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:39:38,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-28 20:39:38,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763071753] [2023-11-28 20:39:38,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:39:38,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-28 20:39:38,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 20:39:38,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-28 20:39:38,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-28 20:39:38,240 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 65 [2023-11-28 20:39:38,240 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 76 transitions, 320 flow. Second operand has 5 states, 5 states have (on average 39.8) internal successors, (199), 5 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:39:38,240 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:39:38,241 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 65 [2023-11-28 20:39:38,241 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:39:39,016 INFO L124 PetriNetUnfolderBase]: 5260/9064 cut-off events. [2023-11-28 20:39:39,016 INFO L125 PetriNetUnfolderBase]: For 5911/6765 co-relation queries the response was YES. [2023-11-28 20:39:39,039 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24242 conditions, 9064 events. 5260/9064 cut-off events. For 5911/6765 co-relation queries the response was YES. Maximal size of possible extension queue 488. Compared 66554 event pairs, 2258 based on Foata normal form. 16/8158 useless extension candidates. Maximal degree in co-relation 24222. Up to 4375 conditions per place. [2023-11-28 20:39:39,065 INFO L140 encePairwiseOnDemand]: 59/65 looper letters, 68 selfloop transitions, 14 changer transitions 0/119 dead transitions. [2023-11-28 20:39:39,065 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 119 transitions, 704 flow [2023-11-28 20:39:39,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-28 20:39:39,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-28 20:39:39,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 233 transitions. [2023-11-28 20:39:39,066 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7169230769230769 [2023-11-28 20:39:39,066 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 233 transitions. [2023-11-28 20:39:39,066 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 233 transitions. [2023-11-28 20:39:39,067 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:39:39,067 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 233 transitions. [2023-11-28 20:39:39,067 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 46.6) internal successors, (233), 5 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:39:39,068 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 65.0) internal successors, (390), 6 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:39:39,068 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 65.0) internal successors, (390), 6 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:39:39,068 INFO L175 Difference]: Start difference. First operand has 82 places, 76 transitions, 320 flow. Second operand 5 states and 233 transitions. [2023-11-28 20:39:39,068 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 119 transitions, 704 flow [2023-11-28 20:39:39,086 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 119 transitions, 694 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-28 20:39:39,087 INFO L231 Difference]: Finished difference. Result has 86 places, 89 transitions, 502 flow [2023-11-28 20:39:39,087 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=314, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=502, PETRI_PLACES=86, PETRI_TRANSITIONS=89} [2023-11-28 20:39:39,088 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 14 predicate places. [2023-11-28 20:39:39,088 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 89 transitions, 502 flow [2023-11-28 20:39:39,088 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 39.8) internal successors, (199), 5 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:39:39,088 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:39:39,088 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] [2023-11-28 20:39:39,092 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_670dfbfa-750d-4394-a19d-2d77acdc8718/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-28 20:39:39,288 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_670dfbfa-750d-4394-a19d-2d77acdc8718/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-28 20:39:39,289 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-28 20:39:39,289 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:39:39,289 INFO L85 PathProgramCache]: Analyzing trace with hash 993511920, now seen corresponding path program 4 times [2023-11-28 20:39:39,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 20:39:39,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1460804094] [2023-11-28 20:39:39,289 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-28 20:39:39,289 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-28 20:39:39,289 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_670dfbfa-750d-4394-a19d-2d77acdc8718/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 20:39:39,290 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_670dfbfa-750d-4394-a19d-2d77acdc8718/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-28 20:39:39,291 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_670dfbfa-750d-4394-a19d-2d77acdc8718/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-28 20:39:39,400 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-28 20:39:39,401 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-28 20:39:39,405 INFO L262 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-28 20:39:39,406 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:39:39,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 20:39:39,459 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 20:39:39,459 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 20:39:39,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1460804094] [2023-11-28 20:39:39,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1460804094] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:39:39,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:39:39,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-28 20:39:39,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942784640] [2023-11-28 20:39:39,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:39:39,460 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-28 20:39:39,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 20:39:39,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-28 20:39:39,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-28 20:39:39,469 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 65 [2023-11-28 20:39:39,469 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 89 transitions, 502 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-28 20:39:39,469 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:39:39,469 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 65 [2023-11-28 20:39:39,469 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:39:40,896 INFO L124 PetriNetUnfolderBase]: 8872/15526 cut-off events. [2023-11-28 20:39:40,896 INFO L125 PetriNetUnfolderBase]: For 13184/14824 co-relation queries the response was YES. [2023-11-28 20:39:40,934 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42961 conditions, 15526 events. 8872/15526 cut-off events. For 13184/14824 co-relation queries the response was YES. Maximal size of possible extension queue 840. Compared 125347 event pairs, 2826 based on Foata normal form. 18/14251 useless extension candidates. Maximal degree in co-relation 42939. Up to 7797 conditions per place. [2023-11-28 20:39:40,975 INFO L140 encePairwiseOnDemand]: 59/65 looper letters, 87 selfloop transitions, 26 changer transitions 0/151 dead transitions. [2023-11-28 20:39:40,976 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 151 transitions, 1147 flow [2023-11-28 20:39:40,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-28 20:39:40,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-28 20:39:40,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 275 transitions. [2023-11-28 20:39:40,977 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7051282051282052 [2023-11-28 20:39:40,978 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 275 transitions. [2023-11-28 20:39:40,978 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 275 transitions. [2023-11-28 20:39:40,978 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:39:40,978 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 275 transitions. [2023-11-28 20:39:40,979 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 45.833333333333336) internal successors, (275), 6 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:39:40,980 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 65.0) internal successors, (455), 7 states have internal predecessors, (455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:39:40,980 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 65.0) internal successors, (455), 7 states have internal predecessors, (455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:39:40,980 INFO L175 Difference]: Start difference. First operand has 86 places, 89 transitions, 502 flow. Second operand 6 states and 275 transitions. [2023-11-28 20:39:40,980 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 151 transitions, 1147 flow [2023-11-28 20:39:41,096 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 151 transitions, 1145 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-28 20:39:41,098 INFO L231 Difference]: Finished difference. Result has 94 places, 114 transitions, 937 flow [2023-11-28 20:39:41,098 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=500, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=937, PETRI_PLACES=94, PETRI_TRANSITIONS=114} [2023-11-28 20:39:41,099 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 22 predicate places. [2023-11-28 20:39:41,099 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 114 transitions, 937 flow [2023-11-28 20:39:41,099 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-28 20:39:41,099 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:39:41,099 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] [2023-11-28 20:39:41,102 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_670dfbfa-750d-4394-a19d-2d77acdc8718/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-28 20:39:41,299 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_670dfbfa-750d-4394-a19d-2d77acdc8718/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-28 20:39:41,299 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-28 20:39:41,300 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:39:41,300 INFO L85 PathProgramCache]: Analyzing trace with hash 1155206162, now seen corresponding path program 5 times [2023-11-28 20:39:41,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 20:39:41,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [191574849] [2023-11-28 20:39:41,300 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-28 20:39:41,300 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-28 20:39:41,300 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_670dfbfa-750d-4394-a19d-2d77acdc8718/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 20:39:41,301 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_670dfbfa-750d-4394-a19d-2d77acdc8718/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-28 20:39:41,302 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_670dfbfa-750d-4394-a19d-2d77acdc8718/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-28 20:39:41,439 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-28 20:39:41,439 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-11-28 20:39:41,439 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-28 20:39:41,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-28 20:39:41,605 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-11-28 20:39:41,605 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-28 20:39:41,606 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2023-11-28 20:39:41,608 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2023-11-28 20:39:41,608 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2023-11-28 20:39:41,608 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2023-11-28 20:39:41,608 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2023-11-28 20:39:41,608 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2023-11-28 20:39:41,608 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2023-11-28 20:39:41,609 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2023-11-28 20:39:41,609 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2023-11-28 20:39:41,609 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2023-11-28 20:39:41,609 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2023-11-28 20:39:41,609 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2023-11-28 20:39:41,609 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2023-11-28 20:39:41,609 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2023-11-28 20:39:41,609 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2023-11-28 20:39:41,610 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2023-11-28 20:39:41,613 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_670dfbfa-750d-4394-a19d-2d77acdc8718/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-28 20:39:41,810 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_670dfbfa-750d-4394-a19d-2d77acdc8718/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-28 20:39:41,810 INFO L445 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:39:41,815 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-28 20:39:41,815 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-28 20:39:41,878 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-28 20:39:41,881 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-28 20:39:41,882 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-28 20:39:41,883 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated [2023-11-28 20:39:41,899 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-28 20:39:41,900 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-28 20:39:41,913 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 08:39:41 BasicIcfg [2023-11-28 20:39:41,913 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-28 20:39:41,913 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-28 20:39:41,913 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-28 20:39:41,914 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-28 20:39:41,914 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:39:23" (3/4) ... [2023-11-28 20:39:41,916 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-28 20:39:41,917 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-28 20:39:41,917 INFO L158 Benchmark]: Toolchain (without parser) took 19417.33ms. Allocated memory was 71.3MB in the beginning and 574.6MB in the end (delta: 503.3MB). Free memory was 46.9MB in the beginning and 154.8MB in the end (delta: -107.9MB). Peak memory consumption was 397.4MB. Max. memory is 16.1GB. [2023-11-28 20:39:41,917 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 71.3MB. Free memory is still 48.2MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-28 20:39:41,918 INFO L158 Benchmark]: CACSL2BoogieTranslator took 548.03ms. Allocated memory was 71.3MB in the beginning and 98.6MB in the end (delta: 27.3MB). Free memory was 46.9MB in the beginning and 70.2MB in the end (delta: -23.3MB). Peak memory consumption was 21.9MB. Max. memory is 16.1GB. [2023-11-28 20:39:41,918 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.52ms. Allocated memory is still 98.6MB. Free memory was 69.8MB in the beginning and 67.6MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-28 20:39:41,918 INFO L158 Benchmark]: Boogie Preprocessor took 56.22ms. Allocated memory is still 98.6MB. Free memory was 67.6MB in the beginning and 63.9MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-28 20:39:41,918 INFO L158 Benchmark]: RCFGBuilder took 757.98ms. Allocated memory is still 98.6MB. Free memory was 63.9MB in the beginning and 63.3MB in the end (delta: 598.3kB). Peak memory consumption was 26.9MB. Max. memory is 16.1GB. [2023-11-28 20:39:41,919 INFO L158 Benchmark]: TraceAbstraction took 17993.55ms. Allocated memory was 98.6MB in the beginning and 574.6MB in the end (delta: 476.1MB). Free memory was 63.1MB in the beginning and 154.8MB in the end (delta: -91.8MB). Peak memory consumption was 384.3MB. Max. memory is 16.1GB. [2023-11-28 20:39:41,919 INFO L158 Benchmark]: Witness Printer took 3.31ms. Allocated memory is still 574.6MB. Free memory is still 154.8MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-28 20:39:41,921 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.27ms. Allocated memory is still 71.3MB. Free memory is still 48.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 548.03ms. Allocated memory was 71.3MB in the beginning and 98.6MB in the end (delta: 27.3MB). Free memory was 46.9MB in the beginning and 70.2MB in the end (delta: -23.3MB). Peak memory consumption was 21.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.52ms. Allocated memory is still 98.6MB. Free memory was 69.8MB in the beginning and 67.6MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 56.22ms. Allocated memory is still 98.6MB. Free memory was 67.6MB in the beginning and 63.9MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 757.98ms. Allocated memory is still 98.6MB. Free memory was 63.9MB in the beginning and 63.3MB in the end (delta: 598.3kB). Peak memory consumption was 26.9MB. Max. memory is 16.1GB. * TraceAbstraction took 17993.55ms. Allocated memory was 98.6MB in the beginning and 574.6MB in the end (delta: 476.1MB). Free memory was 63.1MB in the beginning and 154.8MB in the end (delta: -91.8MB). Peak memory consumption was 384.3MB. Max. memory is 16.1GB. * Witness Printer took 3.31ms. Allocated memory is still 574.6MB. Free memory is still 154.8MB. 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_p2_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int a = 0; [L717] 0 _Bool main$tmp_guard0; [L718] 0 _Bool main$tmp_guard1; [L720] 0 int x = 0; [L722] 0 int y = 0; [L724] 0 int z = 0; [L725] 0 _Bool z$flush_delayed; [L726] 0 int z$mem_tmp; [L727] 0 _Bool z$r_buff0_thd0; [L728] 0 _Bool z$r_buff0_thd1; [L729] 0 _Bool z$r_buff0_thd2; [L730] 0 _Bool z$r_buff0_thd3; [L731] 0 _Bool z$r_buff0_thd4; [L732] 0 _Bool z$r_buff1_thd0; [L733] 0 _Bool z$r_buff1_thd1; [L734] 0 _Bool z$r_buff1_thd2; [L735] 0 _Bool z$r_buff1_thd3; [L736] 0 _Bool z$r_buff1_thd4; [L737] 0 _Bool z$read_delayed; [L738] 0 int *z$read_delayed_var; [L739] 0 int z$w_buff0; [L740] 0 _Bool z$w_buff0_used; [L741] 0 int z$w_buff1; [L742] 0 _Bool z$w_buff1_used; [L743] 0 _Bool weak$$choice0; [L744] 0 _Bool weak$$choice2; [L844] 0 pthread_t t1413; [L845] FCALL, FORK 0 pthread_create(&t1413, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1413={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] [L846] 0 pthread_t t1414; [L847] FCALL, FORK 0 pthread_create(&t1414, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1413={7:0}, t1414={-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] [L848] 0 pthread_t t1415; [L849] FCALL, FORK 0 pthread_create(&t1415, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1413={7:0}, t1414={-2147483645:0}, t1415={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] [L850] 0 pthread_t t1416; [L851] FCALL, FORK 0 pthread_create(&t1416, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1413={7:0}, t1414={-2147483645:0}, t1415={3:0}, t1416={-1073741821: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] [L806] 4 z$w_buff1 = z$w_buff0 [L807] 4 z$w_buff0 = 1 [L808] 4 z$w_buff1_used = z$w_buff0_used [L809] 4 z$w_buff0_used = (_Bool)1 [L810] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L810] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L811] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L812] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L813] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L814] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L815] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L816] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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] [L819] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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] [L748] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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] [L751] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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] [L763] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, 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] [L766] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, 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] [L756] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, 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] [L771] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, 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] [L778] 3 y = 2 VAL [__unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, 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] [L781] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L782] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L783] 3 z$flush_delayed = weak$$choice2 [L784] 3 z$mem_tmp = z [L785] 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) [L786] 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)) [L787] 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)) [L788] 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)) [L789] 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)) [L790] 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)) [L791] 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)) [L792] 3 __unbuffered_p2_EAX = z [L793] 3 z = z$flush_delayed ? z$mem_tmp : z [L794] 3 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, 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] [L799] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, 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] [L822] 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) [L823] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L824] 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 [L825] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L826] 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_p2_EAX=0, __unbuffered_p3_EAX=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, 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] [L829] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, 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] [L853] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [__unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1413={7:0}, t1414={-2147483645:0}, t1415={3:0}, t1416={-1073741821:0}, weak$$choice2=0, x=2, 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] [L855] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L855] RET 0 assume_abort_if_not(main$tmp_guard0) [L857] 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) [L858] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L859] 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 [L860] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L861] 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_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1413={7:0}, t1414={-2147483645:0}, t1415={3:0}, t1416={-1073741821:0}, weak$$choice2=0, x=2, 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] [L864] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 0) VAL [__unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1413={7:0}, t1414={-2147483645:0}, t1415={3:0}, t1416={-1073741821:0}, weak$$choice2=0, x=2, 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] [L866] 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_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, 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", "mix053.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [__unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, 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: 842]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 849]: 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: 847]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 845]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 851]: 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, 97 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: 17.8s, OverallIterations: 19, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 9.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 805 SdHoareTripleChecker+Valid, 2.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 660 mSDsluCounter, 83 SdHoareTripleChecker+Invalid, 2.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 68 IncrementalHoareTripleChecker+Unchecked, 65 mSDsCounter, 48 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2084 IncrementalHoareTripleChecker+Invalid, 2200 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 48 mSolverCounterUnsat, 18 mSDtfsCounter, 2084 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 388 GetRequests, 323 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=937occurred in iteration=18, InterpolantAutomatonStates: 81, 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.3s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 426 NumberOfCodeBlocks, 426 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 367 ConstructedInterpolants, 1 QuantifiedInterpolants, 2717 SizeOfPredicates, 17 NumberOfNonLiveVariables, 2454 ConjunctsInSsa, 96 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-28 20:39:41,942 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_670dfbfa-750d-4394-a19d-2d77acdc8718/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 Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample