./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/mix054_pso.opt_rmo.opt_tso.oepc_tso.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 9bd2c7ff 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_da425da7-9893-4f82-8c0f-b25277bb1da3/bin/uautomizer-verify-uCwYo4JHxu/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da425da7-9893-4f82-8c0f-b25277bb1da3/bin/uautomizer-verify-uCwYo4JHxu/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da425da7-9893-4f82-8c0f-b25277bb1da3/bin/uautomizer-verify-uCwYo4JHxu/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da425da7-9893-4f82-8c0f-b25277bb1da3/bin/uautomizer-verify-uCwYo4JHxu/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix054_pso.opt_rmo.opt_tso.oepc_tso.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da425da7-9893-4f82-8c0f-b25277bb1da3/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da425da7-9893-4f82-8c0f-b25277bb1da3/bin/uautomizer-verify-uCwYo4JHxu --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 4b807ac1723767f46eb51e856f642cbeec29c757d6219d60986235d902b15355 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-9bd2c7f [2023-11-19 07:32:45,995 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-19 07:32:46,140 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da425da7-9893-4f82-8c0f-b25277bb1da3/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-19 07:32:46,146 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-19 07:32:46,148 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-19 07:32:46,191 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-19 07:32:46,193 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-19 07:32:46,193 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-19 07:32:46,195 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-19 07:32:46,200 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-19 07:32:46,201 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-19 07:32:46,202 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-19 07:32:46,202 INFO L153 SettingsManager]: * Use SBE=true [2023-11-19 07:32:46,205 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-19 07:32:46,205 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-19 07:32:46,206 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-19 07:32:46,206 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-19 07:32:46,207 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-19 07:32:46,207 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-19 07:32:46,208 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-19 07:32:46,209 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-19 07:32:46,209 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-19 07:32:46,210 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-19 07:32:46,210 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-19 07:32:46,211 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-19 07:32:46,212 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-19 07:32:46,213 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-19 07:32:46,213 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-19 07:32:46,214 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-19 07:32:46,214 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:32:46,216 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-19 07:32:46,216 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-19 07:32:46,217 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-19 07:32:46,217 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-19 07:32:46,217 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-19 07:32:46,218 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-19 07:32:46,218 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-19 07:32:46,218 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-19 07:32:46,219 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_da425da7-9893-4f82-8c0f-b25277bb1da3/bin/uautomizer-verify-uCwYo4JHxu/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_da425da7-9893-4f82-8c0f-b25277bb1da3/bin/uautomizer-verify-uCwYo4JHxu 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 -> 4b807ac1723767f46eb51e856f642cbeec29c757d6219d60986235d902b15355 [2023-11-19 07:32:46,577 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-19 07:32:46,628 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-19 07:32:46,632 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-19 07:32:46,633 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-19 07:32:46,634 INFO L274 PluginConnector]: CDTParser initialized [2023-11-19 07:32:46,636 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da425da7-9893-4f82-8c0f-b25277bb1da3/bin/uautomizer-verify-uCwYo4JHxu/../../sv-benchmarks/c/pthread-wmm/mix054_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2023-11-19 07:32:49,755 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-19 07:32:50,094 INFO L384 CDTParser]: Found 1 translation units. [2023-11-19 07:32:50,095 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da425da7-9893-4f82-8c0f-b25277bb1da3/sv-benchmarks/c/pthread-wmm/mix054_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2023-11-19 07:32:50,111 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da425da7-9893-4f82-8c0f-b25277bb1da3/bin/uautomizer-verify-uCwYo4JHxu/data/fd122530f/076708d6cd7145fa8b1c430bc78891dc/FLAG19351ed40 [2023-11-19 07:32:50,128 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da425da7-9893-4f82-8c0f-b25277bb1da3/bin/uautomizer-verify-uCwYo4JHxu/data/fd122530f/076708d6cd7145fa8b1c430bc78891dc [2023-11-19 07:32:50,130 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-19 07:32:50,132 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-19 07:32:50,134 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-19 07:32:50,134 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-19 07:32:50,140 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-19 07:32:50,141 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:32:50" (1/1) ... [2023-11-19 07:32:50,143 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@197892e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:32:50, skipping insertion in model container [2023-11-19 07:32:50,143 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:32:50" (1/1) ... [2023-11-19 07:32:50,197 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-19 07:32:50,714 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:32:50,735 INFO L202 MainTranslator]: Completed pre-run [2023-11-19 07:32:50,839 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:32:50,892 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-19 07:32:50,892 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-19 07:32:50,901 INFO L206 MainTranslator]: Completed translation [2023-11-19 07:32:50,902 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:32:50 WrapperNode [2023-11-19 07:32:50,902 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-19 07:32:50,904 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-19 07:32:50,904 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-19 07:32:50,905 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-19 07:32:50,914 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:32:50" (1/1) ... [2023-11-19 07:32:50,953 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:32:50" (1/1) ... [2023-11-19 07:32:51,007 INFO L138 Inliner]: procedures = 175, calls = 42, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 134 [2023-11-19 07:32:51,010 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-19 07:32:51,011 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-19 07:32:51,012 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-19 07:32:51,012 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-19 07:32:51,023 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:32:50" (1/1) ... [2023-11-19 07:32:51,024 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:32:50" (1/1) ... [2023-11-19 07:32:51,042 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:32:50" (1/1) ... [2023-11-19 07:32:51,044 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:32:50" (1/1) ... [2023-11-19 07:32:51,059 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:32:50" (1/1) ... [2023-11-19 07:32:51,070 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:32:50" (1/1) ... [2023-11-19 07:32:51,073 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:32:50" (1/1) ... [2023-11-19 07:32:51,078 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:32:50" (1/1) ... [2023-11-19 07:32:51,082 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-19 07:32:51,096 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-19 07:32:51,096 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-19 07:32:51,096 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-19 07:32:51,097 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:32:50" (1/1) ... [2023-11-19 07:32:51,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:32:51,119 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da425da7-9893-4f82-8c0f-b25277bb1da3/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:32:51,135 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da425da7-9893-4f82-8c0f-b25277bb1da3/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-19 07:32:51,167 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da425da7-9893-4f82-8c0f-b25277bb1da3/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-19 07:32:51,250 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-19 07:32:51,251 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-19 07:32:51,251 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-19 07:32:51,252 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-19 07:32:51,252 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-19 07:32:51,253 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-19 07:32:51,253 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-19 07:32:51,253 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-19 07:32:51,253 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-19 07:32:51,253 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-19 07:32:51,254 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-19 07:32:51,254 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-19 07:32:51,254 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-19 07:32:51,256 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-19 07:32:51,476 INFO L236 CfgBuilder]: Building ICFG [2023-11-19 07:32:51,478 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-19 07:32:51,780 INFO L277 CfgBuilder]: Performing block encoding [2023-11-19 07:32:52,016 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-19 07:32:52,016 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-19 07:32:52,027 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:32:52 BoogieIcfgContainer [2023-11-19 07:32:52,027 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-19 07:32:52,032 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-19 07:32:52,032 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-19 07:32:52,036 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-19 07:32:52,037 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 07:32:50" (1/3) ... [2023-11-19 07:32:52,038 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c34a58b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:32:52, skipping insertion in model container [2023-11-19 07:32:52,038 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:32:50" (2/3) ... [2023-11-19 07:32:52,041 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c34a58b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:32:52, skipping insertion in model container [2023-11-19 07:32:52,041 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:32:52" (3/3) ... [2023-11-19 07:32:52,043 INFO L112 eAbstractionObserver]: Analyzing ICFG mix054_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2023-11-19 07:32:52,065 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-19 07:32:52,067 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2023-11-19 07:32:52,067 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-19 07:32:52,143 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-19 07:32:52,199 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 107 places, 104 transitions, 216 flow [2023-11-19 07:32:52,291 INFO L124 PetriNetUnfolderBase]: 4/102 cut-off events. [2023-11-19 07:32:52,292 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 07:32:52,303 INFO L83 FinitePrefix]: Finished finitePrefix Result has 109 conditions, 102 events. 4/102 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 71 event pairs, 0 based on Foata normal form. 0/91 useless extension candidates. Maximal degree in co-relation 66. Up to 2 conditions per place. [2023-11-19 07:32:52,304 INFO L82 GeneralOperation]: Start removeDead. Operand has 107 places, 104 transitions, 216 flow [2023-11-19 07:32:52,310 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 105 places, 102 transitions, 210 flow [2023-11-19 07:32:52,314 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-19 07:32:52,328 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 105 places, 102 transitions, 210 flow [2023-11-19 07:32:52,330 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 105 places, 102 transitions, 210 flow [2023-11-19 07:32:52,331 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 105 places, 102 transitions, 210 flow [2023-11-19 07:32:52,360 INFO L124 PetriNetUnfolderBase]: 4/102 cut-off events. [2023-11-19 07:32:52,360 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 07:32:52,362 INFO L83 FinitePrefix]: Finished finitePrefix Result has 109 conditions, 102 events. 4/102 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 71 event pairs, 0 based on Foata normal form. 0/91 useless extension candidates. Maximal degree in co-relation 66. Up to 2 conditions per place. [2023-11-19 07:32:52,364 INFO L119 LiptonReduction]: Number of co-enabled transitions 1500 [2023-11-19 07:32:58,950 INFO L134 LiptonReduction]: Checked pairs total: 3708 [2023-11-19 07:32:58,950 INFO L136 LiptonReduction]: Total number of compositions: 112 [2023-11-19 07:32:58,974 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 07:32:58,983 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;@540fb469, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-19 07:32:58,984 INFO L358 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2023-11-19 07:32:58,986 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-19 07:32:58,986 INFO L124 PetriNetUnfolderBase]: 0/0 cut-off events. [2023-11-19 07:32:58,986 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 07:32:58,986 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:32:58,987 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-11-19 07:32:58,987 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-19 07:32:58,993 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:32:58,993 INFO L85 PathProgramCache]: Analyzing trace with hash 493, now seen corresponding path program 1 times [2023-11-19 07:32:59,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:32:59,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882725510] [2023-11-19 07:32:59,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:32:59,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:32:59,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:32:59,146 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-19 07:32:59,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:32:59,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882725510] [2023-11-19 07:32:59,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882725510] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:32:59,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:32:59,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-11-19 07:32:59,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8805788] [2023-11-19 07:32:59,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:32:59,161 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-19 07:32:59,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:32:59,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-19 07:32:59,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-19 07:32:59,196 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 216 [2023-11-19 07:32:59,199 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 22 transitions, 50 flow. Second operand has 2 states, 2 states have (on average 91.5) internal successors, (183), 2 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:32:59,199 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:32:59,200 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 216 [2023-11-19 07:32:59,201 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:32:59,406 INFO L124 PetriNetUnfolderBase]: 173/307 cut-off events. [2023-11-19 07:32:59,407 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-11-19 07:32:59,409 INFO L83 FinitePrefix]: Finished finitePrefix Result has 623 conditions, 307 events. 173/307 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1229 event pairs, 173 based on Foata normal form. 0/239 useless extension candidates. Maximal degree in co-relation 613. Up to 303 conditions per place. [2023-11-19 07:32:59,415 INFO L140 encePairwiseOnDemand]: 212/216 looper letters, 16 selfloop transitions, 0 changer transitions 0/18 dead transitions. [2023-11-19 07:32:59,415 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 18 transitions, 74 flow [2023-11-19 07:32:59,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-19 07:32:59,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-19 07:32:59,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 202 transitions. [2023-11-19 07:32:59,435 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4675925925925926 [2023-11-19 07:32:59,436 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 202 transitions. [2023-11-19 07:32:59,437 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 202 transitions. [2023-11-19 07:32:59,439 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:32:59,442 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 202 transitions. [2023-11-19 07:32:59,449 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 101.0) internal successors, (202), 2 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-19 07:32:59,455 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 216.0) internal successors, (648), 3 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:32:59,456 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 216.0) internal successors, (648), 3 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:32:59,458 INFO L175 Difference]: Start difference. First operand has 29 places, 22 transitions, 50 flow. Second operand 2 states and 202 transitions. [2023-11-19 07:32:59,459 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 18 transitions, 74 flow [2023-11-19 07:32:59,461 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 18 transitions, 72 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-19 07:32:59,463 INFO L231 Difference]: Finished difference. Result has 24 places, 18 transitions, 40 flow [2023-11-19 07:32:59,465 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=40, PETRI_PLACES=24, PETRI_TRANSITIONS=18} [2023-11-19 07:32:59,470 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, -5 predicate places. [2023-11-19 07:32:59,470 INFO L495 AbstractCegarLoop]: Abstraction has has 24 places, 18 transitions, 40 flow [2023-11-19 07:32:59,471 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 91.5) internal successors, (183), 2 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:32:59,471 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:32:59,471 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-19 07:32:59,471 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-19 07:32:59,473 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-19 07:32:59,475 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:32:59,475 INFO L85 PathProgramCache]: Analyzing trace with hash 464394344, now seen corresponding path program 1 times [2023-11-19 07:32:59,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:32:59,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570739256] [2023-11-19 07:32:59,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:32:59,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:32:59,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:32:59,847 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-19 07:32:59,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:32:59,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570739256] [2023-11-19 07:32:59,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570739256] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:32:59,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:32:59,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-19 07:32:59,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609841448] [2023-11-19 07:32:59,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:32:59,850 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 07:32:59,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:32:59,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:32:59,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:32:59,855 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 216 [2023-11-19 07:32:59,856 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 18 transitions, 40 flow. Second operand has 3 states, 3 states have (on average 91.66666666666667) internal successors, (275), 3 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:32:59,856 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:32:59,856 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 216 [2023-11-19 07:32:59,856 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:32:59,991 INFO L124 PetriNetUnfolderBase]: 135/266 cut-off events. [2023-11-19 07:32:59,991 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 07:32:59,992 INFO L83 FinitePrefix]: Finished finitePrefix Result has 519 conditions, 266 events. 135/266 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1138 event pairs, 21 based on Foata normal form. 0/233 useless extension candidates. Maximal degree in co-relation 516. Up to 187 conditions per place. [2023-11-19 07:32:59,994 INFO L140 encePairwiseOnDemand]: 213/216 looper letters, 19 selfloop transitions, 2 changer transitions 2/25 dead transitions. [2023-11-19 07:32:59,995 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 25 transitions, 100 flow [2023-11-19 07:32:59,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:32:59,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-19 07:32:59,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 294 transitions. [2023-11-19 07:32:59,999 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4537037037037037 [2023-11-19 07:32:59,999 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 294 transitions. [2023-11-19 07:32:59,999 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 294 transitions. [2023-11-19 07:33:00,000 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:33:00,000 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 294 transitions. [2023-11-19 07:33:00,001 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 98.0) internal successors, (294), 3 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:00,004 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 216.0) internal successors, (864), 4 states have internal predecessors, (864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:00,005 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 216.0) internal successors, (864), 4 states have internal predecessors, (864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:00,005 INFO L175 Difference]: Start difference. First operand has 24 places, 18 transitions, 40 flow. Second operand 3 states and 294 transitions. [2023-11-19 07:33:00,006 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 25 transitions, 100 flow [2023-11-19 07:33:00,006 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 25 transitions, 100 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-19 07:33:00,007 INFO L231 Difference]: Finished difference. Result has 25 places, 16 transitions, 40 flow [2023-11-19 07:33:00,007 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=40, PETRI_PLACES=25, PETRI_TRANSITIONS=16} [2023-11-19 07:33:00,008 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, -4 predicate places. [2023-11-19 07:33:00,009 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 16 transitions, 40 flow [2023-11-19 07:33:00,009 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 91.66666666666667) internal successors, (275), 3 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:00,009 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:33:00,010 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:33:00,010 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-19 07:33:00,010 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-19 07:33:00,011 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:33:00,011 INFO L85 PathProgramCache]: Analyzing trace with hash -393585407, now seen corresponding path program 1 times [2023-11-19 07:33:00,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:33:00,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467142827] [2023-11-19 07:33:00,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:33:00,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:33:00,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:00,478 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-19 07:33:00,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:33:00,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467142827] [2023-11-19 07:33:00,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467142827] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:33:00,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:33:00,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 07:33:00,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395554355] [2023-11-19 07:33:00,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:33:00,481 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:33:00,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:33:00,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:33:00,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:33:00,557 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 216 [2023-11-19 07:33:00,558 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 16 transitions, 40 flow. Second operand has 4 states, 4 states have (on average 80.75) internal successors, (323), 4 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:00,558 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:33:00,559 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 216 [2023-11-19 07:33:00,559 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:33:00,679 INFO L124 PetriNetUnfolderBase]: 87/165 cut-off events. [2023-11-19 07:33:00,679 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2023-11-19 07:33:00,680 INFO L83 FinitePrefix]: Finished finitePrefix Result has 356 conditions, 165 events. 87/165 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 556 event pairs, 68 based on Foata normal form. 0/163 useless extension candidates. Maximal degree in co-relation 352. Up to 155 conditions per place. [2023-11-19 07:33:00,682 INFO L140 encePairwiseOnDemand]: 213/216 looper letters, 14 selfloop transitions, 2 changer transitions 0/18 dead transitions. [2023-11-19 07:33:00,682 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 18 transitions, 76 flow [2023-11-19 07:33:00,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:33:00,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-19 07:33:00,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 333 transitions. [2023-11-19 07:33:00,686 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3854166666666667 [2023-11-19 07:33:00,686 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 333 transitions. [2023-11-19 07:33:00,686 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 333 transitions. [2023-11-19 07:33:00,687 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:33:00,687 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 333 transitions. [2023-11-19 07:33:00,689 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 83.25) internal successors, (333), 4 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:00,692 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 216.0) internal successors, (1080), 5 states have internal predecessors, (1080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:00,693 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 216.0) internal successors, (1080), 5 states have internal predecessors, (1080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:00,694 INFO L175 Difference]: Start difference. First operand has 25 places, 16 transitions, 40 flow. Second operand 4 states and 333 transitions. [2023-11-19 07:33:00,694 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 18 transitions, 76 flow [2023-11-19 07:33:00,695 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 18 transitions, 72 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-19 07:33:00,696 INFO L231 Difference]: Finished difference. Result has 24 places, 15 transitions, 38 flow [2023-11-19 07:33:00,696 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=34, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=15, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=38, PETRI_PLACES=24, PETRI_TRANSITIONS=15} [2023-11-19 07:33:00,697 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, -5 predicate places. [2023-11-19 07:33:00,697 INFO L495 AbstractCegarLoop]: Abstraction has has 24 places, 15 transitions, 38 flow [2023-11-19 07:33:00,698 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 80.75) internal successors, (323), 4 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:00,698 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:33:00,698 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:33:00,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-19 07:33:00,699 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-19 07:33:00,700 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:33:00,700 INFO L85 PathProgramCache]: Analyzing trace with hash -393585416, now seen corresponding path program 1 times [2023-11-19 07:33:00,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:33:00,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589972213] [2023-11-19 07:33:00,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:33:00,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:33:00,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:01,751 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-19 07:33:01,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:33:01,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589972213] [2023-11-19 07:33:01,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589972213] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:33:01,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:33:01,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 07:33:01,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007061756] [2023-11-19 07:33:01,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:33:01,754 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:33:01,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:33:01,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:33:01,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:33:01,817 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 216 [2023-11-19 07:33:01,818 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 15 transitions, 38 flow. Second operand has 4 states, 4 states have (on average 86.75) internal successors, (347), 4 states have internal predecessors, (347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:01,818 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:33:01,819 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 216 [2023-11-19 07:33:01,819 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:33:01,955 INFO L124 PetriNetUnfolderBase]: 113/208 cut-off events. [2023-11-19 07:33:01,955 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-11-19 07:33:01,957 INFO L83 FinitePrefix]: Finished finitePrefix Result has 433 conditions, 208 events. 113/208 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 731 event pairs, 20 based on Foata normal form. 8/215 useless extension candidates. Maximal degree in co-relation 429. Up to 152 conditions per place. [2023-11-19 07:33:01,959 INFO L140 encePairwiseOnDemand]: 210/216 looper letters, 20 selfloop transitions, 5 changer transitions 0/26 dead transitions. [2023-11-19 07:33:01,959 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 26 transitions, 110 flow [2023-11-19 07:33:01,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:33:01,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-19 07:33:01,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 367 transitions. [2023-11-19 07:33:01,962 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42476851851851855 [2023-11-19 07:33:01,963 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 367 transitions. [2023-11-19 07:33:01,963 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 367 transitions. [2023-11-19 07:33:01,963 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:33:01,964 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 367 transitions. [2023-11-19 07:33:01,965 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 91.75) internal successors, (367), 4 states have internal predecessors, (367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:01,968 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 216.0) internal successors, (1080), 5 states have internal predecessors, (1080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:01,969 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 216.0) internal successors, (1080), 5 states have internal predecessors, (1080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:01,969 INFO L175 Difference]: Start difference. First operand has 24 places, 15 transitions, 38 flow. Second operand 4 states and 367 transitions. [2023-11-19 07:33:01,969 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 26 transitions, 110 flow [2023-11-19 07:33:01,970 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 26 transitions, 107 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-19 07:33:01,971 INFO L231 Difference]: Finished difference. Result has 27 places, 18 transitions, 67 flow [2023-11-19 07:33:01,971 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=35, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=15, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=10, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=67, PETRI_PLACES=27, PETRI_TRANSITIONS=18} [2023-11-19 07:33:01,973 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, -2 predicate places. [2023-11-19 07:33:01,974 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 18 transitions, 67 flow [2023-11-19 07:33:01,974 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 86.75) internal successors, (347), 4 states have internal predecessors, (347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:01,974 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:33:01,975 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:33:01,975 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-19 07:33:01,975 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-19 07:33:01,976 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:33:01,976 INFO L85 PathProgramCache]: Analyzing trace with hash 683714674, now seen corresponding path program 1 times [2023-11-19 07:33:01,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:33:01,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621786478] [2023-11-19 07:33:01,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:33:01,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:33:02,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:02,700 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-19 07:33:02,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:33:02,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621786478] [2023-11-19 07:33:02,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621786478] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:33:02,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:33:02,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 07:33:02,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739017833] [2023-11-19 07:33:02,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:33:02,702 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:33:02,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:33:02,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:33:02,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:33:02,722 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 216 [2023-11-19 07:33:02,723 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 18 transitions, 67 flow. Second operand has 5 states, 5 states have (on average 90.6) internal successors, (453), 5 states have internal predecessors, (453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:02,724 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:33:02,724 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 216 [2023-11-19 07:33:02,724 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:33:02,846 INFO L124 PetriNetUnfolderBase]: 98/187 cut-off events. [2023-11-19 07:33:02,847 INFO L125 PetriNetUnfolderBase]: For 80/82 co-relation queries the response was YES. [2023-11-19 07:33:02,848 INFO L83 FinitePrefix]: Finished finitePrefix Result has 500 conditions, 187 events. 98/187 cut-off events. For 80/82 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 623 event pairs, 32 based on Foata normal form. 4/187 useless extension candidates. Maximal degree in co-relation 494. Up to 137 conditions per place. [2023-11-19 07:33:02,849 INFO L140 encePairwiseOnDemand]: 212/216 looper letters, 20 selfloop transitions, 4 changer transitions 0/27 dead transitions. [2023-11-19 07:33:02,850 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 27 transitions, 147 flow [2023-11-19 07:33:02,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:33:02,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-19 07:33:02,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 289 transitions. [2023-11-19 07:33:02,852 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44598765432098764 [2023-11-19 07:33:02,852 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 289 transitions. [2023-11-19 07:33:02,853 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 289 transitions. [2023-11-19 07:33:02,853 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:33:02,853 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 289 transitions. [2023-11-19 07:33:02,854 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 96.33333333333333) internal successors, (289), 3 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:02,856 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 216.0) internal successors, (864), 4 states have internal predecessors, (864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:02,857 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 216.0) internal successors, (864), 4 states have internal predecessors, (864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:02,858 INFO L175 Difference]: Start difference. First operand has 27 places, 18 transitions, 67 flow. Second operand 3 states and 289 transitions. [2023-11-19 07:33:02,858 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 27 transitions, 147 flow [2023-11-19 07:33:02,859 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 27 transitions, 139 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-19 07:33:02,860 INFO L231 Difference]: Finished difference. Result has 28 places, 20 transitions, 85 flow [2023-11-19 07:33:02,860 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=61, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=85, PETRI_PLACES=28, PETRI_TRANSITIONS=20} [2023-11-19 07:33:02,861 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, -1 predicate places. [2023-11-19 07:33:02,862 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 20 transitions, 85 flow [2023-11-19 07:33:02,862 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 90.6) internal successors, (453), 5 states have internal predecessors, (453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:02,862 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:33:02,863 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:33:02,863 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-19 07:33:02,863 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-19 07:33:02,864 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:33:02,864 INFO L85 PathProgramCache]: Analyzing trace with hash -934839133, now seen corresponding path program 1 times [2023-11-19 07:33:02,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:33:02,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479071969] [2023-11-19 07:33:02,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:33:02,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:33:02,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:03,057 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-19 07:33:03,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:33:03,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479071969] [2023-11-19 07:33:03,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479071969] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:33:03,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:33:03,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 07:33:03,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423547518] [2023-11-19 07:33:03,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:33:03,060 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:33:03,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:33:03,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:33:03,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:33:03,080 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 216 [2023-11-19 07:33:03,082 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 20 transitions, 85 flow. Second operand has 4 states, 4 states have (on average 88.25) internal successors, (353), 4 states have internal predecessors, (353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:03,082 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:33:03,082 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 216 [2023-11-19 07:33:03,082 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:33:03,218 INFO L124 PetriNetUnfolderBase]: 55/131 cut-off events. [2023-11-19 07:33:03,218 INFO L125 PetriNetUnfolderBase]: For 80/83 co-relation queries the response was YES. [2023-11-19 07:33:03,218 INFO L83 FinitePrefix]: Finished finitePrefix Result has 387 conditions, 131 events. 55/131 cut-off events. For 80/83 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 468 event pairs, 10 based on Foata normal form. 27/157 useless extension candidates. Maximal degree in co-relation 380. Up to 59 conditions per place. [2023-11-19 07:33:03,220 INFO L140 encePairwiseOnDemand]: 211/216 looper letters, 25 selfloop transitions, 5 changer transitions 11/44 dead transitions. [2023-11-19 07:33:03,220 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 44 transitions, 258 flow [2023-11-19 07:33:03,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 07:33:03,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-19 07:33:03,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 466 transitions. [2023-11-19 07:33:03,223 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43148148148148147 [2023-11-19 07:33:03,223 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 466 transitions. [2023-11-19 07:33:03,223 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 466 transitions. [2023-11-19 07:33:03,224 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:33:03,224 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 466 transitions. [2023-11-19 07:33:03,226 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 93.2) internal successors, (466), 5 states have internal predecessors, (466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:03,228 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 216.0) internal successors, (1296), 6 states have internal predecessors, (1296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:03,229 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 216.0) internal successors, (1296), 6 states have internal predecessors, (1296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:03,229 INFO L175 Difference]: Start difference. First operand has 28 places, 20 transitions, 85 flow. Second operand 5 states and 466 transitions. [2023-11-19 07:33:03,229 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 44 transitions, 258 flow [2023-11-19 07:33:03,231 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 44 transitions, 251 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-19 07:33:03,232 INFO L231 Difference]: Finished difference. Result has 34 places, 24 transitions, 122 flow [2023-11-19 07:33:03,233 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=81, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=122, PETRI_PLACES=34, PETRI_TRANSITIONS=24} [2023-11-19 07:33:03,234 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 5 predicate places. [2023-11-19 07:33:03,234 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 24 transitions, 122 flow [2023-11-19 07:33:03,234 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 88.25) internal successors, (353), 4 states have internal predecessors, (353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:03,234 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:33:03,234 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:33:03,235 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-19 07:33:03,235 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-19 07:33:03,235 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:33:03,235 INFO L85 PathProgramCache]: Analyzing trace with hash 1006637381, now seen corresponding path program 1 times [2023-11-19 07:33:03,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:33:03,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770257608] [2023-11-19 07:33:03,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:33:03,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:33:03,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:03,469 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-19 07:33:03,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:33:03,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770257608] [2023-11-19 07:33:03,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770257608] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:33:03,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:33:03,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 07:33:03,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670630977] [2023-11-19 07:33:03,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:33:03,471 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:33:03,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:33:03,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:33:03,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:33:03,492 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 216 [2023-11-19 07:33:03,493 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 24 transitions, 122 flow. Second operand has 5 states, 5 states have (on average 88.0) internal successors, (440), 5 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:03,494 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:33:03,494 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 216 [2023-11-19 07:33:03,494 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:33:03,646 INFO L124 PetriNetUnfolderBase]: 37/97 cut-off events. [2023-11-19 07:33:03,646 INFO L125 PetriNetUnfolderBase]: For 127/133 co-relation queries the response was YES. [2023-11-19 07:33:03,647 INFO L83 FinitePrefix]: Finished finitePrefix Result has 341 conditions, 97 events. 37/97 cut-off events. For 127/133 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 341 event pairs, 7 based on Foata normal form. 15/111 useless extension candidates. Maximal degree in co-relation 331. Up to 31 conditions per place. [2023-11-19 07:33:03,648 INFO L140 encePairwiseOnDemand]: 211/216 looper letters, 22 selfloop transitions, 8 changer transitions 10/43 dead transitions. [2023-11-19 07:33:03,648 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 43 transitions, 282 flow [2023-11-19 07:33:03,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-19 07:33:03,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-19 07:33:03,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 638 transitions. [2023-11-19 07:33:03,652 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.421957671957672 [2023-11-19 07:33:03,652 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 638 transitions. [2023-11-19 07:33:03,652 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 638 transitions. [2023-11-19 07:33:03,652 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:33:03,653 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 638 transitions. [2023-11-19 07:33:03,655 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 91.14285714285714) internal successors, (638), 7 states have internal predecessors, (638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:03,658 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 216.0) internal successors, (1728), 8 states have internal predecessors, (1728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:03,659 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 216.0) internal successors, (1728), 8 states have internal predecessors, (1728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:03,660 INFO L175 Difference]: Start difference. First operand has 34 places, 24 transitions, 122 flow. Second operand 7 states and 638 transitions. [2023-11-19 07:33:03,660 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 43 transitions, 282 flow [2023-11-19 07:33:03,665 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 43 transitions, 271 flow, removed 3 selfloop flow, removed 1 redundant places. [2023-11-19 07:33:03,666 INFO L231 Difference]: Finished difference. Result has 42 places, 24 transitions, 139 flow [2023-11-19 07:33:03,666 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=139, PETRI_PLACES=42, PETRI_TRANSITIONS=24} [2023-11-19 07:33:03,667 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 13 predicate places. [2023-11-19 07:33:03,667 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 24 transitions, 139 flow [2023-11-19 07:33:03,667 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 88.0) internal successors, (440), 5 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:03,669 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:33:03,669 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:33:03,669 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-19 07:33:03,670 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-19 07:33:03,671 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:33:03,671 INFO L85 PathProgramCache]: Analyzing trace with hash -944807080, now seen corresponding path program 1 times [2023-11-19 07:33:03,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:33:03,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114889179] [2023-11-19 07:33:03,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:33:03,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:33:03,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:04,147 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-19 07:33:04,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:33:04,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114889179] [2023-11-19 07:33:04,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114889179] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:33:04,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:33:04,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 07:33:04,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203928565] [2023-11-19 07:33:04,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:33:04,149 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:33:04,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:33:04,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:33:04,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:33:04,196 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 216 [2023-11-19 07:33:04,197 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 24 transitions, 139 flow. Second operand has 5 states, 5 states have (on average 85.8) internal successors, (429), 5 states have internal predecessors, (429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:04,197 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:33:04,197 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 216 [2023-11-19 07:33:04,197 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:33:04,395 INFO L124 PetriNetUnfolderBase]: 57/147 cut-off events. [2023-11-19 07:33:04,396 INFO L125 PetriNetUnfolderBase]: For 330/330 co-relation queries the response was YES. [2023-11-19 07:33:04,396 INFO L83 FinitePrefix]: Finished finitePrefix Result has 568 conditions, 147 events. 57/147 cut-off events. For 330/330 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 569 event pairs, 4 based on Foata normal form. 1/148 useless extension candidates. Maximal degree in co-relation 555. Up to 72 conditions per place. [2023-11-19 07:33:04,397 INFO L140 encePairwiseOnDemand]: 210/216 looper letters, 17 selfloop transitions, 3 changer transitions 31/52 dead transitions. [2023-11-19 07:33:04,397 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 52 transitions, 414 flow [2023-11-19 07:33:04,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 07:33:04,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-19 07:33:04,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 533 transitions. [2023-11-19 07:33:04,401 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4112654320987654 [2023-11-19 07:33:04,401 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 533 transitions. [2023-11-19 07:33:04,401 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 533 transitions. [2023-11-19 07:33:04,402 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:33:04,402 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 533 transitions. [2023-11-19 07:33:04,403 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 88.83333333333333) internal successors, (533), 6 states have internal predecessors, (533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:04,406 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 216.0) internal successors, (1512), 7 states have internal predecessors, (1512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:04,407 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 216.0) internal successors, (1512), 7 states have internal predecessors, (1512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:04,407 INFO L175 Difference]: Start difference. First operand has 42 places, 24 transitions, 139 flow. Second operand 6 states and 533 transitions. [2023-11-19 07:33:04,407 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 52 transitions, 414 flow [2023-11-19 07:33:04,411 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 52 transitions, 357 flow, removed 13 selfloop flow, removed 6 redundant places. [2023-11-19 07:33:04,413 INFO L231 Difference]: Finished difference. Result has 43 places, 19 transitions, 98 flow [2023-11-19 07:33:04,413 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=98, PETRI_PLACES=43, PETRI_TRANSITIONS=19} [2023-11-19 07:33:04,414 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 14 predicate places. [2023-11-19 07:33:04,414 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 19 transitions, 98 flow [2023-11-19 07:33:04,414 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 85.8) internal successors, (429), 5 states have internal predecessors, (429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:04,415 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:33:04,415 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:33:04,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-19 07:33:04,415 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-19 07:33:04,416 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:33:04,416 INFO L85 PathProgramCache]: Analyzing trace with hash 1892334144, now seen corresponding path program 2 times [2023-11-19 07:33:04,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:33:04,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056295518] [2023-11-19 07:33:04,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:33:04,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:33:04,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:05,887 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-19 07:33:05,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:33:05,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056295518] [2023-11-19 07:33:05,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056295518] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:33:05,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:33:05,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-19 07:33:05,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177767750] [2023-11-19 07:33:05,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:33:05,889 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-19 07:33:05,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:33:05,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-19 07:33:05,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-19 07:33:05,981 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 216 [2023-11-19 07:33:05,983 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 19 transitions, 98 flow. Second operand has 8 states, 8 states have (on average 82.875) internal successors, (663), 8 states have internal predecessors, (663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:05,983 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:33:05,983 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 216 [2023-11-19 07:33:05,983 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:33:06,186 INFO L124 PetriNetUnfolderBase]: 9/42 cut-off events. [2023-11-19 07:33:06,186 INFO L125 PetriNetUnfolderBase]: For 44/44 co-relation queries the response was YES. [2023-11-19 07:33:06,187 INFO L83 FinitePrefix]: Finished finitePrefix Result has 162 conditions, 42 events. 9/42 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 78 event pairs, 1 based on Foata normal form. 1/43 useless extension candidates. Maximal degree in co-relation 149. Up to 19 conditions per place. [2023-11-19 07:33:06,187 INFO L140 encePairwiseOnDemand]: 211/216 looper letters, 16 selfloop transitions, 4 changer transitions 9/29 dead transitions. [2023-11-19 07:33:06,187 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 29 transitions, 209 flow [2023-11-19 07:33:06,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 07:33:06,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-19 07:33:06,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 511 transitions. [2023-11-19 07:33:06,191 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3942901234567901 [2023-11-19 07:33:06,191 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 511 transitions. [2023-11-19 07:33:06,191 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 511 transitions. [2023-11-19 07:33:06,192 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:33:06,192 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 511 transitions. [2023-11-19 07:33:06,194 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 85.16666666666667) internal successors, (511), 6 states have internal predecessors, (511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:06,197 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 216.0) internal successors, (1512), 7 states have internal predecessors, (1512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:06,197 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 216.0) internal successors, (1512), 7 states have internal predecessors, (1512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:06,197 INFO L175 Difference]: Start difference. First operand has 43 places, 19 transitions, 98 flow. Second operand 6 states and 511 transitions. [2023-11-19 07:33:06,198 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 29 transitions, 209 flow [2023-11-19 07:33:06,200 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 29 transitions, 189 flow, removed 8 selfloop flow, removed 6 redundant places. [2023-11-19 07:33:06,201 INFO L231 Difference]: Finished difference. Result has 39 places, 19 transitions, 98 flow [2023-11-19 07:33:06,201 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=98, PETRI_PLACES=39, PETRI_TRANSITIONS=19} [2023-11-19 07:33:06,203 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 10 predicate places. [2023-11-19 07:33:06,203 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 19 transitions, 98 flow [2023-11-19 07:33:06,204 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 82.875) internal successors, (663), 8 states have internal predecessors, (663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:06,204 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:33:06,204 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:33:06,204 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-19 07:33:06,205 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-19 07:33:06,205 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:33:06,205 INFO L85 PathProgramCache]: Analyzing trace with hash -280307862, now seen corresponding path program 3 times [2023-11-19 07:33:06,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:33:06,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750181123] [2023-11-19 07:33:06,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:33:06,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:33:06,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:33:06,269 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 07:33:06,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:33:06,370 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-19 07:33:06,373 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-19 07:33:06,374 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK (9 of 10 remaining) [2023-11-19 07:33:06,377 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (8 of 10 remaining) [2023-11-19 07:33:06,377 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 10 remaining) [2023-11-19 07:33:06,377 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 10 remaining) [2023-11-19 07:33:06,378 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 10 remaining) [2023-11-19 07:33:06,378 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 10 remaining) [2023-11-19 07:33:06,378 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK (3 of 10 remaining) [2023-11-19 07:33:06,378 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 10 remaining) [2023-11-19 07:33:06,380 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 10 remaining) [2023-11-19 07:33:06,380 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 10 remaining) [2023-11-19 07:33:06,380 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-19 07:33:06,381 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:33:06,387 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-19 07:33:06,388 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-19 07:33:06,442 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre3 could not be translated [2023-11-19 07:33:06,444 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-19 07:33:06,450 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-19 07:33:06,460 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 07:33:06 BasicIcfg [2023-11-19 07:33:06,460 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-19 07:33:06,461 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-19 07:33:06,461 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-19 07:33:06,462 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-19 07:33:06,462 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:32:52" (3/4) ... [2023-11-19 07:33:06,464 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-19 07:33:06,465 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-19 07:33:06,466 INFO L158 Benchmark]: Toolchain (without parser) took 16334.11ms. Allocated memory was 136.3MB in the beginning and 197.1MB in the end (delta: 60.8MB). Free memory was 97.6MB in the beginning and 115.2MB in the end (delta: -17.6MB). Peak memory consumption was 43.2MB. Max. memory is 16.1GB. [2023-11-19 07:33:06,467 INFO L158 Benchmark]: CDTParser took 0.34ms. Allocated memory is still 107.0MB. Free memory is still 80.2MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-19 07:33:06,467 INFO L158 Benchmark]: CACSL2BoogieTranslator took 769.11ms. Allocated memory is still 136.3MB. Free memory was 97.6MB in the beginning and 74.7MB in the end (delta: 22.9MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-11-19 07:33:06,468 INFO L158 Benchmark]: Boogie Procedure Inliner took 106.72ms. Allocated memory is still 136.3MB. Free memory was 74.7MB in the beginning and 72.0MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-19 07:33:06,468 INFO L158 Benchmark]: Boogie Preprocessor took 83.41ms. Allocated memory is still 136.3MB. Free memory was 72.0MB in the beginning and 70.4MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-19 07:33:06,468 INFO L158 Benchmark]: RCFGBuilder took 931.53ms. Allocated memory is still 136.3MB. Free memory was 70.3MB in the beginning and 74.3MB in the end (delta: -4.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2023-11-19 07:33:06,469 INFO L158 Benchmark]: TraceAbstraction took 14428.80ms. Allocated memory was 136.3MB in the beginning and 197.1MB in the end (delta: 60.8MB). Free memory was 73.6MB in the beginning and 115.2MB in the end (delta: -41.6MB). Peak memory consumption was 21.2MB. Max. memory is 16.1GB. [2023-11-19 07:33:06,469 INFO L158 Benchmark]: Witness Printer took 4.56ms. Allocated memory is still 197.1MB. Free memory is still 115.2MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-19 07:33:06,471 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.34ms. Allocated memory is still 107.0MB. Free memory is still 80.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 769.11ms. Allocated memory is still 136.3MB. Free memory was 97.6MB in the beginning and 74.7MB in the end (delta: 22.9MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 106.72ms. Allocated memory is still 136.3MB. Free memory was 74.7MB in the beginning and 72.0MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 83.41ms. Allocated memory is still 136.3MB. Free memory was 72.0MB in the beginning and 70.4MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 931.53ms. Allocated memory is still 136.3MB. Free memory was 70.3MB in the beginning and 74.3MB in the end (delta: -4.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 14428.80ms. Allocated memory was 136.3MB in the beginning and 197.1MB in the end (delta: 60.8MB). Free memory was 73.6MB in the beginning and 115.2MB in the end (delta: -41.6MB). Peak memory consumption was 21.2MB. Max. memory is 16.1GB. * Witness Printer took 4.56ms. Allocated memory is still 197.1MB. Free memory is still 115.2MB. 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: 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: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.6s, 105 PlacesBefore, 29 PlacesAfterwards, 102 TransitionsBefore, 22 TransitionsAfterwards, 1500 CoEnabledTransitionPairs, 7 FixpointIterations, 42 TrivialSequentialCompositions, 55 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 11 ConcurrentYvCompositions, 4 ChoiceCompositions, 112 TotalNumberOfCompositions, 3708 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1709, independent: 1566, independent conditional: 0, independent unconditional: 1566, dependent: 143, dependent conditional: 0, dependent unconditional: 143, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 828, independent: 792, independent conditional: 0, independent unconditional: 792, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1709, independent: 774, independent conditional: 0, independent unconditional: 774, dependent: 107, dependent conditional: 0, dependent unconditional: 107, unknown: 828, unknown conditional: 0, unknown unconditional: 828] , Statistics on independence cache: Total cache size (in pairs): 43, Positive cache size: 32, Positive conditional cache size: 0, Positive unconditional cache size: 32, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [L708] 0 int __unbuffered_cnt = 0; [L710] 0 int __unbuffered_p1_EAX = 0; [L711] 0 _Bool main$tmp_guard0; [L712] 0 _Bool main$tmp_guard1; [L714] 0 int x = 0; [L715] 0 _Bool x$flush_delayed; [L716] 0 int x$mem_tmp; [L717] 0 _Bool x$r_buff0_thd0; [L718] 0 _Bool x$r_buff0_thd1; [L719] 0 _Bool x$r_buff0_thd2; [L720] 0 _Bool x$r_buff1_thd0; [L721] 0 _Bool x$r_buff1_thd1; [L722] 0 _Bool x$r_buff1_thd2; [L723] 0 _Bool x$read_delayed; [L724] 0 int *x$read_delayed_var; [L725] 0 int x$w_buff0; [L726] 0 _Bool x$w_buff0_used; [L727] 0 int x$w_buff1; [L728] 0 _Bool x$w_buff1_used; [L730] 0 int y = 0; [L731] 0 _Bool weak$$choice0; [L732] 0 _Bool weak$$choice2; [L792] 0 pthread_t t1447; [L793] FCALL, FORK 0 pthread_create(&t1447, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1447={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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L794] 0 pthread_t t1448; [L795] FCALL, FORK 0 pthread_create(&t1448, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1447={5:0}, t1448={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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L756] 2 x$w_buff1 = x$w_buff0 [L757] 2 x$w_buff0 = 2 [L758] 2 x$w_buff1_used = x$w_buff0_used [L759] 2 x$w_buff0_used = (_Bool)1 [L760] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L760] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L761] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L762] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L763] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L764] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L767] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L736] 1 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L739] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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=1] [L770] 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) [L771] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L772] 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 [L773] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L774] 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_p1_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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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=1] [L777] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L779] 2 return 0; [L742] 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) [L743] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L744] 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 [L745] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L746] 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=1, __unbuffered_p1_EAX=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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=1] [L749] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L751] 1 return 0; [L797] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L799] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L799] RET 0 assume_abort_if_not(main$tmp_guard0) [L801] 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) [L802] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L803] 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 [L804] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L805] 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 [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1447={5:0}, t1448={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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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=1] [L808] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L809] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L810] 0 x$flush_delayed = weak$$choice2 [L811] 0 x$mem_tmp = x [L812] 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) [L813] 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)) [L814] 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)) [L815] 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)) [L816] 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)) [L817] 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)) [L818] 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)) [L819] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0) [L820] 0 x = x$flush_delayed ? x$mem_tmp : x [L821] 0 x$flush_delayed = (_Bool)0 [L823] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "mix054_pso.opt_rmo.opt_tso.oepc_tso.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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=1] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 790]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 795]: 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: 793]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 120 locations, 10 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 14.2s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 281 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 183 mSDsluCounter, 142 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 113 mSDsCounter, 76 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 588 IncrementalHoareTripleChecker+Invalid, 664 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 76 mSolverCounterUnsat, 29 mSDtfsCounter, 588 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 35 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=139occurred in iteration=7, InterpolantAutomatonStates: 40, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 4.5s InterpolantComputationTime, 94 NumberOfCodeBlocks, 94 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 70 ConstructedInterpolants, 0 QuantifiedInterpolants, 844 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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-19 07:33:06,516 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da425da7-9893-4f82-8c0f-b25277bb1da3/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (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_da425da7-9893-4f82-8c0f-b25277bb1da3/bin/uautomizer-verify-uCwYo4JHxu/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da425da7-9893-4f82-8c0f-b25277bb1da3/bin/uautomizer-verify-uCwYo4JHxu/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da425da7-9893-4f82-8c0f-b25277bb1da3/bin/uautomizer-verify-uCwYo4JHxu/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da425da7-9893-4f82-8c0f-b25277bb1da3/bin/uautomizer-verify-uCwYo4JHxu/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix054_pso.opt_rmo.opt_tso.oepc_tso.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da425da7-9893-4f82-8c0f-b25277bb1da3/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da425da7-9893-4f82-8c0f-b25277bb1da3/bin/uautomizer-verify-uCwYo4JHxu --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 4b807ac1723767f46eb51e856f642cbeec29c757d6219d60986235d902b15355 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-9bd2c7f [2023-11-19 07:33:09,332 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-19 07:33:09,457 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da425da7-9893-4f82-8c0f-b25277bb1da3/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-11-19 07:33:09,467 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-19 07:33:09,470 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-19 07:33:09,519 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-19 07:33:09,520 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-19 07:33:09,521 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-19 07:33:09,522 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-19 07:33:09,527 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-19 07:33:09,528 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-19 07:33:09,529 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-19 07:33:09,529 INFO L153 SettingsManager]: * Use SBE=true [2023-11-19 07:33:09,532 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-19 07:33:09,532 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-19 07:33:09,533 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-19 07:33:09,533 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-19 07:33:09,534 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-19 07:33:09,534 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-19 07:33:09,535 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-19 07:33:09,535 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-19 07:33:09,536 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-19 07:33:09,536 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-19 07:33:09,537 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-19 07:33:09,537 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-19 07:33:09,538 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-19 07:33:09,538 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-19 07:33:09,539 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-19 07:33:09,540 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-19 07:33:09,540 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-19 07:33:09,542 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-19 07:33:09,542 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:33:09,543 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-19 07:33:09,543 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-19 07:33:09,544 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-19 07:33:09,544 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-19 07:33:09,544 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-19 07:33:09,545 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-19 07:33:09,545 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-19 07:33:09,546 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-19 07:33:09,546 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-19 07:33:09,547 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_da425da7-9893-4f82-8c0f-b25277bb1da3/bin/uautomizer-verify-uCwYo4JHxu/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_da425da7-9893-4f82-8c0f-b25277bb1da3/bin/uautomizer-verify-uCwYo4JHxu 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 -> 4b807ac1723767f46eb51e856f642cbeec29c757d6219d60986235d902b15355 [2023-11-19 07:33:09,996 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-19 07:33:10,028 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-19 07:33:10,031 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-19 07:33:10,033 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-19 07:33:10,033 INFO L274 PluginConnector]: CDTParser initialized [2023-11-19 07:33:10,035 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da425da7-9893-4f82-8c0f-b25277bb1da3/bin/uautomizer-verify-uCwYo4JHxu/../../sv-benchmarks/c/pthread-wmm/mix054_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2023-11-19 07:33:13,523 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-19 07:33:13,938 INFO L384 CDTParser]: Found 1 translation units. [2023-11-19 07:33:13,938 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da425da7-9893-4f82-8c0f-b25277bb1da3/sv-benchmarks/c/pthread-wmm/mix054_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2023-11-19 07:33:13,964 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da425da7-9893-4f82-8c0f-b25277bb1da3/bin/uautomizer-verify-uCwYo4JHxu/data/2eeffabab/45af3990b5e64b98aab8da261d9f7571/FLAG024e6be8b [2023-11-19 07:33:13,983 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da425da7-9893-4f82-8c0f-b25277bb1da3/bin/uautomizer-verify-uCwYo4JHxu/data/2eeffabab/45af3990b5e64b98aab8da261d9f7571 [2023-11-19 07:33:13,986 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-19 07:33:13,988 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-19 07:33:13,989 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-19 07:33:13,990 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-19 07:33:13,996 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-19 07:33:13,997 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:33:13" (1/1) ... [2023-11-19 07:33:13,999 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a903662 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:33:13, skipping insertion in model container [2023-11-19 07:33:13,999 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:33:13" (1/1) ... [2023-11-19 07:33:14,067 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-19 07:33:14,668 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:33:14,697 INFO L202 MainTranslator]: Completed pre-run [2023-11-19 07:33:14,797 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:33:14,889 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-19 07:33:14,890 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-19 07:33:14,899 INFO L206 MainTranslator]: Completed translation [2023-11-19 07:33:14,899 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:33:14 WrapperNode [2023-11-19 07:33:14,900 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-19 07:33:14,901 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-19 07:33:14,902 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-19 07:33:14,902 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-19 07:33:14,928 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:33:14" (1/1) ... [2023-11-19 07:33:14,967 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:33:14" (1/1) ... [2023-11-19 07:33:15,028 INFO L138 Inliner]: procedures = 178, calls = 42, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 135 [2023-11-19 07:33:15,029 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-19 07:33:15,030 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-19 07:33:15,030 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-19 07:33:15,031 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-19 07:33:15,042 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:33:14" (1/1) ... [2023-11-19 07:33:15,042 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:33:14" (1/1) ... [2023-11-19 07:33:15,061 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:33:14" (1/1) ... [2023-11-19 07:33:15,062 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:33:14" (1/1) ... [2023-11-19 07:33:15,073 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:33:14" (1/1) ... [2023-11-19 07:33:15,093 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:33:14" (1/1) ... [2023-11-19 07:33:15,096 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:33:14" (1/1) ... [2023-11-19 07:33:15,108 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:33:14" (1/1) ... [2023-11-19 07:33:15,112 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-19 07:33:15,118 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-19 07:33:15,119 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-19 07:33:15,119 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-19 07:33:15,120 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:33:14" (1/1) ... [2023-11-19 07:33:15,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:33:15,150 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da425da7-9893-4f82-8c0f-b25277bb1da3/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:33:15,164 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da425da7-9893-4f82-8c0f-b25277bb1da3/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-19 07:33:15,188 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da425da7-9893-4f82-8c0f-b25277bb1da3/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-19 07:33:15,220 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-19 07:33:15,220 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-19 07:33:15,220 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-19 07:33:15,220 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-19 07:33:15,220 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-11-19 07:33:15,221 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-11-19 07:33:15,221 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-19 07:33:15,221 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-19 07:33:15,221 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-19 07:33:15,221 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-19 07:33:15,222 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-19 07:33:15,222 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-19 07:33:15,224 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-19 07:33:15,225 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-19 07:33:15,444 INFO L236 CfgBuilder]: Building ICFG [2023-11-19 07:33:15,447 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-19 07:33:15,898 INFO L277 CfgBuilder]: Performing block encoding [2023-11-19 07:33:16,100 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-19 07:33:16,100 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-19 07:33:16,105 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:33:16 BoogieIcfgContainer [2023-11-19 07:33:16,105 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-19 07:33:16,109 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-19 07:33:16,109 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-19 07:33:16,113 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-19 07:33:16,113 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 07:33:13" (1/3) ... [2023-11-19 07:33:16,114 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7436633e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:33:16, skipping insertion in model container [2023-11-19 07:33:16,114 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:33:14" (2/3) ... [2023-11-19 07:33:16,115 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7436633e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:33:16, skipping insertion in model container [2023-11-19 07:33:16,115 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:33:16" (3/3) ... [2023-11-19 07:33:16,117 INFO L112 eAbstractionObserver]: Analyzing ICFG mix054_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2023-11-19 07:33:16,142 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-19 07:33:16,142 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2023-11-19 07:33:16,143 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-19 07:33:16,224 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-19 07:33:16,281 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 108 places, 105 transitions, 218 flow [2023-11-19 07:33:16,359 INFO L124 PetriNetUnfolderBase]: 4/103 cut-off events. [2023-11-19 07:33:16,360 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 07:33:16,372 INFO L83 FinitePrefix]: Finished finitePrefix Result has 110 conditions, 103 events. 4/103 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 71 event pairs, 0 based on Foata normal form. 0/92 useless extension candidates. Maximal degree in co-relation 66. Up to 2 conditions per place. [2023-11-19 07:33:16,373 INFO L82 GeneralOperation]: Start removeDead. Operand has 108 places, 105 transitions, 218 flow [2023-11-19 07:33:16,387 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 106 places, 103 transitions, 212 flow [2023-11-19 07:33:16,392 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-19 07:33:16,408 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 106 places, 103 transitions, 212 flow [2023-11-19 07:33:16,415 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 106 places, 103 transitions, 212 flow [2023-11-19 07:33:16,416 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 106 places, 103 transitions, 212 flow [2023-11-19 07:33:16,460 INFO L124 PetriNetUnfolderBase]: 4/103 cut-off events. [2023-11-19 07:33:16,462 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 07:33:16,463 INFO L83 FinitePrefix]: Finished finitePrefix Result has 110 conditions, 103 events. 4/103 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 71 event pairs, 0 based on Foata normal form. 0/92 useless extension candidates. Maximal degree in co-relation 66. Up to 2 conditions per place. [2023-11-19 07:33:16,465 INFO L119 LiptonReduction]: Number of co-enabled transitions 1500 [2023-11-19 07:33:27,488 INFO L134 LiptonReduction]: Checked pairs total: 3340 [2023-11-19 07:33:27,489 INFO L136 LiptonReduction]: Total number of compositions: 115 [2023-11-19 07:33:27,508 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 07:33:27,516 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;@2cf3afd4, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-19 07:33:27,516 INFO L358 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2023-11-19 07:33:27,518 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-19 07:33:27,518 INFO L124 PetriNetUnfolderBase]: 0/0 cut-off events. [2023-11-19 07:33:27,518 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 07:33:27,518 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:33:27,519 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-11-19 07:33:27,520 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-19 07:33:27,526 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:33:27,526 INFO L85 PathProgramCache]: Analyzing trace with hash 498, now seen corresponding path program 1 times [2023-11-19 07:33:27,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-19 07:33:27,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1675693098] [2023-11-19 07:33:27,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:33:27,543 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-19 07:33:27,543 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da425da7-9893-4f82-8c0f-b25277bb1da3/bin/uautomizer-verify-uCwYo4JHxu/mathsat [2023-11-19 07:33:27,547 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da425da7-9893-4f82-8c0f-b25277bb1da3/bin/uautomizer-verify-uCwYo4JHxu/mathsat -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-19 07:33:27,558 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da425da7-9893-4f82-8c0f-b25277bb1da3/bin/uautomizer-verify-uCwYo4JHxu/mathsat -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-19 07:33:27,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:27,660 INFO L262 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-19 07:33:27,664 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 07:33:27,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:33:27,670 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-19 07:33:27,672 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-19 07:33:27,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1675693098] [2023-11-19 07:33:27,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1675693098] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:33:27,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:33:27,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-11-19 07:33:27,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062042932] [2023-11-19 07:33:27,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:33:27,687 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-19 07:33:27,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-19 07:33:27,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-19 07:33:27,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-19 07:33:27,727 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 220 [2023-11-19 07:33:27,730 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 22 transitions, 50 flow. Second operand has 2 states, 2 states have (on average 92.5) internal successors, (185), 2 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:27,730 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:33:27,731 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 220 [2023-11-19 07:33:27,732 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:33:28,047 INFO L124 PetriNetUnfolderBase]: 173/307 cut-off events. [2023-11-19 07:33:28,047 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-11-19 07:33:28,050 INFO L83 FinitePrefix]: Finished finitePrefix Result has 623 conditions, 307 events. 173/307 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1232 event pairs, 173 based on Foata normal form. 0/239 useless extension candidates. Maximal degree in co-relation 613. Up to 303 conditions per place. [2023-11-19 07:33:28,057 INFO L140 encePairwiseOnDemand]: 216/220 looper letters, 16 selfloop transitions, 0 changer transitions 0/18 dead transitions. [2023-11-19 07:33:28,057 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 18 transitions, 74 flow [2023-11-19 07:33:28,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-19 07:33:28,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-19 07:33:28,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 204 transitions. [2023-11-19 07:33:28,078 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4636363636363636 [2023-11-19 07:33:28,079 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 204 transitions. [2023-11-19 07:33:28,080 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 204 transitions. [2023-11-19 07:33:28,082 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:33:28,085 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 204 transitions. [2023-11-19 07:33:28,095 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 102.0) internal successors, (204), 2 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:28,101 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 220.0) internal successors, (660), 3 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:28,102 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 220.0) internal successors, (660), 3 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:28,104 INFO L175 Difference]: Start difference. First operand has 29 places, 22 transitions, 50 flow. Second operand 2 states and 204 transitions. [2023-11-19 07:33:28,105 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 18 transitions, 74 flow [2023-11-19 07:33:28,108 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 18 transitions, 72 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-19 07:33:28,109 INFO L231 Difference]: Finished difference. Result has 24 places, 18 transitions, 40 flow [2023-11-19 07:33:28,112 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=220, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=40, PETRI_PLACES=24, PETRI_TRANSITIONS=18} [2023-11-19 07:33:28,117 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, -5 predicate places. [2023-11-19 07:33:28,118 INFO L495 AbstractCegarLoop]: Abstraction has has 24 places, 18 transitions, 40 flow [2023-11-19 07:33:28,119 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 92.5) internal successors, (185), 2 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:28,119 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:33:28,119 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-19 07:33:28,128 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da425da7-9893-4f82-8c0f-b25277bb1da3/bin/uautomizer-verify-uCwYo4JHxu/mathsat -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)] Ended with exit code 0 [2023-11-19 07:33:28,322 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da425da7-9893-4f82-8c0f-b25277bb1da3/bin/uautomizer-verify-uCwYo4JHxu/mathsat -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-19 07:33:28,322 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-19 07:33:28,323 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:33:28,323 INFO L85 PathProgramCache]: Analyzing trace with hash 469998959, now seen corresponding path program 1 times [2023-11-19 07:33:28,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-19 07:33:28,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1125791294] [2023-11-19 07:33:28,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:33:28,325 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-19 07:33:28,325 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da425da7-9893-4f82-8c0f-b25277bb1da3/bin/uautomizer-verify-uCwYo4JHxu/mathsat [2023-11-19 07:33:28,326 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da425da7-9893-4f82-8c0f-b25277bb1da3/bin/uautomizer-verify-uCwYo4JHxu/mathsat -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-19 07:33:28,340 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da425da7-9893-4f82-8c0f-b25277bb1da3/bin/uautomizer-verify-uCwYo4JHxu/mathsat -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-19 07:33:28,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:28,424 INFO L262 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-19 07:33:28,425 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 07:33:28,456 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-19 07:33:28,457 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-19 07:33:28,457 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-19 07:33:28,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1125791294] [2023-11-19 07:33:28,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1125791294] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:33:28,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:33:28,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-19 07:33:28,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080345386] [2023-11-19 07:33:28,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:33:28,462 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 07:33:28,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-19 07:33:28,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:33:28,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:33:28,473 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 220 [2023-11-19 07:33:28,474 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 18 transitions, 40 flow. Second operand has 3 states, 3 states have (on average 92.66666666666667) internal successors, (278), 3 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:28,474 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:33:28,474 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 220 [2023-11-19 07:33:28,474 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:33:28,663 INFO L124 PetriNetUnfolderBase]: 135/266 cut-off events. [2023-11-19 07:33:28,664 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 07:33:28,665 INFO L83 FinitePrefix]: Finished finitePrefix Result has 519 conditions, 266 events. 135/266 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1136 event pairs, 21 based on Foata normal form. 0/233 useless extension candidates. Maximal degree in co-relation 516. Up to 187 conditions per place. [2023-11-19 07:33:28,667 INFO L140 encePairwiseOnDemand]: 217/220 looper letters, 19 selfloop transitions, 2 changer transitions 2/25 dead transitions. [2023-11-19 07:33:28,667 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 25 transitions, 100 flow [2023-11-19 07:33:28,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:33:28,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-19 07:33:28,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 297 transitions. [2023-11-19 07:33:28,671 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45 [2023-11-19 07:33:28,672 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 297 transitions. [2023-11-19 07:33:28,672 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 297 transitions. [2023-11-19 07:33:28,672 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:33:28,672 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 297 transitions. [2023-11-19 07:33:28,675 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 99.0) internal successors, (297), 3 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-19 07:33:28,680 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 220.0) internal successors, (880), 4 states have internal predecessors, (880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:28,682 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 220.0) internal successors, (880), 4 states have internal predecessors, (880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:28,682 INFO L175 Difference]: Start difference. First operand has 24 places, 18 transitions, 40 flow. Second operand 3 states and 297 transitions. [2023-11-19 07:33:28,682 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 25 transitions, 100 flow [2023-11-19 07:33:28,683 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 25 transitions, 100 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-19 07:33:28,684 INFO L231 Difference]: Finished difference. Result has 25 places, 16 transitions, 40 flow [2023-11-19 07:33:28,685 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=220, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=40, PETRI_PLACES=25, PETRI_TRANSITIONS=16} [2023-11-19 07:33:28,686 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, -4 predicate places. [2023-11-19 07:33:28,686 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 16 transitions, 40 flow [2023-11-19 07:33:28,687 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 92.66666666666667) internal successors, (278), 3 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:28,687 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:33:28,687 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:33:28,695 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da425da7-9893-4f82-8c0f-b25277bb1da3/bin/uautomizer-verify-uCwYo4JHxu/mathsat -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-19 07:33:28,895 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da425da7-9893-4f82-8c0f-b25277bb1da3/bin/uautomizer-verify-uCwYo4JHxu/mathsat -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-19 07:33:28,895 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-19 07:33:28,896 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:33:28,896 INFO L85 PathProgramCache]: Analyzing trace with hash 697488270, now seen corresponding path program 1 times [2023-11-19 07:33:28,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-19 07:33:28,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1859089308] [2023-11-19 07:33:28,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:33:28,898 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-19 07:33:28,898 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da425da7-9893-4f82-8c0f-b25277bb1da3/bin/uautomizer-verify-uCwYo4JHxu/mathsat [2023-11-19 07:33:28,940 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da425da7-9893-4f82-8c0f-b25277bb1da3/bin/uautomizer-verify-uCwYo4JHxu/mathsat -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-19 07:33:28,955 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da425da7-9893-4f82-8c0f-b25277bb1da3/bin/uautomizer-verify-uCwYo4JHxu/mathsat -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-19 07:33:29,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:29,075 INFO L262 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-19 07:33:29,077 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 07:33:29,127 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-19 07:33:29,128 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-19 07:33:29,128 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-19 07:33:29,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1859089308] [2023-11-19 07:33:29,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1859089308] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:33:29,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:33:29,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 07:33:29,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746013735] [2023-11-19 07:33:29,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:33:29,130 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:33:29,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-19 07:33:29,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:33:29,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:33:29,160 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 220 [2023-11-19 07:33:29,161 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 16 transitions, 40 flow. Second operand has 4 states, 4 states have (on average 88.75) internal successors, (355), 4 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:29,161 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:33:29,162 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 220 [2023-11-19 07:33:29,162 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:33:29,325 INFO L124 PetriNetUnfolderBase]: 56/130 cut-off events. [2023-11-19 07:33:29,325 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2023-11-19 07:33:29,326 INFO L83 FinitePrefix]: Finished finitePrefix Result has 282 conditions, 130 events. 56/130 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 460 event pairs, 12 based on Foata normal form. 16/138 useless extension candidates. Maximal degree in co-relation 278. Up to 69 conditions per place. [2023-11-19 07:33:29,327 INFO L140 encePairwiseOnDemand]: 215/220 looper letters, 19 selfloop transitions, 3 changer transitions 13/37 dead transitions. [2023-11-19 07:33:29,327 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 37 transitions, 160 flow [2023-11-19 07:33:29,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 07:33:29,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-19 07:33:29,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 472 transitions. [2023-11-19 07:33:29,331 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4290909090909091 [2023-11-19 07:33:29,331 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 472 transitions. [2023-11-19 07:33:29,331 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 472 transitions. [2023-11-19 07:33:29,332 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:33:29,332 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 472 transitions. [2023-11-19 07:33:29,334 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 94.4) internal successors, (472), 5 states have internal predecessors, (472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:29,338 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 220.0) internal successors, (1320), 6 states have internal predecessors, (1320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:29,339 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 220.0) internal successors, (1320), 6 states have internal predecessors, (1320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:29,339 INFO L175 Difference]: Start difference. First operand has 25 places, 16 transitions, 40 flow. Second operand 5 states and 472 transitions. [2023-11-19 07:33:29,340 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 37 transitions, 160 flow [2023-11-19 07:33:29,341 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 37 transitions, 150 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-19 07:33:29,342 INFO L231 Difference]: Finished difference. Result has 29 places, 18 transitions, 63 flow [2023-11-19 07:33:29,342 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=220, PETRI_DIFFERENCE_MINUEND_FLOW=36, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=63, PETRI_PLACES=29, PETRI_TRANSITIONS=18} [2023-11-19 07:33:29,343 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 0 predicate places. [2023-11-19 07:33:29,343 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 18 transitions, 63 flow [2023-11-19 07:33:29,344 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 88.75) internal successors, (355), 4 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:29,344 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:33:29,344 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:33:29,352 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da425da7-9893-4f82-8c0f-b25277bb1da3/bin/uautomizer-verify-uCwYo4JHxu/mathsat -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-19 07:33:29,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da425da7-9893-4f82-8c0f-b25277bb1da3/bin/uautomizer-verify-uCwYo4JHxu/mathsat -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-19 07:33:29,547 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-19 07:33:29,548 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:33:29,548 INFO L85 PathProgramCache]: Analyzing trace with hash -1289597145, now seen corresponding path program 1 times [2023-11-19 07:33:29,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-19 07:33:29,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [228979637] [2023-11-19 07:33:29,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:33:29,549 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-19 07:33:29,549 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da425da7-9893-4f82-8c0f-b25277bb1da3/bin/uautomizer-verify-uCwYo4JHxu/mathsat [2023-11-19 07:33:29,550 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da425da7-9893-4f82-8c0f-b25277bb1da3/bin/uautomizer-verify-uCwYo4JHxu/mathsat -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-19 07:33:29,554 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da425da7-9893-4f82-8c0f-b25277bb1da3/bin/uautomizer-verify-uCwYo4JHxu/mathsat -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-19 07:33:29,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:29,674 INFO L262 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-19 07:33:29,675 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 07:33:29,734 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-19 07:33:29,734 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-19 07:33:29,734 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-19 07:33:29,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [228979637] [2023-11-19 07:33:29,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [228979637] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:33:29,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:33:29,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 07:33:29,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340518853] [2023-11-19 07:33:29,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:33:29,736 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:33:29,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-19 07:33:29,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:33:29,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:33:29,768 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 220 [2023-11-19 07:33:29,769 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 18 transitions, 63 flow. Second operand has 5 states, 5 states have (on average 89.0) internal successors, (445), 5 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:29,769 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:33:29,769 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 220 [2023-11-19 07:33:29,769 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:33:29,963 INFO L124 PetriNetUnfolderBase]: 20/61 cut-off events. [2023-11-19 07:33:29,963 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2023-11-19 07:33:29,964 INFO L83 FinitePrefix]: Finished finitePrefix Result has 168 conditions, 61 events. 20/61 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 148 event pairs, 8 based on Foata normal form. 7/66 useless extension candidates. Maximal degree in co-relation 161. Up to 24 conditions per place. [2023-11-19 07:33:29,964 INFO L140 encePairwiseOnDemand]: 215/220 looper letters, 17 selfloop transitions, 5 changer transitions 7/31 dead transitions. [2023-11-19 07:33:29,964 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 31 transitions, 159 flow [2023-11-19 07:33:29,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 07:33:29,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-19 07:33:29,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 553 transitions. [2023-11-19 07:33:29,968 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41893939393939394 [2023-11-19 07:33:29,968 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 553 transitions. [2023-11-19 07:33:29,968 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 553 transitions. [2023-11-19 07:33:29,969 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:33:29,969 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 553 transitions. [2023-11-19 07:33:29,971 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 92.16666666666667) internal successors, (553), 6 states have internal predecessors, (553), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:29,975 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 220.0) internal successors, (1540), 7 states have internal predecessors, (1540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:29,976 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 220.0) internal successors, (1540), 7 states have internal predecessors, (1540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:29,977 INFO L175 Difference]: Start difference. First operand has 29 places, 18 transitions, 63 flow. Second operand 6 states and 553 transitions. [2023-11-19 07:33:29,977 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 31 transitions, 159 flow [2023-11-19 07:33:29,978 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 31 transitions, 146 flow, removed 5 selfloop flow, removed 2 redundant places. [2023-11-19 07:33:29,979 INFO L231 Difference]: Finished difference. Result has 33 places, 18 transitions, 74 flow [2023-11-19 07:33:29,980 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=220, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=74, PETRI_PLACES=33, PETRI_TRANSITIONS=18} [2023-11-19 07:33:29,981 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 4 predicate places. [2023-11-19 07:33:29,981 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 18 transitions, 74 flow [2023-11-19 07:33:29,982 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 89.0) internal successors, (445), 5 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:29,982 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:33:29,982 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:33:29,993 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da425da7-9893-4f82-8c0f-b25277bb1da3/bin/uautomizer-verify-uCwYo4JHxu/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-11-19 07:33:30,183 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da425da7-9893-4f82-8c0f-b25277bb1da3/bin/uautomizer-verify-uCwYo4JHxu/mathsat -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-19 07:33:30,183 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-19 07:33:30,184 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:33:30,184 INFO L85 PathProgramCache]: Analyzing trace with hash -2141973844, now seen corresponding path program 1 times [2023-11-19 07:33:30,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-19 07:33:30,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [37481454] [2023-11-19 07:33:30,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:33:30,185 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-19 07:33:30,185 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da425da7-9893-4f82-8c0f-b25277bb1da3/bin/uautomizer-verify-uCwYo4JHxu/mathsat [2023-11-19 07:33:30,187 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da425da7-9893-4f82-8c0f-b25277bb1da3/bin/uautomizer-verify-uCwYo4JHxu/mathsat -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-19 07:33:30,190 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da425da7-9893-4f82-8c0f-b25277bb1da3/bin/uautomizer-verify-uCwYo4JHxu/mathsat -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-19 07:33:30,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:30,342 INFO L262 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-19 07:33:30,346 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 07:33:30,598 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-19 07:33:30,598 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-19 07:33:30,598 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-19 07:33:30,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [37481454] [2023-11-19 07:33:30,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [37481454] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:33:30,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:33:30,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 07:33:30,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894142420] [2023-11-19 07:33:30,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:33:30,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:33:30,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-19 07:33:30,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:33:30,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:33:30,708 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 220 [2023-11-19 07:33:30,709 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 18 transitions, 74 flow. Second operand has 4 states, 4 states have (on average 82.25) internal successors, (329), 4 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:30,709 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:33:30,709 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 220 [2023-11-19 07:33:30,709 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:33:30,799 INFO L124 PetriNetUnfolderBase]: 15/46 cut-off events. [2023-11-19 07:33:30,800 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2023-11-19 07:33:30,800 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 46 events. 15/46 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 92 event pairs, 7 based on Foata normal form. 0/46 useless extension candidates. Maximal degree in co-relation 128. Up to 38 conditions per place. [2023-11-19 07:33:30,801 INFO L140 encePairwiseOnDemand]: 217/220 looper letters, 16 selfloop transitions, 2 changer transitions 0/20 dead transitions. [2023-11-19 07:33:30,801 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 20 transitions, 119 flow [2023-11-19 07:33:30,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:33:30,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-19 07:33:30,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 333 transitions. [2023-11-19 07:33:30,804 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3784090909090909 [2023-11-19 07:33:30,805 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 333 transitions. [2023-11-19 07:33:30,805 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 333 transitions. [2023-11-19 07:33:30,805 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:33:30,805 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 333 transitions. [2023-11-19 07:33:30,807 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 83.25) internal successors, (333), 4 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:30,810 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 220.0) internal successors, (1100), 5 states have internal predecessors, (1100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:30,811 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 220.0) internal successors, (1100), 5 states have internal predecessors, (1100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:30,811 INFO L175 Difference]: Start difference. First operand has 33 places, 18 transitions, 74 flow. Second operand 4 states and 333 transitions. [2023-11-19 07:33:30,811 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 20 transitions, 119 flow [2023-11-19 07:33:30,813 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 20 transitions, 102 flow, removed 5 selfloop flow, removed 5 redundant places. [2023-11-19 07:33:30,815 INFO L231 Difference]: Finished difference. Result has 28 places, 17 transitions, 60 flow [2023-11-19 07:33:30,815 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=220, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=60, PETRI_PLACES=28, PETRI_TRANSITIONS=17} [2023-11-19 07:33:30,818 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, -1 predicate places. [2023-11-19 07:33:30,818 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 17 transitions, 60 flow [2023-11-19 07:33:30,819 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 82.25) internal successors, (329), 4 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:30,819 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:33:30,819 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:33:30,829 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da425da7-9893-4f82-8c0f-b25277bb1da3/bin/uautomizer-verify-uCwYo4JHxu/mathsat -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-19 07:33:31,022 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da425da7-9893-4f82-8c0f-b25277bb1da3/bin/uautomizer-verify-uCwYo4JHxu/mathsat -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-19 07:33:31,026 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-19 07:33:31,026 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:33:31,027 INFO L85 PathProgramCache]: Analyzing trace with hash -1419690979, now seen corresponding path program 1 times [2023-11-19 07:33:31,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-19 07:33:31,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1353760737] [2023-11-19 07:33:31,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:33:31,028 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-19 07:33:31,028 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da425da7-9893-4f82-8c0f-b25277bb1da3/bin/uautomizer-verify-uCwYo4JHxu/mathsat [2023-11-19 07:33:31,032 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da425da7-9893-4f82-8c0f-b25277bb1da3/bin/uautomizer-verify-uCwYo4JHxu/mathsat -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-19 07:33:31,047 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da425da7-9893-4f82-8c0f-b25277bb1da3/bin/uautomizer-verify-uCwYo4JHxu/mathsat -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-19 07:33:31,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:31,190 INFO L262 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-19 07:33:31,192 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 07:33:31,230 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-19 07:33:31,230 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-19 07:33:31,231 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-19 07:33:31,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1353760737] [2023-11-19 07:33:31,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1353760737] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:33:31,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:33:31,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 07:33:31,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168260405] [2023-11-19 07:33:31,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:33:31,232 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:33:31,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-19 07:33:31,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:33:31,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:33:31,241 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 220 [2023-11-19 07:33:31,242 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 17 transitions, 60 flow. Second operand has 4 states, 4 states have (on average 91.5) internal successors, (366), 4 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:31,242 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:33:31,243 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 220 [2023-11-19 07:33:31,243 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:33:31,367 INFO L124 PetriNetUnfolderBase]: 21/71 cut-off events. [2023-11-19 07:33:31,367 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2023-11-19 07:33:31,367 INFO L83 FinitePrefix]: Finished finitePrefix Result has 191 conditions, 71 events. 21/71 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 212 event pairs, 0 based on Foata normal form. 1/72 useless extension candidates. Maximal degree in co-relation 185. Up to 39 conditions per place. [2023-11-19 07:33:31,368 INFO L140 encePairwiseOnDemand]: 217/220 looper letters, 17 selfloop transitions, 1 changer transitions 12/31 dead transitions. [2023-11-19 07:33:31,368 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 31 transitions, 172 flow [2023-11-19 07:33:31,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:33:31,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-19 07:33:31,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 379 transitions. [2023-11-19 07:33:31,372 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43068181818181817 [2023-11-19 07:33:31,372 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 379 transitions. [2023-11-19 07:33:31,372 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 379 transitions. [2023-11-19 07:33:31,373 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:33:31,373 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 379 transitions. [2023-11-19 07:33:31,374 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 94.75) internal successors, (379), 4 states have internal predecessors, (379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:31,376 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 220.0) internal successors, (1100), 5 states have internal predecessors, (1100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:31,377 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 220.0) internal successors, (1100), 5 states have internal predecessors, (1100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:31,378 INFO L175 Difference]: Start difference. First operand has 28 places, 17 transitions, 60 flow. Second operand 4 states and 379 transitions. [2023-11-19 07:33:31,378 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 31 transitions, 172 flow [2023-11-19 07:33:31,379 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 31 transitions, 168 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-19 07:33:31,380 INFO L231 Difference]: Finished difference. Result has 31 places, 17 transitions, 64 flow [2023-11-19 07:33:31,380 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=220, PETRI_DIFFERENCE_MINUEND_FLOW=57, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=64, PETRI_PLACES=31, PETRI_TRANSITIONS=17} [2023-11-19 07:33:31,381 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 2 predicate places. [2023-11-19 07:33:31,382 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 17 transitions, 64 flow [2023-11-19 07:33:31,382 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 91.5) internal successors, (366), 4 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:31,382 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:33:31,383 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:33:31,392 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da425da7-9893-4f82-8c0f-b25277bb1da3/bin/uautomizer-verify-uCwYo4JHxu/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-11-19 07:33:31,586 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da425da7-9893-4f82-8c0f-b25277bb1da3/bin/uautomizer-verify-uCwYo4JHxu/mathsat -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-19 07:33:31,586 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-19 07:33:31,587 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:33:31,587 INFO L85 PathProgramCache]: Analyzing trace with hash -60038235, now seen corresponding path program 2 times [2023-11-19 07:33:31,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-19 07:33:31,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [194614153] [2023-11-19 07:33:31,588 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-19 07:33:31,588 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-19 07:33:31,588 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da425da7-9893-4f82-8c0f-b25277bb1da3/bin/uautomizer-verify-uCwYo4JHxu/mathsat [2023-11-19 07:33:31,594 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da425da7-9893-4f82-8c0f-b25277bb1da3/bin/uautomizer-verify-uCwYo4JHxu/mathsat -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-19 07:33:31,596 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da425da7-9893-4f82-8c0f-b25277bb1da3/bin/uautomizer-verify-uCwYo4JHxu/mathsat -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-19 07:33:31,740 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-19 07:33:31,740 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-19 07:33:31,745 INFO L262 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 16 conjunts are in the unsatisfiable core [2023-11-19 07:33:31,748 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 07:33:32,106 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-19 07:33:32,106 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-19 07:33:32,107 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-19 07:33:32,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [194614153] [2023-11-19 07:33:32,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [194614153] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:33:32,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:33:32,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-19 07:33:32,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127388175] [2023-11-19 07:33:32,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:33:32,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-19 07:33:32,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-19 07:33:32,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-19 07:33:32,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-11-19 07:33:32,174 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 220 [2023-11-19 07:33:32,176 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 17 transitions, 64 flow. Second operand has 8 states, 8 states have (on average 88.75) internal successors, (710), 8 states have internal predecessors, (710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:32,176 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:33:32,176 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 220 [2023-11-19 07:33:32,176 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:33:32,314 INFO L124 PetriNetUnfolderBase]: 21/68 cut-off events. [2023-11-19 07:33:32,314 INFO L125 PetriNetUnfolderBase]: For 44/44 co-relation queries the response was YES. [2023-11-19 07:33:32,315 INFO L83 FinitePrefix]: Finished finitePrefix Result has 204 conditions, 68 events. 21/68 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 165 event pairs, 3 based on Foata normal form. 1/69 useless extension candidates. Maximal degree in co-relation 196. Up to 28 conditions per place. [2023-11-19 07:33:32,315 INFO L140 encePairwiseOnDemand]: 215/220 looper letters, 15 selfloop transitions, 3 changer transitions 12/31 dead transitions. [2023-11-19 07:33:32,315 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 31 transitions, 178 flow [2023-11-19 07:33:32,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 07:33:32,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-19 07:33:32,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 462 transitions. [2023-11-19 07:33:32,319 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42 [2023-11-19 07:33:32,319 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 462 transitions. [2023-11-19 07:33:32,319 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 462 transitions. [2023-11-19 07:33:32,320 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:33:32,320 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 462 transitions. [2023-11-19 07:33:32,321 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 92.4) internal successors, (462), 5 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:32,324 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 220.0) internal successors, (1320), 6 states have internal predecessors, (1320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:32,324 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 220.0) internal successors, (1320), 6 states have internal predecessors, (1320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:32,325 INFO L175 Difference]: Start difference. First operand has 31 places, 17 transitions, 64 flow. Second operand 5 states and 462 transitions. [2023-11-19 07:33:32,325 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 31 transitions, 178 flow [2023-11-19 07:33:32,326 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 31 transitions, 174 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-11-19 07:33:32,327 INFO L231 Difference]: Finished difference. Result has 34 places, 17 transitions, 74 flow [2023-11-19 07:33:32,328 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=220, PETRI_DIFFERENCE_MINUEND_FLOW=61, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=74, PETRI_PLACES=34, PETRI_TRANSITIONS=17} [2023-11-19 07:33:32,328 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 5 predicate places. [2023-11-19 07:33:32,329 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 17 transitions, 74 flow [2023-11-19 07:33:32,329 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 88.75) internal successors, (710), 8 states have internal predecessors, (710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:32,329 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:33:32,330 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:33:32,341 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da425da7-9893-4f82-8c0f-b25277bb1da3/bin/uautomizer-verify-uCwYo4JHxu/mathsat -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-19 07:33:32,532 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da425da7-9893-4f82-8c0f-b25277bb1da3/bin/uautomizer-verify-uCwYo4JHxu/mathsat -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-19 07:33:32,533 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-19 07:33:32,533 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:33:32,533 INFO L85 PathProgramCache]: Analyzing trace with hash 570053517, now seen corresponding path program 3 times [2023-11-19 07:33:32,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-19 07:33:32,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [828111594] [2023-11-19 07:33:32,534 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-19 07:33:32,534 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-19 07:33:32,534 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da425da7-9893-4f82-8c0f-b25277bb1da3/bin/uautomizer-verify-uCwYo4JHxu/mathsat [2023-11-19 07:33:32,536 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da425da7-9893-4f82-8c0f-b25277bb1da3/bin/uautomizer-verify-uCwYo4JHxu/mathsat -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-19 07:33:32,579 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da425da7-9893-4f82-8c0f-b25277bb1da3/bin/uautomizer-verify-uCwYo4JHxu/mathsat -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-19 07:33:32,688 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-11-19 07:33:32,688 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-11-19 07:33:32,689 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 07:33:32,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:33:32,848 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-11-19 07:33:32,848 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-19 07:33:32,849 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK (9 of 10 remaining) [2023-11-19 07:33:32,852 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (8 of 10 remaining) [2023-11-19 07:33:32,852 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 10 remaining) [2023-11-19 07:33:32,852 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 10 remaining) [2023-11-19 07:33:32,853 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 10 remaining) [2023-11-19 07:33:32,853 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 10 remaining) [2023-11-19 07:33:32,853 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK (3 of 10 remaining) [2023-11-19 07:33:32,853 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 10 remaining) [2023-11-19 07:33:32,854 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 10 remaining) [2023-11-19 07:33:32,854 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 10 remaining) [2023-11-19 07:33:32,865 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da425da7-9893-4f82-8c0f-b25277bb1da3/bin/uautomizer-verify-uCwYo4JHxu/mathsat -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)] Forceful destruction successful, exit code 0 [2023-11-19 07:33:33,058 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da425da7-9893-4f82-8c0f-b25277bb1da3/bin/uautomizer-verify-uCwYo4JHxu/mathsat -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-19 07:33:33,058 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1] [2023-11-19 07:33:33,063 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-19 07:33:33,063 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-19 07:33:33,115 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre3 could not be translated [2023-11-19 07:33:33,117 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-19 07:33:33,123 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-19 07:33:33,150 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 07:33:33 BasicIcfg [2023-11-19 07:33:33,151 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-19 07:33:33,151 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-19 07:33:33,151 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-19 07:33:33,152 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-19 07:33:33,152 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:33:16" (3/4) ... [2023-11-19 07:33:33,154 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-19 07:33:33,155 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-19 07:33:33,159 INFO L158 Benchmark]: Toolchain (without parser) took 19168.49ms. Allocated memory was 81.8MB in the beginning and 161.5MB in the end (delta: 79.7MB). Free memory was 56.5MB in the beginning and 55.1MB in the end (delta: 1.4MB). Peak memory consumption was 81.3MB. Max. memory is 16.1GB. [2023-11-19 07:33:33,160 INFO L158 Benchmark]: CDTParser took 0.34ms. Allocated memory is still 81.8MB. Free memory was 57.5MB in the beginning and 57.4MB in the end (delta: 148.1kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-19 07:33:33,160 INFO L158 Benchmark]: CACSL2BoogieTranslator took 910.65ms. Allocated memory is still 81.8MB. Free memory was 56.5MB in the beginning and 54.5MB in the end (delta: 2.0MB). Peak memory consumption was 24.6MB. Max. memory is 16.1GB. [2023-11-19 07:33:33,160 INFO L158 Benchmark]: Boogie Procedure Inliner took 128.42ms. Allocated memory is still 81.8MB. Free memory was 54.5MB in the beginning and 51.8MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-19 07:33:33,161 INFO L158 Benchmark]: Boogie Preprocessor took 87.57ms. Allocated memory is still 81.8MB. Free memory was 51.8MB in the beginning and 49.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-19 07:33:33,161 INFO L158 Benchmark]: RCFGBuilder took 986.93ms. Allocated memory was 81.8MB in the beginning and 111.1MB in the end (delta: 29.4MB). Free memory was 49.7MB in the beginning and 62.0MB in the end (delta: -12.4MB). Peak memory consumption was 21.4MB. Max. memory is 16.1GB. [2023-11-19 07:33:33,162 INFO L158 Benchmark]: TraceAbstraction took 17042.21ms. Allocated memory was 111.1MB in the beginning and 161.5MB in the end (delta: 50.3MB). Free memory was 61.5MB in the beginning and 55.1MB in the end (delta: 6.4MB). Peak memory consumption was 56.2MB. Max. memory is 16.1GB. [2023-11-19 07:33:33,166 INFO L158 Benchmark]: Witness Printer took 4.16ms. Allocated memory is still 161.5MB. Free memory is still 55.1MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-19 07:33:33,169 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.34ms. Allocated memory is still 81.8MB. Free memory was 57.5MB in the beginning and 57.4MB in the end (delta: 148.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 910.65ms. Allocated memory is still 81.8MB. Free memory was 56.5MB in the beginning and 54.5MB in the end (delta: 2.0MB). Peak memory consumption was 24.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 128.42ms. Allocated memory is still 81.8MB. Free memory was 54.5MB in the beginning and 51.8MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 87.57ms. Allocated memory is still 81.8MB. Free memory was 51.8MB in the beginning and 49.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 986.93ms. Allocated memory was 81.8MB in the beginning and 111.1MB in the end (delta: 29.4MB). Free memory was 49.7MB in the beginning and 62.0MB in the end (delta: -12.4MB). Peak memory consumption was 21.4MB. Max. memory is 16.1GB. * TraceAbstraction took 17042.21ms. Allocated memory was 111.1MB in the beginning and 161.5MB in the end (delta: 50.3MB). Free memory was 61.5MB in the beginning and 55.1MB in the end (delta: 6.4MB). Peak memory consumption was 56.2MB. Max. memory is 16.1GB. * Witness Printer took 4.16ms. Allocated memory is still 161.5MB. Free memory is still 55.1MB. 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: 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: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 11.1s, 106 PlacesBefore, 29 PlacesAfterwards, 103 TransitionsBefore, 22 TransitionsAfterwards, 1500 CoEnabledTransitionPairs, 6 FixpointIterations, 47 TrivialSequentialCompositions, 54 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 4 ChoiceCompositions, 115 TotalNumberOfCompositions, 3340 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1660, independent: 1537, independent conditional: 0, independent unconditional: 1537, dependent: 123, dependent conditional: 0, dependent unconditional: 123, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 826, independent: 787, independent conditional: 0, independent unconditional: 787, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1660, independent: 750, independent conditional: 0, independent unconditional: 750, dependent: 84, dependent conditional: 0, dependent unconditional: 84, unknown: 826, unknown conditional: 0, unknown unconditional: 826] , Statistics on independence cache: Total cache size (in pairs): 44, Positive cache size: 33, Positive conditional cache size: 0, Positive unconditional cache size: 33, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [L708] 0 int __unbuffered_cnt = 0; [L710] 0 int __unbuffered_p1_EAX = 0; [L711] 0 _Bool main$tmp_guard0; [L712] 0 _Bool main$tmp_guard1; [L714] 0 int x = 0; [L715] 0 _Bool x$flush_delayed; [L716] 0 int x$mem_tmp; [L717] 0 _Bool x$r_buff0_thd0; [L718] 0 _Bool x$r_buff0_thd1; [L719] 0 _Bool x$r_buff0_thd2; [L720] 0 _Bool x$r_buff1_thd0; [L721] 0 _Bool x$r_buff1_thd1; [L722] 0 _Bool x$r_buff1_thd2; [L723] 0 _Bool x$read_delayed; [L724] 0 int *x$read_delayed_var; [L725] 0 int x$w_buff0; [L726] 0 _Bool x$w_buff0_used; [L727] 0 int x$w_buff1; [L728] 0 _Bool x$w_buff1_used; [L730] 0 int y = 0; [L731] 0 _Bool weak$$choice0; [L732] 0 _Bool weak$$choice2; [L792] 0 pthread_t t1447; [L793] FCALL, FORK 0 pthread_create(&t1447, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1447={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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L794] 0 pthread_t t1448; [L795] FCALL, FORK 0 pthread_create(&t1448, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1447={3:0}, t1448={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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L756] 2 x$w_buff1 = x$w_buff0 [L757] 2 x$w_buff0 = 2 [L758] 2 x$w_buff1_used = x$w_buff0_used [L759] 2 x$w_buff0_used = (_Bool)1 [L760] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L760] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L761] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L762] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L763] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L764] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L767] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L736] 1 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L739] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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=1] [L742] 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) [L743] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L744] 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 [L745] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L746] 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_p1_EAX=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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=1] [L770] 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) [L771] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L772] 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 [L773] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L774] 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_p1_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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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=1] [L777] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L779] 2 return 0; [L749] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L751] 1 return 0; [L797] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L799] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L799] RET 0 assume_abort_if_not(main$tmp_guard0) [L801] 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) [L802] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L803] 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 [L804] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L805] 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 [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1447={3:0}, t1448={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=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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=1] [L808] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L809] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L810] 0 x$flush_delayed = weak$$choice2 [L811] 0 x$mem_tmp = x [L812] 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) [L813] 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)) [L814] 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)) [L815] 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)) [L816] 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)) [L817] 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)) [L818] 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)) [L819] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0) [L820] 0 x = x$flush_delayed ? x$mem_tmp : x [L821] 0 x$flush_delayed = (_Bool)0 [L823] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "mix054_pso.opt_rmo.opt_tso.oepc_tso.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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=1] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 790]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 795]: 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: 793]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 121 locations, 10 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 16.8s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 11.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 164 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 113 mSDsluCounter, 48 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 34 mSDsCounter, 45 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 473 IncrementalHoareTripleChecker+Invalid, 518 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 45 mSolverCounterUnsat, 14 mSDtfsCounter, 473 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 65 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=74occurred in iteration=4, InterpolantAutomatonStates: 29, 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, 0.8s InterpolantComputationTime, 84 NumberOfCodeBlocks, 84 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 62 ConstructedInterpolants, 0 QuantifiedInterpolants, 594 SizeOfPredicates, 5 NumberOfNonLiveVariables, 660 ConjunctsInSsa, 47 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 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-19 07:33:33,225 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da425da7-9893-4f82-8c0f-b25277bb1da3/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample