./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/rfi007_tso.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_3ce43a9a-00a6-41ee-bce8-4a7d9227c264/bin/uautomizer-verify-NlZe1sFDwI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ce43a9a-00a6-41ee-bce8-4a7d9227c264/bin/uautomizer-verify-NlZe1sFDwI/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ce43a9a-00a6-41ee-bce8-4a7d9227c264/bin/uautomizer-verify-NlZe1sFDwI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ce43a9a-00a6-41ee-bce8-4a7d9227c264/bin/uautomizer-verify-NlZe1sFDwI/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/rfi007_tso.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ce43a9a-00a6-41ee-bce8-4a7d9227c264/bin/uautomizer-verify-NlZe1sFDwI/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ce43a9a-00a6-41ee-bce8-4a7d9227c264/bin/uautomizer-verify-NlZe1sFDwI --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 62e921ac3b02bdecb866366797768eb8fcdb22a87147dc14adf7fddb42ab9cb2 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-24 22:03:08,971 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-24 22:03:09,058 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ce43a9a-00a6-41ee-bce8-4a7d9227c264/bin/uautomizer-verify-NlZe1sFDwI/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-24 22:03:09,066 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-24 22:03:09,068 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-24 22:03:09,111 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-24 22:03:09,112 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-24 22:03:09,113 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-24 22:03:09,114 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-24 22:03:09,119 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-24 22:03:09,119 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-24 22:03:09,120 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-24 22:03:09,121 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-24 22:03:09,123 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-24 22:03:09,123 INFO L153 SettingsManager]: * Use SBE=true [2023-11-24 22:03:09,124 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-24 22:03:09,124 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-24 22:03:09,125 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-24 22:03:09,125 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-24 22:03:09,125 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-24 22:03:09,126 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-24 22:03:09,126 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-24 22:03:09,127 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-24 22:03:09,127 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-24 22:03:09,127 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-24 22:03:09,128 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-24 22:03:09,128 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-24 22:03:09,128 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-24 22:03:09,129 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-24 22:03:09,129 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-24 22:03:09,130 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-24 22:03:09,130 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-24 22:03:09,130 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-24 22:03:09,131 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-24 22:03:09,131 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-24 22:03:09,131 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-24 22:03:09,131 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-24 22:03:09,131 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-24 22:03:09,132 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-24 22:03:09,132 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-24 22:03:09,132 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-24 22:03:09,132 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_3ce43a9a-00a6-41ee-bce8-4a7d9227c264/bin/uautomizer-verify-NlZe1sFDwI/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_3ce43a9a-00a6-41ee-bce8-4a7d9227c264/bin/uautomizer-verify-NlZe1sFDwI 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 -> 62e921ac3b02bdecb866366797768eb8fcdb22a87147dc14adf7fddb42ab9cb2 [2023-11-24 22:03:09,432 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-24 22:03:09,461 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-24 22:03:09,465 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-24 22:03:09,466 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-24 22:03:09,467 INFO L274 PluginConnector]: CDTParser initialized [2023-11-24 22:03:09,468 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ce43a9a-00a6-41ee-bce8-4a7d9227c264/bin/uautomizer-verify-NlZe1sFDwI/../../sv-benchmarks/c/pthread-wmm/rfi007_tso.i [2023-11-24 22:03:12,625 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-24 22:03:12,967 INFO L384 CDTParser]: Found 1 translation units. [2023-11-24 22:03:12,967 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ce43a9a-00a6-41ee-bce8-4a7d9227c264/sv-benchmarks/c/pthread-wmm/rfi007_tso.i [2023-11-24 22:03:13,001 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ce43a9a-00a6-41ee-bce8-4a7d9227c264/bin/uautomizer-verify-NlZe1sFDwI/data/1f84dc12e/b65694ec6d064a3c8f4cb1eaa97d5d1f/FLAGee2be9652 [2023-11-24 22:03:13,024 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ce43a9a-00a6-41ee-bce8-4a7d9227c264/bin/uautomizer-verify-NlZe1sFDwI/data/1f84dc12e/b65694ec6d064a3c8f4cb1eaa97d5d1f [2023-11-24 22:03:13,032 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-24 22:03:13,034 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-24 22:03:13,039 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-24 22:03:13,039 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-24 22:03:13,055 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-24 22:03:13,055 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 10:03:13" (1/1) ... [2023-11-24 22:03:13,057 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5535b968 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:03:13, skipping insertion in model container [2023-11-24 22:03:13,072 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 10:03:13" (1/1) ... [2023-11-24 22:03:13,173 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-24 22:03:13,613 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-24 22:03:13,637 INFO L202 MainTranslator]: Completed pre-run [2023-11-24 22:03:13,711 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-24 22:03:13,756 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-24 22:03:13,756 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-24 22:03:13,764 INFO L206 MainTranslator]: Completed translation [2023-11-24 22:03:13,765 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:03:13 WrapperNode [2023-11-24 22:03:13,765 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-24 22:03:13,766 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-24 22:03:13,767 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-24 22:03:13,767 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-24 22:03:13,776 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:03:13" (1/1) ... [2023-11-24 22:03:13,797 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:03:13" (1/1) ... [2023-11-24 22:03:13,840 INFO L138 Inliner]: procedures = 175, calls = 44, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 155 [2023-11-24 22:03:13,841 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-24 22:03:13,841 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-24 22:03:13,842 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-24 22:03:13,842 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-24 22:03:13,854 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:03:13" (1/1) ... [2023-11-24 22:03:13,861 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:03:13" (1/1) ... [2023-11-24 22:03:13,865 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:03:13" (1/1) ... [2023-11-24 22:03:13,886 INFO L175 MemorySlicer]: Split 4 memory accesses to 3 slices as follows [2, 1, 1]. 50 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 2 writes are split as follows [0, 1, 1]. [2023-11-24 22:03:13,886 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:03:13" (1/1) ... [2023-11-24 22:03:13,887 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:03:13" (1/1) ... [2023-11-24 22:03:13,897 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:03:13" (1/1) ... [2023-11-24 22:03:13,900 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:03:13" (1/1) ... [2023-11-24 22:03:13,903 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:03:13" (1/1) ... [2023-11-24 22:03:13,905 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:03:13" (1/1) ... [2023-11-24 22:03:13,910 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-24 22:03:13,911 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-24 22:03:13,912 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-24 22:03:13,912 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-24 22:03:13,913 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:03:13" (1/1) ... [2023-11-24 22:03:13,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-24 22:03:13,935 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ce43a9a-00a6-41ee-bce8-4a7d9227c264/bin/uautomizer-verify-NlZe1sFDwI/z3 [2023-11-24 22:03:13,948 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ce43a9a-00a6-41ee-bce8-4a7d9227c264/bin/uautomizer-verify-NlZe1sFDwI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-24 22:03:13,974 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ce43a9a-00a6-41ee-bce8-4a7d9227c264/bin/uautomizer-verify-NlZe1sFDwI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-24 22:03:13,987 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-24 22:03:13,987 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-24 22:03:13,987 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-24 22:03:13,988 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-24 22:03:13,988 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-24 22:03:13,988 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-24 22:03:13,988 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-24 22:03:13,989 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-24 22:03:13,989 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-24 22:03:13,989 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-24 22:03:13,989 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-24 22:03:13,989 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-24 22:03:13,989 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-24 22:03:13,990 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-24 22:03:13,990 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-24 22:03:13,990 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-24 22:03:13,990 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-24 22:03:13,992 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-24 22:03:14,151 INFO L241 CfgBuilder]: Building ICFG [2023-11-24 22:03:14,154 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-24 22:03:14,558 INFO L282 CfgBuilder]: Performing block encoding [2023-11-24 22:03:14,786 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-24 22:03:14,786 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-24 22:03:14,787 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 10:03:14 BoogieIcfgContainer [2023-11-24 22:03:14,787 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-24 22:03:14,790 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-24 22:03:14,791 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-24 22:03:14,794 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-24 22:03:14,795 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 10:03:13" (1/3) ... [2023-11-24 22:03:14,796 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6eb95895 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 10:03:14, skipping insertion in model container [2023-11-24 22:03:14,798 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:03:13" (2/3) ... [2023-11-24 22:03:14,799 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6eb95895 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 10:03:14, skipping insertion in model container [2023-11-24 22:03:14,800 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 10:03:14" (3/3) ... [2023-11-24 22:03:14,802 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi007_tso.i [2023-11-24 22:03:14,824 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-24 22:03:14,825 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2023-11-24 22:03:14,825 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-24 22:03:14,891 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-24 22:03:14,937 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 42 transitions, 92 flow [2023-11-24 22:03:15,005 INFO L124 PetriNetUnfolderBase]: 2/40 cut-off events. [2023-11-24 22:03:15,009 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-24 22:03:15,012 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47 conditions, 40 events. 2/40 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 71 event pairs, 0 based on Foata normal form. 0/31 useless extension candidates. Maximal degree in co-relation 37. Up to 2 conditions per place. [2023-11-24 22:03:15,012 INFO L82 GeneralOperation]: Start removeDead. Operand has 47 places, 42 transitions, 92 flow [2023-11-24 22:03:15,016 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 45 places, 40 transitions, 86 flow [2023-11-24 22:03:15,026 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-24 22:03:15,033 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;@742de6e6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-24 22:03:15,034 INFO L358 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2023-11-24 22:03:15,037 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-24 22:03:15,037 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-11-24 22:03:15,038 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-24 22:03:15,038 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 22:03:15,039 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-24 22:03:15,039 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-24 22:03:15,044 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 22:03:15,045 INFO L85 PathProgramCache]: Analyzing trace with hash 12693, now seen corresponding path program 1 times [2023-11-24 22:03:15,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 22:03:15,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602623346] [2023-11-24 22:03:15,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 22:03:15,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 22:03:15,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:03:15,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-24 22:03:15,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 22:03:15,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602623346] [2023-11-24 22:03:15,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602623346] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 22:03:15,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 22:03:15,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-24 22:03:15,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129745979] [2023-11-24 22:03:15,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 22:03:15,371 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 22:03:15,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 22:03:15,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 22:03:15,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 22:03:15,427 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 42 [2023-11-24 22:03:15,430 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 40 transitions, 86 flow. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:15,430 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 22:03:15,430 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 42 [2023-11-24 22:03:15,431 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 22:03:15,672 INFO L124 PetriNetUnfolderBase]: 230/516 cut-off events. [2023-11-24 22:03:15,672 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-11-24 22:03:15,675 INFO L83 FinitePrefix]: Finished finitePrefix Result has 928 conditions, 516 events. 230/516 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 3111 event pairs, 176 based on Foata normal form. 36/508 useless extension candidates. Maximal degree in co-relation 915. Up to 310 conditions per place. [2023-11-24 22:03:15,682 INFO L140 encePairwiseOnDemand]: 37/42 looper letters, 25 selfloop transitions, 2 changer transitions 0/43 dead transitions. [2023-11-24 22:03:15,682 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 43 transitions, 146 flow [2023-11-24 22:03:15,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 22:03:15,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 22:03:15,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 84 transitions. [2023-11-24 22:03:15,698 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2023-11-24 22:03:15,699 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 84 transitions. [2023-11-24 22:03:15,700 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 84 transitions. [2023-11-24 22:03:15,702 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 22:03:15,705 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 84 transitions. [2023-11-24 22:03:15,709 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:15,714 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:15,715 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:15,717 INFO L175 Difference]: Start difference. First operand has 45 places, 40 transitions, 86 flow. Second operand 3 states and 84 transitions. [2023-11-24 22:03:15,718 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 43 transitions, 146 flow [2023-11-24 22:03:15,721 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 43 transitions, 144 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 22:03:15,725 INFO L231 Difference]: Finished difference. Result has 43 places, 36 transitions, 80 flow [2023-11-24 22:03:15,728 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=80, PETRI_PLACES=43, PETRI_TRANSITIONS=36} [2023-11-24 22:03:15,735 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, -2 predicate places. [2023-11-24 22:03:15,735 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 36 transitions, 80 flow [2023-11-24 22:03:15,736 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:15,736 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 22:03:15,736 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-24 22:03:15,737 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-24 22:03:15,738 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-24 22:03:15,739 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 22:03:15,740 INFO L85 PathProgramCache]: Analyzing trace with hash 12694, now seen corresponding path program 1 times [2023-11-24 22:03:15,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 22:03:15,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419587765] [2023-11-24 22:03:15,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 22:03:15,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 22:03:15,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:03:15,886 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-24 22:03:15,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 22:03:15,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419587765] [2023-11-24 22:03:15,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419587765] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 22:03:15,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 22:03:15,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-24 22:03:15,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321555535] [2023-11-24 22:03:15,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 22:03:15,889 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 22:03:15,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 22:03:15,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 22:03:15,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 22:03:15,900 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 42 [2023-11-24 22:03:15,900 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 36 transitions, 80 flow. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:15,900 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 22:03:15,901 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 42 [2023-11-24 22:03:15,901 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 22:03:16,128 INFO L124 PetriNetUnfolderBase]: 230/515 cut-off events. [2023-11-24 22:03:16,129 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2023-11-24 22:03:16,134 INFO L83 FinitePrefix]: Finished finitePrefix Result has 944 conditions, 515 events. 230/515 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 3086 event pairs, 176 based on Foata normal form. 1/472 useless extension candidates. Maximal degree in co-relation 933. Up to 309 conditions per place. [2023-11-24 22:03:16,139 INFO L140 encePairwiseOnDemand]: 39/42 looper letters, 24 selfloop transitions, 2 changer transitions 0/42 dead transitions. [2023-11-24 22:03:16,140 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 42 transitions, 144 flow [2023-11-24 22:03:16,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 22:03:16,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 22:03:16,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 84 transitions. [2023-11-24 22:03:16,144 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2023-11-24 22:03:16,144 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 84 transitions. [2023-11-24 22:03:16,144 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 84 transitions. [2023-11-24 22:03:16,145 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 22:03:16,145 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 84 transitions. [2023-11-24 22:03:16,149 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:16,151 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:16,152 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:16,152 INFO L175 Difference]: Start difference. First operand has 43 places, 36 transitions, 80 flow. Second operand 3 states and 84 transitions. [2023-11-24 22:03:16,152 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 42 transitions, 144 flow [2023-11-24 22:03:16,156 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 42 transitions, 140 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 22:03:16,160 INFO L231 Difference]: Finished difference. Result has 42 places, 35 transitions, 78 flow [2023-11-24 22:03:16,163 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=78, PETRI_PLACES=42, PETRI_TRANSITIONS=35} [2023-11-24 22:03:16,164 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, -3 predicate places. [2023-11-24 22:03:16,164 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 35 transitions, 78 flow [2023-11-24 22:03:16,165 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:16,166 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 22:03:16,166 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-24 22:03:16,167 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-24 22:03:16,167 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-24 22:03:16,171 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 22:03:16,176 INFO L85 PathProgramCache]: Analyzing trace with hash 378489340, now seen corresponding path program 1 times [2023-11-24 22:03:16,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 22:03:16,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545857249] [2023-11-24 22:03:16,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 22:03:16,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 22:03:16,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:03:16,264 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-24 22:03:16,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 22:03:16,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545857249] [2023-11-24 22:03:16,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545857249] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 22:03:16,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 22:03:16,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-24 22:03:16,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066340999] [2023-11-24 22:03:16,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 22:03:16,266 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 22:03:16,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 22:03:16,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 22:03:16,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 22:03:16,277 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 42 [2023-11-24 22:03:16,277 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 35 transitions, 78 flow. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:16,277 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 22:03:16,278 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 42 [2023-11-24 22:03:16,278 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 22:03:16,427 INFO L124 PetriNetUnfolderBase]: 232/507 cut-off events. [2023-11-24 22:03:16,428 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2023-11-24 22:03:16,429 INFO L83 FinitePrefix]: Finished finitePrefix Result has 941 conditions, 507 events. 232/507 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 3009 event pairs, 182 based on Foata normal form. 0/469 useless extension candidates. Maximal degree in co-relation 930. Up to 310 conditions per place. [2023-11-24 22:03:16,433 INFO L140 encePairwiseOnDemand]: 39/42 looper letters, 25 selfloop transitions, 2 changer transitions 0/41 dead transitions. [2023-11-24 22:03:16,433 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 41 transitions, 144 flow [2023-11-24 22:03:16,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 22:03:16,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 22:03:16,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 82 transitions. [2023-11-24 22:03:16,435 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6507936507936508 [2023-11-24 22:03:16,435 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 82 transitions. [2023-11-24 22:03:16,435 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 82 transitions. [2023-11-24 22:03:16,435 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 22:03:16,435 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 82 transitions. [2023-11-24 22:03:16,436 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:16,437 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:16,437 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:16,437 INFO L175 Difference]: Start difference. First operand has 42 places, 35 transitions, 78 flow. Second operand 3 states and 82 transitions. [2023-11-24 22:03:16,437 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 41 transitions, 144 flow [2023-11-24 22:03:16,438 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 41 transitions, 140 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 22:03:16,440 INFO L231 Difference]: Finished difference. Result has 41 places, 34 transitions, 76 flow [2023-11-24 22:03:16,440 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=76, PETRI_PLACES=41, PETRI_TRANSITIONS=34} [2023-11-24 22:03:16,441 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, -4 predicate places. [2023-11-24 22:03:16,441 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 34 transitions, 76 flow [2023-11-24 22:03:16,441 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:16,441 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 22:03:16,442 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-24 22:03:16,442 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-24 22:03:16,442 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-24 22:03:16,443 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 22:03:16,443 INFO L85 PathProgramCache]: Analyzing trace with hash 378489341, now seen corresponding path program 1 times [2023-11-24 22:03:16,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 22:03:16,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769345212] [2023-11-24 22:03:16,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 22:03:16,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 22:03:16,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:03:16,521 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-24 22:03:16,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 22:03:16,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769345212] [2023-11-24 22:03:16,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769345212] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 22:03:16,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 22:03:16,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-24 22:03:16,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764499880] [2023-11-24 22:03:16,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 22:03:16,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 22:03:16,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 22:03:16,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 22:03:16,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 22:03:16,534 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 42 [2023-11-24 22:03:16,535 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 34 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:16,535 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 22:03:16,535 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 42 [2023-11-24 22:03:16,535 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 22:03:16,690 INFO L124 PetriNetUnfolderBase]: 230/509 cut-off events. [2023-11-24 22:03:16,691 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2023-11-24 22:03:16,692 INFO L83 FinitePrefix]: Finished finitePrefix Result has 940 conditions, 509 events. 230/509 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 3073 event pairs, 114 based on Foata normal form. 3/475 useless extension candidates. Maximal degree in co-relation 930. Up to 305 conditions per place. [2023-11-24 22:03:16,696 INFO L140 encePairwiseOnDemand]: 39/42 looper letters, 24 selfloop transitions, 2 changer transitions 0/40 dead transitions. [2023-11-24 22:03:16,696 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 40 transitions, 140 flow [2023-11-24 22:03:16,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 22:03:16,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 22:03:16,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 84 transitions. [2023-11-24 22:03:16,697 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2023-11-24 22:03:16,698 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 84 transitions. [2023-11-24 22:03:16,698 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 84 transitions. [2023-11-24 22:03:16,698 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 22:03:16,698 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 84 transitions. [2023-11-24 22:03:16,699 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:16,699 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:16,700 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:16,700 INFO L175 Difference]: Start difference. First operand has 41 places, 34 transitions, 76 flow. Second operand 3 states and 84 transitions. [2023-11-24 22:03:16,700 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 40 transitions, 140 flow [2023-11-24 22:03:16,701 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 40 transitions, 136 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 22:03:16,702 INFO L231 Difference]: Finished difference. Result has 40 places, 33 transitions, 74 flow [2023-11-24 22:03:16,702 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=74, PETRI_PLACES=40, PETRI_TRANSITIONS=33} [2023-11-24 22:03:16,703 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, -5 predicate places. [2023-11-24 22:03:16,703 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 33 transitions, 74 flow [2023-11-24 22:03:16,704 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:16,704 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 22:03:16,704 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 22:03:16,704 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-24 22:03:16,704 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-24 22:03:16,705 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 22:03:16,705 INFO L85 PathProgramCache]: Analyzing trace with hash 1287127174, now seen corresponding path program 1 times [2023-11-24 22:03:16,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 22:03:16,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211691691] [2023-11-24 22:03:16,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 22:03:16,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 22:03:16,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:03:16,862 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-24 22:03:16,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 22:03:16,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211691691] [2023-11-24 22:03:16,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211691691] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 22:03:16,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 22:03:16,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-24 22:03:16,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790139130] [2023-11-24 22:03:16,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 22:03:16,864 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 22:03:16,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 22:03:16,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 22:03:16,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 22:03:16,865 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 42 [2023-11-24 22:03:16,865 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 33 transitions, 74 flow. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:16,865 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 22:03:16,865 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 42 [2023-11-24 22:03:16,866 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 22:03:16,995 INFO L124 PetriNetUnfolderBase]: 188/410 cut-off events. [2023-11-24 22:03:16,995 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2023-11-24 22:03:16,996 INFO L83 FinitePrefix]: Finished finitePrefix Result has 769 conditions, 410 events. 188/410 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 2224 event pairs, 20 based on Foata normal form. 0/404 useless extension candidates. Maximal degree in co-relation 759. Up to 277 conditions per place. [2023-11-24 22:03:16,999 INFO L140 encePairwiseOnDemand]: 39/42 looper letters, 24 selfloop transitions, 2 changer transitions 2/42 dead transitions. [2023-11-24 22:03:16,999 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 42 transitions, 150 flow [2023-11-24 22:03:16,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 22:03:17,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 22:03:17,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 89 transitions. [2023-11-24 22:03:17,001 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7063492063492064 [2023-11-24 22:03:17,001 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 89 transitions. [2023-11-24 22:03:17,001 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 89 transitions. [2023-11-24 22:03:17,001 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 22:03:17,001 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 89 transitions. [2023-11-24 22:03:17,002 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:17,003 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:17,003 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:17,003 INFO L175 Difference]: Start difference. First operand has 40 places, 33 transitions, 74 flow. Second operand 3 states and 89 transitions. [2023-11-24 22:03:17,003 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 42 transitions, 150 flow [2023-11-24 22:03:17,004 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 42 transitions, 144 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 22:03:17,005 INFO L231 Difference]: Finished difference. Result has 39 places, 31 transitions, 70 flow [2023-11-24 22:03:17,005 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=70, PETRI_PLACES=39, PETRI_TRANSITIONS=31} [2023-11-24 22:03:17,006 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, -6 predicate places. [2023-11-24 22:03:17,006 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 31 transitions, 70 flow [2023-11-24 22:03:17,006 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:17,006 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 22:03:17,007 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 22:03:17,007 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-24 22:03:17,007 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-24 22:03:17,007 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 22:03:17,008 INFO L85 PathProgramCache]: Analyzing trace with hash 1059029559, now seen corresponding path program 1 times [2023-11-24 22:03:17,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 22:03:17,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111339439] [2023-11-24 22:03:17,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 22:03:17,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 22:03:17,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:03:17,418 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-24 22:03:17,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 22:03:17,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111339439] [2023-11-24 22:03:17,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111339439] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 22:03:17,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 22:03:17,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-24 22:03:17,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278734117] [2023-11-24 22:03:17,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 22:03:17,420 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-24 22:03:17,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 22:03:17,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-24 22:03:17,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-24 22:03:17,470 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 42 [2023-11-24 22:03:17,471 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 31 transitions, 70 flow. Second operand has 6 states, 6 states have (on average 19.0) internal successors, (114), 6 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:17,471 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 22:03:17,471 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 42 [2023-11-24 22:03:17,471 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 22:03:17,674 INFO L124 PetriNetUnfolderBase]: 166/372 cut-off events. [2023-11-24 22:03:17,674 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2023-11-24 22:03:17,676 INFO L83 FinitePrefix]: Finished finitePrefix Result has 702 conditions, 372 events. 166/372 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 2024 event pairs, 142 based on Foata normal form. 15/378 useless extension candidates. Maximal degree in co-relation 690. Up to 252 conditions per place. [2023-11-24 22:03:17,678 INFO L140 encePairwiseOnDemand]: 38/42 looper letters, 17 selfloop transitions, 2 changer transitions 7/38 dead transitions. [2023-11-24 22:03:17,679 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 38 transitions, 138 flow [2023-11-24 22:03:17,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-24 22:03:17,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-24 22:03:17,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 112 transitions. [2023-11-24 22:03:17,681 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5333333333333333 [2023-11-24 22:03:17,681 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 112 transitions. [2023-11-24 22:03:17,681 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 112 transitions. [2023-11-24 22:03:17,681 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 22:03:17,681 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 112 transitions. [2023-11-24 22:03:17,682 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 22.4) internal successors, (112), 5 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:17,685 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 42.0) internal successors, (252), 6 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:17,685 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 42.0) internal successors, (252), 6 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:17,685 INFO L175 Difference]: Start difference. First operand has 39 places, 31 transitions, 70 flow. Second operand 5 states and 112 transitions. [2023-11-24 22:03:17,685 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 38 transitions, 138 flow [2023-11-24 22:03:17,687 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 38 transitions, 132 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 22:03:17,688 INFO L231 Difference]: Finished difference. Result has 39 places, 29 transitions, 66 flow [2023-11-24 22:03:17,689 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=66, PETRI_PLACES=39, PETRI_TRANSITIONS=29} [2023-11-24 22:03:17,692 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, -6 predicate places. [2023-11-24 22:03:17,692 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 29 transitions, 66 flow [2023-11-24 22:03:17,693 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.0) internal successors, (114), 6 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:17,693 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 22:03:17,693 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 22:03:17,693 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-24 22:03:17,693 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-24 22:03:17,694 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 22:03:17,694 INFO L85 PathProgramCache]: Analyzing trace with hash 1059030954, now seen corresponding path program 1 times [2023-11-24 22:03:17,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 22:03:17,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661825945] [2023-11-24 22:03:17,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 22:03:17,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 22:03:17,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:03:18,617 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-24 22:03:18,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 22:03:18,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661825945] [2023-11-24 22:03:18,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661825945] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 22:03:18,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 22:03:18,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-24 22:03:18,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792827292] [2023-11-24 22:03:18,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 22:03:18,623 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-24 22:03:18,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 22:03:18,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-24 22:03:18,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-24 22:03:18,664 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 42 [2023-11-24 22:03:18,664 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 29 transitions, 66 flow. Second operand has 7 states, 7 states have (on average 17.571428571428573) internal successors, (123), 7 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:18,665 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 22:03:18,665 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 42 [2023-11-24 22:03:18,665 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 22:03:19,130 INFO L124 PetriNetUnfolderBase]: 398/735 cut-off events. [2023-11-24 22:03:19,130 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-11-24 22:03:19,132 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1436 conditions, 735 events. 398/735 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 3734 event pairs, 63 based on Foata normal form. 0/712 useless extension candidates. Maximal degree in co-relation 1425. Up to 354 conditions per place. [2023-11-24 22:03:19,135 INFO L140 encePairwiseOnDemand]: 35/42 looper letters, 28 selfloop transitions, 4 changer transitions 44/85 dead transitions. [2023-11-24 22:03:19,135 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 85 transitions, 334 flow [2023-11-24 22:03:19,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-24 22:03:19,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-11-24 22:03:19,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 255 transitions. [2023-11-24 22:03:19,138 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.551948051948052 [2023-11-24 22:03:19,138 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 255 transitions. [2023-11-24 22:03:19,138 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 255 transitions. [2023-11-24 22:03:19,139 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 22:03:19,139 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 255 transitions. [2023-11-24 22:03:19,140 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 23.181818181818183) internal successors, (255), 11 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:19,142 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 42.0) internal successors, (504), 12 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:19,142 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 42.0) internal successors, (504), 12 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:19,142 INFO L175 Difference]: Start difference. First operand has 39 places, 29 transitions, 66 flow. Second operand 11 states and 255 transitions. [2023-11-24 22:03:19,142 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 85 transitions, 334 flow [2023-11-24 22:03:19,144 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 85 transitions, 330 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 22:03:19,145 INFO L231 Difference]: Finished difference. Result has 53 places, 30 transitions, 100 flow [2023-11-24 22:03:19,146 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=63, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=100, PETRI_PLACES=53, PETRI_TRANSITIONS=30} [2023-11-24 22:03:19,146 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 8 predicate places. [2023-11-24 22:03:19,147 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 30 transitions, 100 flow [2023-11-24 22:03:19,147 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.571428571428573) internal successors, (123), 7 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:19,147 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 22:03:19,147 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 22:03:19,147 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-24 22:03:19,148 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-24 22:03:19,148 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 22:03:19,148 INFO L85 PathProgramCache]: Analyzing trace with hash -288371124, now seen corresponding path program 1 times [2023-11-24 22:03:19,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 22:03:19,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807409449] [2023-11-24 22:03:19,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 22:03:19,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 22:03:19,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:03:19,386 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-24 22:03:19,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 22:03:19,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807409449] [2023-11-24 22:03:19,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807409449] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 22:03:19,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 22:03:19,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-24 22:03:19,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700163934] [2023-11-24 22:03:19,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 22:03:19,389 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-24 22:03:19,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 22:03:19,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-24 22:03:19,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-24 22:03:19,398 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 42 [2023-11-24 22:03:19,398 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 30 transitions, 100 flow. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:19,398 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 22:03:19,399 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 42 [2023-11-24 22:03:19,400 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 22:03:19,629 INFO L124 PetriNetUnfolderBase]: 195/404 cut-off events. [2023-11-24 22:03:19,630 INFO L125 PetriNetUnfolderBase]: For 236/236 co-relation queries the response was YES. [2023-11-24 22:03:19,631 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1010 conditions, 404 events. 195/404 cut-off events. For 236/236 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1821 event pairs, 37 based on Foata normal form. 24/425 useless extension candidates. Maximal degree in co-relation 991. Up to 199 conditions per place. [2023-11-24 22:03:19,634 INFO L140 encePairwiseOnDemand]: 37/42 looper letters, 32 selfloop transitions, 5 changer transitions 1/47 dead transitions. [2023-11-24 22:03:19,634 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 47 transitions, 228 flow [2023-11-24 22:03:19,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-24 22:03:19,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-24 22:03:19,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 107 transitions. [2023-11-24 22:03:19,636 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6369047619047619 [2023-11-24 22:03:19,636 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 107 transitions. [2023-11-24 22:03:19,636 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 107 transitions. [2023-11-24 22:03:19,637 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 22:03:19,637 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 107 transitions. [2023-11-24 22:03:19,638 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:19,638 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 42.0) internal successors, (210), 5 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:19,639 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 42.0) internal successors, (210), 5 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:19,639 INFO L175 Difference]: Start difference. First operand has 53 places, 30 transitions, 100 flow. Second operand 4 states and 107 transitions. [2023-11-24 22:03:19,639 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 47 transitions, 228 flow [2023-11-24 22:03:19,642 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 47 transitions, 216 flow, removed 4 selfloop flow, removed 5 redundant places. [2023-11-24 22:03:19,644 INFO L231 Difference]: Finished difference. Result has 45 places, 32 transitions, 125 flow [2023-11-24 22:03:19,644 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=89, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=125, PETRI_PLACES=45, PETRI_TRANSITIONS=32} [2023-11-24 22:03:19,645 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 0 predicate places. [2023-11-24 22:03:19,645 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 32 transitions, 125 flow [2023-11-24 22:03:19,645 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:19,646 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 22:03:19,646 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-24 22:03:19,646 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-24 22:03:19,646 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-24 22:03:19,647 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 22:03:19,647 INFO L85 PathProgramCache]: Analyzing trace with hash 1952482250, now seen corresponding path program 1 times [2023-11-24 22:03:19,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 22:03:19,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071570361] [2023-11-24 22:03:19,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 22:03:19,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 22:03:19,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:03:19,929 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-24 22:03:19,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 22:03:19,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071570361] [2023-11-24 22:03:19,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071570361] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 22:03:19,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 22:03:19,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-24 22:03:19,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245946225] [2023-11-24 22:03:19,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 22:03:19,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-24 22:03:19,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 22:03:19,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-24 22:03:19,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-24 22:03:19,937 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 42 [2023-11-24 22:03:19,937 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 32 transitions, 125 flow. Second operand has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:19,937 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 22:03:19,937 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 42 [2023-11-24 22:03:19,937 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 22:03:20,114 INFO L124 PetriNetUnfolderBase]: 101/224 cut-off events. [2023-11-24 22:03:20,114 INFO L125 PetriNetUnfolderBase]: For 210/210 co-relation queries the response was YES. [2023-11-24 22:03:20,115 INFO L83 FinitePrefix]: Finished finitePrefix Result has 595 conditions, 224 events. 101/224 cut-off events. For 210/210 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 742 event pairs, 29 based on Foata normal form. 16/237 useless extension candidates. Maximal degree in co-relation 577. Up to 86 conditions per place. [2023-11-24 22:03:20,116 INFO L140 encePairwiseOnDemand]: 37/42 looper letters, 27 selfloop transitions, 7 changer transitions 1/44 dead transitions. [2023-11-24 22:03:20,117 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 44 transitions, 225 flow [2023-11-24 22:03:20,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-24 22:03:20,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-24 22:03:20,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 121 transitions. [2023-11-24 22:03:20,118 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5761904761904761 [2023-11-24 22:03:20,119 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 121 transitions. [2023-11-24 22:03:20,119 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 121 transitions. [2023-11-24 22:03:20,119 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 22:03:20,119 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 121 transitions. [2023-11-24 22:03:20,120 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 24.2) internal successors, (121), 5 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:20,121 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 42.0) internal successors, (252), 6 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:20,121 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 42.0) internal successors, (252), 6 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:20,121 INFO L175 Difference]: Start difference. First operand has 45 places, 32 transitions, 125 flow. Second operand 5 states and 121 transitions. [2023-11-24 22:03:20,122 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 44 transitions, 225 flow [2023-11-24 22:03:20,126 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 44 transitions, 197 flow, removed 9 selfloop flow, removed 5 redundant places. [2023-11-24 22:03:20,128 INFO L231 Difference]: Finished difference. Result has 46 places, 32 transitions, 125 flow [2023-11-24 22:03:20,128 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=99, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=125, PETRI_PLACES=46, PETRI_TRANSITIONS=32} [2023-11-24 22:03:20,130 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 1 predicate places. [2023-11-24 22:03:20,130 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 32 transitions, 125 flow [2023-11-24 22:03:20,130 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:20,130 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 22:03:20,131 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-24 22:03:20,131 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-24 22:03:20,131 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-24 22:03:20,131 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 22:03:20,132 INFO L85 PathProgramCache]: Analyzing trace with hash -1756583879, now seen corresponding path program 1 times [2023-11-24 22:03:20,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 22:03:20,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630365140] [2023-11-24 22:03:20,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 22:03:20,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 22:03:20,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:03:21,018 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-24 22:03:21,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 22:03:21,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630365140] [2023-11-24 22:03:21,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630365140] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 22:03:21,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 22:03:21,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-24 22:03:21,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522242139] [2023-11-24 22:03:21,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 22:03:21,020 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-24 22:03:21,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 22:03:21,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-24 22:03:21,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-24 22:03:21,041 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 42 [2023-11-24 22:03:21,042 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 32 transitions, 125 flow. Second operand has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 7 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:21,042 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 22:03:21,042 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 42 [2023-11-24 22:03:21,042 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 22:03:21,408 INFO L124 PetriNetUnfolderBase]: 121/290 cut-off events. [2023-11-24 22:03:21,408 INFO L125 PetriNetUnfolderBase]: For 150/150 co-relation queries the response was YES. [2023-11-24 22:03:21,409 INFO L83 FinitePrefix]: Finished finitePrefix Result has 692 conditions, 290 events. 121/290 cut-off events. For 150/150 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1079 event pairs, 18 based on Foata normal form. 4/289 useless extension candidates. Maximal degree in co-relation 675. Up to 129 conditions per place. [2023-11-24 22:03:21,410 INFO L140 encePairwiseOnDemand]: 34/42 looper letters, 19 selfloop transitions, 3 changer transitions 26/60 dead transitions. [2023-11-24 22:03:21,411 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 60 transitions, 289 flow [2023-11-24 22:03:21,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-24 22:03:21,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-24 22:03:21,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 183 transitions. [2023-11-24 22:03:21,413 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5446428571428571 [2023-11-24 22:03:21,413 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 183 transitions. [2023-11-24 22:03:21,413 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 183 transitions. [2023-11-24 22:03:21,414 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 22:03:21,414 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 183 transitions. [2023-11-24 22:03:21,415 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 22.875) internal successors, (183), 8 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:21,417 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 42.0) internal successors, (378), 9 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:21,418 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 42.0) internal successors, (378), 9 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:21,418 INFO L175 Difference]: Start difference. First operand has 46 places, 32 transitions, 125 flow. Second operand 8 states and 183 transitions. [2023-11-24 22:03:21,418 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 60 transitions, 289 flow [2023-11-24 22:03:21,420 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 60 transitions, 249 flow, removed 9 selfloop flow, removed 6 redundant places. [2023-11-24 22:03:21,422 INFO L231 Difference]: Finished difference. Result has 52 places, 30 transitions, 98 flow [2023-11-24 22:03:21,423 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=91, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=98, PETRI_PLACES=52, PETRI_TRANSITIONS=30} [2023-11-24 22:03:21,425 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 7 predicate places. [2023-11-24 22:03:21,426 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 30 transitions, 98 flow [2023-11-24 22:03:21,426 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 7 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:21,427 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 22:03:21,427 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-24 22:03:21,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-24 22:03:21,427 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-24 22:03:21,428 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 22:03:21,428 INFO L85 PathProgramCache]: Analyzing trace with hash 805619633, now seen corresponding path program 2 times [2023-11-24 22:03:21,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 22:03:21,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284507936] [2023-11-24 22:03:21,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 22:03:21,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 22:03:21,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:03:23,939 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-24 22:03:23,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 22:03:23,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284507936] [2023-11-24 22:03:23,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284507936] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 22:03:23,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 22:03:23,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-24 22:03:23,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203647344] [2023-11-24 22:03:23,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 22:03:23,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-24 22:03:23,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 22:03:23,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-24 22:03:23,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-11-24 22:03:23,954 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 42 [2023-11-24 22:03:23,955 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 30 transitions, 98 flow. Second operand has 9 states, 9 states have (on average 18.77777777777778) internal successors, (169), 9 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:23,955 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 22:03:23,955 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 42 [2023-11-24 22:03:23,956 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 22:03:24,363 INFO L124 PetriNetUnfolderBase]: 88/228 cut-off events. [2023-11-24 22:03:24,364 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2023-11-24 22:03:24,364 INFO L83 FinitePrefix]: Finished finitePrefix Result has 512 conditions, 228 events. 88/228 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 822 event pairs, 26 based on Foata normal form. 4/223 useless extension candidates. Maximal degree in co-relation 493. Up to 92 conditions per place. [2023-11-24 22:03:24,365 INFO L140 encePairwiseOnDemand]: 34/42 looper letters, 18 selfloop transitions, 5 changer transitions 12/47 dead transitions. [2023-11-24 22:03:24,366 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 47 transitions, 210 flow [2023-11-24 22:03:24,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-24 22:03:24,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-24 22:03:24,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 172 transitions. [2023-11-24 22:03:24,368 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5119047619047619 [2023-11-24 22:03:24,368 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 172 transitions. [2023-11-24 22:03:24,368 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 172 transitions. [2023-11-24 22:03:24,368 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 22:03:24,369 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 172 transitions. [2023-11-24 22:03:24,370 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 21.5) internal successors, (172), 8 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:24,371 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 42.0) internal successors, (378), 9 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:24,371 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 42.0) internal successors, (378), 9 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:24,371 INFO L175 Difference]: Start difference. First operand has 52 places, 30 transitions, 98 flow. Second operand 8 states and 172 transitions. [2023-11-24 22:03:24,371 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 47 transitions, 210 flow [2023-11-24 22:03:24,373 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 47 transitions, 191 flow, removed 7 selfloop flow, removed 6 redundant places. [2023-11-24 22:03:24,374 INFO L231 Difference]: Finished difference. Result has 51 places, 30 transitions, 104 flow [2023-11-24 22:03:24,375 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=104, PETRI_PLACES=51, PETRI_TRANSITIONS=30} [2023-11-24 22:03:24,375 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 6 predicate places. [2023-11-24 22:03:24,375 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 30 transitions, 104 flow [2023-11-24 22:03:24,376 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 18.77777777777778) internal successors, (169), 9 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:24,376 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 22:03:24,376 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-24 22:03:24,376 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-24 22:03:24,377 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-24 22:03:24,377 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 22:03:24,377 INFO L85 PathProgramCache]: Analyzing trace with hash 1578641329, now seen corresponding path program 3 times [2023-11-24 22:03:24,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 22:03:24,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461537848] [2023-11-24 22:03:24,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 22:03:24,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 22:03:24,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-24 22:03:24,437 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-24 22:03:24,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-24 22:03:24,529 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-24 22:03:24,530 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-24 22:03:24,531 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK (9 of 10 remaining) [2023-11-24 22:03:24,533 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (8 of 10 remaining) [2023-11-24 22:03:24,533 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 10 remaining) [2023-11-24 22:03:24,534 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 10 remaining) [2023-11-24 22:03:24,534 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 10 remaining) [2023-11-24 22:03:24,534 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 10 remaining) [2023-11-24 22:03:24,534 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK (3 of 10 remaining) [2023-11-24 22:03:24,535 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 10 remaining) [2023-11-24 22:03:24,535 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 10 remaining) [2023-11-24 22:03:24,535 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 10 remaining) [2023-11-24 22:03:24,535 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-24 22:03:24,536 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 22:03:24,542 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-24 22:03:24,543 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-24 22:03:24,590 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-24 22:03:24,593 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-24 22:03:24,601 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-24 22:03:24,608 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-24 22:03:24,634 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.11 10:03:24 BasicIcfg [2023-11-24 22:03:24,635 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-24 22:03:24,635 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-24 22:03:24,636 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-24 22:03:24,636 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-24 22:03:24,636 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 10:03:14" (3/4) ... [2023-11-24 22:03:24,638 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-24 22:03:24,640 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-24 22:03:24,641 INFO L158 Benchmark]: Toolchain (without parser) took 11606.21ms. Allocated memory was 161.5MB in the beginning and 295.7MB in the end (delta: 134.2MB). Free memory was 119.9MB in the beginning and 98.6MB in the end (delta: 21.4MB). Peak memory consumption was 155.2MB. Max. memory is 16.1GB. [2023-11-24 22:03:24,641 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 119.5MB. Free memory is still 87.8MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-24 22:03:24,641 INFO L158 Benchmark]: CACSL2BoogieTranslator took 726.54ms. Allocated memory is still 161.5MB. Free memory was 119.9MB in the beginning and 110.1MB in the end (delta: 9.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2023-11-24 22:03:24,642 INFO L158 Benchmark]: Boogie Procedure Inliner took 74.41ms. Allocated memory is still 161.5MB. Free memory was 110.1MB in the beginning and 107.3MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-24 22:03:24,642 INFO L158 Benchmark]: Boogie Preprocessor took 69.02ms. Allocated memory is still 161.5MB. Free memory was 107.3MB in the beginning and 103.1MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-24 22:03:24,642 INFO L158 Benchmark]: RCFGBuilder took 875.95ms. Allocated memory is still 161.5MB. Free memory was 103.1MB in the beginning and 51.4MB in the end (delta: 51.8MB). Peak memory consumption was 52.4MB. Max. memory is 16.1GB. [2023-11-24 22:03:24,643 INFO L158 Benchmark]: TraceAbstraction took 9845.05ms. Allocated memory was 161.5MB in the beginning and 295.7MB in the end (delta: 134.2MB). Free memory was 50.7MB in the beginning and 98.6MB in the end (delta: -47.9MB). Peak memory consumption was 89.4MB. Max. memory is 16.1GB. [2023-11-24 22:03:24,645 INFO L158 Benchmark]: Witness Printer took 4.53ms. Allocated memory is still 295.7MB. Free memory is still 98.6MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-24 22:03:24,647 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.32ms. Allocated memory is still 119.5MB. Free memory is still 87.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 726.54ms. Allocated memory is still 161.5MB. Free memory was 119.9MB in the beginning and 110.1MB in the end (delta: 9.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 74.41ms. Allocated memory is still 161.5MB. Free memory was 110.1MB in the beginning and 107.3MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 69.02ms. Allocated memory is still 161.5MB. Free memory was 107.3MB in the beginning and 103.1MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 875.95ms. Allocated memory is still 161.5MB. Free memory was 103.1MB in the beginning and 51.4MB in the end (delta: 51.8MB). Peak memory consumption was 52.4MB. Max. memory is 16.1GB. * TraceAbstraction took 9845.05ms. Allocated memory was 161.5MB in the beginning and 295.7MB in the end (delta: 134.2MB). Free memory was 50.7MB in the beginning and 98.6MB in the end (delta: -47.9MB). Peak memory consumption was 89.4MB. Max. memory is 16.1GB. * Witness Printer took 4.53ms. Allocated memory is still 295.7MB. Free memory is still 98.6MB. 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: 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: [L708] 0 int __unbuffered_cnt = 0; [L710] 0 int __unbuffered_p1_EAX = 0; [L712] 0 int __unbuffered_p1_EBX = 0; [L713] 0 _Bool main$tmp_guard0; [L714] 0 _Bool main$tmp_guard1; [L716] 0 int x = 0; [L718] 0 int y = 0; [L719] 0 _Bool y$flush_delayed; [L720] 0 int y$mem_tmp; [L721] 0 _Bool y$r_buff0_thd0; [L722] 0 _Bool y$r_buff0_thd1; [L723] 0 _Bool y$r_buff0_thd2; [L724] 0 _Bool y$r_buff1_thd0; [L725] 0 _Bool y$r_buff1_thd1; [L726] 0 _Bool y$r_buff1_thd2; [L727] 0 _Bool y$read_delayed; [L728] 0 int *y$read_delayed_var; [L729] 0 int y$w_buff0; [L730] 0 _Bool y$w_buff0_used; [L731] 0 int y$w_buff1; [L732] 0 _Bool y$w_buff1_used; [L733] 0 _Bool weak$$choice0; [L734] 0 _Bool weak$$choice2; [L810] 0 pthread_t t1717; [L811] FCALL, FORK 0 pthread_create(&t1717, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1717={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L812] 0 pthread_t t1718; [L813] FCALL, FORK 0 pthread_create(&t1718, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1717={5:0}, t1718={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L758] 2 y$w_buff1 = y$w_buff0 [L759] 2 y$w_buff0 = 2 [L760] 2 y$w_buff1_used = y$w_buff0_used [L761] 2 y$w_buff0_used = (_Bool)1 [L762] CALL 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L762] RET 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L763] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L764] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L765] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L766] 2 y$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L769] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L770] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L771] 2 y$flush_delayed = weak$$choice2 [L772] 2 y$mem_tmp = y [L773] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L774] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L775] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L776] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L777] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L778] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L779] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L780] 2 __unbuffered_p1_EAX = y [L781] 2 y = y$flush_delayed ? y$mem_tmp : y [L782] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L785] 2 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L738] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L741] 1 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L744] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L745] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L746] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L747] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L748] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L788] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L789] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L790] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L791] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L792] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=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=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L795] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=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=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L751] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L815] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1717={5:0}, t1718={3:0}, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L817] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L817] RET 0 assume_abort_if_not(main$tmp_guard0) [L819] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L820] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L821] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L822] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L823] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1717={5:0}, t1718={3:0}, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L826] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L827] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L828] 0 y$flush_delayed = weak$$choice2 [L829] 0 y$mem_tmp = y [L830] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L831] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L832] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L833] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L834] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L835] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L836] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L837] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0) [L838] 0 y = y$flush_delayed ? y$mem_tmp : y [L839] 0 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1717={5:0}, t1718={3:0}, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L841] 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=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L17] 0 __assert_fail ("0", "rfi007_tso.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] - 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: 808]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 811]: 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: 813]: 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 5 procedures, 59 locations, 10 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: 9.6s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 3.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 388 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 320 mSDsluCounter, 122 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 93 mSDsCounter, 35 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 839 IncrementalHoareTripleChecker+Invalid, 874 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 35 mSolverCounterUnsat, 29 mSDtfsCounter, 839 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 56 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=125occurred in iteration=8, InterpolantAutomatonStates: 56, 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.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 5.4s InterpolantComputationTime, 169 NumberOfCodeBlocks, 169 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 132 ConstructedInterpolants, 0 QuantifiedInterpolants, 1116 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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-24 22:03:24,695 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ce43a9a-00a6-41ee-bce8-4a7d9227c264/bin/uautomizer-verify-NlZe1sFDwI/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_3ce43a9a-00a6-41ee-bce8-4a7d9227c264/bin/uautomizer-verify-NlZe1sFDwI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ce43a9a-00a6-41ee-bce8-4a7d9227c264/bin/uautomizer-verify-NlZe1sFDwI/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ce43a9a-00a6-41ee-bce8-4a7d9227c264/bin/uautomizer-verify-NlZe1sFDwI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ce43a9a-00a6-41ee-bce8-4a7d9227c264/bin/uautomizer-verify-NlZe1sFDwI/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/rfi007_tso.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ce43a9a-00a6-41ee-bce8-4a7d9227c264/bin/uautomizer-verify-NlZe1sFDwI/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ce43a9a-00a6-41ee-bce8-4a7d9227c264/bin/uautomizer-verify-NlZe1sFDwI --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 62e921ac3b02bdecb866366797768eb8fcdb22a87147dc14adf7fddb42ab9cb2 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-24 22:03:27,476 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-24 22:03:27,557 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ce43a9a-00a6-41ee-bce8-4a7d9227c264/bin/uautomizer-verify-NlZe1sFDwI/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-11-24 22:03:27,563 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-24 22:03:27,564 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-24 22:03:27,607 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-24 22:03:27,608 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-24 22:03:27,608 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-24 22:03:27,609 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-24 22:03:27,610 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-24 22:03:27,611 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-24 22:03:27,611 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-24 22:03:27,616 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-24 22:03:27,622 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-24 22:03:27,622 INFO L153 SettingsManager]: * Use SBE=true [2023-11-24 22:03:27,623 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-24 22:03:27,625 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-24 22:03:27,626 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-24 22:03:27,626 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-24 22:03:27,627 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-24 22:03:27,628 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-24 22:03:27,629 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-24 22:03:27,629 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-24 22:03:27,630 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-24 22:03:27,630 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-24 22:03:27,631 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-24 22:03:27,631 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-24 22:03:27,632 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-24 22:03:27,632 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-24 22:03:27,633 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-24 22:03:27,635 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-24 22:03:27,635 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-24 22:03:27,636 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-24 22:03:27,636 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-24 22:03:27,636 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-24 22:03:27,637 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-24 22:03:27,638 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-24 22:03:27,638 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-24 22:03:27,639 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-24 22:03:27,639 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-24 22:03:27,639 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-24 22:03:27,639 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-24 22:03:27,641 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-24 22:03:27,641 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-24 22:03:27,642 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_3ce43a9a-00a6-41ee-bce8-4a7d9227c264/bin/uautomizer-verify-NlZe1sFDwI/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_3ce43a9a-00a6-41ee-bce8-4a7d9227c264/bin/uautomizer-verify-NlZe1sFDwI 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 -> 62e921ac3b02bdecb866366797768eb8fcdb22a87147dc14adf7fddb42ab9cb2 [2023-11-24 22:03:28,044 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-24 22:03:28,081 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-24 22:03:28,084 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-24 22:03:28,086 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-24 22:03:28,086 INFO L274 PluginConnector]: CDTParser initialized [2023-11-24 22:03:28,088 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ce43a9a-00a6-41ee-bce8-4a7d9227c264/bin/uautomizer-verify-NlZe1sFDwI/../../sv-benchmarks/c/pthread-wmm/rfi007_tso.i [2023-11-24 22:03:31,362 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-24 22:03:31,679 INFO L384 CDTParser]: Found 1 translation units. [2023-11-24 22:03:31,684 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ce43a9a-00a6-41ee-bce8-4a7d9227c264/sv-benchmarks/c/pthread-wmm/rfi007_tso.i [2023-11-24 22:03:31,720 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ce43a9a-00a6-41ee-bce8-4a7d9227c264/bin/uautomizer-verify-NlZe1sFDwI/data/54183f395/dfdf7fe2b62b4802b554e660a3443c47/FLAGd5ba34294 [2023-11-24 22:03:31,734 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ce43a9a-00a6-41ee-bce8-4a7d9227c264/bin/uautomizer-verify-NlZe1sFDwI/data/54183f395/dfdf7fe2b62b4802b554e660a3443c47 [2023-11-24 22:03:31,737 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-24 22:03:31,739 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-24 22:03:31,740 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-24 22:03:31,740 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-24 22:03:31,748 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-24 22:03:31,751 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 10:03:31" (1/1) ... [2023-11-24 22:03:31,752 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e7c6f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:03:31, skipping insertion in model container [2023-11-24 22:03:31,753 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 10:03:31" (1/1) ... [2023-11-24 22:03:31,835 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-24 22:03:32,370 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-24 22:03:32,406 INFO L202 MainTranslator]: Completed pre-run [2023-11-24 22:03:32,508 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-24 22:03:32,565 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-24 22:03:32,565 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-24 22:03:32,573 INFO L206 MainTranslator]: Completed translation [2023-11-24 22:03:32,574 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:03:32 WrapperNode [2023-11-24 22:03:32,574 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-24 22:03:32,575 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-24 22:03:32,575 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-24 22:03:32,575 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-24 22:03:32,583 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:03:32" (1/1) ... [2023-11-24 22:03:32,608 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:03:32" (1/1) ... [2023-11-24 22:03:32,645 INFO L138 Inliner]: procedures = 178, calls = 44, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 156 [2023-11-24 22:03:32,647 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-24 22:03:32,648 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-24 22:03:32,649 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-24 22:03:32,649 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-24 22:03:32,660 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:03:32" (1/1) ... [2023-11-24 22:03:32,660 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:03:32" (1/1) ... [2023-11-24 22:03:32,678 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:03:32" (1/1) ... [2023-11-24 22:03:32,706 INFO L175 MemorySlicer]: Split 4 memory accesses to 3 slices as follows [2, 1, 1]. 50 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 2 writes are split as follows [0, 1, 1]. [2023-11-24 22:03:32,706 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:03:32" (1/1) ... [2023-11-24 22:03:32,707 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:03:32" (1/1) ... [2023-11-24 22:03:32,727 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:03:32" (1/1) ... [2023-11-24 22:03:32,729 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:03:32" (1/1) ... [2023-11-24 22:03:32,732 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:03:32" (1/1) ... [2023-11-24 22:03:32,734 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:03:32" (1/1) ... [2023-11-24 22:03:32,738 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-24 22:03:32,739 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-24 22:03:32,739 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-24 22:03:32,740 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-24 22:03:32,748 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:03:32" (1/1) ... [2023-11-24 22:03:32,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-24 22:03:32,766 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ce43a9a-00a6-41ee-bce8-4a7d9227c264/bin/uautomizer-verify-NlZe1sFDwI/z3 [2023-11-24 22:03:32,780 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ce43a9a-00a6-41ee-bce8-4a7d9227c264/bin/uautomizer-verify-NlZe1sFDwI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-24 22:03:32,823 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ce43a9a-00a6-41ee-bce8-4a7d9227c264/bin/uautomizer-verify-NlZe1sFDwI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-24 22:03:32,834 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-24 22:03:32,834 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-24 22:03:32,834 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-24 22:03:32,834 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-24 22:03:32,835 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-11-24 22:03:32,835 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-11-24 22:03:32,835 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2023-11-24 22:03:32,837 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-24 22:03:32,837 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-11-24 22:03:32,837 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-11-24 22:03:32,838 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-24 22:03:32,838 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-24 22:03:32,838 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-24 22:03:32,838 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-24 22:03:32,838 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-24 22:03:32,839 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-24 22:03:32,839 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-24 22:03:32,842 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-24 22:03:33,071 INFO L241 CfgBuilder]: Building ICFG [2023-11-24 22:03:33,073 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-24 22:03:33,500 INFO L282 CfgBuilder]: Performing block encoding [2023-11-24 22:03:33,838 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-24 22:03:33,838 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-24 22:03:33,840 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 10:03:33 BoogieIcfgContainer [2023-11-24 22:03:33,841 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-24 22:03:33,846 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-24 22:03:33,846 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-24 22:03:33,850 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-24 22:03:33,850 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 10:03:31" (1/3) ... [2023-11-24 22:03:33,851 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@386ad737 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 10:03:33, skipping insertion in model container [2023-11-24 22:03:33,851 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:03:32" (2/3) ... [2023-11-24 22:03:33,853 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@386ad737 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 10:03:33, skipping insertion in model container [2023-11-24 22:03:33,853 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 10:03:33" (3/3) ... [2023-11-24 22:03:33,855 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi007_tso.i [2023-11-24 22:03:33,875 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-24 22:03:33,875 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2023-11-24 22:03:33,875 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-24 22:03:33,939 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-24 22:03:33,978 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 42 transitions, 92 flow [2023-11-24 22:03:34,006 INFO L124 PetriNetUnfolderBase]: 2/40 cut-off events. [2023-11-24 22:03:34,007 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-24 22:03:34,010 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47 conditions, 40 events. 2/40 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 65 event pairs, 0 based on Foata normal form. 0/31 useless extension candidates. Maximal degree in co-relation 37. Up to 2 conditions per place. [2023-11-24 22:03:34,010 INFO L82 GeneralOperation]: Start removeDead. Operand has 47 places, 42 transitions, 92 flow [2023-11-24 22:03:34,014 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 45 places, 40 transitions, 86 flow [2023-11-24 22:03:34,025 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-24 22:03:34,032 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;@6e4ebfd4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-24 22:03:34,032 INFO L358 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2023-11-24 22:03:34,035 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-24 22:03:34,036 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-11-24 22:03:34,036 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-24 22:03:34,037 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 22:03:34,037 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-24 22:03:34,038 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-24 22:03:34,043 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 22:03:34,044 INFO L85 PathProgramCache]: Analyzing trace with hash 12757, now seen corresponding path program 1 times [2023-11-24 22:03:34,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-24 22:03:34,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1034676317] [2023-11-24 22:03:34,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 22:03:34,061 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-24 22:03:34,061 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ce43a9a-00a6-41ee-bce8-4a7d9227c264/bin/uautomizer-verify-NlZe1sFDwI/mathsat [2023-11-24 22:03:34,064 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ce43a9a-00a6-41ee-bce8-4a7d9227c264/bin/uautomizer-verify-NlZe1sFDwI/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-24 22:03:34,070 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ce43a9a-00a6-41ee-bce8-4a7d9227c264/bin/uautomizer-verify-NlZe1sFDwI/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-24 22:03:34,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:03:34,237 INFO L262 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-24 22:03:34,242 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 22:03:34,310 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-24 22:03:34,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-24 22:03:34,329 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-24 22:03:34,330 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-24 22:03:34,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1034676317] [2023-11-24 22:03:34,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1034676317] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 22:03:34,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 22:03:34,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-24 22:03:34,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704131298] [2023-11-24 22:03:34,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 22:03:34,344 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 22:03:34,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-24 22:03:34,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 22:03:34,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 22:03:34,413 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 42 [2023-11-24 22:03:34,416 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 40 transitions, 86 flow. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:34,416 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 22:03:34,416 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 42 [2023-11-24 22:03:34,417 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 22:03:34,729 INFO L124 PetriNetUnfolderBase]: 230/516 cut-off events. [2023-11-24 22:03:34,730 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-11-24 22:03:34,739 INFO L83 FinitePrefix]: Finished finitePrefix Result has 928 conditions, 516 events. 230/516 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 3091 event pairs, 176 based on Foata normal form. 36/508 useless extension candidates. Maximal degree in co-relation 915. Up to 310 conditions per place. [2023-11-24 22:03:34,745 INFO L140 encePairwiseOnDemand]: 37/42 looper letters, 25 selfloop transitions, 2 changer transitions 0/43 dead transitions. [2023-11-24 22:03:34,745 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 43 transitions, 146 flow [2023-11-24 22:03:34,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 22:03:34,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 22:03:34,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 84 transitions. [2023-11-24 22:03:34,762 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2023-11-24 22:03:34,763 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 84 transitions. [2023-11-24 22:03:34,763 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 84 transitions. [2023-11-24 22:03:34,765 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 22:03:34,768 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 84 transitions. [2023-11-24 22:03:34,770 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:34,774 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:34,774 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:34,776 INFO L175 Difference]: Start difference. First operand has 45 places, 40 transitions, 86 flow. Second operand 3 states and 84 transitions. [2023-11-24 22:03:34,778 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 43 transitions, 146 flow [2023-11-24 22:03:34,780 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 43 transitions, 144 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 22:03:34,783 INFO L231 Difference]: Finished difference. Result has 43 places, 36 transitions, 80 flow [2023-11-24 22:03:34,785 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=80, PETRI_PLACES=43, PETRI_TRANSITIONS=36} [2023-11-24 22:03:34,789 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, -2 predicate places. [2023-11-24 22:03:34,789 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 36 transitions, 80 flow [2023-11-24 22:03:34,790 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:34,790 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 22:03:34,790 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-24 22:03:34,805 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ce43a9a-00a6-41ee-bce8-4a7d9227c264/bin/uautomizer-verify-NlZe1sFDwI/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-24 22:03:35,006 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ce43a9a-00a6-41ee-bce8-4a7d9227c264/bin/uautomizer-verify-NlZe1sFDwI/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-24 22:03:35,007 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-24 22:03:35,007 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 22:03:35,007 INFO L85 PathProgramCache]: Analyzing trace with hash 12758, now seen corresponding path program 1 times [2023-11-24 22:03:35,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-24 22:03:35,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [469929357] [2023-11-24 22:03:35,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 22:03:35,009 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-24 22:03:35,009 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ce43a9a-00a6-41ee-bce8-4a7d9227c264/bin/uautomizer-verify-NlZe1sFDwI/mathsat [2023-11-24 22:03:35,010 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ce43a9a-00a6-41ee-bce8-4a7d9227c264/bin/uautomizer-verify-NlZe1sFDwI/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-24 22:03:35,046 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ce43a9a-00a6-41ee-bce8-4a7d9227c264/bin/uautomizer-verify-NlZe1sFDwI/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-24 22:03:35,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:03:35,103 INFO L262 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-24 22:03:35,105 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 22:03:35,113 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-24 22:03:35,126 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-24 22:03:35,126 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-24 22:03:35,127 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-24 22:03:35,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [469929357] [2023-11-24 22:03:35,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [469929357] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 22:03:35,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 22:03:35,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-24 22:03:35,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020323898] [2023-11-24 22:03:35,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 22:03:35,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 22:03:35,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-24 22:03:35,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 22:03:35,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 22:03:35,163 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 42 [2023-11-24 22:03:35,164 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 36 transitions, 80 flow. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:35,164 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 22:03:35,164 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 42 [2023-11-24 22:03:35,164 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 22:03:35,397 INFO L124 PetriNetUnfolderBase]: 230/515 cut-off events. [2023-11-24 22:03:35,398 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2023-11-24 22:03:35,402 INFO L83 FinitePrefix]: Finished finitePrefix Result has 944 conditions, 515 events. 230/515 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 3076 event pairs, 176 based on Foata normal form. 1/472 useless extension candidates. Maximal degree in co-relation 933. Up to 309 conditions per place. [2023-11-24 22:03:35,409 INFO L140 encePairwiseOnDemand]: 39/42 looper letters, 24 selfloop transitions, 2 changer transitions 0/42 dead transitions. [2023-11-24 22:03:35,409 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 42 transitions, 144 flow [2023-11-24 22:03:35,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 22:03:35,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 22:03:35,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 84 transitions. [2023-11-24 22:03:35,414 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2023-11-24 22:03:35,415 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 84 transitions. [2023-11-24 22:03:35,415 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 84 transitions. [2023-11-24 22:03:35,421 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 22:03:35,422 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 84 transitions. [2023-11-24 22:03:35,424 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:35,426 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:35,427 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:35,427 INFO L175 Difference]: Start difference. First operand has 43 places, 36 transitions, 80 flow. Second operand 3 states and 84 transitions. [2023-11-24 22:03:35,427 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 42 transitions, 144 flow [2023-11-24 22:03:35,430 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 42 transitions, 140 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 22:03:35,433 INFO L231 Difference]: Finished difference. Result has 42 places, 35 transitions, 78 flow [2023-11-24 22:03:35,434 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=78, PETRI_PLACES=42, PETRI_TRANSITIONS=35} [2023-11-24 22:03:35,434 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, -3 predicate places. [2023-11-24 22:03:35,435 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 35 transitions, 78 flow [2023-11-24 22:03:35,435 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:35,435 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 22:03:35,435 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-24 22:03:35,446 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ce43a9a-00a6-41ee-bce8-4a7d9227c264/bin/uautomizer-verify-NlZe1sFDwI/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)] Forceful destruction successful, exit code 0 [2023-11-24 22:03:35,646 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ce43a9a-00a6-41ee-bce8-4a7d9227c264/bin/uautomizer-verify-NlZe1sFDwI/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-24 22:03:35,646 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-24 22:03:35,647 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 22:03:35,647 INFO L85 PathProgramCache]: Analyzing trace with hash 380396028, now seen corresponding path program 1 times [2023-11-24 22:03:35,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-24 22:03:35,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [939506063] [2023-11-24 22:03:35,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 22:03:35,648 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-24 22:03:35,648 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ce43a9a-00a6-41ee-bce8-4a7d9227c264/bin/uautomizer-verify-NlZe1sFDwI/mathsat [2023-11-24 22:03:35,651 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ce43a9a-00a6-41ee-bce8-4a7d9227c264/bin/uautomizer-verify-NlZe1sFDwI/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-24 22:03:35,733 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ce43a9a-00a6-41ee-bce8-4a7d9227c264/bin/uautomizer-verify-NlZe1sFDwI/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-24 22:03:35,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:03:35,795 INFO L262 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-24 22:03:35,797 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 22:03:35,809 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-24 22:03:35,816 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-24 22:03:35,816 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-24 22:03:35,816 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-24 22:03:35,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [939506063] [2023-11-24 22:03:35,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [939506063] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 22:03:35,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 22:03:35,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-24 22:03:35,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830572460] [2023-11-24 22:03:35,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 22:03:35,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 22:03:35,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-24 22:03:35,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 22:03:35,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 22:03:35,845 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 42 [2023-11-24 22:03:35,845 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 35 transitions, 78 flow. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:35,846 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 22:03:35,846 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 42 [2023-11-24 22:03:35,846 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 22:03:36,024 INFO L124 PetriNetUnfolderBase]: 232/507 cut-off events. [2023-11-24 22:03:36,025 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2023-11-24 22:03:36,026 INFO L83 FinitePrefix]: Finished finitePrefix Result has 941 conditions, 507 events. 232/507 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 2996 event pairs, 182 based on Foata normal form. 0/469 useless extension candidates. Maximal degree in co-relation 930. Up to 310 conditions per place. [2023-11-24 22:03:36,030 INFO L140 encePairwiseOnDemand]: 39/42 looper letters, 25 selfloop transitions, 2 changer transitions 0/41 dead transitions. [2023-11-24 22:03:36,030 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 41 transitions, 144 flow [2023-11-24 22:03:36,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 22:03:36,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 22:03:36,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 82 transitions. [2023-11-24 22:03:36,033 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6507936507936508 [2023-11-24 22:03:36,033 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 82 transitions. [2023-11-24 22:03:36,033 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 82 transitions. [2023-11-24 22:03:36,033 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 22:03:36,033 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 82 transitions. [2023-11-24 22:03:36,034 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:36,035 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:36,035 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:36,036 INFO L175 Difference]: Start difference. First operand has 42 places, 35 transitions, 78 flow. Second operand 3 states and 82 transitions. [2023-11-24 22:03:36,036 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 41 transitions, 144 flow [2023-11-24 22:03:36,037 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 41 transitions, 140 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 22:03:36,038 INFO L231 Difference]: Finished difference. Result has 41 places, 34 transitions, 76 flow [2023-11-24 22:03:36,039 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=76, PETRI_PLACES=41, PETRI_TRANSITIONS=34} [2023-11-24 22:03:36,039 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, -4 predicate places. [2023-11-24 22:03:36,040 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 34 transitions, 76 flow [2023-11-24 22:03:36,040 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:36,040 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 22:03:36,040 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-24 22:03:36,049 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ce43a9a-00a6-41ee-bce8-4a7d9227c264/bin/uautomizer-verify-NlZe1sFDwI/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)] Forceful destruction successful, exit code 0 [2023-11-24 22:03:36,243 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ce43a9a-00a6-41ee-bce8-4a7d9227c264/bin/uautomizer-verify-NlZe1sFDwI/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-24 22:03:36,243 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-24 22:03:36,244 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 22:03:36,244 INFO L85 PathProgramCache]: Analyzing trace with hash 380396029, now seen corresponding path program 1 times [2023-11-24 22:03:36,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-24 22:03:36,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1946930064] [2023-11-24 22:03:36,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 22:03:36,245 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-24 22:03:36,245 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ce43a9a-00a6-41ee-bce8-4a7d9227c264/bin/uautomizer-verify-NlZe1sFDwI/mathsat [2023-11-24 22:03:36,246 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ce43a9a-00a6-41ee-bce8-4a7d9227c264/bin/uautomizer-verify-NlZe1sFDwI/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-24 22:03:36,251 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ce43a9a-00a6-41ee-bce8-4a7d9227c264/bin/uautomizer-verify-NlZe1sFDwI/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-24 22:03:36,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:03:36,341 INFO L262 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-24 22:03:36,342 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 22:03:36,359 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-24 22:03:36,373 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-24 22:03:36,373 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-24 22:03:36,374 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-24 22:03:36,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1946930064] [2023-11-24 22:03:36,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1946930064] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 22:03:36,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 22:03:36,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-24 22:03:36,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762703637] [2023-11-24 22:03:36,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 22:03:36,375 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 22:03:36,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-24 22:03:36,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 22:03:36,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 22:03:36,405 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 42 [2023-11-24 22:03:36,405 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 34 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:36,406 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 22:03:36,406 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 42 [2023-11-24 22:03:36,406 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 22:03:36,577 INFO L124 PetriNetUnfolderBase]: 230/509 cut-off events. [2023-11-24 22:03:36,577 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2023-11-24 22:03:36,578 INFO L83 FinitePrefix]: Finished finitePrefix Result has 940 conditions, 509 events. 230/509 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 3055 event pairs, 114 based on Foata normal form. 3/476 useless extension candidates. Maximal degree in co-relation 930. Up to 305 conditions per place. [2023-11-24 22:03:36,582 INFO L140 encePairwiseOnDemand]: 39/42 looper letters, 24 selfloop transitions, 2 changer transitions 0/40 dead transitions. [2023-11-24 22:03:36,582 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 40 transitions, 140 flow [2023-11-24 22:03:36,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 22:03:36,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 22:03:36,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 84 transitions. [2023-11-24 22:03:36,587 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2023-11-24 22:03:36,591 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 84 transitions. [2023-11-24 22:03:36,591 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 84 transitions. [2023-11-24 22:03:36,591 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 22:03:36,591 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 84 transitions. [2023-11-24 22:03:36,593 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:36,594 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:36,594 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:36,595 INFO L175 Difference]: Start difference. First operand has 41 places, 34 transitions, 76 flow. Second operand 3 states and 84 transitions. [2023-11-24 22:03:36,595 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 40 transitions, 140 flow [2023-11-24 22:03:36,598 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 40 transitions, 136 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 22:03:36,599 INFO L231 Difference]: Finished difference. Result has 40 places, 33 transitions, 74 flow [2023-11-24 22:03:36,599 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=74, PETRI_PLACES=40, PETRI_TRANSITIONS=33} [2023-11-24 22:03:36,601 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, -5 predicate places. [2023-11-24 22:03:36,601 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 33 transitions, 74 flow [2023-11-24 22:03:36,602 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:36,602 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 22:03:36,602 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 22:03:36,611 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ce43a9a-00a6-41ee-bce8-4a7d9227c264/bin/uautomizer-verify-NlZe1sFDwI/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)] Forceful destruction successful, exit code 0 [2023-11-24 22:03:36,804 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ce43a9a-00a6-41ee-bce8-4a7d9227c264/bin/uautomizer-verify-NlZe1sFDwI/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-24 22:03:36,804 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-24 22:03:36,805 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 22:03:36,805 INFO L85 PathProgramCache]: Analyzing trace with hash -2040268854, now seen corresponding path program 1 times [2023-11-24 22:03:36,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-24 22:03:36,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1572395251] [2023-11-24 22:03:36,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 22:03:36,806 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-24 22:03:36,806 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ce43a9a-00a6-41ee-bce8-4a7d9227c264/bin/uautomizer-verify-NlZe1sFDwI/mathsat [2023-11-24 22:03:36,807 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ce43a9a-00a6-41ee-bce8-4a7d9227c264/bin/uautomizer-verify-NlZe1sFDwI/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-24 22:03:36,810 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ce43a9a-00a6-41ee-bce8-4a7d9227c264/bin/uautomizer-verify-NlZe1sFDwI/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-24 22:03:36,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:03:36,907 INFO L262 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-24 22:03:36,908 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 22:03:36,925 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-24 22:03:36,925 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-24 22:03:36,925 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-24 22:03:36,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1572395251] [2023-11-24 22:03:36,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1572395251] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 22:03:36,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 22:03:36,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-24 22:03:36,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650389510] [2023-11-24 22:03:36,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 22:03:36,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 22:03:36,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-24 22:03:36,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 22:03:36,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 22:03:36,928 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 42 [2023-11-24 22:03:36,929 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 33 transitions, 74 flow. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:36,929 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 22:03:36,929 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 42 [2023-11-24 22:03:36,929 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 22:03:37,049 INFO L124 PetriNetUnfolderBase]: 188/410 cut-off events. [2023-11-24 22:03:37,049 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2023-11-24 22:03:37,050 INFO L83 FinitePrefix]: Finished finitePrefix Result has 769 conditions, 410 events. 188/410 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 2229 event pairs, 20 based on Foata normal form. 0/405 useless extension candidates. Maximal degree in co-relation 759. Up to 277 conditions per place. [2023-11-24 22:03:37,053 INFO L140 encePairwiseOnDemand]: 39/42 looper letters, 24 selfloop transitions, 2 changer transitions 2/42 dead transitions. [2023-11-24 22:03:37,053 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 42 transitions, 150 flow [2023-11-24 22:03:37,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 22:03:37,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 22:03:37,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 89 transitions. [2023-11-24 22:03:37,055 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7063492063492064 [2023-11-24 22:03:37,055 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 89 transitions. [2023-11-24 22:03:37,055 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 89 transitions. [2023-11-24 22:03:37,055 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 22:03:37,056 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 89 transitions. [2023-11-24 22:03:37,056 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:37,057 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:37,057 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:37,058 INFO L175 Difference]: Start difference. First operand has 40 places, 33 transitions, 74 flow. Second operand 3 states and 89 transitions. [2023-11-24 22:03:37,058 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 42 transitions, 150 flow [2023-11-24 22:03:37,058 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 42 transitions, 144 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 22:03:37,059 INFO L231 Difference]: Finished difference. Result has 39 places, 31 transitions, 70 flow [2023-11-24 22:03:37,060 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=70, PETRI_PLACES=39, PETRI_TRANSITIONS=31} [2023-11-24 22:03:37,060 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, -6 predicate places. [2023-11-24 22:03:37,061 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 31 transitions, 70 flow [2023-11-24 22:03:37,061 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:37,061 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 22:03:37,061 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 22:03:37,069 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ce43a9a-00a6-41ee-bce8-4a7d9227c264/bin/uautomizer-verify-NlZe1sFDwI/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)] Forceful destruction successful, exit code 0 [2023-11-24 22:03:37,264 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ce43a9a-00a6-41ee-bce8-4a7d9227c264/bin/uautomizer-verify-NlZe1sFDwI/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-24 22:03:37,264 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-24 22:03:37,265 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 22:03:37,265 INFO L85 PathProgramCache]: Analyzing trace with hash 646110645, now seen corresponding path program 1 times [2023-11-24 22:03:37,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-24 22:03:37,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [435285244] [2023-11-24 22:03:37,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 22:03:37,266 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-24 22:03:37,266 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ce43a9a-00a6-41ee-bce8-4a7d9227c264/bin/uautomizer-verify-NlZe1sFDwI/mathsat [2023-11-24 22:03:37,267 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ce43a9a-00a6-41ee-bce8-4a7d9227c264/bin/uautomizer-verify-NlZe1sFDwI/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-24 22:03:37,270 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ce43a9a-00a6-41ee-bce8-4a7d9227c264/bin/uautomizer-verify-NlZe1sFDwI/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-24 22:03:37,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:03:37,391 INFO L262 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-24 22:03:37,393 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 22:03:37,437 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-24 22:03:37,437 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-24 22:03:37,437 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-24 22:03:37,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [435285244] [2023-11-24 22:03:37,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [435285244] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 22:03:37,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 22:03:37,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-24 22:03:37,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558157462] [2023-11-24 22:03:37,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 22:03:37,439 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-24 22:03:37,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-24 22:03:37,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-24 22:03:37,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-24 22:03:37,447 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 42 [2023-11-24 22:03:37,448 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 31 transitions, 70 flow. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:37,448 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 22:03:37,448 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 42 [2023-11-24 22:03:37,448 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 22:03:37,617 INFO L124 PetriNetUnfolderBase]: 235/506 cut-off events. [2023-11-24 22:03:37,617 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2023-11-24 22:03:37,619 INFO L83 FinitePrefix]: Finished finitePrefix Result has 974 conditions, 506 events. 235/506 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 2544 event pairs, 31 based on Foata normal form. 24/527 useless extension candidates. Maximal degree in co-relation 963. Up to 267 conditions per place. [2023-11-24 22:03:37,621 INFO L140 encePairwiseOnDemand]: 37/42 looper letters, 33 selfloop transitions, 4 changer transitions 1/49 dead transitions. [2023-11-24 22:03:37,622 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 49 transitions, 188 flow [2023-11-24 22:03:37,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-24 22:03:37,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-24 22:03:37,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 108 transitions. [2023-11-24 22:03:37,623 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6428571428571429 [2023-11-24 22:03:37,623 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 108 transitions. [2023-11-24 22:03:37,623 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 108 transitions. [2023-11-24 22:03:37,624 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 22:03:37,624 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 108 transitions. [2023-11-24 22:03:37,625 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:37,626 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 42.0) internal successors, (210), 5 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:37,626 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 42.0) internal successors, (210), 5 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:37,627 INFO L175 Difference]: Start difference. First operand has 39 places, 31 transitions, 70 flow. Second operand 4 states and 108 transitions. [2023-11-24 22:03:37,627 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 49 transitions, 188 flow [2023-11-24 22:03:37,629 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 49 transitions, 180 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 22:03:37,630 INFO L231 Difference]: Finished difference. Result has 41 places, 33 transitions, 92 flow [2023-11-24 22:03:37,631 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=92, PETRI_PLACES=41, PETRI_TRANSITIONS=33} [2023-11-24 22:03:37,634 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, -4 predicate places. [2023-11-24 22:03:37,634 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 33 transitions, 92 flow [2023-11-24 22:03:37,634 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:37,635 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 22:03:37,635 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 22:03:37,643 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ce43a9a-00a6-41ee-bce8-4a7d9227c264/bin/uautomizer-verify-NlZe1sFDwI/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)] Forceful destruction successful, exit code 0 [2023-11-24 22:03:37,837 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ce43a9a-00a6-41ee-bce8-4a7d9227c264/bin/uautomizer-verify-NlZe1sFDwI/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-24 22:03:37,838 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-24 22:03:37,838 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 22:03:37,838 INFO L85 PathProgramCache]: Analyzing trace with hash -1564649754, now seen corresponding path program 1 times [2023-11-24 22:03:37,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-24 22:03:37,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [769240164] [2023-11-24 22:03:37,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 22:03:37,839 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-24 22:03:37,839 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ce43a9a-00a6-41ee-bce8-4a7d9227c264/bin/uautomizer-verify-NlZe1sFDwI/mathsat [2023-11-24 22:03:37,843 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ce43a9a-00a6-41ee-bce8-4a7d9227c264/bin/uautomizer-verify-NlZe1sFDwI/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-24 22:03:37,845 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ce43a9a-00a6-41ee-bce8-4a7d9227c264/bin/uautomizer-verify-NlZe1sFDwI/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-24 22:03:37,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:03:37,948 INFO L262 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-24 22:03:37,950 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 22:03:37,990 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-24 22:03:37,990 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-24 22:03:37,990 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-24 22:03:37,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [769240164] [2023-11-24 22:03:37,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [769240164] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 22:03:37,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 22:03:37,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-24 22:03:37,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129060358] [2023-11-24 22:03:37,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 22:03:37,992 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-24 22:03:37,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-24 22:03:37,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-24 22:03:37,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-24 22:03:37,999 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 42 [2023-11-24 22:03:37,999 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 33 transitions, 92 flow. Second operand has 5 states, 5 states have (on average 19.6) internal successors, (98), 5 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:37,999 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 22:03:37,999 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 42 [2023-11-24 22:03:38,000 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 22:03:38,176 INFO L124 PetriNetUnfolderBase]: 105/234 cut-off events. [2023-11-24 22:03:38,177 INFO L125 PetriNetUnfolderBase]: For 64/64 co-relation queries the response was YES. [2023-11-24 22:03:38,177 INFO L83 FinitePrefix]: Finished finitePrefix Result has 536 conditions, 234 events. 105/234 cut-off events. For 64/64 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 821 event pairs, 21 based on Foata normal form. 16/247 useless extension candidates. Maximal degree in co-relation 523. Up to 86 conditions per place. [2023-11-24 22:03:38,179 INFO L140 encePairwiseOnDemand]: 37/42 looper letters, 28 selfloop transitions, 6 changer transitions 1/46 dead transitions. [2023-11-24 22:03:38,179 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 46 transitions, 193 flow [2023-11-24 22:03:38,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-24 22:03:38,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-24 22:03:38,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 122 transitions. [2023-11-24 22:03:38,181 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.580952380952381 [2023-11-24 22:03:38,182 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 122 transitions. [2023-11-24 22:03:38,182 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 122 transitions. [2023-11-24 22:03:38,182 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 22:03:38,182 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 122 transitions. [2023-11-24 22:03:38,183 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 24.4) internal successors, (122), 5 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-24 22:03:38,185 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 42.0) internal successors, (252), 6 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:38,186 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 42.0) internal successors, (252), 6 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:38,186 INFO L175 Difference]: Start difference. First operand has 41 places, 33 transitions, 92 flow. Second operand 5 states and 122 transitions. [2023-11-24 22:03:38,186 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 46 transitions, 193 flow [2023-11-24 22:03:38,188 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 46 transitions, 184 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-11-24 22:03:38,189 INFO L231 Difference]: Finished difference. Result has 45 places, 33 transitions, 108 flow [2023-11-24 22:03:38,190 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=85, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=108, PETRI_PLACES=45, PETRI_TRANSITIONS=33} [2023-11-24 22:03:38,190 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 0 predicate places. [2023-11-24 22:03:38,191 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 33 transitions, 108 flow [2023-11-24 22:03:38,191 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 5 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:38,191 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 22:03:38,191 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-24 22:03:38,203 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ce43a9a-00a6-41ee-bce8-4a7d9227c264/bin/uautomizer-verify-NlZe1sFDwI/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-24 22:03:38,394 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ce43a9a-00a6-41ee-bce8-4a7d9227c264/bin/uautomizer-verify-NlZe1sFDwI/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-24 22:03:38,395 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-24 22:03:38,395 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 22:03:38,395 INFO L85 PathProgramCache]: Analyzing trace with hash -897465066, now seen corresponding path program 1 times [2023-11-24 22:03:38,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-24 22:03:38,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1748402013] [2023-11-24 22:03:38,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 22:03:38,396 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-24 22:03:38,396 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ce43a9a-00a6-41ee-bce8-4a7d9227c264/bin/uautomizer-verify-NlZe1sFDwI/mathsat [2023-11-24 22:03:38,397 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ce43a9a-00a6-41ee-bce8-4a7d9227c264/bin/uautomizer-verify-NlZe1sFDwI/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-24 22:03:38,398 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ce43a9a-00a6-41ee-bce8-4a7d9227c264/bin/uautomizer-verify-NlZe1sFDwI/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-24 22:03:38,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:03:38,568 INFO L262 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-24 22:03:38,571 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 22:03:38,996 WARN L876 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~#t1717~0#1.base_39| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#t1718~0#1.base_45| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t1717~0#1.base_39|)) (= (_ bv0 1) (select (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t1717~0#1.base_39| (_ bv1 1)) |v_ULTIMATE.start_main_~#t1718~0#1.base_45|)) (= (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t1717~0#1.base_39| (_ bv0 1)) |v_ULTIMATE.start_main_~#t1718~0#1.base_45| (_ bv0 1)) |c_#valid|))) is different from true [2023-11-24 22:03:38,997 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-24 22:03:38,998 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-24 22:03:38,998 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-24 22:03:38,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1748402013] [2023-11-24 22:03:38,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1748402013] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 22:03:38,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 22:03:38,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-24 22:03:38,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763224798] [2023-11-24 22:03:38,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 22:03:39,000 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-24 22:03:39,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-24 22:03:39,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-24 22:03:39,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=8, Unknown=1, NotChecked=4, Total=20 [2023-11-24 22:03:39,024 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 42 [2023-11-24 22:03:39,024 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 33 transitions, 108 flow. Second operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:39,025 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 22:03:39,025 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 42 [2023-11-24 22:03:39,025 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 22:03:39,165 INFO L124 PetriNetUnfolderBase]: 64/173 cut-off events. [2023-11-24 22:03:39,165 INFO L125 PetriNetUnfolderBase]: For 46/46 co-relation queries the response was YES. [2023-11-24 22:03:39,166 INFO L83 FinitePrefix]: Finished finitePrefix Result has 376 conditions, 173 events. 64/173 cut-off events. For 46/46 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 603 event pairs, 55 based on Foata normal form. 4/170 useless extension candidates. Maximal degree in co-relation 360. Up to 115 conditions per place. [2023-11-24 22:03:39,167 INFO L140 encePairwiseOnDemand]: 36/42 looper letters, 21 selfloop transitions, 5 changer transitions 0/39 dead transitions. [2023-11-24 22:03:39,167 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 39 transitions, 172 flow [2023-11-24 22:03:39,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-24 22:03:39,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-24 22:03:39,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 92 transitions. [2023-11-24 22:03:39,169 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4380952380952381 [2023-11-24 22:03:39,169 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 92 transitions. [2023-11-24 22:03:39,169 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 92 transitions. [2023-11-24 22:03:39,169 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 22:03:39,169 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 92 transitions. [2023-11-24 22:03:39,170 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:39,171 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 42.0) internal successors, (252), 6 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:39,171 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 42.0) internal successors, (252), 6 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:39,171 INFO L175 Difference]: Start difference. First operand has 45 places, 33 transitions, 108 flow. Second operand 5 states and 92 transitions. [2023-11-24 22:03:39,171 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 39 transitions, 172 flow [2023-11-24 22:03:39,172 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 39 transitions, 144 flow, removed 5 selfloop flow, removed 6 redundant places. [2023-11-24 22:03:39,174 INFO L231 Difference]: Finished difference. Result has 44 places, 35 transitions, 103 flow [2023-11-24 22:03:39,174 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=103, PETRI_PLACES=44, PETRI_TRANSITIONS=35} [2023-11-24 22:03:39,175 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, -1 predicate places. [2023-11-24 22:03:39,175 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 35 transitions, 103 flow [2023-11-24 22:03:39,175 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:39,175 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 22:03:39,176 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-24 22:03:39,184 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ce43a9a-00a6-41ee-bce8-4a7d9227c264/bin/uautomizer-verify-NlZe1sFDwI/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-24 22:03:39,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ce43a9a-00a6-41ee-bce8-4a7d9227c264/bin/uautomizer-verify-NlZe1sFDwI/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-24 22:03:39,379 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-24 22:03:39,380 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 22:03:39,380 INFO L85 PathProgramCache]: Analyzing trace with hash -127361791, now seen corresponding path program 1 times [2023-11-24 22:03:39,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-24 22:03:39,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1995887477] [2023-11-24 22:03:39,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 22:03:39,381 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-24 22:03:39,381 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ce43a9a-00a6-41ee-bce8-4a7d9227c264/bin/uautomizer-verify-NlZe1sFDwI/mathsat [2023-11-24 22:03:39,382 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ce43a9a-00a6-41ee-bce8-4a7d9227c264/bin/uautomizer-verify-NlZe1sFDwI/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-24 22:03:39,383 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ce43a9a-00a6-41ee-bce8-4a7d9227c264/bin/uautomizer-verify-NlZe1sFDwI/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-24 22:03:39,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:03:39,519 INFO L262 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-24 22:03:39,521 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 22:03:39,638 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-24 22:03:39,638 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-24 22:03:39,638 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-24 22:03:39,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1995887477] [2023-11-24 22:03:39,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1995887477] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 22:03:39,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 22:03:39,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-24 22:03:39,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161476219] [2023-11-24 22:03:39,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 22:03:39,640 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-24 22:03:39,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-24 22:03:39,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-24 22:03:39,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-24 22:03:39,659 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 42 [2023-11-24 22:03:39,659 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 35 transitions, 103 flow. Second operand has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 6 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:39,659 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 22:03:39,659 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 42 [2023-11-24 22:03:39,660 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 22:03:39,953 INFO L124 PetriNetUnfolderBase]: 128/324 cut-off events. [2023-11-24 22:03:39,953 INFO L125 PetriNetUnfolderBase]: For 98/102 co-relation queries the response was YES. [2023-11-24 22:03:39,954 INFO L83 FinitePrefix]: Finished finitePrefix Result has 737 conditions, 324 events. 128/324 cut-off events. For 98/102 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1341 event pairs, 33 based on Foata normal form. 4/320 useless extension candidates. Maximal degree in co-relation 724. Up to 145 conditions per place. [2023-11-24 22:03:39,957 INFO L140 encePairwiseOnDemand]: 36/42 looper letters, 40 selfloop transitions, 5 changer transitions 0/59 dead transitions. [2023-11-24 22:03:39,957 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 59 transitions, 268 flow [2023-11-24 22:03:39,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 22:03:39,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-24 22:03:39,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 150 transitions. [2023-11-24 22:03:39,959 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5952380952380952 [2023-11-24 22:03:39,960 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 150 transitions. [2023-11-24 22:03:39,960 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 150 transitions. [2023-11-24 22:03:39,960 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 22:03:39,960 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 150 transitions. [2023-11-24 22:03:39,961 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 25.0) internal successors, (150), 6 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-24 22:03:39,962 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 42.0) internal successors, (294), 7 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:39,963 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 42.0) internal successors, (294), 7 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:39,963 INFO L175 Difference]: Start difference. First operand has 44 places, 35 transitions, 103 flow. Second operand 6 states and 150 transitions. [2023-11-24 22:03:39,963 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 59 transitions, 268 flow [2023-11-24 22:03:39,966 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 59 transitions, 256 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-24 22:03:39,967 INFO L231 Difference]: Finished difference. Result has 50 places, 39 transitions, 135 flow [2023-11-24 22:03:39,968 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=135, PETRI_PLACES=50, PETRI_TRANSITIONS=39} [2023-11-24 22:03:39,969 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 5 predicate places. [2023-11-24 22:03:39,969 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 39 transitions, 135 flow [2023-11-24 22:03:39,970 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 6 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:39,970 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 22:03:39,970 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-24 22:03:39,981 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ce43a9a-00a6-41ee-bce8-4a7d9227c264/bin/uautomizer-verify-NlZe1sFDwI/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)] Forceful destruction successful, exit code 0 [2023-11-24 22:03:40,176 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ce43a9a-00a6-41ee-bce8-4a7d9227c264/bin/uautomizer-verify-NlZe1sFDwI/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-24 22:03:40,177 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-24 22:03:40,177 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 22:03:40,177 INFO L85 PathProgramCache]: Analyzing trace with hash 1735317725, now seen corresponding path program 2 times [2023-11-24 22:03:40,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-24 22:03:40,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [926433288] [2023-11-24 22:03:40,178 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-24 22:03:40,178 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-24 22:03:40,179 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ce43a9a-00a6-41ee-bce8-4a7d9227c264/bin/uautomizer-verify-NlZe1sFDwI/mathsat [2023-11-24 22:03:40,180 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ce43a9a-00a6-41ee-bce8-4a7d9227c264/bin/uautomizer-verify-NlZe1sFDwI/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-24 22:03:40,183 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ce43a9a-00a6-41ee-bce8-4a7d9227c264/bin/uautomizer-verify-NlZe1sFDwI/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-24 22:03:40,318 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-24 22:03:40,318 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-24 22:03:40,324 INFO L262 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 13 conjunts are in the unsatisfiable core [2023-11-24 22:03:40,327 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 22:03:40,603 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-24 22:03:40,603 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-24 22:03:40,603 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-24 22:03:40,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [926433288] [2023-11-24 22:03:40,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [926433288] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 22:03:40,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 22:03:40,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-24 22:03:40,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132543769] [2023-11-24 22:03:40,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 22:03:40,605 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-24 22:03:40,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-24 22:03:40,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-24 22:03:40,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-24 22:03:40,620 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 42 [2023-11-24 22:03:40,621 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 39 transitions, 135 flow. Second operand has 8 states, 8 states have (on average 20.875) internal successors, (167), 8 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:40,621 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 22:03:40,621 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 42 [2023-11-24 22:03:40,622 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 22:03:40,929 INFO L124 PetriNetUnfolderBase]: 199/498 cut-off events. [2023-11-24 22:03:40,929 INFO L125 PetriNetUnfolderBase]: For 214/222 co-relation queries the response was YES. [2023-11-24 22:03:40,931 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1242 conditions, 498 events. 199/498 cut-off events. For 214/222 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2489 event pairs, 61 based on Foata normal form. 4/483 useless extension candidates. Maximal degree in co-relation 1226. Up to 196 conditions per place. [2023-11-24 22:03:40,934 INFO L140 encePairwiseOnDemand]: 34/42 looper letters, 36 selfloop transitions, 10 changer transitions 0/62 dead transitions. [2023-11-24 22:03:40,935 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 62 transitions, 313 flow [2023-11-24 22:03:40,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 22:03:40,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-24 22:03:40,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 151 transitions. [2023-11-24 22:03:40,936 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5992063492063492 [2023-11-24 22:03:40,937 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 151 transitions. [2023-11-24 22:03:40,937 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 151 transitions. [2023-11-24 22:03:40,937 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 22:03:40,937 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 151 transitions. [2023-11-24 22:03:40,938 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 25.166666666666668) internal successors, (151), 6 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-24 22:03:40,939 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 42.0) internal successors, (294), 7 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:40,939 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 42.0) internal successors, (294), 7 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:40,940 INFO L175 Difference]: Start difference. First operand has 50 places, 39 transitions, 135 flow. Second operand 6 states and 151 transitions. [2023-11-24 22:03:40,940 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 62 transitions, 313 flow [2023-11-24 22:03:40,943 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 62 transitions, 312 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-24 22:03:40,944 INFO L231 Difference]: Finished difference. Result has 57 places, 47 transitions, 225 flow [2023-11-24 22:03:40,945 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=225, PETRI_PLACES=57, PETRI_TRANSITIONS=47} [2023-11-24 22:03:40,946 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 12 predicate places. [2023-11-24 22:03:40,946 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 47 transitions, 225 flow [2023-11-24 22:03:40,946 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 20.875) internal successors, (167), 8 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:40,946 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 22:03:40,947 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-24 22:03:40,958 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ce43a9a-00a6-41ee-bce8-4a7d9227c264/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2023-11-24 22:03:41,158 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ce43a9a-00a6-41ee-bce8-4a7d9227c264/bin/uautomizer-verify-NlZe1sFDwI/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-24 22:03:41,159 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-24 22:03:41,159 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 22:03:41,159 INFO L85 PathProgramCache]: Analyzing trace with hash -789648887, now seen corresponding path program 3 times [2023-11-24 22:03:41,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-24 22:03:41,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [380622294] [2023-11-24 22:03:41,160 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-24 22:03:41,160 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-24 22:03:41,160 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ce43a9a-00a6-41ee-bce8-4a7d9227c264/bin/uautomizer-verify-NlZe1sFDwI/mathsat [2023-11-24 22:03:41,161 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ce43a9a-00a6-41ee-bce8-4a7d9227c264/bin/uautomizer-verify-NlZe1sFDwI/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-24 22:03:41,162 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ce43a9a-00a6-41ee-bce8-4a7d9227c264/bin/uautomizer-verify-NlZe1sFDwI/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-24 22:03:41,315 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-11-24 22:03:41,316 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-11-24 22:03:41,316 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-24 22:03:41,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-24 22:03:41,498 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-11-24 22:03:41,498 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-24 22:03:41,499 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK (9 of 10 remaining) [2023-11-24 22:03:41,501 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (8 of 10 remaining) [2023-11-24 22:03:41,501 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 10 remaining) [2023-11-24 22:03:41,502 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 10 remaining) [2023-11-24 22:03:41,502 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 10 remaining) [2023-11-24 22:03:41,502 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 10 remaining) [2023-11-24 22:03:41,502 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK (3 of 10 remaining) [2023-11-24 22:03:41,502 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 10 remaining) [2023-11-24 22:03:41,503 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 10 remaining) [2023-11-24 22:03:41,503 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 10 remaining) [2023-11-24 22:03:41,511 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ce43a9a-00a6-41ee-bce8-4a7d9227c264/bin/uautomizer-verify-NlZe1sFDwI/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)] Forceful destruction successful, exit code 0 [2023-11-24 22:03:41,707 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ce43a9a-00a6-41ee-bce8-4a7d9227c264/bin/uautomizer-verify-NlZe1sFDwI/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-24 22:03:41,707 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 22:03:41,713 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-24 22:03:41,713 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-24 22:03:41,779 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-24 22:03:41,781 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-24 22:03:41,794 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-24 22:03:41,805 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-24 22:03:41,821 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.11 10:03:41 BasicIcfg [2023-11-24 22:03:41,822 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-24 22:03:41,823 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-24 22:03:41,823 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-24 22:03:41,824 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-24 22:03:41,824 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 10:03:33" (3/4) ... [2023-11-24 22:03:41,826 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-24 22:03:41,827 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-24 22:03:41,832 INFO L158 Benchmark]: Toolchain (without parser) took 10089.69ms. Allocated memory was 81.8MB in the beginning and 144.7MB in the end (delta: 62.9MB). Free memory was 57.3MB in the beginning and 61.3MB in the end (delta: -4.0MB). Peak memory consumption was 62.1MB. Max. memory is 16.1GB. [2023-11-24 22:03:41,832 INFO L158 Benchmark]: CDTParser took 2.20ms. Allocated memory is still 60.8MB. Free memory was 37.7MB in the beginning and 37.6MB in the end (delta: 92.4kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-24 22:03:41,833 INFO L158 Benchmark]: CACSL2BoogieTranslator took 834.30ms. Allocated memory is still 81.8MB. Free memory was 57.1MB in the beginning and 50.9MB in the end (delta: 6.1MB). Peak memory consumption was 17.1MB. Max. memory is 16.1GB. [2023-11-24 22:03:41,833 INFO L158 Benchmark]: Boogie Procedure Inliner took 72.35ms. Allocated memory is still 81.8MB. Free memory was 50.9MB in the beginning and 47.9MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-24 22:03:41,833 INFO L158 Benchmark]: Boogie Preprocessor took 90.72ms. Allocated memory is still 81.8MB. Free memory was 47.9MB in the beginning and 44.4MB in the end (delta: 3.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-24 22:03:41,834 INFO L158 Benchmark]: RCFGBuilder took 1101.63ms. Allocated memory was 81.8MB in the beginning and 98.6MB in the end (delta: 16.8MB). Free memory was 44.3MB in the beginning and 73.1MB in the end (delta: -28.8MB). Peak memory consumption was 24.4MB. Max. memory is 16.1GB. [2023-11-24 22:03:41,835 INFO L158 Benchmark]: TraceAbstraction took 7977.00ms. Allocated memory was 98.6MB in the beginning and 144.7MB in the end (delta: 46.1MB). Free memory was 72.5MB in the beginning and 62.3MB in the end (delta: 10.2MB). Peak memory consumption was 56.2MB. Max. memory is 16.1GB. [2023-11-24 22:03:41,835 INFO L158 Benchmark]: Witness Printer took 4.52ms. Allocated memory is still 144.7MB. Free memory was 62.3MB in the beginning and 61.3MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-24 22:03:41,838 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 2.20ms. Allocated memory is still 60.8MB. Free memory was 37.7MB in the beginning and 37.6MB in the end (delta: 92.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 834.30ms. Allocated memory is still 81.8MB. Free memory was 57.1MB in the beginning and 50.9MB in the end (delta: 6.1MB). Peak memory consumption was 17.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 72.35ms. Allocated memory is still 81.8MB. Free memory was 50.9MB in the beginning and 47.9MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 90.72ms. Allocated memory is still 81.8MB. Free memory was 47.9MB in the beginning and 44.4MB in the end (delta: 3.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1101.63ms. Allocated memory was 81.8MB in the beginning and 98.6MB in the end (delta: 16.8MB). Free memory was 44.3MB in the beginning and 73.1MB in the end (delta: -28.8MB). Peak memory consumption was 24.4MB. Max. memory is 16.1GB. * TraceAbstraction took 7977.00ms. Allocated memory was 98.6MB in the beginning and 144.7MB in the end (delta: 46.1MB). Free memory was 72.5MB in the beginning and 62.3MB in the end (delta: 10.2MB). Peak memory consumption was 56.2MB. Max. memory is 16.1GB. * Witness Printer took 4.52ms. Allocated memory is still 144.7MB. Free memory was 62.3MB in the beginning and 61.3MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: 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: [L708] 0 int __unbuffered_cnt = 0; [L710] 0 int __unbuffered_p1_EAX = 0; [L712] 0 int __unbuffered_p1_EBX = 0; [L713] 0 _Bool main$tmp_guard0; [L714] 0 _Bool main$tmp_guard1; [L716] 0 int x = 0; [L718] 0 int y = 0; [L719] 0 _Bool y$flush_delayed; [L720] 0 int y$mem_tmp; [L721] 0 _Bool y$r_buff0_thd0; [L722] 0 _Bool y$r_buff0_thd1; [L723] 0 _Bool y$r_buff0_thd2; [L724] 0 _Bool y$r_buff1_thd0; [L725] 0 _Bool y$r_buff1_thd1; [L726] 0 _Bool y$r_buff1_thd2; [L727] 0 _Bool y$read_delayed; [L728] 0 int *y$read_delayed_var; [L729] 0 int y$w_buff0; [L730] 0 _Bool y$w_buff0_used; [L731] 0 int y$w_buff1; [L732] 0 _Bool y$w_buff1_used; [L733] 0 _Bool weak$$choice0; [L734] 0 _Bool weak$$choice2; [L810] 0 pthread_t t1717; [L811] FCALL, FORK 0 pthread_create(&t1717, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1717={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L812] 0 pthread_t t1718; [L813] FCALL, FORK 0 pthread_create(&t1718, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1717={5:0}, t1718={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L758] 2 y$w_buff1 = y$w_buff0 [L759] 2 y$w_buff0 = 2 [L760] 2 y$w_buff1_used = y$w_buff0_used [L761] 2 y$w_buff0_used = (_Bool)1 [L762] CALL 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L762] RET 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L763] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L764] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L765] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L766] 2 y$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L769] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L770] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L771] 2 y$flush_delayed = weak$$choice2 [L772] 2 y$mem_tmp = y [L773] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L774] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L775] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L776] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L777] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L778] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L779] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L780] 2 __unbuffered_p1_EAX = y [L781] 2 y = y$flush_delayed ? y$mem_tmp : y [L782] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=2, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L785] 2 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=2, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L738] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=2, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L741] 1 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=2, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L744] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L745] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L746] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L747] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L748] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=2, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L788] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L789] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L790] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L791] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L792] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=2, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L751] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=2, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L795] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=2, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L815] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1717={5:0}, t1718={3:0}, weak$$choice2=2, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L817] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L817] RET 0 assume_abort_if_not(main$tmp_guard0) [L819] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L820] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L821] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L822] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L823] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1717={5:0}, t1718={3:0}, weak$$choice2=2, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L826] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L827] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L828] 0 y$flush_delayed = weak$$choice2 [L829] 0 y$mem_tmp = y [L830] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L831] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L832] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L833] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L834] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L835] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L836] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L837] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0) [L838] 0 y = y$flush_delayed ? y$mem_tmp : y [L839] 0 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1717={5:0}, t1718={3:0}, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L841] 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=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L17] 0 __assert_fail ("0", "rfi007_tso.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] - 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: 808]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 813]: 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: 811]: 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 5 procedures, 59 locations, 10 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: 7.7s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 2.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 274 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 228 mSDsluCounter, 48 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 36 IncrementalHoareTripleChecker+Unchecked, 34 mSDsCounter, 28 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 651 IncrementalHoareTripleChecker+Invalid, 715 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 28 mSolverCounterUnsat, 14 mSDtfsCounter, 651 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 133 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=225occurred in iteration=10, InterpolantAutomatonStates: 41, 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.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 161 NumberOfCodeBlocks, 161 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 125 ConstructedInterpolants, 1 QuantifiedInterpolants, 946 SizeOfPredicates, 8 NumberOfNonLiveVariables, 967 ConjunctsInSsa, 55 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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-24 22:03:41,877 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ce43a9a-00a6-41ee-bce8-4a7d9227c264/bin/uautomizer-verify-NlZe1sFDwI/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