./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/safe001_power.opt_pso.oepc_pso.opt_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65231864-f43e-4150-9960-204c98c4fb59/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65231864-f43e-4150-9960-204c98c4fb59/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65231864-f43e-4150-9960-204c98c4fb59/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65231864-f43e-4150-9960-204c98c4fb59/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe001_power.opt_pso.oepc_pso.opt_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65231864-f43e-4150-9960-204c98c4fb59/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65231864-f43e-4150-9960-204c98c4fb59/bin/uautomizer-verify-BQ2R08f2Ya --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a843579fcb7bb5d5833d499f834986a668bfbdfa4c59a86e5d344f532fcebd9f --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-28 23:34:36,009 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-28 23:34:36,074 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65231864-f43e-4150-9960-204c98c4fb59/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-28 23:34:36,078 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-28 23:34:36,078 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-28 23:34:36,101 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-28 23:34:36,102 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-28 23:34:36,102 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-28 23:34:36,103 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-28 23:34:36,104 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-28 23:34:36,104 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-28 23:34:36,105 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-28 23:34:36,106 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-28 23:34:36,106 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-28 23:34:36,107 INFO L153 SettingsManager]: * Use SBE=true [2023-11-28 23:34:36,107 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-28 23:34:36,108 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-28 23:34:36,108 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-28 23:34:36,109 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-28 23:34:36,109 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-28 23:34:36,110 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-28 23:34:36,113 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-28 23:34:36,113 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-28 23:34:36,114 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-28 23:34:36,114 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-28 23:34:36,114 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-28 23:34:36,114 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-28 23:34:36,115 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-28 23:34:36,115 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-28 23:34:36,116 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-28 23:34:36,116 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-28 23:34:36,117 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-28 23:34:36,117 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-28 23:34:36,117 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-28 23:34:36,118 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-28 23:34:36,118 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-28 23:34:36,118 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-28 23:34:36,119 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-28 23:34:36,119 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-28 23:34:36,119 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-28 23:34:36,119 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-28 23:34:36,119 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_65231864-f43e-4150-9960-204c98c4fb59/bin/uautomizer-verify-BQ2R08f2Ya/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65231864-f43e-4150-9960-204c98c4fb59/bin/uautomizer-verify-BQ2R08f2Ya Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a843579fcb7bb5d5833d499f834986a668bfbdfa4c59a86e5d344f532fcebd9f [2023-11-28 23:34:36,344 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-28 23:34:36,364 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-28 23:34:36,366 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-28 23:34:36,367 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-28 23:34:36,367 INFO L274 PluginConnector]: CDTParser initialized [2023-11-28 23:34:36,369 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65231864-f43e-4150-9960-204c98c4fb59/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/pthread-wmm/safe001_power.opt_pso.oepc_pso.opt_rmo.opt.i [2023-11-28 23:34:39,172 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-28 23:34:39,383 INFO L384 CDTParser]: Found 1 translation units. [2023-11-28 23:34:39,384 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65231864-f43e-4150-9960-204c98c4fb59/sv-benchmarks/c/pthread-wmm/safe001_power.opt_pso.oepc_pso.opt_rmo.opt.i [2023-11-28 23:34:39,401 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65231864-f43e-4150-9960-204c98c4fb59/bin/uautomizer-verify-BQ2R08f2Ya/data/57dbd6720/062d9baf04fd48aa9a5b90c94f767153/FLAG0d3e54178 [2023-11-28 23:34:39,416 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65231864-f43e-4150-9960-204c98c4fb59/bin/uautomizer-verify-BQ2R08f2Ya/data/57dbd6720/062d9baf04fd48aa9a5b90c94f767153 [2023-11-28 23:34:39,418 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-28 23:34:39,420 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-28 23:34:39,421 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-28 23:34:39,421 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-28 23:34:39,426 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-28 23:34:39,427 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:34:39" (1/1) ... [2023-11-28 23:34:39,428 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f57645b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:34:39, skipping insertion in model container [2023-11-28 23:34:39,428 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:34:39" (1/1) ... [2023-11-28 23:34:39,478 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-28 23:34:39,796 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-28 23:34:39,808 INFO L202 MainTranslator]: Completed pre-run [2023-11-28 23:34:39,866 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-28 23:34:39,897 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-28 23:34:39,897 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-28 23:34:39,905 INFO L206 MainTranslator]: Completed translation [2023-11-28 23:34:39,905 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:34:39 WrapperNode [2023-11-28 23:34:39,906 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-28 23:34:39,907 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-28 23:34:39,907 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-28 23:34:39,907 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-28 23:34:39,915 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:34:39" (1/1) ... [2023-11-28 23:34:39,933 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:34:39" (1/1) ... [2023-11-28 23:34:39,964 INFO L138 Inliner]: procedures = 176, calls = 55, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 149 [2023-11-28 23:34:39,964 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-28 23:34:39,965 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-28 23:34:39,965 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-28 23:34:39,965 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-28 23:34:39,978 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:34:39" (1/1) ... [2023-11-28 23:34:39,978 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:34:39" (1/1) ... [2023-11-28 23:34:39,982 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:34:39" (1/1) ... [2023-11-28 23:34:40,002 INFO L175 MemorySlicer]: Split 5 memory accesses to 4 slices as follows [2, 1, 1, 1]. 40 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 3 writes are split as follows [0, 1, 1, 1]. [2023-11-28 23:34:40,003 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:34:39" (1/1) ... [2023-11-28 23:34:40,003 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:34:39" (1/1) ... [2023-11-28 23:34:40,013 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:34:39" (1/1) ... [2023-11-28 23:34:40,016 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:34:39" (1/1) ... [2023-11-28 23:34:40,018 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:34:39" (1/1) ... [2023-11-28 23:34:40,020 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:34:39" (1/1) ... [2023-11-28 23:34:40,025 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-28 23:34:40,026 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-28 23:34:40,026 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-28 23:34:40,027 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-28 23:34:40,027 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:34:39" (1/1) ... [2023-11-28 23:34:40,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-28 23:34:40,050 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65231864-f43e-4150-9960-204c98c4fb59/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 23:34:40,064 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65231864-f43e-4150-9960-204c98c4fb59/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-28 23:34:40,067 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65231864-f43e-4150-9960-204c98c4fb59/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-28 23:34:40,100 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-28 23:34:40,101 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-28 23:34:40,101 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-28 23:34:40,101 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-11-28 23:34:40,101 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-28 23:34:40,101 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-28 23:34:40,102 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-28 23:34:40,102 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-28 23:34:40,102 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-28 23:34:40,102 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-28 23:34:40,102 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-28 23:34:40,102 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-28 23:34:40,103 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-28 23:34:40,103 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-28 23:34:40,103 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-28 23:34:40,103 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-28 23:34:40,103 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-28 23:34:40,103 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-11-28 23:34:40,103 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-28 23:34:40,104 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-28 23:34:40,104 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-28 23:34:40,105 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-28 23:34:40,248 INFO L241 CfgBuilder]: Building ICFG [2023-11-28 23:34:40,249 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-28 23:34:40,532 INFO L282 CfgBuilder]: Performing block encoding [2023-11-28 23:34:40,745 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-28 23:34:40,745 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-28 23:34:40,746 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:34:40 BoogieIcfgContainer [2023-11-28 23:34:40,746 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-28 23:34:40,749 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-28 23:34:40,749 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-28 23:34:40,753 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-28 23:34:40,753 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 11:34:39" (1/3) ... [2023-11-28 23:34:40,754 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39cf790d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 11:34:40, skipping insertion in model container [2023-11-28 23:34:40,754 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:34:39" (2/3) ... [2023-11-28 23:34:40,754 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39cf790d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 11:34:40, skipping insertion in model container [2023-11-28 23:34:40,754 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:34:40" (3/3) ... [2023-11-28 23:34:40,756 INFO L112 eAbstractionObserver]: Analyzing ICFG safe001_power.opt_pso.oepc_pso.opt_rmo.opt.i [2023-11-28 23:34:40,776 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-28 23:34:40,776 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2023-11-28 23:34:40,776 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-28 23:34:40,829 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-28 23:34:40,866 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 61 places, 53 transitions, 118 flow [2023-11-28 23:34:40,900 INFO L124 PetriNetUnfolderBase]: 2/50 cut-off events. [2023-11-28 23:34:40,901 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-28 23:34:40,904 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60 conditions, 50 events. 2/50 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 94 event pairs, 0 based on Foata normal form. 0/39 useless extension candidates. Maximal degree in co-relation 49. Up to 2 conditions per place. [2023-11-28 23:34:40,904 INFO L82 GeneralOperation]: Start removeDead. Operand has 61 places, 53 transitions, 118 flow [2023-11-28 23:34:40,909 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 58 places, 50 transitions, 109 flow [2023-11-28 23:34:40,920 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-28 23:34:40,927 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;@a9830fa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-28 23:34:40,927 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2023-11-28 23:34:40,931 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-28 23:34:40,931 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-11-28 23:34:40,931 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-28 23:34:40,932 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 23:34:40,932 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-28 23:34:40,933 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-28 23:34:40,939 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:34:40,939 INFO L85 PathProgramCache]: Analyzing trace with hash 12275, now seen corresponding path program 1 times [2023-11-28 23:34:40,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:34:40,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171474158] [2023-11-28 23:34:40,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:34:40,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:34:41,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:34:41,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 23:34:41,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 23:34:41,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171474158] [2023-11-28 23:34:41,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171474158] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:34:41,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:34:41,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-28 23:34:41,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497779344] [2023-11-28 23:34:41,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:34:41,212 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 23:34:41,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 23:34:41,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 23:34:41,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 23:34:41,263 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 53 [2023-11-28 23:34:41,266 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 50 transitions, 109 flow. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:34:41,267 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 23:34:41,267 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 53 [2023-11-28 23:34:41,268 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 23:34:41,718 INFO L124 PetriNetUnfolderBase]: 868/1664 cut-off events. [2023-11-28 23:34:41,718 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2023-11-28 23:34:41,726 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3018 conditions, 1664 events. 868/1664 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 11209 event pairs, 676 based on Foata normal form. 90/1592 useless extension candidates. Maximal degree in co-relation 3004. Up to 1029 conditions per place. [2023-11-28 23:34:41,742 INFO L140 encePairwiseOnDemand]: 48/53 looper letters, 29 selfloop transitions, 2 changer transitions 0/54 dead transitions. [2023-11-28 23:34:41,742 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 54 transitions, 179 flow [2023-11-28 23:34:41,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 23:34:41,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-28 23:34:41,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 112 transitions. [2023-11-28 23:34:41,755 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7044025157232704 [2023-11-28 23:34:41,756 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 112 transitions. [2023-11-28 23:34:41,756 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 112 transitions. [2023-11-28 23:34:41,757 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 23:34:41,760 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 112 transitions. [2023-11-28 23:34:41,762 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 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-28 23:34:41,766 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 53.0) internal successors, (212), 4 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:34:41,766 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 53.0) internal successors, (212), 4 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:34:41,768 INFO L175 Difference]: Start difference. First operand has 58 places, 50 transitions, 109 flow. Second operand 3 states and 112 transitions. [2023-11-28 23:34:41,769 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 54 transitions, 179 flow [2023-11-28 23:34:41,773 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 54 transitions, 176 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-28 23:34:41,776 INFO L231 Difference]: Finished difference. Result has 55 places, 46 transitions, 102 flow [2023-11-28 23:34:41,778 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=102, PETRI_PLACES=55, PETRI_TRANSITIONS=46} [2023-11-28 23:34:41,781 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, -3 predicate places. [2023-11-28 23:34:41,782 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 46 transitions, 102 flow [2023-11-28 23:34:41,782 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:34:41,782 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 23:34:41,782 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-28 23:34:41,783 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-28 23:34:41,783 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-28 23:34:41,783 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:34:41,784 INFO L85 PathProgramCache]: Analyzing trace with hash 12276, now seen corresponding path program 1 times [2023-11-28 23:34:41,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:34:41,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567528228] [2023-11-28 23:34:41,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:34:41,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:34:41,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:34:41,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 23:34:41,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 23:34:41,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567528228] [2023-11-28 23:34:41,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567528228] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:34:41,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:34:41,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-28 23:34:41,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694424374] [2023-11-28 23:34:41,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:34:41,885 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 23:34:41,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 23:34:41,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 23:34:41,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 23:34:41,901 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 53 [2023-11-28 23:34:41,901 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 46 transitions, 102 flow. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:34:41,901 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 23:34:41,902 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 53 [2023-11-28 23:34:41,902 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 23:34:42,220 INFO L124 PetriNetUnfolderBase]: 868/1663 cut-off events. [2023-11-28 23:34:42,220 INFO L125 PetriNetUnfolderBase]: For 45/45 co-relation queries the response was YES. [2023-11-28 23:34:42,225 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3060 conditions, 1663 events. 868/1663 cut-off events. For 45/45 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 11165 event pairs, 676 based on Foata normal form. 1/1502 useless extension candidates. Maximal degree in co-relation 3049. Up to 1028 conditions per place. [2023-11-28 23:34:42,237 INFO L140 encePairwiseOnDemand]: 50/53 looper letters, 28 selfloop transitions, 2 changer transitions 0/53 dead transitions. [2023-11-28 23:34:42,237 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 53 transitions, 176 flow [2023-11-28 23:34:42,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 23:34:42,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-28 23:34:42,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 112 transitions. [2023-11-28 23:34:42,239 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7044025157232704 [2023-11-28 23:34:42,240 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 112 transitions. [2023-11-28 23:34:42,240 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 112 transitions. [2023-11-28 23:34:42,240 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 23:34:42,240 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 112 transitions. [2023-11-28 23:34:42,242 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 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-28 23:34:42,243 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 53.0) internal successors, (212), 4 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:34:42,243 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 53.0) internal successors, (212), 4 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:34:42,244 INFO L175 Difference]: Start difference. First operand has 55 places, 46 transitions, 102 flow. Second operand 3 states and 112 transitions. [2023-11-28 23:34:42,244 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 53 transitions, 176 flow [2023-11-28 23:34:42,247 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 53 transitions, 172 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-28 23:34:42,248 INFO L231 Difference]: Finished difference. Result has 54 places, 45 transitions, 100 flow [2023-11-28 23:34:42,248 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=100, PETRI_PLACES=54, PETRI_TRANSITIONS=45} [2023-11-28 23:34:42,249 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, -4 predicate places. [2023-11-28 23:34:42,249 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 45 transitions, 100 flow [2023-11-28 23:34:42,250 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:34:42,250 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 23:34:42,250 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-28 23:34:42,250 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-28 23:34:42,251 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-28 23:34:42,251 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:34:42,252 INFO L85 PathProgramCache]: Analyzing trace with hash 366055635, now seen corresponding path program 1 times [2023-11-28 23:34:42,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:34:42,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409975724] [2023-11-28 23:34:42,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:34:42,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:34:42,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:34:42,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 23:34:42,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 23:34:42,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409975724] [2023-11-28 23:34:42,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409975724] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:34:42,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:34:42,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-28 23:34:42,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156965988] [2023-11-28 23:34:42,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:34:42,328 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 23:34:42,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 23:34:42,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 23:34:42,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 23:34:42,343 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 53 [2023-11-28 23:34:42,344 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 45 transitions, 100 flow. Second operand has 3 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-28 23:34:42,344 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 23:34:42,344 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 53 [2023-11-28 23:34:42,344 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 23:34:42,651 INFO L124 PetriNetUnfolderBase]: 870/1662 cut-off events. [2023-11-28 23:34:42,651 INFO L125 PetriNetUnfolderBase]: For 45/45 co-relation queries the response was YES. [2023-11-28 23:34:42,656 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3064 conditions, 1662 events. 870/1662 cut-off events. For 45/45 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 11190 event pairs, 504 based on Foata normal form. 0/1507 useless extension candidates. Maximal degree in co-relation 3053. Up to 1029 conditions per place. [2023-11-28 23:34:42,667 INFO L140 encePairwiseOnDemand]: 50/53 looper letters, 29 selfloop transitions, 2 changer transitions 0/52 dead transitions. [2023-11-28 23:34:42,667 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 52 transitions, 176 flow [2023-11-28 23:34:42,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 23:34:42,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-28 23:34:42,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 110 transitions. [2023-11-28 23:34:42,669 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6918238993710691 [2023-11-28 23:34:42,669 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 110 transitions. [2023-11-28 23:34:42,669 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 110 transitions. [2023-11-28 23:34:42,670 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 23:34:42,670 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 110 transitions. [2023-11-28 23:34:42,671 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:34:42,672 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 53.0) internal successors, (212), 4 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:34:42,672 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 53.0) internal successors, (212), 4 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:34:42,672 INFO L175 Difference]: Start difference. First operand has 54 places, 45 transitions, 100 flow. Second operand 3 states and 110 transitions. [2023-11-28 23:34:42,672 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 52 transitions, 176 flow [2023-11-28 23:34:42,674 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 52 transitions, 172 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-28 23:34:42,675 INFO L231 Difference]: Finished difference. Result has 53 places, 44 transitions, 98 flow [2023-11-28 23:34:42,676 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=98, PETRI_PLACES=53, PETRI_TRANSITIONS=44} [2023-11-28 23:34:42,676 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, -5 predicate places. [2023-11-28 23:34:42,699 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 44 transitions, 98 flow [2023-11-28 23:34:42,699 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 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-28 23:34:42,699 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 23:34:42,700 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-28 23:34:42,700 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-28 23:34:42,700 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-28 23:34:42,701 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:34:42,701 INFO L85 PathProgramCache]: Analyzing trace with hash 366055636, now seen corresponding path program 1 times [2023-11-28 23:34:42,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:34:42,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647884835] [2023-11-28 23:34:42,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:34:42,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:34:42,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:34:42,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 23:34:42,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 23:34:42,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647884835] [2023-11-28 23:34:42,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647884835] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:34:42,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:34:42,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-28 23:34:42,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099862157] [2023-11-28 23:34:42,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:34:42,782 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 23:34:42,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 23:34:42,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 23:34:42,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 23:34:42,797 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 53 [2023-11-28 23:34:42,797 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 44 transitions, 98 flow. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:34:42,798 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 23:34:42,798 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 53 [2023-11-28 23:34:42,798 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 23:34:43,151 INFO L124 PetriNetUnfolderBase]: 868/1641 cut-off events. [2023-11-28 23:34:43,151 INFO L125 PetriNetUnfolderBase]: For 47/47 co-relation queries the response was YES. [2023-11-28 23:34:43,156 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3040 conditions, 1641 events. 868/1641 cut-off events. For 47/47 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 10944 event pairs, 689 based on Foata normal form. 3/1490 useless extension candidates. Maximal degree in co-relation 3030. Up to 1024 conditions per place. [2023-11-28 23:34:43,168 INFO L140 encePairwiseOnDemand]: 50/53 looper letters, 28 selfloop transitions, 2 changer transitions 0/51 dead transitions. [2023-11-28 23:34:43,168 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 51 transitions, 172 flow [2023-11-28 23:34:43,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 23:34:43,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-28 23:34:43,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 112 transitions. [2023-11-28 23:34:43,170 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7044025157232704 [2023-11-28 23:34:43,170 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 112 transitions. [2023-11-28 23:34:43,170 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 112 transitions. [2023-11-28 23:34:43,170 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 23:34:43,171 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 112 transitions. [2023-11-28 23:34:43,171 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 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-28 23:34:43,172 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 53.0) internal successors, (212), 4 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:34:43,173 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 53.0) internal successors, (212), 4 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:34:43,173 INFO L175 Difference]: Start difference. First operand has 53 places, 44 transitions, 98 flow. Second operand 3 states and 112 transitions. [2023-11-28 23:34:43,173 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 51 transitions, 172 flow [2023-11-28 23:34:43,175 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 51 transitions, 168 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-28 23:34:43,176 INFO L231 Difference]: Finished difference. Result has 52 places, 43 transitions, 96 flow [2023-11-28 23:34:43,177 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=96, PETRI_PLACES=52, PETRI_TRANSITIONS=43} [2023-11-28 23:34:43,177 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, -6 predicate places. [2023-11-28 23:34:43,178 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 43 transitions, 96 flow [2023-11-28 23:34:43,178 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:34:43,178 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 23:34:43,178 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 23:34:43,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-28 23:34:43,179 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-28 23:34:43,179 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:34:43,179 INFO L85 PathProgramCache]: Analyzing trace with hash 241827682, now seen corresponding path program 1 times [2023-11-28 23:34:43,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:34:43,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579849068] [2023-11-28 23:34:43,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:34:43,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:34:43,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:34:43,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 23:34:43,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 23:34:43,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579849068] [2023-11-28 23:34:43,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579849068] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:34:43,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:34:43,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-28 23:34:43,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392031152] [2023-11-28 23:34:43,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:34:43,305 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 23:34:43,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 23:34:43,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 23:34:43,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 23:34:43,307 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 53 [2023-11-28 23:34:43,307 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 43 transitions, 96 flow. Second operand has 3 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-28 23:34:43,307 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 23:34:43,307 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 53 [2023-11-28 23:34:43,308 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 23:34:43,557 INFO L124 PetriNetUnfolderBase]: 678/1257 cut-off events. [2023-11-28 23:34:43,557 INFO L125 PetriNetUnfolderBase]: For 38/38 co-relation queries the response was YES. [2023-11-28 23:34:43,560 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2364 conditions, 1257 events. 678/1257 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 7665 event pairs, 216 based on Foata normal form. 0/1240 useless extension candidates. Maximal degree in co-relation 2354. Up to 832 conditions per place. [2023-11-28 23:34:43,568 INFO L140 encePairwiseOnDemand]: 50/53 looper letters, 31 selfloop transitions, 2 changer transitions 2/56 dead transitions. [2023-11-28 23:34:43,568 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 56 transitions, 196 flow [2023-11-28 23:34:43,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 23:34:43,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-28 23:34:43,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 120 transitions. [2023-11-28 23:34:43,570 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7547169811320755 [2023-11-28 23:34:43,570 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 120 transitions. [2023-11-28 23:34:43,570 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 120 transitions. [2023-11-28 23:34:43,570 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 23:34:43,571 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 120 transitions. [2023-11-28 23:34:43,571 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:34:43,572 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 53.0) internal successors, (212), 4 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:34:43,573 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 53.0) internal successors, (212), 4 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:34:43,573 INFO L175 Difference]: Start difference. First operand has 52 places, 43 transitions, 96 flow. Second operand 3 states and 120 transitions. [2023-11-28 23:34:43,573 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 56 transitions, 196 flow [2023-11-28 23:34:43,574 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 56 transitions, 190 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-28 23:34:43,575 INFO L231 Difference]: Finished difference. Result has 51 places, 41 transitions, 92 flow [2023-11-28 23:34:43,576 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=92, PETRI_PLACES=51, PETRI_TRANSITIONS=41} [2023-11-28 23:34:43,576 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, -7 predicate places. [2023-11-28 23:34:43,577 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 41 transitions, 92 flow [2023-11-28 23:34:43,577 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 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-28 23:34:43,577 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 23:34:43,577 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 23:34:43,577 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-28 23:34:43,578 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-28 23:34:43,578 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:34:43,578 INFO L85 PathProgramCache]: Analyzing trace with hash 241826619, now seen corresponding path program 1 times [2023-11-28 23:34:43,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:34:43,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262095419] [2023-11-28 23:34:43,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:34:43,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:34:43,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:34:43,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 23:34:43,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 23:34:43,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262095419] [2023-11-28 23:34:43,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262095419] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:34:43,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:34:43,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-28 23:34:43,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295410165] [2023-11-28 23:34:43,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:34:43,629 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 23:34:43,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 23:34:43,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 23:34:43,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 23:34:43,643 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 53 [2023-11-28 23:34:43,644 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 41 transitions, 92 flow. Second operand has 3 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-28 23:34:43,644 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 23:34:43,644 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 53 [2023-11-28 23:34:43,644 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 23:34:43,867 INFO L124 PetriNetUnfolderBase]: 620/1184 cut-off events. [2023-11-28 23:34:43,868 INFO L125 PetriNetUnfolderBase]: For 81/81 co-relation queries the response was YES. [2023-11-28 23:34:43,870 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2252 conditions, 1184 events. 620/1184 cut-off events. For 81/81 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 7566 event pairs, 319 based on Foata normal form. 0/1154 useless extension candidates. Maximal degree in co-relation 2241. Up to 811 conditions per place. [2023-11-28 23:34:43,878 INFO L140 encePairwiseOnDemand]: 50/53 looper letters, 26 selfloop transitions, 2 changer transitions 0/47 dead transitions. [2023-11-28 23:34:43,878 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 47 transitions, 162 flow [2023-11-28 23:34:43,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 23:34:43,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-28 23:34:43,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 107 transitions. [2023-11-28 23:34:43,879 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6729559748427673 [2023-11-28 23:34:43,879 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 107 transitions. [2023-11-28 23:34:43,879 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 107 transitions. [2023-11-28 23:34:43,880 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 23:34:43,880 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 107 transitions. [2023-11-28 23:34:43,880 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 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-28 23:34:43,881 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 53.0) internal successors, (212), 4 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:34:43,881 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 53.0) internal successors, (212), 4 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:34:43,881 INFO L175 Difference]: Start difference. First operand has 51 places, 41 transitions, 92 flow. Second operand 3 states and 107 transitions. [2023-11-28 23:34:43,882 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 47 transitions, 162 flow [2023-11-28 23:34:43,882 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 47 transitions, 156 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-28 23:34:43,883 INFO L231 Difference]: Finished difference. Result has 49 places, 40 transitions, 90 flow [2023-11-28 23:34:43,884 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=90, PETRI_PLACES=49, PETRI_TRANSITIONS=40} [2023-11-28 23:34:43,884 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, -9 predicate places. [2023-11-28 23:34:43,885 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 40 transitions, 90 flow [2023-11-28 23:34:43,885 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 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-28 23:34:43,885 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 23:34:43,885 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 23:34:43,885 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-28 23:34:43,886 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-28 23:34:43,886 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:34:43,886 INFO L85 PathProgramCache]: Analyzing trace with hash 241826620, now seen corresponding path program 1 times [2023-11-28 23:34:43,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:34:43,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633299537] [2023-11-28 23:34:43,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:34:43,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:34:43,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:34:43,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 23:34:43,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 23:34:43,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633299537] [2023-11-28 23:34:43,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633299537] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:34:43,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:34:43,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-28 23:34:43,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295096423] [2023-11-28 23:34:43,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:34:43,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 23:34:43,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 23:34:43,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 23:34:43,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 23:34:43,970 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 53 [2023-11-28 23:34:43,970 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 40 transitions, 90 flow. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:34:43,970 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 23:34:43,970 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 53 [2023-11-28 23:34:43,970 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 23:34:44,192 INFO L124 PetriNetUnfolderBase]: 603/1149 cut-off events. [2023-11-28 23:34:44,193 INFO L125 PetriNetUnfolderBase]: For 45/45 co-relation queries the response was YES. [2023-11-28 23:34:44,194 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2154 conditions, 1149 events. 603/1149 cut-off events. For 45/45 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 7472 event pairs, 367 based on Foata normal form. 12/1137 useless extension candidates. Maximal degree in co-relation 2144. Up to 782 conditions per place. [2023-11-28 23:34:44,201 INFO L140 encePairwiseOnDemand]: 50/53 looper letters, 25 selfloop transitions, 2 changer transitions 0/46 dead transitions. [2023-11-28 23:34:44,202 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 46 transitions, 156 flow [2023-11-28 23:34:44,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 23:34:44,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-28 23:34:44,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 109 transitions. [2023-11-28 23:34:44,203 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6855345911949685 [2023-11-28 23:34:44,203 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 109 transitions. [2023-11-28 23:34:44,203 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 109 transitions. [2023-11-28 23:34:44,203 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 23:34:44,204 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 109 transitions. [2023-11-28 23:34:44,204 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:34:44,205 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 53.0) internal successors, (212), 4 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:34:44,205 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 53.0) internal successors, (212), 4 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:34:44,206 INFO L175 Difference]: Start difference. First operand has 49 places, 40 transitions, 90 flow. Second operand 3 states and 109 transitions. [2023-11-28 23:34:44,206 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 46 transitions, 156 flow [2023-11-28 23:34:44,207 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 46 transitions, 152 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-28 23:34:44,208 INFO L231 Difference]: Finished difference. Result has 48 places, 39 transitions, 88 flow [2023-11-28 23:34:44,208 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=88, PETRI_PLACES=48, PETRI_TRANSITIONS=39} [2023-11-28 23:34:44,209 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, -10 predicate places. [2023-11-28 23:34:44,209 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 39 transitions, 88 flow [2023-11-28 23:34:44,210 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:34:44,210 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 23:34:44,210 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-28 23:34:44,210 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-28 23:34:44,210 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-28 23:34:44,211 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:34:44,211 INFO L85 PathProgramCache]: Analyzing trace with hash 27365463, now seen corresponding path program 1 times [2023-11-28 23:34:44,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:34:44,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870001600] [2023-11-28 23:34:44,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:34:44,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:34:44,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:34:44,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 23:34:44,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 23:34:44,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870001600] [2023-11-28 23:34:44,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870001600] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:34:44,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:34:44,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-28 23:34:44,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154918782] [2023-11-28 23:34:44,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:34:44,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-28 23:34:44,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 23:34:44,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-28 23:34:44,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-11-28 23:34:44,893 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 53 [2023-11-28 23:34:44,894 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 39 transitions, 88 flow. Second operand has 8 states, 8 states have (on average 26.75) internal successors, (214), 8 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:34:44,894 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 23:34:44,894 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 53 [2023-11-28 23:34:44,894 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 23:34:45,284 INFO L124 PetriNetUnfolderBase]: 825/1498 cut-off events. [2023-11-28 23:34:45,284 INFO L125 PetriNetUnfolderBase]: For 57/57 co-relation queries the response was YES. [2023-11-28 23:34:45,286 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2836 conditions, 1498 events. 825/1498 cut-off events. For 57/57 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 9353 event pairs, 10 based on Foata normal form. 48/1543 useless extension candidates. Maximal degree in co-relation 2826. Up to 825 conditions per place. [2023-11-28 23:34:45,295 INFO L140 encePairwiseOnDemand]: 47/53 looper letters, 35 selfloop transitions, 4 changer transitions 10/65 dead transitions. [2023-11-28 23:34:45,295 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 65 transitions, 240 flow [2023-11-28 23:34:45,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-28 23:34:45,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-28 23:34:45,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 225 transitions. [2023-11-28 23:34:45,297 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6064690026954178 [2023-11-28 23:34:45,297 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 225 transitions. [2023-11-28 23:34:45,297 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 225 transitions. [2023-11-28 23:34:45,297 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 23:34:45,297 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 225 transitions. [2023-11-28 23:34:45,298 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 32.142857142857146) internal successors, (225), 7 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:34:45,299 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 53.0) internal successors, (424), 8 states have internal predecessors, (424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:34:45,299 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 53.0) internal successors, (424), 8 states have internal predecessors, (424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:34:45,299 INFO L175 Difference]: Start difference. First operand has 48 places, 39 transitions, 88 flow. Second operand 7 states and 225 transitions. [2023-11-28 23:34:45,300 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 65 transitions, 240 flow [2023-11-28 23:34:45,300 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 65 transitions, 234 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-28 23:34:45,302 INFO L231 Difference]: Finished difference. Result has 51 places, 37 transitions, 88 flow [2023-11-28 23:34:45,302 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=88, PETRI_PLACES=51, PETRI_TRANSITIONS=37} [2023-11-28 23:34:45,303 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, -7 predicate places. [2023-11-28 23:34:45,303 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 37 transitions, 88 flow [2023-11-28 23:34:45,303 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 26.75) internal successors, (214), 8 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:34:45,303 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 23:34:45,303 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-28 23:34:45,304 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-28 23:34:45,304 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-28 23:34:45,304 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:34:45,304 INFO L85 PathProgramCache]: Analyzing trace with hash 27366842, now seen corresponding path program 1 times [2023-11-28 23:34:45,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:34:45,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800723296] [2023-11-28 23:34:45,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:34:45,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:34:45,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:34:45,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 23:34:45,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 23:34:45,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800723296] [2023-11-28 23:34:45,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800723296] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:34:45,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:34:45,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-28 23:34:45,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871695746] [2023-11-28 23:34:45,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:34:45,440 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-28 23:34:45,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 23:34:45,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-28 23:34:45,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-28 23:34:45,449 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 53 [2023-11-28 23:34:45,449 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 37 transitions, 88 flow. Second operand has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:34:45,450 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 23:34:45,450 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 53 [2023-11-28 23:34:45,450 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 23:34:45,789 INFO L124 PetriNetUnfolderBase]: 1361/2296 cut-off events. [2023-11-28 23:34:45,789 INFO L125 PetriNetUnfolderBase]: For 21/21 co-relation queries the response was YES. [2023-11-28 23:34:45,793 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4438 conditions, 2296 events. 1361/2296 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 160. Compared 13935 event pairs, 147 based on Foata normal form. 80/2339 useless extension candidates. Maximal degree in co-relation 4427. Up to 1297 conditions per place. [2023-11-28 23:34:45,806 INFO L140 encePairwiseOnDemand]: 47/53 looper letters, 40 selfloop transitions, 5 changer transitions 1/60 dead transitions. [2023-11-28 23:34:45,806 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 60 transitions, 234 flow [2023-11-28 23:34:45,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-28 23:34:45,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-28 23:34:45,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 144 transitions. [2023-11-28 23:34:45,808 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6792452830188679 [2023-11-28 23:34:45,808 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 144 transitions. [2023-11-28 23:34:45,808 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 144 transitions. [2023-11-28 23:34:45,808 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 23:34:45,808 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 144 transitions. [2023-11-28 23:34:45,809 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 36.0) internal successors, (144), 4 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:34:45,809 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 53.0) internal successors, (265), 5 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:34:45,810 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 53.0) internal successors, (265), 5 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:34:45,810 INFO L175 Difference]: Start difference. First operand has 51 places, 37 transitions, 88 flow. Second operand 4 states and 144 transitions. [2023-11-28 23:34:45,810 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 60 transitions, 234 flow [2023-11-28 23:34:45,811 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 60 transitions, 223 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-28 23:34:45,812 INFO L231 Difference]: Finished difference. Result has 50 places, 40 transitions, 115 flow [2023-11-28 23:34:45,812 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=81, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=115, PETRI_PLACES=50, PETRI_TRANSITIONS=40} [2023-11-28 23:34:45,813 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, -8 predicate places. [2023-11-28 23:34:45,813 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 40 transitions, 115 flow [2023-11-28 23:34:45,813 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:34:45,813 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 23:34:45,814 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 23:34:45,814 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-28 23:34:45,814 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-28 23:34:45,814 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:34:45,814 INFO L85 PathProgramCache]: Analyzing trace with hash -1765535027, now seen corresponding path program 1 times [2023-11-28 23:34:45,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:34:45,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369827969] [2023-11-28 23:34:45,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:34:45,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:34:45,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:34:45,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 23:34:46,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 23:34:46,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369827969] [2023-11-28 23:34:46,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369827969] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:34:46,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:34:46,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-28 23:34:46,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504265999] [2023-11-28 23:34:46,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:34:46,001 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-28 23:34:46,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 23:34:46,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-28 23:34:46,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-28 23:34:46,006 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 53 [2023-11-28 23:34:46,006 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 40 transitions, 115 flow. Second operand has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 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-28 23:34:46,006 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 23:34:46,006 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 53 [2023-11-28 23:34:46,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 23:34:46,245 INFO L124 PetriNetUnfolderBase]: 877/1512 cut-off events. [2023-11-28 23:34:46,245 INFO L125 PetriNetUnfolderBase]: For 376/376 co-relation queries the response was YES. [2023-11-28 23:34:46,248 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3440 conditions, 1512 events. 877/1512 cut-off events. For 376/376 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 8150 event pairs, 73 based on Foata normal form. 68/1550 useless extension candidates. Maximal degree in co-relation 3427. Up to 625 conditions per place. [2023-11-28 23:34:46,255 INFO L140 encePairwiseOnDemand]: 47/53 looper letters, 50 selfloop transitions, 8 changer transitions 1/73 dead transitions. [2023-11-28 23:34:46,255 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 73 transitions, 320 flow [2023-11-28 23:34:46,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-28 23:34:46,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-28 23:34:46,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 181 transitions. [2023-11-28 23:34:46,257 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6830188679245283 [2023-11-28 23:34:46,257 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 181 transitions. [2023-11-28 23:34:46,257 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 181 transitions. [2023-11-28 23:34:46,257 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 23:34:46,257 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 181 transitions. [2023-11-28 23:34:46,258 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 36.2) internal successors, (181), 5 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:34:46,259 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 53.0) internal successors, (318), 6 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:34:46,259 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 53.0) internal successors, (318), 6 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:34:46,259 INFO L175 Difference]: Start difference. First operand has 50 places, 40 transitions, 115 flow. Second operand 5 states and 181 transitions. [2023-11-28 23:34:46,259 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 73 transitions, 320 flow [2023-11-28 23:34:46,261 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 73 transitions, 310 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-11-28 23:34:46,262 INFO L231 Difference]: Finished difference. Result has 54 places, 43 transitions, 155 flow [2023-11-28 23:34:46,263 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=107, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=155, PETRI_PLACES=54, PETRI_TRANSITIONS=43} [2023-11-28 23:34:46,263 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, -4 predicate places. [2023-11-28 23:34:46,263 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 43 transitions, 155 flow [2023-11-28 23:34:46,264 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 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-28 23:34:46,264 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 23:34:46,264 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 23:34:46,264 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-28 23:34:46,264 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-28 23:34:46,265 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:34:46,265 INFO L85 PathProgramCache]: Analyzing trace with hash -1647930558, now seen corresponding path program 1 times [2023-11-28 23:34:46,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:34:46,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710567504] [2023-11-28 23:34:46,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:34:46,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:34:46,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:34:46,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 23:34:46,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 23:34:46,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710567504] [2023-11-28 23:34:46,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710567504] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:34:46,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:34:46,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-28 23:34:46,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126853294] [2023-11-28 23:34:46,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:34:46,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-28 23:34:46,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 23:34:46,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-28 23:34:46,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-28 23:34:46,528 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 53 [2023-11-28 23:34:46,528 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 43 transitions, 155 flow. Second operand has 6 states, 6 states have (on average 27.0) internal successors, (162), 6 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:34:46,528 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 23:34:46,528 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 53 [2023-11-28 23:34:46,528 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 23:34:46,754 INFO L124 PetriNetUnfolderBase]: 489/840 cut-off events. [2023-11-28 23:34:46,754 INFO L125 PetriNetUnfolderBase]: For 677/677 co-relation queries the response was YES. [2023-11-28 23:34:46,756 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2178 conditions, 840 events. 489/840 cut-off events. For 677/677 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3779 event pairs, 59 based on Foata normal form. 36/849 useless extension candidates. Maximal degree in co-relation 2163. Up to 268 conditions per place. [2023-11-28 23:34:46,760 INFO L140 encePairwiseOnDemand]: 47/53 looper letters, 44 selfloop transitions, 11 changer transitions 1/70 dead transitions. [2023-11-28 23:34:46,760 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 70 transitions, 331 flow [2023-11-28 23:34:46,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-28 23:34:46,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-28 23:34:46,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 202 transitions. [2023-11-28 23:34:46,761 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6352201257861635 [2023-11-28 23:34:46,761 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 202 transitions. [2023-11-28 23:34:46,762 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 202 transitions. [2023-11-28 23:34:46,762 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 23:34:46,762 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 202 transitions. [2023-11-28 23:34:46,763 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 33.666666666666664) internal successors, (202), 6 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:34:46,764 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 53.0) internal successors, (371), 7 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:34:46,764 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 53.0) internal successors, (371), 7 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:34:46,764 INFO L175 Difference]: Start difference. First operand has 54 places, 43 transitions, 155 flow. Second operand 6 states and 202 transitions. [2023-11-28 23:34:46,764 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 70 transitions, 331 flow [2023-11-28 23:34:46,767 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 70 transitions, 306 flow, removed 4 selfloop flow, removed 4 redundant places. [2023-11-28 23:34:46,769 INFO L231 Difference]: Finished difference. Result has 57 places, 43 transitions, 169 flow [2023-11-28 23:34:46,769 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=133, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=169, PETRI_PLACES=57, PETRI_TRANSITIONS=43} [2023-11-28 23:34:46,769 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, -1 predicate places. [2023-11-28 23:34:46,769 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 43 transitions, 169 flow [2023-11-28 23:34:46,770 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.0) internal successors, (162), 6 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:34:46,770 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 23:34:46,770 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 23:34:46,770 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-28 23:34:46,770 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-28 23:34:46,771 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:34:46,771 INFO L85 PathProgramCache]: Analyzing trace with hash 964833554, now seen corresponding path program 1 times [2023-11-28 23:34:46,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:34:46,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030887510] [2023-11-28 23:34:46,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:34:46,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:34:46,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:34:47,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 23:34:47,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 23:34:47,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030887510] [2023-11-28 23:34:47,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030887510] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:34:47,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:34:47,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-28 23:34:47,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281379148] [2023-11-28 23:34:47,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:34:47,251 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-28 23:34:47,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 23:34:47,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-28 23:34:47,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-28 23:34:47,280 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 53 [2023-11-28 23:34:47,280 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 43 transitions, 169 flow. Second operand has 7 states, 7 states have (on average 26.857142857142858) internal successors, (188), 7 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:34:47,280 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 23:34:47,280 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 53 [2023-11-28 23:34:47,280 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 23:34:47,643 INFO L124 PetriNetUnfolderBase]: 1002/1823 cut-off events. [2023-11-28 23:34:47,643 INFO L125 PetriNetUnfolderBase]: For 737/761 co-relation queries the response was YES. [2023-11-28 23:34:47,648 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4212 conditions, 1823 events. 1002/1823 cut-off events. For 737/761 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 10464 event pairs, 225 based on Foata normal form. 8/1795 useless extension candidates. Maximal degree in co-relation 4196. Up to 624 conditions per place. [2023-11-28 23:34:47,654 INFO L140 encePairwiseOnDemand]: 42/53 looper letters, 39 selfloop transitions, 10 changer transitions 15/84 dead transitions. [2023-11-28 23:34:47,654 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 84 transitions, 393 flow [2023-11-28 23:34:47,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-28 23:34:47,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-28 23:34:47,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 233 transitions. [2023-11-28 23:34:47,656 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.628032345013477 [2023-11-28 23:34:47,656 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 233 transitions. [2023-11-28 23:34:47,656 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 233 transitions. [2023-11-28 23:34:47,657 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 23:34:47,657 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 233 transitions. [2023-11-28 23:34:47,658 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 33.285714285714285) internal successors, (233), 7 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:34:47,659 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 53.0) internal successors, (424), 8 states have internal predecessors, (424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:34:47,659 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 53.0) internal successors, (424), 8 states have internal predecessors, (424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:34:47,659 INFO L175 Difference]: Start difference. First operand has 57 places, 43 transitions, 169 flow. Second operand 7 states and 233 transitions. [2023-11-28 23:34:47,659 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 84 transitions, 393 flow [2023-11-28 23:34:47,665 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 84 transitions, 329 flow, removed 14 selfloop flow, removed 8 redundant places. [2023-11-28 23:34:47,667 INFO L231 Difference]: Finished difference. Result has 61 places, 51 transitions, 190 flow [2023-11-28 23:34:47,667 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=113, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=190, PETRI_PLACES=61, PETRI_TRANSITIONS=51} [2023-11-28 23:34:47,668 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 3 predicate places. [2023-11-28 23:34:47,668 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 51 transitions, 190 flow [2023-11-28 23:34:47,668 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 26.857142857142858) internal successors, (188), 7 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:34:47,668 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 23:34:47,668 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 23:34:47,669 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-28 23:34:47,669 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-28 23:34:47,669 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:34:47,669 INFO L85 PathProgramCache]: Analyzing trace with hash 1037668396, now seen corresponding path program 2 times [2023-11-28 23:34:47,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:34:47,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620160696] [2023-11-28 23:34:47,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:34:47,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:34:47,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:34:48,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 23:34:48,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 23:34:48,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620160696] [2023-11-28 23:34:48,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620160696] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:34:48,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:34:48,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-28 23:34:48,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733489714] [2023-11-28 23:34:48,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:34:48,166 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-28 23:34:48,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 23:34:48,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-28 23:34:48,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-28 23:34:48,193 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 53 [2023-11-28 23:34:48,193 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 51 transitions, 190 flow. Second operand has 7 states, 7 states have (on average 26.857142857142858) internal successors, (188), 7 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:34:48,193 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 23:34:48,193 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 53 [2023-11-28 23:34:48,194 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 23:34:48,541 INFO L124 PetriNetUnfolderBase]: 812/1489 cut-off events. [2023-11-28 23:34:48,541 INFO L125 PetriNetUnfolderBase]: For 530/542 co-relation queries the response was YES. [2023-11-28 23:34:48,546 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3777 conditions, 1489 events. 812/1489 cut-off events. For 530/542 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 8204 event pairs, 241 based on Foata normal form. 8/1451 useless extension candidates. Maximal degree in co-relation 3759. Up to 670 conditions per place. [2023-11-28 23:34:48,551 INFO L140 encePairwiseOnDemand]: 43/53 looper letters, 32 selfloop transitions, 10 changer transitions 21/83 dead transitions. [2023-11-28 23:34:48,551 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 83 transitions, 421 flow [2023-11-28 23:34:48,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-28 23:34:48,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-28 23:34:48,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 225 transitions. [2023-11-28 23:34:48,553 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6064690026954178 [2023-11-28 23:34:48,553 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 225 transitions. [2023-11-28 23:34:48,553 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 225 transitions. [2023-11-28 23:34:48,553 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 23:34:48,553 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 225 transitions. [2023-11-28 23:34:48,554 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 32.142857142857146) internal successors, (225), 7 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:34:48,555 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 53.0) internal successors, (424), 8 states have internal predecessors, (424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:34:48,555 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 53.0) internal successors, (424), 8 states have internal predecessors, (424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:34:48,556 INFO L175 Difference]: Start difference. First operand has 61 places, 51 transitions, 190 flow. Second operand 7 states and 225 transitions. [2023-11-28 23:34:48,556 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 83 transitions, 421 flow [2023-11-28 23:34:48,558 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 83 transitions, 406 flow, removed 5 selfloop flow, removed 3 redundant places. [2023-11-28 23:34:48,560 INFO L231 Difference]: Finished difference. Result has 66 places, 50 transitions, 218 flow [2023-11-28 23:34:48,560 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=181, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=218, PETRI_PLACES=66, PETRI_TRANSITIONS=50} [2023-11-28 23:34:48,560 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 8 predicate places. [2023-11-28 23:34:48,561 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 50 transitions, 218 flow [2023-11-28 23:34:48,561 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 26.857142857142858) internal successors, (188), 7 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:34:48,561 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 23:34:48,561 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 23:34:48,561 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-28 23:34:48,561 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-28 23:34:48,562 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:34:48,562 INFO L85 PathProgramCache]: Analyzing trace with hash -1557113334, now seen corresponding path program 3 times [2023-11-28 23:34:48,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:34:48,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711019253] [2023-11-28 23:34:48,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:34:48,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:34:48,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:34:48,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 23:34:48,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 23:34:48,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711019253] [2023-11-28 23:34:48,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711019253] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:34:48,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:34:48,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-28 23:34:48,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248000517] [2023-11-28 23:34:48,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:34:48,881 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-28 23:34:48,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 23:34:48,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-28 23:34:48,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-28 23:34:48,899 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 53 [2023-11-28 23:34:48,900 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 50 transitions, 218 flow. Second operand has 6 states, 6 states have (on average 28.166666666666668) internal successors, (169), 6 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-28 23:34:48,900 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 23:34:48,900 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 53 [2023-11-28 23:34:48,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 23:34:49,202 INFO L124 PetriNetUnfolderBase]: 546/1063 cut-off events. [2023-11-28 23:34:49,202 INFO L125 PetriNetUnfolderBase]: For 674/698 co-relation queries the response was YES. [2023-11-28 23:34:49,206 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2762 conditions, 1063 events. 546/1063 cut-off events. For 674/698 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 5405 event pairs, 141 based on Foata normal form. 28/1067 useless extension candidates. Maximal degree in co-relation 2741. Up to 353 conditions per place. [2023-11-28 23:34:49,209 INFO L140 encePairwiseOnDemand]: 47/53 looper letters, 26 selfloop transitions, 3 changer transitions 31/81 dead transitions. [2023-11-28 23:34:49,209 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 81 transitions, 435 flow [2023-11-28 23:34:49,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-28 23:34:49,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-28 23:34:49,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 229 transitions. [2023-11-28 23:34:49,211 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6172506738544474 [2023-11-28 23:34:49,211 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 229 transitions. [2023-11-28 23:34:49,211 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 229 transitions. [2023-11-28 23:34:49,212 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 23:34:49,212 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 229 transitions. [2023-11-28 23:34:49,213 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 32.714285714285715) internal successors, (229), 7 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:34:49,214 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 53.0) internal successors, (424), 8 states have internal predecessors, (424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:34:49,214 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 53.0) internal successors, (424), 8 states have internal predecessors, (424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:34:49,214 INFO L175 Difference]: Start difference. First operand has 66 places, 50 transitions, 218 flow. Second operand 7 states and 229 transitions. [2023-11-28 23:34:49,214 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 81 transitions, 435 flow [2023-11-28 23:34:49,217 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 81 transitions, 403 flow, removed 8 selfloop flow, removed 7 redundant places. [2023-11-28 23:34:49,219 INFO L231 Difference]: Finished difference. Result has 67 places, 45 transitions, 168 flow [2023-11-28 23:34:49,219 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=168, PETRI_PLACES=67, PETRI_TRANSITIONS=45} [2023-11-28 23:34:49,220 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 9 predicate places. [2023-11-28 23:34:49,220 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 45 transitions, 168 flow [2023-11-28 23:34:49,220 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.166666666666668) internal successors, (169), 6 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-28 23:34:49,220 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 23:34:49,220 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 23:34:49,220 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-28 23:34:49,221 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-28 23:34:49,221 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:34:49,221 INFO L85 PathProgramCache]: Analyzing trace with hash -129626004, now seen corresponding path program 4 times [2023-11-28 23:34:49,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:34:49,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815494545] [2023-11-28 23:34:49,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:34:49,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:34:49,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:34:50,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 23:34:50,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 23:34:50,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815494545] [2023-11-28 23:34:50,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815494545] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:34:50,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:34:50,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-28 23:34:50,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386056140] [2023-11-28 23:34:50,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:34:50,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-28 23:34:50,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 23:34:50,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-28 23:34:50,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-11-28 23:34:50,259 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 53 [2023-11-28 23:34:50,259 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 45 transitions, 168 flow. Second operand has 9 states, 9 states have (on average 25.333333333333332) internal successors, (228), 9 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:34:50,259 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 23:34:50,259 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 53 [2023-11-28 23:34:50,259 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 23:34:50,622 INFO L124 PetriNetUnfolderBase]: 432/847 cut-off events. [2023-11-28 23:34:50,622 INFO L125 PetriNetUnfolderBase]: For 372/372 co-relation queries the response was YES. [2023-11-28 23:34:50,624 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2034 conditions, 847 events. 432/847 cut-off events. For 372/372 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 4113 event pairs, 108 based on Foata normal form. 8/831 useless extension candidates. Maximal degree in co-relation 2015. Up to 409 conditions per place. [2023-11-28 23:34:50,626 INFO L140 encePairwiseOnDemand]: 43/53 looper letters, 36 selfloop transitions, 8 changer transitions 10/73 dead transitions. [2023-11-28 23:34:50,626 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 73 transitions, 368 flow [2023-11-28 23:34:50,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-28 23:34:50,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-28 23:34:50,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 238 transitions. [2023-11-28 23:34:50,628 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5613207547169812 [2023-11-28 23:34:50,628 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 238 transitions. [2023-11-28 23:34:50,628 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 238 transitions. [2023-11-28 23:34:50,628 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 23:34:50,628 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 238 transitions. [2023-11-28 23:34:50,629 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 29.75) internal successors, (238), 8 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:34:50,629 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 53.0) internal successors, (477), 9 states have internal predecessors, (477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:34:50,630 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 53.0) internal successors, (477), 9 states have internal predecessors, (477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:34:50,630 INFO L175 Difference]: Start difference. First operand has 67 places, 45 transitions, 168 flow. Second operand 8 states and 238 transitions. [2023-11-28 23:34:50,630 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 73 transitions, 368 flow [2023-11-28 23:34:50,631 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 73 transitions, 337 flow, removed 10 selfloop flow, removed 6 redundant places. [2023-11-28 23:34:50,632 INFO L231 Difference]: Finished difference. Result has 68 places, 50 transitions, 216 flow [2023-11-28 23:34:50,632 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=216, PETRI_PLACES=68, PETRI_TRANSITIONS=50} [2023-11-28 23:34:50,633 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 10 predicate places. [2023-11-28 23:34:50,633 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 50 transitions, 216 flow [2023-11-28 23:34:50,633 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 25.333333333333332) internal successors, (228), 9 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:34:50,633 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 23:34:50,633 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 23:34:50,634 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-28 23:34:50,634 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-28 23:34:50,634 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:34:50,634 INFO L85 PathProgramCache]: Analyzing trace with hash -293515048, now seen corresponding path program 5 times [2023-11-28 23:34:50,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:34:50,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548130520] [2023-11-28 23:34:50,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:34:50,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:34:50,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:34:52,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 23:34:52,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 23:34:52,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548130520] [2023-11-28 23:34:52,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548130520] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:34:52,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:34:52,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-28 23:34:52,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570282750] [2023-11-28 23:34:52,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:34:52,010 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-28 23:34:52,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 23:34:52,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-28 23:34:52,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2023-11-28 23:34:52,028 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 53 [2023-11-28 23:34:52,029 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 50 transitions, 216 flow. Second operand has 11 states, 11 states have (on average 28.545454545454547) internal successors, (314), 11 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:34:52,029 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 23:34:52,029 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 53 [2023-11-28 23:34:52,029 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 23:34:52,447 INFO L124 PetriNetUnfolderBase]: 500/983 cut-off events. [2023-11-28 23:34:52,448 INFO L125 PetriNetUnfolderBase]: For 576/596 co-relation queries the response was YES. [2023-11-28 23:34:52,450 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2412 conditions, 983 events. 500/983 cut-off events. For 576/596 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 4999 event pairs, 148 based on Foata normal form. 8/950 useless extension candidates. Maximal degree in co-relation 2391. Up to 323 conditions per place. [2023-11-28 23:34:52,452 INFO L140 encePairwiseOnDemand]: 45/53 looper letters, 25 selfloop transitions, 4 changer transitions 32/84 dead transitions. [2023-11-28 23:34:52,452 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 84 transitions, 444 flow [2023-11-28 23:34:52,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-28 23:34:52,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-28 23:34:52,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 297 transitions. [2023-11-28 23:34:52,454 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6226415094339622 [2023-11-28 23:34:52,454 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 297 transitions. [2023-11-28 23:34:52,454 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 297 transitions. [2023-11-28 23:34:52,455 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 23:34:52,455 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 297 transitions. [2023-11-28 23:34:52,455 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 33.0) internal successors, (297), 9 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:34:52,457 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 53.0) internal successors, (530), 10 states have internal predecessors, (530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:34:52,457 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 53.0) internal successors, (530), 10 states have internal predecessors, (530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:34:52,457 INFO L175 Difference]: Start difference. First operand has 68 places, 50 transitions, 216 flow. Second operand 9 states and 297 transitions. [2023-11-28 23:34:52,457 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 84 transitions, 444 flow [2023-11-28 23:34:52,460 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 84 transitions, 431 flow, removed 4 selfloop flow, removed 5 redundant places. [2023-11-28 23:34:52,461 INFO L231 Difference]: Finished difference. Result has 74 places, 46 transitions, 196 flow [2023-11-28 23:34:52,461 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=205, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=196, PETRI_PLACES=74, PETRI_TRANSITIONS=46} [2023-11-28 23:34:52,461 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 16 predicate places. [2023-11-28 23:34:52,462 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 46 transitions, 196 flow [2023-11-28 23:34:52,462 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 28.545454545454547) internal successors, (314), 11 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:34:52,462 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 23:34:52,462 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 23:34:52,462 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-28 23:34:52,463 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-28 23:34:52,463 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:34:52,463 INFO L85 PathProgramCache]: Analyzing trace with hash -1062422906, now seen corresponding path program 6 times [2023-11-28 23:34:52,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:34:52,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585833272] [2023-11-28 23:34:52,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:34:52,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:34:52,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-28 23:34:52,502 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-28 23:34:52,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-28 23:34:52,563 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-28 23:34:52,563 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-28 23:34:52,564 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2023-11-28 23:34:52,565 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining) [2023-11-28 23:34:52,565 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2023-11-28 23:34:52,565 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2023-11-28 23:34:52,566 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2023-11-28 23:34:52,566 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2023-11-28 23:34:52,566 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2023-11-28 23:34:52,566 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2023-11-28 23:34:52,566 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining) [2023-11-28 23:34:52,566 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining) [2023-11-28 23:34:52,566 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2023-11-28 23:34:52,566 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2023-11-28 23:34:52,566 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2023-11-28 23:34:52,567 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-28 23:34:52,567 INFO L445 BasicCegarLoop]: Path program histogram: [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 23:34:52,572 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-28 23:34:52,572 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-28 23:34:52,616 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre3 could not be translated [2023-11-28 23:34:52,618 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-28 23:34:52,619 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-28 23:34:52,630 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-28 23:34:52,631 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-28 23:34:52,643 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 11:34:52 BasicIcfg [2023-11-28 23:34:52,643 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-28 23:34:52,644 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-28 23:34:52,644 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-28 23:34:52,644 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-28 23:34:52,644 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:34:40" (3/4) ... [2023-11-28 23:34:52,646 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-28 23:34:52,646 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-28 23:34:52,647 INFO L158 Benchmark]: Toolchain (without parser) took 13227.35ms. Allocated memory was 155.2MB in the beginning and 339.7MB in the end (delta: 184.5MB). Free memory was 114.5MB in the beginning and 135.9MB in the end (delta: -21.4MB). Peak memory consumption was 165.9MB. Max. memory is 16.1GB. [2023-11-28 23:34:52,647 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 155.2MB. Free memory is still 126.4MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-28 23:34:52,647 INFO L158 Benchmark]: CACSL2BoogieTranslator took 485.13ms. Allocated memory is still 155.2MB. Free memory was 114.5MB in the beginning and 91.0MB in the end (delta: 23.5MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-11-28 23:34:52,648 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.83ms. Allocated memory is still 155.2MB. Free memory was 91.0MB in the beginning and 87.8MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-28 23:34:52,648 INFO L158 Benchmark]: Boogie Preprocessor took 60.29ms. Allocated memory is still 155.2MB. Free memory was 87.8MB in the beginning and 84.7MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-28 23:34:52,648 INFO L158 Benchmark]: RCFGBuilder took 719.90ms. Allocated memory was 155.2MB in the beginning and 195.0MB in the end (delta: 39.8MB). Free memory was 84.7MB in the beginning and 143.6MB in the end (delta: -58.9MB). Peak memory consumption was 41.8MB. Max. memory is 16.1GB. [2023-11-28 23:34:52,649 INFO L158 Benchmark]: TraceAbstraction took 11894.16ms. Allocated memory was 195.0MB in the beginning and 339.7MB in the end (delta: 144.7MB). Free memory was 143.6MB in the beginning and 135.9MB in the end (delta: 7.7MB). Peak memory consumption was 153.5MB. Max. memory is 16.1GB. [2023-11-28 23:34:52,649 INFO L158 Benchmark]: Witness Printer took 2.70ms. Allocated memory is still 339.7MB. Free memory is still 135.9MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-28 23:34:52,650 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.19ms. Allocated memory is still 155.2MB. Free memory is still 126.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 485.13ms. Allocated memory is still 155.2MB. Free memory was 114.5MB in the beginning and 91.0MB in the end (delta: 23.5MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.83ms. Allocated memory is still 155.2MB. Free memory was 91.0MB in the beginning and 87.8MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 60.29ms. Allocated memory is still 155.2MB. Free memory was 87.8MB in the beginning and 84.7MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 719.90ms. Allocated memory was 155.2MB in the beginning and 195.0MB in the end (delta: 39.8MB). Free memory was 84.7MB in the beginning and 143.6MB in the end (delta: -58.9MB). Peak memory consumption was 41.8MB. Max. memory is 16.1GB. * TraceAbstraction took 11894.16ms. Allocated memory was 195.0MB in the beginning and 339.7MB in the end (delta: 144.7MB). Free memory was 143.6MB in the beginning and 135.9MB in the end (delta: 7.7MB). Peak memory consumption was 153.5MB. Max. memory is 16.1GB. * Witness Printer took 2.70ms. Allocated memory is still 339.7MB. Free memory is still 135.9MB. 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~pre3 could not be translated - 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: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p2_EAX = 0; [L714] 0 _Bool main$tmp_guard0; [L715] 0 _Bool main$tmp_guard1; [L717] 0 int x = 0; [L718] 0 _Bool x$flush_delayed; [L719] 0 int x$mem_tmp; [L720] 0 _Bool x$r_buff0_thd0; [L721] 0 _Bool x$r_buff0_thd1; [L722] 0 _Bool x$r_buff0_thd2; [L723] 0 _Bool x$r_buff0_thd3; [L724] 0 _Bool x$r_buff1_thd0; [L725] 0 _Bool x$r_buff1_thd1; [L726] 0 _Bool x$r_buff1_thd2; [L727] 0 _Bool x$r_buff1_thd3; [L728] 0 _Bool x$read_delayed; [L729] 0 int *x$read_delayed_var; [L730] 0 int x$w_buff0; [L731] 0 _Bool x$w_buff0_used; [L732] 0 int x$w_buff1; [L733] 0 _Bool x$w_buff1_used; [L735] 0 int y = 0; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L818] 0 pthread_t t1804; [L819] FCALL, FORK 0 pthread_create(&t1804, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1804={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L820] 0 pthread_t t1805; [L821] FCALL, FORK 0 pthread_create(&t1805, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1804={5:0}, t1805={6:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L822] 0 pthread_t t1806; [L823] FCALL, FORK 0 pthread_create(&t1806, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1804={5:0}, t1805={6:0}, t1806={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L761] 2 x$w_buff1 = x$w_buff0 [L762] 2 x$w_buff0 = 2 [L763] 2 x$w_buff1_used = x$w_buff0_used [L764] 2 x$w_buff0_used = (_Bool)1 [L765] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L765] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L766] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L767] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L768] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L769] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L770] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L773] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L790] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L793] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L796] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L797] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L798] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L799] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L800] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L741] 1 __unbuffered_p0_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L744] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L747] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L748] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L749] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L750] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L751] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L776] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L777] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L778] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L779] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L780] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L783] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L803] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L754] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L825] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1804={5:0}, t1805={6:0}, t1806={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L827] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L827] RET 0 assume_abort_if_not(main$tmp_guard0) [L829] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L830] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L831] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L832] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L833] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1804={5:0}, t1805={6:0}, t1806={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L836] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L837] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L838] 0 x$flush_delayed = weak$$choice2 [L839] 0 x$mem_tmp = x [L840] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L841] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L842] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L843] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L844] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L845] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L846] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L847] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p0_EAX == 2 && __unbuffered_p2_EAX == 1) [L848] 0 x = x$flush_delayed ? x$mem_tmp : x [L849] 0 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1804={5:0}, t1805={6:0}, t1806={3:0}, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L851] 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=3, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L17] 0 __assert_fail ("0", "safe001_power.opt_pso.oepc_pso.opt_rmo.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, 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: -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: 816]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 819]: 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: 823]: 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: 821]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 77 locations, 13 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: 11.7s, OverallIterations: 17, TraceHistogramMax: 1, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 5.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 775 SdHoareTripleChecker+Valid, 2.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 646 mSDsluCounter, 261 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 225 mSDsCounter, 65 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1866 IncrementalHoareTripleChecker+Invalid, 1931 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 65 mSolverCounterUnsat, 36 mSDtfsCounter, 1866 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 91 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=218occurred in iteration=13, InterpolantAutomatonStates: 81, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.8s InterpolantComputationTime, 323 NumberOfCodeBlocks, 323 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 274 ConstructedInterpolants, 0 QuantifiedInterpolants, 2243 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-11-28 23:34:52,674 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65231864-f43e-4150-9960-204c98c4fb59/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65231864-f43e-4150-9960-204c98c4fb59/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65231864-f43e-4150-9960-204c98c4fb59/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65231864-f43e-4150-9960-204c98c4fb59/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65231864-f43e-4150-9960-204c98c4fb59/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe001_power.opt_pso.oepc_pso.opt_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65231864-f43e-4150-9960-204c98c4fb59/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65231864-f43e-4150-9960-204c98c4fb59/bin/uautomizer-verify-BQ2R08f2Ya --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a843579fcb7bb5d5833d499f834986a668bfbdfa4c59a86e5d344f532fcebd9f --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-28 23:34:54,683 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-28 23:34:54,762 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65231864-f43e-4150-9960-204c98c4fb59/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-11-28 23:34:54,768 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-28 23:34:54,768 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-28 23:34:54,796 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-28 23:34:54,796 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-28 23:34:54,797 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-28 23:34:54,798 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-28 23:34:54,798 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-28 23:34:54,799 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-28 23:34:54,799 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-28 23:34:54,800 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-28 23:34:54,801 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-28 23:34:54,801 INFO L153 SettingsManager]: * Use SBE=true [2023-11-28 23:34:54,802 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-28 23:34:54,803 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-28 23:34:54,803 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-28 23:34:54,804 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-28 23:34:54,804 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-28 23:34:54,805 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-28 23:34:54,805 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-28 23:34:54,806 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-28 23:34:54,806 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-28 23:34:54,807 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-28 23:34:54,807 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-28 23:34:54,807 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-28 23:34:54,808 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-28 23:34:54,808 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-28 23:34:54,808 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-28 23:34:54,809 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-28 23:34:54,809 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-28 23:34:54,810 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-28 23:34:54,810 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-28 23:34:54,810 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-28 23:34:54,810 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-28 23:34:54,811 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-28 23:34:54,811 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-28 23:34:54,811 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-28 23:34:54,811 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-28 23:34:54,812 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-28 23:34:54,812 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-28 23:34:54,812 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-28 23:34:54,812 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-28 23:34:54,812 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_65231864-f43e-4150-9960-204c98c4fb59/bin/uautomizer-verify-BQ2R08f2Ya/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65231864-f43e-4150-9960-204c98c4fb59/bin/uautomizer-verify-BQ2R08f2Ya Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a843579fcb7bb5d5833d499f834986a668bfbdfa4c59a86e5d344f532fcebd9f [2023-11-28 23:34:55,121 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-28 23:34:55,138 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-28 23:34:55,141 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-28 23:34:55,142 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-28 23:34:55,143 INFO L274 PluginConnector]: CDTParser initialized [2023-11-28 23:34:55,144 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65231864-f43e-4150-9960-204c98c4fb59/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/pthread-wmm/safe001_power.opt_pso.oepc_pso.opt_rmo.opt.i [2023-11-28 23:34:57,991 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-28 23:34:58,239 INFO L384 CDTParser]: Found 1 translation units. [2023-11-28 23:34:58,240 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65231864-f43e-4150-9960-204c98c4fb59/sv-benchmarks/c/pthread-wmm/safe001_power.opt_pso.oepc_pso.opt_rmo.opt.i [2023-11-28 23:34:58,257 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65231864-f43e-4150-9960-204c98c4fb59/bin/uautomizer-verify-BQ2R08f2Ya/data/98857fee5/ee2d75fa2a5d4496b79357bea2ca3134/FLAG12f575860 [2023-11-28 23:34:58,272 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65231864-f43e-4150-9960-204c98c4fb59/bin/uautomizer-verify-BQ2R08f2Ya/data/98857fee5/ee2d75fa2a5d4496b79357bea2ca3134 [2023-11-28 23:34:58,275 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-28 23:34:58,277 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-28 23:34:58,278 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-28 23:34:58,278 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-28 23:34:58,284 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-28 23:34:58,285 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:34:58" (1/1) ... [2023-11-28 23:34:58,286 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20225ec5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:34:58, skipping insertion in model container [2023-11-28 23:34:58,286 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:34:58" (1/1) ... [2023-11-28 23:34:58,340 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-28 23:34:58,715 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-28 23:34:58,730 INFO L202 MainTranslator]: Completed pre-run [2023-11-28 23:34:58,788 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-28 23:34:58,822 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-28 23:34:58,822 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-28 23:34:58,830 INFO L206 MainTranslator]: Completed translation [2023-11-28 23:34:58,830 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:34:58 WrapperNode [2023-11-28 23:34:58,830 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-28 23:34:58,831 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-28 23:34:58,831 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-28 23:34:58,831 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-28 23:34:58,839 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:34:58" (1/1) ... [2023-11-28 23:34:58,860 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:34:58" (1/1) ... [2023-11-28 23:34:58,888 INFO L138 Inliner]: procedures = 179, calls = 55, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 150 [2023-11-28 23:34:58,889 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-28 23:34:58,890 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-28 23:34:58,890 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-28 23:34:58,890 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-28 23:34:58,901 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:34:58" (1/1) ... [2023-11-28 23:34:58,902 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:34:58" (1/1) ... [2023-11-28 23:34:58,906 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:34:58" (1/1) ... [2023-11-28 23:34:58,927 INFO L175 MemorySlicer]: Split 5 memory accesses to 4 slices as follows [2, 1, 1, 1]. 40 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 3 writes are split as follows [0, 1, 1, 1]. [2023-11-28 23:34:58,927 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:34:58" (1/1) ... [2023-11-28 23:34:58,928 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:34:58" (1/1) ... [2023-11-28 23:34:58,939 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:34:58" (1/1) ... [2023-11-28 23:34:58,941 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:34:58" (1/1) ... [2023-11-28 23:34:58,944 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:34:58" (1/1) ... [2023-11-28 23:34:58,947 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:34:58" (1/1) ... [2023-11-28 23:34:58,952 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-28 23:34:58,953 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-28 23:34:58,953 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-28 23:34:58,953 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-28 23:34:58,954 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:34:58" (1/1) ... [2023-11-28 23:34:58,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-28 23:34:58,970 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65231864-f43e-4150-9960-204c98c4fb59/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 23:34:58,981 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65231864-f43e-4150-9960-204c98c4fb59/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-28 23:34:59,000 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65231864-f43e-4150-9960-204c98c4fb59/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-28 23:34:59,029 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-28 23:34:59,029 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-28 23:34:59,029 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-28 23:34:59,029 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-28 23:34:59,030 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-11-28 23:34:59,030 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-11-28 23:34:59,030 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2023-11-28 23:34:59,030 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2023-11-28 23:34:59,030 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-28 23:34:59,031 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-11-28 23:34:59,031 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-11-28 23:34:59,031 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2023-11-28 23:34:59,031 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-28 23:34:59,031 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-28 23:34:59,032 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-28 23:34:59,032 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-28 23:34:59,032 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-28 23:34:59,032 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-28 23:34:59,033 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-28 23:34:59,033 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-28 23:34:59,033 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-28 23:34:59,035 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-28 23:34:59,185 INFO L241 CfgBuilder]: Building ICFG [2023-11-28 23:34:59,188 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-28 23:34:59,533 INFO L282 CfgBuilder]: Performing block encoding [2023-11-28 23:34:59,738 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-28 23:34:59,738 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-28 23:34:59,739 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:34:59 BoogieIcfgContainer [2023-11-28 23:34:59,739 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-28 23:34:59,741 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-28 23:34:59,742 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-28 23:34:59,745 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-28 23:34:59,745 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 11:34:58" (1/3) ... [2023-11-28 23:34:59,746 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75abeb3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 11:34:59, skipping insertion in model container [2023-11-28 23:34:59,746 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:34:58" (2/3) ... [2023-11-28 23:34:59,746 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75abeb3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 11:34:59, skipping insertion in model container [2023-11-28 23:34:59,746 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:34:59" (3/3) ... [2023-11-28 23:34:59,748 INFO L112 eAbstractionObserver]: Analyzing ICFG safe001_power.opt_pso.oepc_pso.opt_rmo.opt.i [2023-11-28 23:34:59,769 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-28 23:34:59,769 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2023-11-28 23:34:59,769 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-28 23:34:59,851 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-28 23:34:59,886 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 61 places, 53 transitions, 118 flow [2023-11-28 23:34:59,920 INFO L124 PetriNetUnfolderBase]: 2/50 cut-off events. [2023-11-28 23:34:59,920 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-28 23:34:59,924 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60 conditions, 50 events. 2/50 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 94 event pairs, 0 based on Foata normal form. 0/39 useless extension candidates. Maximal degree in co-relation 49. Up to 2 conditions per place. [2023-11-28 23:34:59,924 INFO L82 GeneralOperation]: Start removeDead. Operand has 61 places, 53 transitions, 118 flow [2023-11-28 23:34:59,928 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 58 places, 50 transitions, 109 flow [2023-11-28 23:34:59,940 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-28 23:34:59,947 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;@214d54c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-28 23:34:59,947 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2023-11-28 23:34:59,951 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-28 23:34:59,951 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-11-28 23:34:59,951 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-28 23:34:59,951 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 23:34:59,952 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-28 23:34:59,952 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-28 23:34:59,958 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:34:59,958 INFO L85 PathProgramCache]: Analyzing trace with hash 12339, now seen corresponding path program 1 times [2023-11-28 23:34:59,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 23:34:59,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [694053435] [2023-11-28 23:34:59,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:34:59,971 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-28 23:34:59,971 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65231864-f43e-4150-9960-204c98c4fb59/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 23:34:59,973 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65231864-f43e-4150-9960-204c98c4fb59/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-28 23:34:59,998 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65231864-f43e-4150-9960-204c98c4fb59/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-11-28 23:35:00,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:35:00,107 INFO L262 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-28 23:35:00,111 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 23:35:00,177 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-28 23:35:00,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 23:35:00,189 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 23:35:00,190 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 23:35:00,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [694053435] [2023-11-28 23:35:00,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [694053435] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:35:00,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:35:00,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-28 23:35:00,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672869862] [2023-11-28 23:35:00,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:35:00,202 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 23:35:00,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 23:35:00,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 23:35:00,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 23:35:00,268 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 53 [2023-11-28 23:35:00,271 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 50 transitions, 109 flow. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:35:00,271 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 23:35:00,271 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 53 [2023-11-28 23:35:00,272 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 23:35:00,726 INFO L124 PetriNetUnfolderBase]: 868/1664 cut-off events. [2023-11-28 23:35:00,727 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2023-11-28 23:35:00,734 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3018 conditions, 1664 events. 868/1664 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 11209 event pairs, 676 based on Foata normal form. 90/1592 useless extension candidates. Maximal degree in co-relation 3004. Up to 1029 conditions per place. [2023-11-28 23:35:00,748 INFO L140 encePairwiseOnDemand]: 48/53 looper letters, 29 selfloop transitions, 2 changer transitions 0/54 dead transitions. [2023-11-28 23:35:00,748 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 54 transitions, 179 flow [2023-11-28 23:35:00,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 23:35:00,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-28 23:35:00,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 112 transitions. [2023-11-28 23:35:00,761 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7044025157232704 [2023-11-28 23:35:00,762 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 112 transitions. [2023-11-28 23:35:00,762 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 112 transitions. [2023-11-28 23:35:00,763 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 23:35:00,766 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 112 transitions. [2023-11-28 23:35:00,768 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 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-28 23:35:00,772 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 53.0) internal successors, (212), 4 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:35:00,772 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 53.0) internal successors, (212), 4 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:35:00,774 INFO L175 Difference]: Start difference. First operand has 58 places, 50 transitions, 109 flow. Second operand 3 states and 112 transitions. [2023-11-28 23:35:00,776 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 54 transitions, 179 flow [2023-11-28 23:35:00,779 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 54 transitions, 176 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-28 23:35:00,782 INFO L231 Difference]: Finished difference. Result has 55 places, 46 transitions, 102 flow [2023-11-28 23:35:00,784 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=102, PETRI_PLACES=55, PETRI_TRANSITIONS=46} [2023-11-28 23:35:00,788 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, -3 predicate places. [2023-11-28 23:35:00,788 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 46 transitions, 102 flow [2023-11-28 23:35:00,789 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:35:00,789 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 23:35:00,789 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-28 23:35:00,797 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65231864-f43e-4150-9960-204c98c4fb59/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-11-28 23:35:00,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65231864-f43e-4150-9960-204c98c4fb59/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-28 23:35:00,990 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-28 23:35:00,991 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:35:00,991 INFO L85 PathProgramCache]: Analyzing trace with hash 12340, now seen corresponding path program 1 times [2023-11-28 23:35:00,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 23:35:00,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2015838219] [2023-11-28 23:35:00,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:35:00,992 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-28 23:35:00,992 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65231864-f43e-4150-9960-204c98c4fb59/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 23:35:00,993 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65231864-f43e-4150-9960-204c98c4fb59/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-28 23:35:00,994 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65231864-f43e-4150-9960-204c98c4fb59/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-11-28 23:35:01,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:35:01,070 INFO L262 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-28 23:35:01,071 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 23:35:01,082 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-28 23:35:01,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 23:35:01,110 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 23:35:01,111 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 23:35:01,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2015838219] [2023-11-28 23:35:01,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2015838219] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:35:01,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:35:01,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-28 23:35:01,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983586383] [2023-11-28 23:35:01,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:35:01,113 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 23:35:01,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 23:35:01,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 23:35:01,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 23:35:01,143 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 53 [2023-11-28 23:35:01,143 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 46 transitions, 102 flow. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:35:01,144 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 23:35:01,144 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 53 [2023-11-28 23:35:01,144 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 23:35:01,505 INFO L124 PetriNetUnfolderBase]: 868/1663 cut-off events. [2023-11-28 23:35:01,505 INFO L125 PetriNetUnfolderBase]: For 45/45 co-relation queries the response was YES. [2023-11-28 23:35:01,509 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3060 conditions, 1663 events. 868/1663 cut-off events. For 45/45 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 11165 event pairs, 676 based on Foata normal form. 1/1502 useless extension candidates. Maximal degree in co-relation 3049. Up to 1028 conditions per place. [2023-11-28 23:35:01,521 INFO L140 encePairwiseOnDemand]: 50/53 looper letters, 28 selfloop transitions, 2 changer transitions 0/53 dead transitions. [2023-11-28 23:35:01,521 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 53 transitions, 176 flow [2023-11-28 23:35:01,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 23:35:01,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-28 23:35:01,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 112 transitions. [2023-11-28 23:35:01,524 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7044025157232704 [2023-11-28 23:35:01,524 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 112 transitions. [2023-11-28 23:35:01,525 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 112 transitions. [2023-11-28 23:35:01,525 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 23:35:01,525 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 112 transitions. [2023-11-28 23:35:01,526 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 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-28 23:35:01,528 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 53.0) internal successors, (212), 4 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:35:01,528 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 53.0) internal successors, (212), 4 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:35:01,528 INFO L175 Difference]: Start difference. First operand has 55 places, 46 transitions, 102 flow. Second operand 3 states and 112 transitions. [2023-11-28 23:35:01,528 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 53 transitions, 176 flow [2023-11-28 23:35:01,531 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 53 transitions, 172 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-28 23:35:01,533 INFO L231 Difference]: Finished difference. Result has 54 places, 45 transitions, 100 flow [2023-11-28 23:35:01,533 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=100, PETRI_PLACES=54, PETRI_TRANSITIONS=45} [2023-11-28 23:35:01,534 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, -4 predicate places. [2023-11-28 23:35:01,534 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 45 transitions, 100 flow [2023-11-28 23:35:01,535 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:35:01,535 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 23:35:01,535 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-28 23:35:01,537 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65231864-f43e-4150-9960-204c98c4fb59/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2023-11-28 23:35:01,737 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65231864-f43e-4150-9960-204c98c4fb59/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-28 23:35:01,738 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-28 23:35:01,738 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:35:01,739 INFO L85 PathProgramCache]: Analyzing trace with hash 367964245, now seen corresponding path program 1 times [2023-11-28 23:35:01,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 23:35:01,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1909665747] [2023-11-28 23:35:01,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:35:01,740 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-28 23:35:01,740 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65231864-f43e-4150-9960-204c98c4fb59/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 23:35:01,741 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65231864-f43e-4150-9960-204c98c4fb59/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-28 23:35:01,742 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65231864-f43e-4150-9960-204c98c4fb59/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-11-28 23:35:01,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:35:01,827 INFO L262 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-28 23:35:01,828 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 23:35:01,833 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-28 23:35:01,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 23:35:01,839 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 23:35:01,840 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 23:35:01,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1909665747] [2023-11-28 23:35:01,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1909665747] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:35:01,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:35:01,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-28 23:35:01,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867615741] [2023-11-28 23:35:01,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:35:01,841 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 23:35:01,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 23:35:01,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 23:35:01,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 23:35:01,865 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 53 [2023-11-28 23:35:01,866 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 45 transitions, 100 flow. Second operand has 3 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-28 23:35:01,866 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 23:35:01,866 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 53 [2023-11-28 23:35:01,866 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 23:35:02,176 INFO L124 PetriNetUnfolderBase]: 870/1662 cut-off events. [2023-11-28 23:35:02,176 INFO L125 PetriNetUnfolderBase]: For 45/45 co-relation queries the response was YES. [2023-11-28 23:35:02,180 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3064 conditions, 1662 events. 870/1662 cut-off events. For 45/45 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 11190 event pairs, 504 based on Foata normal form. 0/1507 useless extension candidates. Maximal degree in co-relation 3053. Up to 1029 conditions per place. [2023-11-28 23:35:02,191 INFO L140 encePairwiseOnDemand]: 50/53 looper letters, 29 selfloop transitions, 2 changer transitions 0/52 dead transitions. [2023-11-28 23:35:02,191 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 52 transitions, 176 flow [2023-11-28 23:35:02,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 23:35:02,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-28 23:35:02,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 110 transitions. [2023-11-28 23:35:02,193 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6918238993710691 [2023-11-28 23:35:02,193 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 110 transitions. [2023-11-28 23:35:02,193 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 110 transitions. [2023-11-28 23:35:02,194 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 23:35:02,194 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 110 transitions. [2023-11-28 23:35:02,195 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:35:02,196 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 53.0) internal successors, (212), 4 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:35:02,196 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 53.0) internal successors, (212), 4 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:35:02,196 INFO L175 Difference]: Start difference. First operand has 54 places, 45 transitions, 100 flow. Second operand 3 states and 110 transitions. [2023-11-28 23:35:02,196 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 52 transitions, 176 flow [2023-11-28 23:35:02,199 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 52 transitions, 172 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-28 23:35:02,200 INFO L231 Difference]: Finished difference. Result has 53 places, 44 transitions, 98 flow [2023-11-28 23:35:02,200 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=98, PETRI_PLACES=53, PETRI_TRANSITIONS=44} [2023-11-28 23:35:02,201 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, -5 predicate places. [2023-11-28 23:35:02,201 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 44 transitions, 98 flow [2023-11-28 23:35:02,202 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 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-28 23:35:02,202 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 23:35:02,202 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-28 23:35:02,204 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65231864-f43e-4150-9960-204c98c4fb59/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2023-11-28 23:35:02,402 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65231864-f43e-4150-9960-204c98c4fb59/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-28 23:35:02,403 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-28 23:35:02,403 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:35:02,403 INFO L85 PathProgramCache]: Analyzing trace with hash 367964246, now seen corresponding path program 1 times [2023-11-28 23:35:02,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 23:35:02,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [222879127] [2023-11-28 23:35:02,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:35:02,404 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-28 23:35:02,405 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65231864-f43e-4150-9960-204c98c4fb59/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 23:35:02,406 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65231864-f43e-4150-9960-204c98c4fb59/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-28 23:35:02,407 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65231864-f43e-4150-9960-204c98c4fb59/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-11-28 23:35:02,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:35:02,480 INFO L262 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-28 23:35:02,482 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 23:35:02,490 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-28 23:35:02,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 23:35:02,501 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 23:35:02,501 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 23:35:02,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [222879127] [2023-11-28 23:35:02,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [222879127] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:35:02,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:35:02,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-28 23:35:02,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173894520] [2023-11-28 23:35:02,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:35:02,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 23:35:02,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 23:35:02,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 23:35:02,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 23:35:02,530 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 53 [2023-11-28 23:35:02,531 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 44 transitions, 98 flow. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:35:02,531 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 23:35:02,531 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 53 [2023-11-28 23:35:02,531 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 23:35:02,832 INFO L124 PetriNetUnfolderBase]: 868/1641 cut-off events. [2023-11-28 23:35:02,832 INFO L125 PetriNetUnfolderBase]: For 47/47 co-relation queries the response was YES. [2023-11-28 23:35:02,836 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3040 conditions, 1641 events. 868/1641 cut-off events. For 47/47 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 10944 event pairs, 689 based on Foata normal form. 3/1490 useless extension candidates. Maximal degree in co-relation 3030. Up to 1024 conditions per place. [2023-11-28 23:35:02,846 INFO L140 encePairwiseOnDemand]: 50/53 looper letters, 28 selfloop transitions, 2 changer transitions 0/51 dead transitions. [2023-11-28 23:35:02,847 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 51 transitions, 172 flow [2023-11-28 23:35:02,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 23:35:02,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-28 23:35:02,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 112 transitions. [2023-11-28 23:35:02,849 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7044025157232704 [2023-11-28 23:35:02,849 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 112 transitions. [2023-11-28 23:35:02,849 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 112 transitions. [2023-11-28 23:35:02,849 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 23:35:02,849 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 112 transitions. [2023-11-28 23:35:02,850 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 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-28 23:35:02,851 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 53.0) internal successors, (212), 4 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:35:02,852 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 53.0) internal successors, (212), 4 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:35:02,852 INFO L175 Difference]: Start difference. First operand has 53 places, 44 transitions, 98 flow. Second operand 3 states and 112 transitions. [2023-11-28 23:35:02,852 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 51 transitions, 172 flow [2023-11-28 23:35:02,854 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 51 transitions, 168 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-28 23:35:02,855 INFO L231 Difference]: Finished difference. Result has 52 places, 43 transitions, 96 flow [2023-11-28 23:35:02,856 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=96, PETRI_PLACES=52, PETRI_TRANSITIONS=43} [2023-11-28 23:35:02,857 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, -6 predicate places. [2023-11-28 23:35:02,857 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 43 transitions, 96 flow [2023-11-28 23:35:02,857 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:35:02,857 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 23:35:02,858 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 23:35:02,860 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65231864-f43e-4150-9960-204c98c4fb59/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2023-11-28 23:35:03,060 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65231864-f43e-4150-9960-204c98c4fb59/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-28 23:35:03,061 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-28 23:35:03,061 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:35:03,061 INFO L85 PathProgramCache]: Analyzing trace with hash 1266655330, now seen corresponding path program 1 times [2023-11-28 23:35:03,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 23:35:03,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [578888483] [2023-11-28 23:35:03,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:35:03,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-28 23:35:03,062 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65231864-f43e-4150-9960-204c98c4fb59/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 23:35:03,062 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65231864-f43e-4150-9960-204c98c4fb59/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-28 23:35:03,063 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65231864-f43e-4150-9960-204c98c4fb59/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-11-28 23:35:03,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:35:03,144 INFO L262 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-28 23:35:03,146 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 23:35:03,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 23:35:03,163 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 23:35:03,163 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 23:35:03,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [578888483] [2023-11-28 23:35:03,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [578888483] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:35:03,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:35:03,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-28 23:35:03,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697060308] [2023-11-28 23:35:03,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:35:03,164 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 23:35:03,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 23:35:03,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 23:35:03,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 23:35:03,166 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 53 [2023-11-28 23:35:03,166 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 43 transitions, 96 flow. Second operand has 3 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-28 23:35:03,166 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 23:35:03,166 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 53 [2023-11-28 23:35:03,166 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 23:35:03,407 INFO L124 PetriNetUnfolderBase]: 678/1284 cut-off events. [2023-11-28 23:35:03,407 INFO L125 PetriNetUnfolderBase]: For 38/38 co-relation queries the response was YES. [2023-11-28 23:35:03,409 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2391 conditions, 1284 events. 678/1284 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 8362 event pairs, 108 based on Foata normal form. 0/1266 useless extension candidates. Maximal degree in co-relation 2381. Up to 832 conditions per place. [2023-11-28 23:35:03,414 INFO L140 encePairwiseOnDemand]: 50/53 looper letters, 31 selfloop transitions, 2 changer transitions 2/56 dead transitions. [2023-11-28 23:35:03,415 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 56 transitions, 196 flow [2023-11-28 23:35:03,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 23:35:03,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-28 23:35:03,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 120 transitions. [2023-11-28 23:35:03,416 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7547169811320755 [2023-11-28 23:35:03,416 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 120 transitions. [2023-11-28 23:35:03,417 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 120 transitions. [2023-11-28 23:35:03,417 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 23:35:03,417 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 120 transitions. [2023-11-28 23:35:03,418 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:35:03,419 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 53.0) internal successors, (212), 4 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:35:03,419 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 53.0) internal successors, (212), 4 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:35:03,419 INFO L175 Difference]: Start difference. First operand has 52 places, 43 transitions, 96 flow. Second operand 3 states and 120 transitions. [2023-11-28 23:35:03,420 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 56 transitions, 196 flow [2023-11-28 23:35:03,421 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 56 transitions, 190 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-28 23:35:03,421 INFO L231 Difference]: Finished difference. Result has 51 places, 41 transitions, 92 flow [2023-11-28 23:35:03,422 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=92, PETRI_PLACES=51, PETRI_TRANSITIONS=41} [2023-11-28 23:35:03,422 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, -7 predicate places. [2023-11-28 23:35:03,423 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 41 transitions, 92 flow [2023-11-28 23:35:03,423 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 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-28 23:35:03,423 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 23:35:03,423 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 23:35:03,426 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65231864-f43e-4150-9960-204c98c4fb59/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-11-28 23:35:03,626 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65231864-f43e-4150-9960-204c98c4fb59/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-28 23:35:03,627 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-28 23:35:03,627 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:35:03,627 INFO L85 PathProgramCache]: Analyzing trace with hash 1266654267, now seen corresponding path program 1 times [2023-11-28 23:35:03,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 23:35:03,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1189661744] [2023-11-28 23:35:03,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:35:03,628 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-28 23:35:03,628 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65231864-f43e-4150-9960-204c98c4fb59/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 23:35:03,629 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65231864-f43e-4150-9960-204c98c4fb59/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-28 23:35:03,630 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65231864-f43e-4150-9960-204c98c4fb59/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-11-28 23:35:03,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:35:03,714 INFO L262 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-28 23:35:03,715 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 23:35:03,721 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-28 23:35:03,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 23:35:03,729 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 23:35:03,729 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 23:35:03,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1189661744] [2023-11-28 23:35:03,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1189661744] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:35:03,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:35:03,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-28 23:35:03,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716975802] [2023-11-28 23:35:03,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:35:03,731 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 23:35:03,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 23:35:03,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 23:35:03,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 23:35:03,761 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 53 [2023-11-28 23:35:03,761 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 41 transitions, 92 flow. Second operand has 3 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-28 23:35:03,761 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 23:35:03,761 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 53 [2023-11-28 23:35:03,762 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 23:35:03,990 INFO L124 PetriNetUnfolderBase]: 620/1208 cut-off events. [2023-11-28 23:35:03,990 INFO L125 PetriNetUnfolderBase]: For 81/81 co-relation queries the response was YES. [2023-11-28 23:35:03,993 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2276 conditions, 1208 events. 620/1208 cut-off events. For 81/81 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 7758 event pairs, 205 based on Foata normal form. 0/1181 useless extension candidates. Maximal degree in co-relation 2265. Up to 811 conditions per place. [2023-11-28 23:35:04,001 INFO L140 encePairwiseOnDemand]: 50/53 looper letters, 26 selfloop transitions, 2 changer transitions 0/47 dead transitions. [2023-11-28 23:35:04,001 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 47 transitions, 162 flow [2023-11-28 23:35:04,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 23:35:04,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-28 23:35:04,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 107 transitions. [2023-11-28 23:35:04,003 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6729559748427673 [2023-11-28 23:35:04,003 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 107 transitions. [2023-11-28 23:35:04,003 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 107 transitions. [2023-11-28 23:35:04,003 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 23:35:04,003 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 107 transitions. [2023-11-28 23:35:04,004 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 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-28 23:35:04,005 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 53.0) internal successors, (212), 4 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:35:04,005 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 53.0) internal successors, (212), 4 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:35:04,006 INFO L175 Difference]: Start difference. First operand has 51 places, 41 transitions, 92 flow. Second operand 3 states and 107 transitions. [2023-11-28 23:35:04,006 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 47 transitions, 162 flow [2023-11-28 23:35:04,007 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 47 transitions, 156 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-28 23:35:04,008 INFO L231 Difference]: Finished difference. Result has 49 places, 40 transitions, 90 flow [2023-11-28 23:35:04,008 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=90, PETRI_PLACES=49, PETRI_TRANSITIONS=40} [2023-11-28 23:35:04,009 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, -9 predicate places. [2023-11-28 23:35:04,009 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 40 transitions, 90 flow [2023-11-28 23:35:04,009 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 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-28 23:35:04,010 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 23:35:04,010 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 23:35:04,013 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65231864-f43e-4150-9960-204c98c4fb59/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2023-11-28 23:35:04,212 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65231864-f43e-4150-9960-204c98c4fb59/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-28 23:35:04,213 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-28 23:35:04,213 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:35:04,214 INFO L85 PathProgramCache]: Analyzing trace with hash 1266654268, now seen corresponding path program 1 times [2023-11-28 23:35:04,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 23:35:04,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [714624917] [2023-11-28 23:35:04,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:35:04,215 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-28 23:35:04,215 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65231864-f43e-4150-9960-204c98c4fb59/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 23:35:04,216 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65231864-f43e-4150-9960-204c98c4fb59/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-28 23:35:04,218 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65231864-f43e-4150-9960-204c98c4fb59/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-11-28 23:35:04,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:35:04,311 INFO L262 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-28 23:35:04,312 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 23:35:04,324 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-28 23:35:04,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 23:35:04,335 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 23:35:04,335 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 23:35:04,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [714624917] [2023-11-28 23:35:04,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [714624917] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:35:04,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:35:04,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-28 23:35:04,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442205795] [2023-11-28 23:35:04,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:35:04,336 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 23:35:04,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 23:35:04,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 23:35:04,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 23:35:04,362 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 53 [2023-11-28 23:35:04,363 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 40 transitions, 90 flow. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:35:04,363 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 23:35:04,363 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 53 [2023-11-28 23:35:04,363 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 23:35:04,582 INFO L124 PetriNetUnfolderBase]: 603/1152 cut-off events. [2023-11-28 23:35:04,582 INFO L125 PetriNetUnfolderBase]: For 45/45 co-relation queries the response was YES. [2023-11-28 23:35:04,585 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2157 conditions, 1152 events. 603/1152 cut-off events. For 45/45 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 7385 event pairs, 313 based on Foata normal form. 12/1134 useless extension candidates. Maximal degree in co-relation 2147. Up to 782 conditions per place. [2023-11-28 23:35:04,593 INFO L140 encePairwiseOnDemand]: 50/53 looper letters, 25 selfloop transitions, 2 changer transitions 0/46 dead transitions. [2023-11-28 23:35:04,593 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 46 transitions, 156 flow [2023-11-28 23:35:04,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 23:35:04,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-28 23:35:04,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 109 transitions. [2023-11-28 23:35:04,594 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6855345911949685 [2023-11-28 23:35:04,594 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 109 transitions. [2023-11-28 23:35:04,594 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 109 transitions. [2023-11-28 23:35:04,595 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 23:35:04,595 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 109 transitions. [2023-11-28 23:35:04,595 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:35:04,596 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 53.0) internal successors, (212), 4 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:35:04,596 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 53.0) internal successors, (212), 4 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:35:04,597 INFO L175 Difference]: Start difference. First operand has 49 places, 40 transitions, 90 flow. Second operand 3 states and 109 transitions. [2023-11-28 23:35:04,597 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 46 transitions, 156 flow [2023-11-28 23:35:04,598 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 46 transitions, 152 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-28 23:35:04,599 INFO L231 Difference]: Finished difference. Result has 48 places, 39 transitions, 88 flow [2023-11-28 23:35:04,599 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=88, PETRI_PLACES=48, PETRI_TRANSITIONS=39} [2023-11-28 23:35:04,600 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, -10 predicate places. [2023-11-28 23:35:04,600 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 39 transitions, 88 flow [2023-11-28 23:35:04,600 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:35:04,600 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 23:35:04,600 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-28 23:35:04,603 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65231864-f43e-4150-9960-204c98c4fb59/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-11-28 23:35:04,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65231864-f43e-4150-9960-204c98c4fb59/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-28 23:35:04,801 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-28 23:35:04,801 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:35:04,801 INFO L85 PathProgramCache]: Analyzing trace with hash -887926121, now seen corresponding path program 1 times [2023-11-28 23:35:04,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 23:35:04,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [139195067] [2023-11-28 23:35:04,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:35:04,802 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-28 23:35:04,802 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65231864-f43e-4150-9960-204c98c4fb59/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 23:35:04,803 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65231864-f43e-4150-9960-204c98c4fb59/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-28 23:35:04,804 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65231864-f43e-4150-9960-204c98c4fb59/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-11-28 23:35:04,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:35:04,922 INFO L262 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-28 23:35:04,924 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 23:35:04,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 23:35:04,957 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 23:35:04,958 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 23:35:04,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [139195067] [2023-11-28 23:35:04,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [139195067] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:35:04,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:35:04,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-28 23:35:04,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258287854] [2023-11-28 23:35:04,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:35:04,959 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-28 23:35:04,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 23:35:04,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-28 23:35:04,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-28 23:35:04,970 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 53 [2023-11-28 23:35:04,971 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 39 transitions, 88 flow. Second operand has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:35:04,971 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 23:35:04,971 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 53 [2023-11-28 23:35:04,971 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 23:35:05,288 INFO L124 PetriNetUnfolderBase]: 1509/2580 cut-off events. [2023-11-28 23:35:05,288 INFO L125 PetriNetUnfolderBase]: For 86/86 co-relation queries the response was YES. [2023-11-28 23:35:05,292 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4995 conditions, 2580 events. 1509/2580 cut-off events. For 86/86 co-relation queries the response was YES. Maximal size of possible extension queue 172. Compared 16220 event pairs, 147 based on Foata normal form. 80/2621 useless extension candidates. Maximal degree in co-relation 4985. Up to 1513 conditions per place. [2023-11-28 23:35:05,303 INFO L140 encePairwiseOnDemand]: 47/53 looper letters, 41 selfloop transitions, 5 changer transitions 1/62 dead transitions. [2023-11-28 23:35:05,303 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 62 transitions, 234 flow [2023-11-28 23:35:05,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-28 23:35:05,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-28 23:35:05,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 145 transitions. [2023-11-28 23:35:05,305 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6839622641509434 [2023-11-28 23:35:05,305 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 145 transitions. [2023-11-28 23:35:05,305 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 145 transitions. [2023-11-28 23:35:05,305 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 23:35:05,305 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 145 transitions. [2023-11-28 23:35:05,306 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 36.25) internal successors, (145), 4 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:35:05,307 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 53.0) internal successors, (265), 5 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:35:05,307 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 53.0) internal successors, (265), 5 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:35:05,307 INFO L175 Difference]: Start difference. First operand has 48 places, 39 transitions, 88 flow. Second operand 4 states and 145 transitions. [2023-11-28 23:35:05,307 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 62 transitions, 234 flow [2023-11-28 23:35:05,309 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 62 transitions, 228 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-28 23:35:05,311 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 118 flow [2023-11-28 23:35:05,311 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=118, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2023-11-28 23:35:05,312 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, -7 predicate places. [2023-11-28 23:35:05,312 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 42 transitions, 118 flow [2023-11-28 23:35:05,312 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:35:05,312 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 23:35:05,312 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 23:35:05,315 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65231864-f43e-4150-9960-204c98c4fb59/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2023-11-28 23:35:05,515 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65231864-f43e-4150-9960-204c98c4fb59/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-28 23:35:05,515 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-28 23:35:05,516 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:35:05,516 INFO L85 PathProgramCache]: Analyzing trace with hash -2056334676, now seen corresponding path program 1 times [2023-11-28 23:35:05,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 23:35:05,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1303437718] [2023-11-28 23:35:05,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:35:05,517 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-28 23:35:05,517 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65231864-f43e-4150-9960-204c98c4fb59/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 23:35:05,518 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65231864-f43e-4150-9960-204c98c4fb59/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-28 23:35:05,522 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65231864-f43e-4150-9960-204c98c4fb59/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-11-28 23:35:05,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:35:05,655 INFO L262 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-28 23:35:05,658 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 23:35:05,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 23:35:05,710 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 23:35:05,711 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 23:35:05,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1303437718] [2023-11-28 23:35:05,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1303437718] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:35:05,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:35:05,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-28 23:35:05,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254955291] [2023-11-28 23:35:05,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:35:05,712 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-28 23:35:05,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 23:35:05,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-28 23:35:05,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-28 23:35:05,725 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 53 [2023-11-28 23:35:05,726 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 42 transitions, 118 flow. Second operand has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 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-28 23:35:05,726 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 23:35:05,726 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 53 [2023-11-28 23:35:05,726 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 23:35:06,056 INFO L124 PetriNetUnfolderBase]: 945/1652 cut-off events. [2023-11-28 23:35:06,057 INFO L125 PetriNetUnfolderBase]: For 388/388 co-relation queries the response was YES. [2023-11-28 23:35:06,061 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3690 conditions, 1652 events. 945/1652 cut-off events. For 388/388 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 9153 event pairs, 73 based on Foata normal form. 68/1690 useless extension candidates. Maximal degree in co-relation 3677. Up to 729 conditions per place. [2023-11-28 23:35:06,068 INFO L140 encePairwiseOnDemand]: 47/53 looper letters, 51 selfloop transitions, 8 changer transitions 1/75 dead transitions. [2023-11-28 23:35:06,068 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 75 transitions, 325 flow [2023-11-28 23:35:06,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-28 23:35:06,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-28 23:35:06,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 182 transitions. [2023-11-28 23:35:06,070 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6867924528301886 [2023-11-28 23:35:06,070 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 182 transitions. [2023-11-28 23:35:06,070 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 182 transitions. [2023-11-28 23:35:06,070 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 23:35:06,071 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 182 transitions. [2023-11-28 23:35:06,072 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 36.4) internal successors, (182), 5 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:35:06,073 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 53.0) internal successors, (318), 6 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:35:06,073 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 53.0) internal successors, (318), 6 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:35:06,073 INFO L175 Difference]: Start difference. First operand has 51 places, 42 transitions, 118 flow. Second operand 5 states and 182 transitions. [2023-11-28 23:35:06,073 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 75 transitions, 325 flow [2023-11-28 23:35:06,075 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 75 transitions, 315 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-11-28 23:35:06,077 INFO L231 Difference]: Finished difference. Result has 55 places, 45 transitions, 158 flow [2023-11-28 23:35:06,077 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=158, PETRI_PLACES=55, PETRI_TRANSITIONS=45} [2023-11-28 23:35:06,078 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, -3 predicate places. [2023-11-28 23:35:06,078 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 45 transitions, 158 flow [2023-11-28 23:35:06,079 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 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-28 23:35:06,079 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 23:35:06,079 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 23:35:06,082 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65231864-f43e-4150-9960-204c98c4fb59/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2023-11-28 23:35:06,281 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65231864-f43e-4150-9960-204c98c4fb59/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-28 23:35:06,281 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-28 23:35:06,282 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:35:06,282 INFO L85 PathProgramCache]: Analyzing trace with hash -456400545, now seen corresponding path program 1 times [2023-11-28 23:35:06,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 23:35:06,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [655117300] [2023-11-28 23:35:06,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:35:06,283 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-28 23:35:06,283 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65231864-f43e-4150-9960-204c98c4fb59/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 23:35:06,284 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65231864-f43e-4150-9960-204c98c4fb59/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-28 23:35:06,285 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65231864-f43e-4150-9960-204c98c4fb59/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-11-28 23:35:06,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:35:06,412 INFO L262 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-28 23:35:06,414 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 23:35:06,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 23:35:06,497 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 23:35:06,498 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 23:35:06,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [655117300] [2023-11-28 23:35:06,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [655117300] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:35:06,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:35:06,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-28 23:35:06,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739838085] [2023-11-28 23:35:06,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:35:06,499 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-28 23:35:06,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 23:35:06,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-28 23:35:06,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-28 23:35:06,522 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 53 [2023-11-28 23:35:06,523 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 45 transitions, 158 flow. Second operand has 6 states, 6 states have (on average 27.0) internal successors, (162), 6 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:35:06,523 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 23:35:06,523 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 53 [2023-11-28 23:35:06,523 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 23:35:06,811 INFO L124 PetriNetUnfolderBase]: 501/868 cut-off events. [2023-11-28 23:35:06,811 INFO L125 PetriNetUnfolderBase]: For 677/677 co-relation queries the response was YES. [2023-11-28 23:35:06,813 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2220 conditions, 868 events. 501/868 cut-off events. For 677/677 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3945 event pairs, 59 based on Foata normal form. 36/877 useless extension candidates. Maximal degree in co-relation 2205. Up to 268 conditions per place. [2023-11-28 23:35:06,817 INFO L140 encePairwiseOnDemand]: 47/53 looper letters, 45 selfloop transitions, 11 changer transitions 1/72 dead transitions. [2023-11-28 23:35:06,817 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 72 transitions, 336 flow [2023-11-28 23:35:06,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-28 23:35:06,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-28 23:35:06,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 203 transitions. [2023-11-28 23:35:06,819 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6383647798742138 [2023-11-28 23:35:06,819 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 203 transitions. [2023-11-28 23:35:06,819 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 203 transitions. [2023-11-28 23:35:06,820 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 23:35:06,820 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 203 transitions. [2023-11-28 23:35:06,821 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 33.833333333333336) internal successors, (203), 6 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:35:06,822 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 53.0) internal successors, (371), 7 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:35:06,822 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 53.0) internal successors, (371), 7 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:35:06,822 INFO L175 Difference]: Start difference. First operand has 55 places, 45 transitions, 158 flow. Second operand 6 states and 203 transitions. [2023-11-28 23:35:06,822 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 72 transitions, 336 flow [2023-11-28 23:35:06,825 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 72 transitions, 311 flow, removed 4 selfloop flow, removed 4 redundant places. [2023-11-28 23:35:06,826 INFO L231 Difference]: Finished difference. Result has 58 places, 45 transitions, 172 flow [2023-11-28 23:35:06,827 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=172, PETRI_PLACES=58, PETRI_TRANSITIONS=45} [2023-11-28 23:35:06,827 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 0 predicate places. [2023-11-28 23:35:06,828 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 45 transitions, 172 flow [2023-11-28 23:35:06,828 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.0) internal successors, (162), 6 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:35:06,828 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 23:35:06,828 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 23:35:06,832 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65231864-f43e-4150-9960-204c98c4fb59/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2023-11-28 23:35:07,031 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65231864-f43e-4150-9960-204c98c4fb59/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-28 23:35:07,031 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-28 23:35:07,032 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:35:07,032 INFO L85 PathProgramCache]: Analyzing trace with hash 174204849, now seen corresponding path program 1 times [2023-11-28 23:35:07,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 23:35:07,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [926822618] [2023-11-28 23:35:07,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:35:07,032 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-28 23:35:07,033 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65231864-f43e-4150-9960-204c98c4fb59/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 23:35:07,033 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65231864-f43e-4150-9960-204c98c4fb59/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-28 23:35:07,034 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65231864-f43e-4150-9960-204c98c4fb59/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-11-28 23:35:07,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:35:07,180 INFO L262 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 14 conjunts are in the unsatisfiable core [2023-11-28 23:35:07,183 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 23:35:07,687 WARN L876 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~#t1804~0#1.base_47| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#t1805~0#1.base_57| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#t1806~0#1.base_47| (_ BitVec 32))) (let ((.cse0 (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t1804~0#1.base_47| (_ bv1 1)))) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t1804~0#1.base_47|) (_ bv0 1)) (= (_ bv0 1) (select .cse0 |v_ULTIMATE.start_main_~#t1805~0#1.base_57|)) (= (_ bv0 1) (select (store .cse0 |v_ULTIMATE.start_main_~#t1805~0#1.base_57| (_ bv1 1)) |v_ULTIMATE.start_main_~#t1806~0#1.base_47|)) (= (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t1804~0#1.base_47| (_ bv0 1)) |v_ULTIMATE.start_main_~#t1805~0#1.base_57| (_ bv0 1)) |v_ULTIMATE.start_main_~#t1806~0#1.base_47| (_ bv0 1)) |c_#valid|)))) is different from true [2023-11-28 23:35:07,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 23:35:07,688 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 23:35:07,688 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 23:35:07,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [926822618] [2023-11-28 23:35:07,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [926822618] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:35:07,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:35:07,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-28 23:35:07,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370865830] [2023-11-28 23:35:07,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:35:07,689 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-28 23:35:07,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 23:35:07,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-28 23:35:07,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=14, Unknown=1, NotChecked=6, Total=30 [2023-11-28 23:35:07,759 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 53 [2023-11-28 23:35:07,759 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 45 transitions, 172 flow. Second operand has 6 states, 6 states have (on average 21.333333333333332) internal successors, (128), 6 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:35:07,759 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 23:35:07,759 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 53 [2023-11-28 23:35:07,760 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 23:35:07,996 INFO L124 PetriNetUnfolderBase]: 296/590 cut-off events. [2023-11-28 23:35:07,996 INFO L125 PetriNetUnfolderBase]: For 195/200 co-relation queries the response was YES. [2023-11-28 23:35:07,998 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1315 conditions, 590 events. 296/590 cut-off events. For 195/200 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 2771 event pairs, 124 based on Foata normal form. 8/555 useless extension candidates. Maximal degree in co-relation 1298. Up to 403 conditions per place. [2023-11-28 23:35:08,001 INFO L140 encePairwiseOnDemand]: 45/53 looper letters, 30 selfloop transitions, 7 changer transitions 0/58 dead transitions. [2023-11-28 23:35:08,001 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 58 transitions, 272 flow [2023-11-28 23:35:08,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-28 23:35:08,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-28 23:35:08,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 146 transitions. [2023-11-28 23:35:08,003 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4591194968553459 [2023-11-28 23:35:08,003 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 146 transitions. [2023-11-28 23:35:08,003 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 146 transitions. [2023-11-28 23:35:08,003 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 23:35:08,003 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 146 transitions. [2023-11-28 23:35:08,004 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 24.333333333333332) internal successors, (146), 6 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:35:08,005 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 53.0) internal successors, (371), 7 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:35:08,005 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 53.0) internal successors, (371), 7 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:35:08,005 INFO L175 Difference]: Start difference. First operand has 58 places, 45 transitions, 172 flow. Second operand 6 states and 146 transitions. [2023-11-28 23:35:08,005 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 58 transitions, 272 flow [2023-11-28 23:35:08,007 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 58 transitions, 216 flow, removed 10 selfloop flow, removed 8 redundant places. [2023-11-28 23:35:08,008 INFO L231 Difference]: Finished difference. Result has 56 places, 48 transitions, 148 flow [2023-11-28 23:35:08,008 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=148, PETRI_PLACES=56, PETRI_TRANSITIONS=48} [2023-11-28 23:35:08,009 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, -2 predicate places. [2023-11-28 23:35:08,009 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 48 transitions, 148 flow [2023-11-28 23:35:08,009 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.333333333333332) internal successors, (128), 6 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:35:08,009 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 23:35:08,010 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 23:35:08,018 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65231864-f43e-4150-9960-204c98c4fb59/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2023-11-28 23:35:08,210 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65231864-f43e-4150-9960-204c98c4fb59/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-28 23:35:08,210 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-28 23:35:08,210 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:35:08,210 INFO L85 PathProgramCache]: Analyzing trace with hash -222572746, now seen corresponding path program 1 times [2023-11-28 23:35:08,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 23:35:08,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [593222053] [2023-11-28 23:35:08,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:35:08,211 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-28 23:35:08,211 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65231864-f43e-4150-9960-204c98c4fb59/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 23:35:08,212 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65231864-f43e-4150-9960-204c98c4fb59/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-28 23:35:08,213 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65231864-f43e-4150-9960-204c98c4fb59/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2023-11-28 23:35:08,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:35:08,352 INFO L262 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-28 23:35:08,355 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 23:35:08,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 23:35:08,586 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 23:35:08,586 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 23:35:08,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [593222053] [2023-11-28 23:35:08,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [593222053] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:35:08,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:35:08,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-28 23:35:08,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194751680] [2023-11-28 23:35:08,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:35:08,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-28 23:35:08,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 23:35:08,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-28 23:35:08,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-28 23:35:08,608 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 53 [2023-11-28 23:35:08,609 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 48 transitions, 148 flow. Second operand has 6 states, 6 states have (on average 28.166666666666668) internal successors, (169), 6 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-28 23:35:08,609 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 23:35:08,609 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 53 [2023-11-28 23:35:08,609 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 23:35:08,883 INFO L124 PetriNetUnfolderBase]: 850/1604 cut-off events. [2023-11-28 23:35:08,883 INFO L125 PetriNetUnfolderBase]: For 428/456 co-relation queries the response was YES. [2023-11-28 23:35:08,886 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3712 conditions, 1604 events. 850/1604 cut-off events. For 428/456 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 8970 event pairs, 205 based on Foata normal form. 8/1558 useless extension candidates. Maximal degree in co-relation 3699. Up to 576 conditions per place. [2023-11-28 23:35:08,893 INFO L140 encePairwiseOnDemand]: 45/53 looper letters, 54 selfloop transitions, 7 changer transitions 0/83 dead transitions. [2023-11-28 23:35:08,893 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 83 transitions, 380 flow [2023-11-28 23:35:08,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-28 23:35:08,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-28 23:35:08,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 206 transitions. [2023-11-28 23:35:08,895 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6477987421383647 [2023-11-28 23:35:08,895 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 206 transitions. [2023-11-28 23:35:08,895 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 206 transitions. [2023-11-28 23:35:08,895 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 23:35:08,896 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 206 transitions. [2023-11-28 23:35:08,896 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 34.333333333333336) internal successors, (206), 6 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:35:08,897 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 53.0) internal successors, (371), 7 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:35:08,898 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 53.0) internal successors, (371), 7 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:35:08,898 INFO L175 Difference]: Start difference. First operand has 56 places, 48 transitions, 148 flow. Second operand 6 states and 206 transitions. [2023-11-28 23:35:08,898 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 83 transitions, 380 flow [2023-11-28 23:35:08,900 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 83 transitions, 362 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-28 23:35:08,901 INFO L231 Difference]: Finished difference. Result has 61 places, 54 transitions, 192 flow [2023-11-28 23:35:08,901 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=192, PETRI_PLACES=61, PETRI_TRANSITIONS=54} [2023-11-28 23:35:08,902 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 3 predicate places. [2023-11-28 23:35:08,902 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 54 transitions, 192 flow [2023-11-28 23:35:08,903 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.166666666666668) internal successors, (169), 6 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-28 23:35:08,903 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 23:35:08,903 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 23:35:08,906 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65231864-f43e-4150-9960-204c98c4fb59/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2023-11-28 23:35:09,105 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65231864-f43e-4150-9960-204c98c4fb59/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-28 23:35:09,105 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-28 23:35:09,106 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:35:09,106 INFO L85 PathProgramCache]: Analyzing trace with hash 2035782192, now seen corresponding path program 2 times [2023-11-28 23:35:09,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 23:35:09,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [559520981] [2023-11-28 23:35:09,106 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-28 23:35:09,106 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-28 23:35:09,106 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65231864-f43e-4150-9960-204c98c4fb59/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 23:35:09,107 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65231864-f43e-4150-9960-204c98c4fb59/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-28 23:35:09,113 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65231864-f43e-4150-9960-204c98c4fb59/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2023-11-28 23:35:09,230 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-28 23:35:09,230 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-28 23:35:09,236 INFO L262 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 13 conjunts are in the unsatisfiable core [2023-11-28 23:35:09,239 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 23:35:09,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 23:35:09,575 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 23:35:09,575 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 23:35:09,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [559520981] [2023-11-28 23:35:09,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [559520981] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:35:09,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:35:09,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-28 23:35:09,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994242398] [2023-11-28 23:35:09,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:35:09,576 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-28 23:35:09,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 23:35:09,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-28 23:35:09,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-28 23:35:09,585 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 53 [2023-11-28 23:35:09,586 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 54 transitions, 192 flow. Second operand has 8 states, 8 states have (on average 29.125) internal successors, (233), 8 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:35:09,586 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 23:35:09,586 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 53 [2023-11-28 23:35:09,586 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 23:35:10,009 INFO L124 PetriNetUnfolderBase]: 1196/2291 cut-off events. [2023-11-28 23:35:10,009 INFO L125 PetriNetUnfolderBase]: For 810/909 co-relation queries the response was YES. [2023-11-28 23:35:10,018 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5593 conditions, 2291 events. 1196/2291 cut-off events. For 810/909 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 14631 event pairs, 437 based on Foata normal form. 8/2092 useless extension candidates. Maximal degree in co-relation 5576. Up to 1010 conditions per place. [2023-11-28 23:35:10,028 INFO L140 encePairwiseOnDemand]: 45/53 looper letters, 46 selfloop transitions, 10 changer transitions 0/83 dead transitions. [2023-11-28 23:35:10,028 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 83 transitions, 412 flow [2023-11-28 23:35:10,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-28 23:35:10,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-28 23:35:10,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 207 transitions. [2023-11-28 23:35:10,030 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6509433962264151 [2023-11-28 23:35:10,030 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 207 transitions. [2023-11-28 23:35:10,030 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 207 transitions. [2023-11-28 23:35:10,030 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 23:35:10,030 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 207 transitions. [2023-11-28 23:35:10,031 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 34.5) internal successors, (207), 6 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:35:10,032 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 53.0) internal successors, (371), 7 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:35:10,032 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 53.0) internal successors, (371), 7 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:35:10,032 INFO L175 Difference]: Start difference. First operand has 61 places, 54 transitions, 192 flow. Second operand 6 states and 207 transitions. [2023-11-28 23:35:10,032 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 83 transitions, 412 flow [2023-11-28 23:35:10,036 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 83 transitions, 410 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-28 23:35:10,037 INFO L231 Difference]: Finished difference. Result has 68 places, 62 transitions, 281 flow [2023-11-28 23:35:10,038 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=281, PETRI_PLACES=68, PETRI_TRANSITIONS=62} [2023-11-28 23:35:10,038 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 10 predicate places. [2023-11-28 23:35:10,039 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 62 transitions, 281 flow [2023-11-28 23:35:10,039 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 29.125) internal successors, (233), 8 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:35:10,039 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 23:35:10,039 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 23:35:10,043 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65231864-f43e-4150-9960-204c98c4fb59/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2023-11-28 23:35:10,239 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65231864-f43e-4150-9960-204c98c4fb59/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-28 23:35:10,240 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-28 23:35:10,240 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:35:10,240 INFO L85 PathProgramCache]: Analyzing trace with hash -26223442, now seen corresponding path program 3 times [2023-11-28 23:35:10,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 23:35:10,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1086557299] [2023-11-28 23:35:10,240 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-28 23:35:10,240 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-28 23:35:10,241 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65231864-f43e-4150-9960-204c98c4fb59/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 23:35:10,241 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65231864-f43e-4150-9960-204c98c4fb59/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-28 23:35:10,242 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65231864-f43e-4150-9960-204c98c4fb59/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2023-11-28 23:35:10,348 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-11-28 23:35:10,348 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-28 23:35:10,352 INFO L262 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-28 23:35:10,354 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 23:35:10,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 23:35:10,408 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 23:35:10,409 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 23:35:10,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1086557299] [2023-11-28 23:35:10,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1086557299] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:35:10,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:35:10,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-28 23:35:10,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133791302] [2023-11-28 23:35:10,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:35:10,410 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-28 23:35:10,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 23:35:10,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-28 23:35:10,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-28 23:35:10,428 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 53 [2023-11-28 23:35:10,428 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 62 transitions, 281 flow. Second operand has 6 states, 6 states have (on average 28.166666666666668) internal successors, (169), 6 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-28 23:35:10,429 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 23:35:10,429 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 53 [2023-11-28 23:35:10,429 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 23:35:11,268 INFO L124 PetriNetUnfolderBase]: 3008/5593 cut-off events. [2023-11-28 23:35:11,268 INFO L125 PetriNetUnfolderBase]: For 3560/3824 co-relation queries the response was YES. [2023-11-28 23:35:11,283 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15324 conditions, 5593 events. 3008/5593 cut-off events. For 3560/3824 co-relation queries the response was YES. Maximal size of possible extension queue 377. Compared 40211 event pairs, 1139 based on Foata normal form. 32/5402 useless extension candidates. Maximal degree in co-relation 15303. Up to 2207 conditions per place. [2023-11-28 23:35:11,304 INFO L140 encePairwiseOnDemand]: 46/53 looper letters, 101 selfloop transitions, 29 changer transitions 0/152 dead transitions. [2023-11-28 23:35:11,304 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 152 transitions, 979 flow [2023-11-28 23:35:11,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-28 23:35:11,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-11-28 23:35:11,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 362 transitions. [2023-11-28 23:35:11,307 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6209262435677531 [2023-11-28 23:35:11,307 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 362 transitions. [2023-11-28 23:35:11,307 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 362 transitions. [2023-11-28 23:35:11,307 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 23:35:11,308 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 362 transitions. [2023-11-28 23:35:11,309 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 32.90909090909091) internal successors, (362), 11 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:35:11,310 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 53.0) internal successors, (636), 12 states have internal predecessors, (636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:35:11,311 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 53.0) internal successors, (636), 12 states have internal predecessors, (636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:35:11,311 INFO L175 Difference]: Start difference. First operand has 68 places, 62 transitions, 281 flow. Second operand 11 states and 362 transitions. [2023-11-28 23:35:11,311 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 152 transitions, 979 flow [2023-11-28 23:35:11,327 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 152 transitions, 968 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-28 23:35:11,329 INFO L231 Difference]: Finished difference. Result has 81 places, 88 transitions, 606 flow [2023-11-28 23:35:11,330 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=276, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=606, PETRI_PLACES=81, PETRI_TRANSITIONS=88} [2023-11-28 23:35:11,330 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 23 predicate places. [2023-11-28 23:35:11,330 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 88 transitions, 606 flow [2023-11-28 23:35:11,331 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.166666666666668) internal successors, (169), 6 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-28 23:35:11,331 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 23:35:11,331 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 23:35:11,334 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65231864-f43e-4150-9960-204c98c4fb59/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2023-11-28 23:35:11,531 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65231864-f43e-4150-9960-204c98c4fb59/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-28 23:35:11,531 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-28 23:35:11,532 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:35:11,532 INFO L85 PathProgramCache]: Analyzing trace with hash -1814012050, now seen corresponding path program 4 times [2023-11-28 23:35:11,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 23:35:11,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [723929035] [2023-11-28 23:35:11,532 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-28 23:35:11,533 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-28 23:35:11,533 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65231864-f43e-4150-9960-204c98c4fb59/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 23:35:11,534 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65231864-f43e-4150-9960-204c98c4fb59/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-28 23:35:11,535 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65231864-f43e-4150-9960-204c98c4fb59/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2023-11-28 23:35:11,655 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-28 23:35:11,655 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-28 23:35:11,659 INFO L262 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 16 conjunts are in the unsatisfiable core [2023-11-28 23:35:11,661 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 23:35:12,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 23:35:12,098 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 23:35:12,098 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 23:35:12,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [723929035] [2023-11-28 23:35:12,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [723929035] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:35:12,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:35:12,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-28 23:35:12,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784535316] [2023-11-28 23:35:12,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:35:12,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-28 23:35:12,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 23:35:12,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-28 23:35:12,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-11-28 23:35:12,116 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 53 [2023-11-28 23:35:12,117 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 88 transitions, 606 flow. Second operand has 9 states, 9 states have (on average 28.88888888888889) internal successors, (260), 9 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:35:12,117 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 23:35:12,117 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 53 [2023-11-28 23:35:12,117 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 23:35:12,964 INFO L124 PetriNetUnfolderBase]: 3535/6683 cut-off events. [2023-11-28 23:35:12,964 INFO L125 PetriNetUnfolderBase]: For 6310/6740 co-relation queries the response was YES. [2023-11-28 23:35:12,981 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18702 conditions, 6683 events. 3535/6683 cut-off events. For 6310/6740 co-relation queries the response was YES. Maximal size of possible extension queue 471. Compared 51184 event pairs, 1309 based on Foata normal form. 30/6268 useless extension candidates. Maximal degree in co-relation 18677. Up to 2969 conditions per place. [2023-11-28 23:35:13,008 INFO L140 encePairwiseOnDemand]: 46/53 looper letters, 59 selfloop transitions, 40 changer transitions 0/128 dead transitions. [2023-11-28 23:35:13,008 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 128 transitions, 1062 flow [2023-11-28 23:35:13,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-28 23:35:13,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-28 23:35:13,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 207 transitions. [2023-11-28 23:35:13,010 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6509433962264151 [2023-11-28 23:35:13,010 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 207 transitions. [2023-11-28 23:35:13,010 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 207 transitions. [2023-11-28 23:35:13,010 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 23:35:13,010 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 207 transitions. [2023-11-28 23:35:13,011 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 34.5) internal successors, (207), 6 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:35:13,012 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 53.0) internal successors, (371), 7 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:35:13,012 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 53.0) internal successors, (371), 7 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:35:13,013 INFO L175 Difference]: Start difference. First operand has 81 places, 88 transitions, 606 flow. Second operand 6 states and 207 transitions. [2023-11-28 23:35:13,013 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 128 transitions, 1062 flow [2023-11-28 23:35:13,057 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 128 transitions, 1022 flow, removed 20 selfloop flow, removed 0 redundant places. [2023-11-28 23:35:13,060 INFO L231 Difference]: Finished difference. Result has 89 places, 107 transitions, 949 flow [2023-11-28 23:35:13,060 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=578, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=949, PETRI_PLACES=89, PETRI_TRANSITIONS=107} [2023-11-28 23:35:13,060 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 31 predicate places. [2023-11-28 23:35:13,061 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 107 transitions, 949 flow [2023-11-28 23:35:13,061 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 28.88888888888889) internal successors, (260), 9 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:35:13,061 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 23:35:13,061 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 23:35:13,065 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65231864-f43e-4150-9960-204c98c4fb59/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2023-11-28 23:35:13,262 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65231864-f43e-4150-9960-204c98c4fb59/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-28 23:35:13,262 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-28 23:35:13,262 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:35:13,262 INFO L85 PathProgramCache]: Analyzing trace with hash 2015524830, now seen corresponding path program 5 times [2023-11-28 23:35:13,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 23:35:13,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [661389181] [2023-11-28 23:35:13,263 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-28 23:35:13,263 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-28 23:35:13,263 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65231864-f43e-4150-9960-204c98c4fb59/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 23:35:13,264 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65231864-f43e-4150-9960-204c98c4fb59/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-28 23:35:13,265 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65231864-f43e-4150-9960-204c98c4fb59/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2023-11-28 23:35:13,421 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-28 23:35:13,421 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-11-28 23:35:13,421 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-28 23:35:13,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-28 23:35:13,552 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-11-28 23:35:13,552 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-28 23:35:13,553 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2023-11-28 23:35:13,555 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining) [2023-11-28 23:35:13,555 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2023-11-28 23:35:13,555 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2023-11-28 23:35:13,556 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2023-11-28 23:35:13,556 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2023-11-28 23:35:13,556 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2023-11-28 23:35:13,556 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2023-11-28 23:35:13,556 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining) [2023-11-28 23:35:13,557 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining) [2023-11-28 23:35:13,557 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2023-11-28 23:35:13,557 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2023-11-28 23:35:13,557 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2023-11-28 23:35:13,561 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65231864-f43e-4150-9960-204c98c4fb59/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Ended with exit code 0 [2023-11-28 23:35:13,761 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65231864-f43e-4150-9960-204c98c4fb59/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-28 23:35:13,762 INFO L445 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 23:35:13,767 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-28 23:35:13,767 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-28 23:35:13,824 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre3 could not be translated [2023-11-28 23:35:13,826 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-28 23:35:13,828 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-28 23:35:13,838 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-28 23:35:13,839 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-28 23:35:13,851 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 11:35:13 BasicIcfg [2023-11-28 23:35:13,851 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-28 23:35:13,852 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-28 23:35:13,852 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-28 23:35:13,852 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-28 23:35:13,853 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:34:59" (3/4) ... [2023-11-28 23:35:13,855 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-28 23:35:13,856 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-28 23:35:13,856 INFO L158 Benchmark]: Toolchain (without parser) took 15579.62ms. Allocated memory was 67.1MB in the beginning and 247.5MB in the end (delta: 180.4MB). Free memory was 42.2MB in the beginning and 107.3MB in the end (delta: -65.1MB). Peak memory consumption was 117.3MB. Max. memory is 16.1GB. [2023-11-28 23:35:13,857 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 67.1MB. Free memory was 43.2MB in the beginning and 43.1MB in the end (delta: 92.4kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-28 23:35:13,857 INFO L158 Benchmark]: CACSL2BoogieTranslator took 552.44ms. Allocated memory was 67.1MB in the beginning and 90.2MB in the end (delta: 23.1MB). Free memory was 42.1MB in the beginning and 56.5MB in the end (delta: -14.4MB). Peak memory consumption was 13.8MB. Max. memory is 16.1GB. [2023-11-28 23:35:13,857 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.10ms. Allocated memory is still 90.2MB. Free memory was 56.5MB in the beginning and 53.6MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-28 23:35:13,858 INFO L158 Benchmark]: Boogie Preprocessor took 61.98ms. Allocated memory is still 90.2MB. Free memory was 53.6MB in the beginning and 50.1MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-28 23:35:13,858 INFO L158 Benchmark]: RCFGBuilder took 786.21ms. Allocated memory is still 90.2MB. Free memory was 50.1MB in the beginning and 40.8MB in the end (delta: 9.3MB). Peak memory consumption was 18.4MB. Max. memory is 16.1GB. [2023-11-28 23:35:13,859 INFO L158 Benchmark]: TraceAbstraction took 14110.14ms. Allocated memory was 90.2MB in the beginning and 247.5MB in the end (delta: 157.3MB). Free memory was 40.3MB in the beginning and 107.3MB in the end (delta: -67.0MB). Peak memory consumption was 89.2MB. Max. memory is 16.1GB. [2023-11-28 23:35:13,859 INFO L158 Benchmark]: Witness Printer took 3.60ms. Allocated memory is still 247.5MB. Free memory is still 107.3MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-28 23:35:13,861 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.29ms. Allocated memory is still 67.1MB. Free memory was 43.2MB in the beginning and 43.1MB in the end (delta: 92.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 552.44ms. Allocated memory was 67.1MB in the beginning and 90.2MB in the end (delta: 23.1MB). Free memory was 42.1MB in the beginning and 56.5MB in the end (delta: -14.4MB). Peak memory consumption was 13.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 58.10ms. Allocated memory is still 90.2MB. Free memory was 56.5MB in the beginning and 53.6MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 61.98ms. Allocated memory is still 90.2MB. Free memory was 53.6MB in the beginning and 50.1MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 786.21ms. Allocated memory is still 90.2MB. Free memory was 50.1MB in the beginning and 40.8MB in the end (delta: 9.3MB). Peak memory consumption was 18.4MB. Max. memory is 16.1GB. * TraceAbstraction took 14110.14ms. Allocated memory was 90.2MB in the beginning and 247.5MB in the end (delta: 157.3MB). Free memory was 40.3MB in the beginning and 107.3MB in the end (delta: -67.0MB). Peak memory consumption was 89.2MB. Max. memory is 16.1GB. * Witness Printer took 3.60ms. Allocated memory is still 247.5MB. Free memory is still 107.3MB. 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~pre3 could not be translated - 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: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p2_EAX = 0; [L714] 0 _Bool main$tmp_guard0; [L715] 0 _Bool main$tmp_guard1; [L717] 0 int x = 0; [L718] 0 _Bool x$flush_delayed; [L719] 0 int x$mem_tmp; [L720] 0 _Bool x$r_buff0_thd0; [L721] 0 _Bool x$r_buff0_thd1; [L722] 0 _Bool x$r_buff0_thd2; [L723] 0 _Bool x$r_buff0_thd3; [L724] 0 _Bool x$r_buff1_thd0; [L725] 0 _Bool x$r_buff1_thd1; [L726] 0 _Bool x$r_buff1_thd2; [L727] 0 _Bool x$r_buff1_thd3; [L728] 0 _Bool x$read_delayed; [L729] 0 int *x$read_delayed_var; [L730] 0 int x$w_buff0; [L731] 0 _Bool x$w_buff0_used; [L732] 0 int x$w_buff1; [L733] 0 _Bool x$w_buff1_used; [L735] 0 int y = 0; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L818] 0 pthread_t t1804; [L819] FCALL, FORK 0 pthread_create(&t1804, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1804={7:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L820] 0 pthread_t t1805; [L821] FCALL, FORK 0 pthread_create(&t1805, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1804={7:0}, t1805={6:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L761] 2 x$w_buff1 = x$w_buff0 [L762] 2 x$w_buff0 = 2 [L763] 2 x$w_buff1_used = x$w_buff0_used [L764] 2 x$w_buff0_used = (_Bool)1 [L765] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L765] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L766] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L767] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L768] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L769] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L770] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L822] 0 pthread_t t1806; [L823] FCALL, FORK 0 pthread_create(&t1806, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1804={7:0}, t1805={6:0}, t1806={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L773] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L790] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L793] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L741] 1 __unbuffered_p0_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L744] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L747] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L748] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L749] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L750] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L751] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L776] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L777] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L778] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L779] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L780] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L754] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L783] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L796] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L797] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L798] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L799] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L800] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L803] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L825] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1804={7:0}, t1805={6:0}, t1806={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L827] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L827] RET 0 assume_abort_if_not(main$tmp_guard0) [L829] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L830] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L831] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L832] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L833] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1804={7:0}, t1805={6:0}, t1806={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L836] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L837] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L838] 0 x$flush_delayed = weak$$choice2 [L839] 0 x$mem_tmp = x [L840] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L841] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L842] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L843] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L844] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L845] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L846] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L847] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p0_EAX == 2 && __unbuffered_p2_EAX == 1) [L848] 0 x = x$flush_delayed ? x$mem_tmp : x [L849] 0 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1804={7:0}, t1805={6:0}, t1806={3:0}, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L851] 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=3, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L17] 0 __assert_fail ("0", "safe001_power.opt_pso.oepc_pso.opt_rmo.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, 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: -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: 816]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 821]: 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: 819]: 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: 823]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 77 locations, 13 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: 13.9s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 6.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 593 SdHoareTripleChecker+Valid, 2.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 486 mSDsluCounter, 159 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 56 IncrementalHoareTripleChecker+Unchecked, 115 mSDsCounter, 54 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1528 IncrementalHoareTripleChecker+Invalid, 1638 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 54 mSolverCounterUnsat, 44 mSDtfsCounter, 1528 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 277 GetRequests, 216 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=949occurred in iteration=15, InterpolantAutomatonStates: 71, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 305 NumberOfCodeBlocks, 305 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 257 ConstructedInterpolants, 1 QuantifiedInterpolants, 2093 SizeOfPredicates, 15 NumberOfNonLiveVariables, 1790 ConjunctsInSsa, 93 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-11-28 23:35:13,877 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65231864-f43e-4150-9960-204c98c4fb59/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample