./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/mix053.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3b3024b-b024-412f-9855-fa0716ff9611/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3b3024b-b024-412f-9855-fa0716ff9611/bin/uautomizer-verify-qhAvR1uOyd/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3b3024b-b024-412f-9855-fa0716ff9611/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3b3024b-b024-412f-9855-fa0716ff9611/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix053.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3b3024b-b024-412f-9855-fa0716ff9611/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3b3024b-b024-412f-9855-fa0716ff9611/bin/uautomizer-verify-qhAvR1uOyd --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 998817f829569afa1d1e3eda89c2594d280c8ae81957c207a6b68804966cf3a6 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 15:53:04,978 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 15:53:05,063 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3b3024b-b024-412f-9855-fa0716ff9611/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-13 15:53:05,069 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 15:53:05,069 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 15:53:05,091 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 15:53:05,092 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 15:53:05,092 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 15:53:05,092 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 15:53:05,092 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 15:53:05,093 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 15:53:05,093 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 15:53:05,093 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 15:53:05,093 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 15:53:05,093 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 15:53:05,093 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 15:53:05,094 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 15:53:05,094 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 15:53:05,094 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 15:53:05,094 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 15:53:05,094 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-13 15:53:05,094 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-13 15:53:05,094 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-13 15:53:05,094 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 15:53:05,094 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-13 15:53:05,095 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 15:53:05,095 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-13 15:53:05,095 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 15:53:05,095 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 15:53:05,095 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 15:53:05,095 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 15:53:05,095 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 15:53:05,095 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 15:53:05,095 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 15:53:05,096 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 15:53:05,096 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 15:53:05,096 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-13 15:53:05,096 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 15:53:05,096 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 15:53:05,096 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 15:53:05,096 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 15:53:05,096 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 15:53:05,097 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_c3b3024b-b024-412f-9855-fa0716ff9611/bin/uautomizer-verify-qhAvR1uOyd Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 998817f829569afa1d1e3eda89c2594d280c8ae81957c207a6b68804966cf3a6 [2024-11-13 15:53:05,405 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 15:53:05,414 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 15:53:05,416 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 15:53:05,418 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 15:53:05,418 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 15:53:05,419 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3b3024b-b024-412f-9855-fa0716ff9611/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/pthread-wmm/mix053.opt.i Unable to find full path for "g++" [2024-11-13 15:53:07,153 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 15:53:07,495 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 15:53:07,496 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3b3024b-b024-412f-9855-fa0716ff9611/sv-benchmarks/c/pthread-wmm/mix053.opt.i [2024-11-13 15:53:07,512 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3b3024b-b024-412f-9855-fa0716ff9611/bin/uautomizer-verify-qhAvR1uOyd/data/72d6a4668/14e1a6e3d6524999a7a905700023fed7/FLAG9e0af62c3 [2024-11-13 15:53:07,530 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3b3024b-b024-412f-9855-fa0716ff9611/bin/uautomizer-verify-qhAvR1uOyd/data/72d6a4668/14e1a6e3d6524999a7a905700023fed7 [2024-11-13 15:53:07,532 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 15:53:07,533 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 15:53:07,536 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 15:53:07,536 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 15:53:07,541 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 15:53:07,542 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 03:53:07" (1/1) ... [2024-11-13 15:53:07,546 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f0bd5b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:53:07, skipping insertion in model container [2024-11-13 15:53:07,546 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 03:53:07" (1/1) ... [2024-11-13 15:53:07,603 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 15:53:08,011 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 15:53:08,022 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 15:53:08,111 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 15:53:08,158 INFO L204 MainTranslator]: Completed translation [2024-11-13 15:53:08,159 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:53:08 WrapperNode [2024-11-13 15:53:08,160 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 15:53:08,161 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 15:53:08,161 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 15:53:08,162 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 15:53:08,172 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:53:08" (1/1) ... [2024-11-13 15:53:08,185 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:53:08" (1/1) ... [2024-11-13 15:53:08,212 INFO L138 Inliner]: procedures = 176, calls = 52, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 130 [2024-11-13 15:53:08,213 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 15:53:08,213 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 15:53:08,214 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 15:53:08,214 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 15:53:08,221 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:53:08" (1/1) ... [2024-11-13 15:53:08,222 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:53:08" (1/1) ... [2024-11-13 15:53:08,225 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:53:08" (1/1) ... [2024-11-13 15:53:08,239 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-13 15:53:08,239 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:53:08" (1/1) ... [2024-11-13 15:53:08,239 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:53:08" (1/1) ... [2024-11-13 15:53:08,246 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:53:08" (1/1) ... [2024-11-13 15:53:08,248 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:53:08" (1/1) ... [2024-11-13 15:53:08,250 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:53:08" (1/1) ... [2024-11-13 15:53:08,251 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:53:08" (1/1) ... [2024-11-13 15:53:08,254 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 15:53:08,255 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 15:53:08,255 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 15:53:08,255 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 15:53:08,256 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:53:08" (1/1) ... [2024-11-13 15:53:08,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 15:53:08,277 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3b3024b-b024-412f-9855-fa0716ff9611/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:53:08,289 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3b3024b-b024-412f-9855-fa0716ff9611/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 15:53:08,293 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3b3024b-b024-412f-9855-fa0716ff9611/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 15:53:08,320 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-13 15:53:08,321 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 15:53:08,321 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-13 15:53:08,321 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-13 15:53:08,321 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-13 15:53:08,321 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-13 15:53:08,322 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-11-13 15:53:08,323 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-11-13 15:53:08,323 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2024-11-13 15:53:08,323 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2024-11-13 15:53:08,323 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-13 15:53:08,323 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-13 15:53:08,323 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 15:53:08,324 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 15:53:08,325 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-13 15:53:08,467 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 15:53:08,469 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 15:53:08,866 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-13 15:53:08,866 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 15:53:09,221 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 15:53:09,221 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-13 15:53:09,221 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 03:53:09 BoogieIcfgContainer [2024-11-13 15:53:09,221 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 15:53:09,228 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 15:53:09,228 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 15:53:09,233 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 15:53:09,234 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 03:53:07" (1/3) ... [2024-11-13 15:53:09,235 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31f26fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 03:53:09, skipping insertion in model container [2024-11-13 15:53:09,235 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:53:08" (2/3) ... [2024-11-13 15:53:09,237 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31f26fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 03:53:09, skipping insertion in model container [2024-11-13 15:53:09,237 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 03:53:09" (3/3) ... [2024-11-13 15:53:09,238 INFO L112 eAbstractionObserver]: Analyzing ICFG mix053.opt.i [2024-11-13 15:53:09,257 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 15:53:09,262 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG mix053.opt.i that has 5 procedures, 52 locations, 1 initial locations, 0 loop locations, and 3 error locations. [2024-11-13 15:53:09,262 INFO L492 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-13 15:53:09,354 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-13 15:53:09,399 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 64 places, 53 transitions, 122 flow [2024-11-13 15:53:09,452 INFO L124 PetriNetUnfolderBase]: 2/49 cut-off events. [2024-11-13 15:53:09,456 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-13 15:53:09,462 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62 conditions, 49 events. 2/49 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 103 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 53. Up to 2 conditions per place. [2024-11-13 15:53:09,463 INFO L82 GeneralOperation]: Start removeDead. Operand has 64 places, 53 transitions, 122 flow [2024-11-13 15:53:09,467 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 60 places, 49 transitions, 110 flow [2024-11-13 15:53:09,476 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 15:53:09,498 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, 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;@19c7948b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 15:53:09,498 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-11-13 15:53:09,513 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-13 15:53:09,517 INFO L124 PetriNetUnfolderBase]: 0/25 cut-off events. [2024-11-13 15:53:09,517 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-13 15:53:09,517 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 15:53:09,517 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:53:09,518 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P3Err0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-13 15:53:09,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:53:09,524 INFO L85 PathProgramCache]: Analyzing trace with hash -448655706, now seen corresponding path program 1 times [2024-11-13 15:53:09,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:53:09,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378843325] [2024-11-13 15:53:09,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:53:09,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:53:09,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:53:10,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 15:53:10,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:53:10,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378843325] [2024-11-13 15:53:10,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378843325] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:53:10,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:53:10,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-13 15:53:10,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277767776] [2024-11-13 15:53:10,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:53:10,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 15:53:10,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:53:10,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 15:53:10,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 15:53:10,253 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 53 [2024-11-13 15:53:10,258 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 49 transitions, 110 flow. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:53:10,258 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 15:53:10,258 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 53 [2024-11-13 15:53:10,259 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 15:53:10,900 INFO L124 PetriNetUnfolderBase]: 931/1659 cut-off events. [2024-11-13 15:53:10,901 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-13 15:53:10,911 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3055 conditions, 1659 events. 931/1659 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 11844 event pairs, 199 based on Foata normal form. 96/1715 useless extension candidates. Maximal degree in co-relation 3043. Up to 1021 conditions per place. [2024-11-13 15:53:10,927 INFO L140 encePairwiseOnDemand]: 48/53 looper letters, 29 selfloop transitions, 2 changer transitions 2/56 dead transitions. [2024-11-13 15:53:10,928 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 56 transitions, 190 flow [2024-11-13 15:53:10,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 15:53:10,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-13 15:53:10,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 119 transitions. [2024-11-13 15:53:10,944 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7484276729559748 [2024-11-13 15:53:10,946 INFO L175 Difference]: Start difference. First operand has 60 places, 49 transitions, 110 flow. Second operand 3 states and 119 transitions. [2024-11-13 15:53:10,947 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 56 transitions, 190 flow [2024-11-13 15:53:10,955 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 56 transitions, 186 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-13 15:53:10,961 INFO L231 Difference]: Finished difference. Result has 56 places, 44 transitions, 100 flow [2024-11-13 15:53:10,963 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=100, PETRI_PLACES=56, PETRI_TRANSITIONS=44} [2024-11-13 15:53:10,970 INFO L277 CegarLoopForPetriNet]: 60 programPoint places, -4 predicate places. [2024-11-13 15:53:10,970 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 44 transitions, 100 flow [2024-11-13 15:53:10,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:53:10,971 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 15:53:10,971 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:53:10,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-13 15:53:10,971 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-13 15:53:10,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:53:10,973 INFO L85 PathProgramCache]: Analyzing trace with hash 1374932447, now seen corresponding path program 1 times [2024-11-13 15:53:10,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:53:10,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541246104] [2024-11-13 15:53:10,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:53:10,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:53:11,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:53:11,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 15:53:11,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:53:11,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541246104] [2024-11-13 15:53:11,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541246104] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:53:11,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:53:11,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-13 15:53:11,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761392277] [2024-11-13 15:53:11,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:53:11,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 15:53:11,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:53:11,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 15:53:11,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 15:53:11,107 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 53 [2024-11-13 15:53:11,107 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 44 transitions, 100 flow. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:53:11,107 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 15:53:11,108 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 53 [2024-11-13 15:53:11,108 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 15:53:11,498 INFO L124 PetriNetUnfolderBase]: 815/1495 cut-off events. [2024-11-13 15:53:11,498 INFO L125 PetriNetUnfolderBase]: For 84/84 co-relation queries the response was YES. [2024-11-13 15:53:11,503 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2809 conditions, 1495 events. 815/1495 cut-off events. For 84/84 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 10947 event pairs, 815 based on Foata normal form. 48/1479 useless extension candidates. Maximal degree in co-relation 2799. Up to 1188 conditions per place. [2024-11-13 15:53:11,512 INFO L140 encePairwiseOnDemand]: 51/53 looper letters, 19 selfloop transitions, 1 changer transitions 1/43 dead transitions. [2024-11-13 15:53:11,512 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 43 transitions, 140 flow [2024-11-13 15:53:11,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 15:53:11,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-13 15:53:11,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 100 transitions. [2024-11-13 15:53:11,514 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6289308176100629 [2024-11-13 15:53:11,514 INFO L175 Difference]: Start difference. First operand has 56 places, 44 transitions, 100 flow. Second operand 3 states and 100 transitions. [2024-11-13 15:53:11,514 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 43 transitions, 140 flow [2024-11-13 15:53:11,518 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 43 transitions, 136 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-13 15:53:11,520 INFO L231 Difference]: Finished difference. Result has 54 places, 42 transitions, 94 flow [2024-11-13 15:53:11,520 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=94, PETRI_PLACES=54, PETRI_TRANSITIONS=42} [2024-11-13 15:53:11,521 INFO L277 CegarLoopForPetriNet]: 60 programPoint places, -6 predicate places. [2024-11-13 15:53:11,521 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 42 transitions, 94 flow [2024-11-13 15:53:11,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:53:11,521 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 15:53:11,521 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:53:11,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-13 15:53:11,522 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-13 15:53:11,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:53:11,522 INFO L85 PathProgramCache]: Analyzing trace with hash 1374933732, now seen corresponding path program 1 times [2024-11-13 15:53:11,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:53:11,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750059660] [2024-11-13 15:53:11,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:53:11,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:53:11,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:53:11,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 15:53:11,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:53:11,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750059660] [2024-11-13 15:53:11,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750059660] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:53:11,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:53:11,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 15:53:11,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631655754] [2024-11-13 15:53:11,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:53:11,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 15:53:11,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:53:11,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 15:53:11,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 15:53:11,950 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 53 [2024-11-13 15:53:11,951 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 42 transitions, 94 flow. Second operand has 5 states, 5 states have (on average 22.8) internal successors, (114), 5 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:53:11,951 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 15:53:11,951 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 53 [2024-11-13 15:53:11,951 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 15:53:14,888 INFO L124 PetriNetUnfolderBase]: 12981/19903 cut-off events. [2024-11-13 15:53:14,888 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-13 15:53:14,954 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37919 conditions, 19903 events. 12981/19903 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 1219. Compared 153506 event pairs, 2970 based on Foata normal form. 0/19306 useless extension candidates. Maximal degree in co-relation 37913. Up to 6477 conditions per place. [2024-11-13 15:53:15,027 INFO L140 encePairwiseOnDemand]: 42/53 looper letters, 40 selfloop transitions, 7 changer transitions 79/141 dead transitions. [2024-11-13 15:53:15,028 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 141 transitions, 548 flow [2024-11-13 15:53:15,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 15:53:15,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-13 15:53:15,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 308 transitions. [2024-11-13 15:53:15,031 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6457023060796646 [2024-11-13 15:53:15,031 INFO L175 Difference]: Start difference. First operand has 54 places, 42 transitions, 94 flow. Second operand 9 states and 308 transitions. [2024-11-13 15:53:15,031 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 141 transitions, 548 flow [2024-11-13 15:53:15,034 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 141 transitions, 547 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-13 15:53:15,038 INFO L231 Difference]: Finished difference. Result has 68 places, 47 transitions, 189 flow [2024-11-13 15:53:15,038 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=93, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=189, PETRI_PLACES=68, PETRI_TRANSITIONS=47} [2024-11-13 15:53:15,040 INFO L277 CegarLoopForPetriNet]: 60 programPoint places, 8 predicate places. [2024-11-13 15:53:15,040 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 47 transitions, 189 flow [2024-11-13 15:53:15,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.8) internal successors, (114), 5 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:53:15,040 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 15:53:15,040 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:53:15,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-13 15:53:15,040 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-13 15:53:15,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:53:15,041 INFO L85 PathProgramCache]: Analyzing trace with hash -1913618141, now seen corresponding path program 1 times [2024-11-13 15:53:15,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:53:15,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010165638] [2024-11-13 15:53:15,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:53:15,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:53:15,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:53:15,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 15:53:15,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:53:15,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010165638] [2024-11-13 15:53:15,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010165638] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:53:15,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:53:15,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 15:53:15,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062843173] [2024-11-13 15:53:15,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:53:15,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 15:53:15,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:53:15,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 15:53:15,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-13 15:53:15,423 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 53 [2024-11-13 15:53:15,423 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 47 transitions, 189 flow. Second operand has 6 states, 6 states have (on average 22.5) internal successors, (135), 6 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:53:15,423 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 15:53:15,423 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 53 [2024-11-13 15:53:15,423 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 15:53:17,840 INFO L124 PetriNetUnfolderBase]: 9622/16145 cut-off events. [2024-11-13 15:53:17,840 INFO L125 PetriNetUnfolderBase]: For 22918/22918 co-relation queries the response was YES. [2024-11-13 15:53:17,907 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46835 conditions, 16145 events. 9622/16145 cut-off events. For 22918/22918 co-relation queries the response was YES. Maximal size of possible extension queue 980. Compared 133843 event pairs, 916 based on Foata normal form. 388/16432 useless extension candidates. Maximal degree in co-relation 46820. Up to 5776 conditions per place. [2024-11-13 15:53:17,966 INFO L140 encePairwiseOnDemand]: 43/53 looper letters, 55 selfloop transitions, 11 changer transitions 78/159 dead transitions. [2024-11-13 15:53:17,967 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 159 transitions, 1037 flow [2024-11-13 15:53:17,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-13 15:53:17,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-13 15:53:17,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 334 transitions. [2024-11-13 15:53:17,970 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.630188679245283 [2024-11-13 15:53:17,970 INFO L175 Difference]: Start difference. First operand has 68 places, 47 transitions, 189 flow. Second operand 10 states and 334 transitions. [2024-11-13 15:53:17,970 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 159 transitions, 1037 flow [2024-11-13 15:53:18,076 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 159 transitions, 907 flow, removed 31 selfloop flow, removed 4 redundant places. [2024-11-13 15:53:18,079 INFO L231 Difference]: Finished difference. Result has 75 places, 54 transitions, 287 flow [2024-11-13 15:53:18,079 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=163, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=287, PETRI_PLACES=75, PETRI_TRANSITIONS=54} [2024-11-13 15:53:18,081 INFO L277 CegarLoopForPetriNet]: 60 programPoint places, 15 predicate places. [2024-11-13 15:53:18,081 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 54 transitions, 287 flow [2024-11-13 15:53:18,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.5) internal successors, (135), 6 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:53:18,081 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 15:53:18,082 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:53:18,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-13 15:53:18,083 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-13 15:53:18,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:53:18,083 INFO L85 PathProgramCache]: Analyzing trace with hash -711788445, now seen corresponding path program 1 times [2024-11-13 15:53:18,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:53:18,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921421744] [2024-11-13 15:53:18,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:53:18,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:53:18,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:53:18,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 15:53:18,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:53:18,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921421744] [2024-11-13 15:53:18,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921421744] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:53:18,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:53:18,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 15:53:18,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242616674] [2024-11-13 15:53:18,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:53:18,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 15:53:18,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:53:18,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 15:53:18,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 15:53:18,307 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 53 [2024-11-13 15:53:18,307 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 54 transitions, 287 flow. Second operand has 5 states, 5 states have (on average 25.8) internal successors, (129), 5 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:53:18,307 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 15:53:18,307 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 53 [2024-11-13 15:53:18,308 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 15:53:19,835 INFO L124 PetriNetUnfolderBase]: 7283/12694 cut-off events. [2024-11-13 15:53:19,835 INFO L125 PetriNetUnfolderBase]: For 31175/31717 co-relation queries the response was YES. [2024-11-13 15:53:19,901 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38769 conditions, 12694 events. 7283/12694 cut-off events. For 31175/31717 co-relation queries the response was YES. Maximal size of possible extension queue 809. Compared 106353 event pairs, 2810 based on Foata normal form. 611/12926 useless extension candidates. Maximal degree in co-relation 38747. Up to 7673 conditions per place. [2024-11-13 15:53:19,946 INFO L140 encePairwiseOnDemand]: 47/53 looper letters, 41 selfloop transitions, 6 changer transitions 41/114 dead transitions. [2024-11-13 15:53:19,946 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 114 transitions, 761 flow [2024-11-13 15:53:19,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 15:53:19,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-13 15:53:19,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 237 transitions. [2024-11-13 15:53:19,948 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6388140161725068 [2024-11-13 15:53:19,948 INFO L175 Difference]: Start difference. First operand has 75 places, 54 transitions, 287 flow. Second operand 7 states and 237 transitions. [2024-11-13 15:53:19,948 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 114 transitions, 761 flow [2024-11-13 15:53:20,091 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 114 transitions, 745 flow, removed 8 selfloop flow, removed 0 redundant places. [2024-11-13 15:53:20,092 INFO L231 Difference]: Finished difference. Result has 80 places, 59 transitions, 369 flow [2024-11-13 15:53:20,093 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=279, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=369, PETRI_PLACES=80, PETRI_TRANSITIONS=59} [2024-11-13 15:53:20,093 INFO L277 CegarLoopForPetriNet]: 60 programPoint places, 20 predicate places. [2024-11-13 15:53:20,094 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 59 transitions, 369 flow [2024-11-13 15:53:20,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.8) internal successors, (129), 5 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:53:20,094 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 15:53:20,094 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:53:20,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-13 15:53:20,094 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-13 15:53:20,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:53:20,095 INFO L85 PathProgramCache]: Analyzing trace with hash -347764354, now seen corresponding path program 1 times [2024-11-13 15:53:20,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:53:20,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157418667] [2024-11-13 15:53:20,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:53:20,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:53:20,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:53:20,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 15:53:20,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:53:20,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157418667] [2024-11-13 15:53:20,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157418667] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:53:20,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:53:20,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 15:53:20,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241451887] [2024-11-13 15:53:20,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:53:20,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 15:53:20,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:53:20,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 15:53:20,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 15:53:20,411 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 53 [2024-11-13 15:53:20,411 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 59 transitions, 369 flow. Second operand has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:53:20,411 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 15:53:20,411 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 53 [2024-11-13 15:53:20,411 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 15:53:23,523 INFO L124 PetriNetUnfolderBase]: 15892/24839 cut-off events. [2024-11-13 15:53:23,524 INFO L125 PetriNetUnfolderBase]: For 42176/46191 co-relation queries the response was YES. [2024-11-13 15:53:23,623 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66823 conditions, 24839 events. 15892/24839 cut-off events. For 42176/46191 co-relation queries the response was YES. Maximal size of possible extension queue 1300. Compared 193756 event pairs, 2553 based on Foata normal form. 1278/25319 useless extension candidates. Maximal degree in co-relation 66794. Up to 13738 conditions per place. [2024-11-13 15:53:23,706 INFO L140 encePairwiseOnDemand]: 46/53 looper letters, 48 selfloop transitions, 6 changer transitions 0/87 dead transitions. [2024-11-13 15:53:23,706 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 87 transitions, 563 flow [2024-11-13 15:53:23,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 15:53:23,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-13 15:53:23,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 141 transitions. [2024-11-13 15:53:23,708 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6650943396226415 [2024-11-13 15:53:23,708 INFO L175 Difference]: Start difference. First operand has 80 places, 59 transitions, 369 flow. Second operand 4 states and 141 transitions. [2024-11-13 15:53:23,708 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 87 transitions, 563 flow [2024-11-13 15:53:23,837 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 87 transitions, 529 flow, removed 14 selfloop flow, removed 7 redundant places. [2024-11-13 15:53:23,839 INFO L231 Difference]: Finished difference. Result has 74 places, 64 transitions, 381 flow [2024-11-13 15:53:23,840 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=335, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=381, PETRI_PLACES=74, PETRI_TRANSITIONS=64} [2024-11-13 15:53:23,842 INFO L277 CegarLoopForPetriNet]: 60 programPoint places, 14 predicate places. [2024-11-13 15:53:23,843 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 64 transitions, 381 flow [2024-11-13 15:53:23,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:53:23,843 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 15:53:23,843 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:53:23,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-13 15:53:23,843 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-13 15:53:23,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:53:23,844 INFO L85 PathProgramCache]: Analyzing trace with hash -30358056, now seen corresponding path program 1 times [2024-11-13 15:53:23,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:53:23,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432192729] [2024-11-13 15:53:23,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:53:23,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:53:23,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:53:24,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 15:53:24,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:53:24,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432192729] [2024-11-13 15:53:24,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432192729] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:53:24,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:53:24,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 15:53:24,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849167602] [2024-11-13 15:53:24,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:53:24,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 15:53:24,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:53:24,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 15:53:24,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-13 15:53:24,152 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 53 [2024-11-13 15:53:24,153 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 64 transitions, 381 flow. Second operand has 6 states, 6 states have (on average 22.666666666666668) internal successors, (136), 6 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:53:24,153 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 15:53:24,153 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 53 [2024-11-13 15:53:24,153 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 15:53:28,703 INFO L124 PetriNetUnfolderBase]: 22474/36385 cut-off events. [2024-11-13 15:53:28,703 INFO L125 PetriNetUnfolderBase]: For 83945/84696 co-relation queries the response was YES. [2024-11-13 15:53:28,840 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113850 conditions, 36385 events. 22474/36385 cut-off events. For 83945/84696 co-relation queries the response was YES. Maximal size of possible extension queue 1946. Compared 316586 event pairs, 7490 based on Foata normal form. 740/34278 useless extension candidates. Maximal degree in co-relation 113824. Up to 12008 conditions per place. [2024-11-13 15:53:28,906 INFO L140 encePairwiseOnDemand]: 43/53 looper letters, 108 selfloop transitions, 29 changer transitions 14/171 dead transitions. [2024-11-13 15:53:28,906 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 171 transitions, 1219 flow [2024-11-13 15:53:28,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-13 15:53:28,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-13 15:53:28,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 331 transitions. [2024-11-13 15:53:28,908 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6245283018867924 [2024-11-13 15:53:28,908 INFO L175 Difference]: Start difference. First operand has 74 places, 64 transitions, 381 flow. Second operand 10 states and 331 transitions. [2024-11-13 15:53:28,908 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 171 transitions, 1219 flow [2024-11-13 15:53:29,112 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 171 transitions, 1207 flow, removed 5 selfloop flow, removed 1 redundant places. [2024-11-13 15:53:29,114 INFO L231 Difference]: Finished difference. Result has 90 places, 80 transitions, 640 flow [2024-11-13 15:53:29,115 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=373, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=640, PETRI_PLACES=90, PETRI_TRANSITIONS=80} [2024-11-13 15:53:29,115 INFO L277 CegarLoopForPetriNet]: 60 programPoint places, 30 predicate places. [2024-11-13 15:53:29,115 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 80 transitions, 640 flow [2024-11-13 15:53:29,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.666666666666668) internal successors, (136), 6 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:53:29,116 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 15:53:29,116 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:53:29,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-13 15:53:29,116 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-13 15:53:29,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:53:29,117 INFO L85 PathProgramCache]: Analyzing trace with hash 563940492, now seen corresponding path program 1 times [2024-11-13 15:53:29,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:53:29,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055972670] [2024-11-13 15:53:29,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:53:29,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:53:29,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:53:29,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 15:53:29,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:53:29,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055972670] [2024-11-13 15:53:29,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055972670] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:53:29,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:53:29,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 15:53:29,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36016787] [2024-11-13 15:53:29,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:53:29,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 15:53:29,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:53:29,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 15:53:29,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-13 15:53:29,295 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 53 [2024-11-13 15:53:29,296 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 80 transitions, 640 flow. Second operand has 5 states, 5 states have (on average 25.0) internal successors, (125), 5 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:53:29,296 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 15:53:29,296 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 53 [2024-11-13 15:53:29,296 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 15:53:33,438 INFO L124 PetriNetUnfolderBase]: 21862/33740 cut-off events. [2024-11-13 15:53:33,438 INFO L125 PetriNetUnfolderBase]: For 75716/82591 co-relation queries the response was YES. [2024-11-13 15:53:33,595 INFO L83 FinitePrefix]: Finished finitePrefix Result has 102300 conditions, 33740 events. 21862/33740 cut-off events. For 75716/82591 co-relation queries the response was YES. Maximal size of possible extension queue 1773. Compared 266228 event pairs, 2247 based on Foata normal form. 1890/34757 useless extension candidates. Maximal degree in co-relation 102265. Up to 15157 conditions per place. [2024-11-13 15:53:33,654 INFO L140 encePairwiseOnDemand]: 46/53 looper letters, 66 selfloop transitions, 10 changer transitions 8/124 dead transitions. [2024-11-13 15:53:33,654 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 124 transitions, 987 flow [2024-11-13 15:53:33,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 15:53:33,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-13 15:53:33,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 180 transitions. [2024-11-13 15:53:33,655 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6792452830188679 [2024-11-13 15:53:33,655 INFO L175 Difference]: Start difference. First operand has 90 places, 80 transitions, 640 flow. Second operand 5 states and 180 transitions. [2024-11-13 15:53:33,655 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 124 transitions, 987 flow [2024-11-13 15:53:34,288 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 124 transitions, 951 flow, removed 18 selfloop flow, removed 0 redundant places. [2024-11-13 15:53:34,290 INFO L231 Difference]: Finished difference. Result has 96 places, 77 transitions, 587 flow [2024-11-13 15:53:34,291 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=604, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=587, PETRI_PLACES=96, PETRI_TRANSITIONS=77} [2024-11-13 15:53:34,291 INFO L277 CegarLoopForPetriNet]: 60 programPoint places, 36 predicate places. [2024-11-13 15:53:34,291 INFO L471 AbstractCegarLoop]: Abstraction has has 96 places, 77 transitions, 587 flow [2024-11-13 15:53:34,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.0) internal successors, (125), 5 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:53:34,292 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 15:53:34,292 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:53:34,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-13 15:53:34,292 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-13 15:53:34,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:53:34,293 INFO L85 PathProgramCache]: Analyzing trace with hash 1808375498, now seen corresponding path program 1 times [2024-11-13 15:53:34,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:53:34,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600366177] [2024-11-13 15:53:34,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:53:34,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:53:34,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:53:34,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 15:53:34,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:53:34,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600366177] [2024-11-13 15:53:34,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600366177] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:53:34,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:53:34,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 15:53:34,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710441107] [2024-11-13 15:53:34,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:53:34,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 15:53:34,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:53:34,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 15:53:34,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-13 15:53:34,579 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 53 [2024-11-13 15:53:34,579 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 77 transitions, 587 flow. Second operand has 6 states, 6 states have (on average 24.833333333333332) internal successors, (149), 6 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:53:34,579 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 15:53:34,579 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 53 [2024-11-13 15:53:34,580 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 15:53:37,747 INFO L124 PetriNetUnfolderBase]: 15388/23569 cut-off events. [2024-11-13 15:53:37,748 INFO L125 PetriNetUnfolderBase]: For 51607/59982 co-relation queries the response was YES. [2024-11-13 15:53:37,847 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77149 conditions, 23569 events. 15388/23569 cut-off events. For 51607/59982 co-relation queries the response was YES. Maximal size of possible extension queue 1365. Compared 176314 event pairs, 882 based on Foata normal form. 1525/24285 useless extension candidates. Maximal degree in co-relation 77110. Up to 7608 conditions per place. [2024-11-13 15:53:37,881 INFO L140 encePairwiseOnDemand]: 46/53 looper letters, 77 selfloop transitions, 14 changer transitions 2/132 dead transitions. [2024-11-13 15:53:37,881 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 132 transitions, 1014 flow [2024-11-13 15:53:37,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 15:53:37,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-13 15:53:37,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 217 transitions. [2024-11-13 15:53:37,882 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6823899371069182 [2024-11-13 15:53:37,882 INFO L175 Difference]: Start difference. First operand has 96 places, 77 transitions, 587 flow. Second operand 6 states and 217 transitions. [2024-11-13 15:53:37,882 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 132 transitions, 1014 flow [2024-11-13 15:53:37,933 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 132 transitions, 986 flow, removed 10 selfloop flow, removed 5 redundant places. [2024-11-13 15:53:37,935 INFO L231 Difference]: Finished difference. Result has 95 places, 81 transitions, 633 flow [2024-11-13 15:53:37,935 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=548, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=633, PETRI_PLACES=95, PETRI_TRANSITIONS=81} [2024-11-13 15:53:37,935 INFO L277 CegarLoopForPetriNet]: 60 programPoint places, 35 predicate places. [2024-11-13 15:53:37,935 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 81 transitions, 633 flow [2024-11-13 15:53:37,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.833333333333332) internal successors, (149), 6 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:53:37,936 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 15:53:37,936 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:53:37,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-13 15:53:37,936 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-13 15:53:37,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:53:37,936 INFO L85 PathProgramCache]: Analyzing trace with hash 1358168739, now seen corresponding path program 1 times [2024-11-13 15:53:37,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:53:37,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514124868] [2024-11-13 15:53:37,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:53:37,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:53:37,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:53:38,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 15:53:38,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:53:38,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514124868] [2024-11-13 15:53:38,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514124868] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:53:38,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:53:38,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 15:53:38,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921972797] [2024-11-13 15:53:38,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:53:38,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 15:53:38,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:53:38,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 15:53:38,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-13 15:53:38,170 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 53 [2024-11-13 15:53:38,171 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 81 transitions, 633 flow. Second operand has 7 states, 7 states have (on average 24.571428571428573) internal successors, (172), 7 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:53:38,171 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 15:53:38,171 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 53 [2024-11-13 15:53:38,171 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 15:53:41,087 INFO L124 PetriNetUnfolderBase]: 13340/20169 cut-off events. [2024-11-13 15:53:41,087 INFO L125 PetriNetUnfolderBase]: For 61790/70240 co-relation queries the response was YES. [2024-11-13 15:53:41,175 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72120 conditions, 20169 events. 13340/20169 cut-off events. For 61790/70240 co-relation queries the response was YES. Maximal size of possible extension queue 1365. Compared 148988 event pairs, 766 based on Foata normal form. 979/20347 useless extension candidates. Maximal degree in co-relation 72082. Up to 7608 conditions per place. [2024-11-13 15:53:41,197 INFO L140 encePairwiseOnDemand]: 46/53 looper letters, 71 selfloop transitions, 18 changer transitions 2/127 dead transitions. [2024-11-13 15:53:41,197 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 127 transitions, 973 flow [2024-11-13 15:53:41,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 15:53:41,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-13 15:53:41,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 238 transitions. [2024-11-13 15:53:41,198 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6415094339622641 [2024-11-13 15:53:41,199 INFO L175 Difference]: Start difference. First operand has 95 places, 81 transitions, 633 flow. Second operand 7 states and 238 transitions. [2024-11-13 15:53:41,199 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 127 transitions, 973 flow [2024-11-13 15:53:41,409 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 127 transitions, 899 flow, removed 29 selfloop flow, removed 11 redundant places. [2024-11-13 15:53:41,410 INFO L231 Difference]: Finished difference. Result has 90 places, 79 transitions, 591 flow [2024-11-13 15:53:41,410 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=536, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=591, PETRI_PLACES=90, PETRI_TRANSITIONS=79} [2024-11-13 15:53:41,410 INFO L277 CegarLoopForPetriNet]: 60 programPoint places, 30 predicate places. [2024-11-13 15:53:41,411 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 79 transitions, 591 flow [2024-11-13 15:53:41,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.571428571428573) internal successors, (172), 7 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:53:41,411 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 15:53:41,411 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:53:41,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-13 15:53:41,411 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-13 15:53:41,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:53:41,412 INFO L85 PathProgramCache]: Analyzing trace with hash 1959678978, now seen corresponding path program 1 times [2024-11-13 15:53:41,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:53:41,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95860757] [2024-11-13 15:53:41,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:53:41,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:53:41,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:53:42,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 15:53:42,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:53:42,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95860757] [2024-11-13 15:53:42,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95860757] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:53:42,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:53:42,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-13 15:53:42,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416023033] [2024-11-13 15:53:42,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:53:42,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-13 15:53:42,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:53:42,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-13 15:53:42,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-13 15:53:42,334 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 53 [2024-11-13 15:53:42,335 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 79 transitions, 591 flow. Second operand has 9 states, 9 states have (on average 21.555555555555557) internal successors, (194), 9 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:53:42,335 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 15:53:42,335 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 53 [2024-11-13 15:53:42,335 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 15:53:45,343 INFO L124 PetriNetUnfolderBase]: 15277/25870 cut-off events. [2024-11-13 15:53:45,343 INFO L125 PetriNetUnfolderBase]: For 86693/90597 co-relation queries the response was YES. [2024-11-13 15:53:45,462 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89395 conditions, 25870 events. 15277/25870 cut-off events. For 86693/90597 co-relation queries the response was YES. Maximal size of possible extension queue 2027. Compared 228447 event pairs, 2089 based on Foata normal form. 301/23777 useless extension candidates. Maximal degree in co-relation 89363. Up to 8060 conditions per place. [2024-11-13 15:53:45,498 INFO L140 encePairwiseOnDemand]: 40/53 looper letters, 100 selfloop transitions, 58 changer transitions 44/232 dead transitions. [2024-11-13 15:53:45,498 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 232 transitions, 2057 flow [2024-11-13 15:53:45,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 15:53:45,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-13 15:53:45,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 363 transitions. [2024-11-13 15:53:45,499 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5707547169811321 [2024-11-13 15:53:45,500 INFO L175 Difference]: Start difference. First operand has 90 places, 79 transitions, 591 flow. Second operand 12 states and 363 transitions. [2024-11-13 15:53:45,500 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 232 transitions, 2057 flow [2024-11-13 15:53:46,313 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 232 transitions, 1894 flow, removed 70 selfloop flow, removed 7 redundant places. [2024-11-13 15:53:46,317 INFO L231 Difference]: Finished difference. Result has 102 places, 129 transitions, 1212 flow [2024-11-13 15:53:46,317 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=518, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1212, PETRI_PLACES=102, PETRI_TRANSITIONS=129} [2024-11-13 15:53:46,318 INFO L277 CegarLoopForPetriNet]: 60 programPoint places, 42 predicate places. [2024-11-13 15:53:46,318 INFO L471 AbstractCegarLoop]: Abstraction has has 102 places, 129 transitions, 1212 flow [2024-11-13 15:53:46,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 21.555555555555557) internal successors, (194), 9 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:53:46,318 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 15:53:46,319 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:53:46,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-13 15:53:46,319 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-13 15:53:46,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:53:46,319 INFO L85 PathProgramCache]: Analyzing trace with hash -225133278, now seen corresponding path program 2 times [2024-11-13 15:53:46,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:53:46,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397157681] [2024-11-13 15:53:46,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:53:46,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:53:46,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:53:46,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 15:53:46,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:53:46,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397157681] [2024-11-13 15:53:46,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397157681] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:53:46,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:53:46,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 15:53:46,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563678418] [2024-11-13 15:53:46,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:53:46,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 15:53:46,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:53:46,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 15:53:46,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-13 15:53:46,723 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 53 [2024-11-13 15:53:46,723 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 129 transitions, 1212 flow. Second operand has 6 states, 6 states have (on average 22.833333333333332) internal successors, (137), 6 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:53:46,723 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 15:53:46,723 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 53 [2024-11-13 15:53:46,723 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 15:53:49,595 INFO L124 PetriNetUnfolderBase]: 12153/21475 cut-off events. [2024-11-13 15:53:49,595 INFO L125 PetriNetUnfolderBase]: For 75510/77735 co-relation queries the response was YES. [2024-11-13 15:53:49,725 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76774 conditions, 21475 events. 12153/21475 cut-off events. For 75510/77735 co-relation queries the response was YES. Maximal size of possible extension queue 1682. Compared 193664 event pairs, 2695 based on Foata normal form. 239/19805 useless extension candidates. Maximal degree in co-relation 76736. Up to 7716 conditions per place. [2024-11-13 15:53:49,758 INFO L140 encePairwiseOnDemand]: 42/53 looper letters, 89 selfloop transitions, 66 changer transitions 22/207 dead transitions. [2024-11-13 15:53:49,758 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 207 transitions, 2104 flow [2024-11-13 15:53:49,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 15:53:49,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-13 15:53:49,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 222 transitions. [2024-11-13 15:53:49,759 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5983827493261455 [2024-11-13 15:53:49,759 INFO L175 Difference]: Start difference. First operand has 102 places, 129 transitions, 1212 flow. Second operand 7 states and 222 transitions. [2024-11-13 15:53:49,759 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 207 transitions, 2104 flow [2024-11-13 15:53:50,445 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 207 transitions, 2047 flow, removed 6 selfloop flow, removed 4 redundant places. [2024-11-13 15:53:50,448 INFO L231 Difference]: Finished difference. Result has 108 places, 152 transitions, 1752 flow [2024-11-13 15:53:50,448 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=1173, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1752, PETRI_PLACES=108, PETRI_TRANSITIONS=152} [2024-11-13 15:53:50,449 INFO L277 CegarLoopForPetriNet]: 60 programPoint places, 48 predicate places. [2024-11-13 15:53:50,449 INFO L471 AbstractCegarLoop]: Abstraction has has 108 places, 152 transitions, 1752 flow [2024-11-13 15:53:50,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.833333333333332) internal successors, (137), 6 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:53:50,449 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 15:53:50,449 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:53:50,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-13 15:53:50,449 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-13 15:53:50,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:53:50,449 INFO L85 PathProgramCache]: Analyzing trace with hash 74881400, now seen corresponding path program 3 times [2024-11-13 15:53:50,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:53:50,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338836428] [2024-11-13 15:53:50,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:53:50,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:53:50,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:53:50,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 15:53:50,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:53:50,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338836428] [2024-11-13 15:53:50,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338836428] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:53:50,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:53:50,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 15:53:50,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493038831] [2024-11-13 15:53:50,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:53:50,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 15:53:50,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:53:50,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 15:53:50,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-13 15:53:50,690 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 53 [2024-11-13 15:53:50,691 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 152 transitions, 1752 flow. Second operand has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 6 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:53:50,691 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 15:53:50,691 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 53 [2024-11-13 15:53:50,691 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 15:53:53,889 INFO L124 PetriNetUnfolderBase]: 11661/22179 cut-off events. [2024-11-13 15:53:53,889 INFO L125 PetriNetUnfolderBase]: For 84540/90444 co-relation queries the response was YES. [2024-11-13 15:53:53,993 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77901 conditions, 22179 events. 11661/22179 cut-off events. For 84540/90444 co-relation queries the response was YES. Maximal size of possible extension queue 1823. Compared 220337 event pairs, 2474 based on Foata normal form. 1232/20928 useless extension candidates. Maximal degree in co-relation 77859. Up to 8750 conditions per place. [2024-11-13 15:53:54,008 INFO L140 encePairwiseOnDemand]: 48/53 looper letters, 33 selfloop transitions, 1 changer transitions 110/187 dead transitions. [2024-11-13 15:53:54,008 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 187 transitions, 2095 flow [2024-11-13 15:53:54,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 15:53:54,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-13 15:53:54,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 195 transitions. [2024-11-13 15:53:54,010 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6132075471698113 [2024-11-13 15:53:54,010 INFO L175 Difference]: Start difference. First operand has 108 places, 152 transitions, 1752 flow. Second operand 6 states and 195 transitions. [2024-11-13 15:53:54,010 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 187 transitions, 2095 flow [2024-11-13 15:53:54,871 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 187 transitions, 2079 flow, removed 8 selfloop flow, removed 2 redundant places. [2024-11-13 15:53:54,872 INFO L231 Difference]: Finished difference. Result has 112 places, 72 transitions, 593 flow [2024-11-13 15:53:54,872 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=1738, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=151, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=593, PETRI_PLACES=112, PETRI_TRANSITIONS=72} [2024-11-13 15:53:54,873 INFO L277 CegarLoopForPetriNet]: 60 programPoint places, 52 predicate places. [2024-11-13 15:53:54,873 INFO L471 AbstractCegarLoop]: Abstraction has has 112 places, 72 transitions, 593 flow [2024-11-13 15:53:54,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 6 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:53:54,873 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 15:53:54,873 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:53:54,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-13 15:53:54,873 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-13 15:53:54,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:53:54,874 INFO L85 PathProgramCache]: Analyzing trace with hash 989399186, now seen corresponding path program 4 times [2024-11-13 15:53:54,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:53:54,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057603470] [2024-11-13 15:53:54,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:53:54,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:53:54,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:53:55,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 15:53:55,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:53:55,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057603470] [2024-11-13 15:53:55,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057603470] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:53:55,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:53:55,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 15:53:55,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867071707] [2024-11-13 15:53:55,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:53:55,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 15:53:55,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:53:55,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 15:53:55,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 15:53:55,103 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 53 [2024-11-13 15:53:55,104 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 72 transitions, 593 flow. Second operand has 5 states, 5 states have (on average 26.8) internal successors, (134), 5 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:53:55,104 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 15:53:55,104 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 53 [2024-11-13 15:53:55,104 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 15:53:55,280 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([389] L764-->L767: Formula: (= v_~y~0_1 1) InVars {} OutVars{~y~0=v_~y~0_1} AuxVars[] AssignedVars[~y~0][31], [Black: 239#true, 42#L767true, 18#L817true, 63#true, 276#(= ~y~0 1), 56#L749true, 54#L795true, Black: 138#(< (mod ~main$tmp_guard0~0 256) 1), Black: 198#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 265#(and (= ~a~0 1) (= ~__unbuffered_p3_EAX~0 1)), Black: 206#(and (<= ~__unbuffered_cnt~0 3) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 268#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0)) (= ~__unbuffered_p3_EAX~0 1)), 65#true, 260#(= ~a~0 1), Black: 270#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0)) (= ~__unbuffered_p3_EAX~0 1)), 61#true, Black: 73#true, 72#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), 59#true, Black: 211#(and (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0)), Black: 225#(and (= ~z$w_buff0~0 ~a~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (not (= ~z$w_buff0~0 0)) (= ~z$w_buff0~0 ~__unbuffered_p3_EAX~0) (= ~z~0 0)), Black: 213#(and (= ~z$w_buff0~0 ~a~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (not (= ~z$w_buff0~0 0)) (= ~z~0 0)), 173#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 219#(and (= ~z$r_buff0_thd3~0 0) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))) (= ~z$w_buff0~0 0) (= ~z~0 0)), 246#(and (= ~a~0 1) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0)))), 215#(or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))), 97#(or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))), Black: 209#true, Black: 212#(and (= ~a~0 1) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0)), Black: 171#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 96#(<= ~y~0 0), 146#(or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))), Black: 175#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 94#true, 12#L852true, Black: 241#(= ~a~0 1), Black: 183#(< (mod ~main$tmp_guard0~0 256) 1), Black: 242#(or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))), Black: 189#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0))]) [2024-11-13 15:53:55,281 INFO L294 olderBase$Statistics]: this new event has 19 ancestors and is not cut-off event [2024-11-13 15:53:55,281 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is not cut-off event [2024-11-13 15:53:55,281 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is not cut-off event [2024-11-13 15:53:55,281 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is not cut-off event [2024-11-13 15:53:55,403 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([389] L764-->L767: Formula: (= v_~y~0_1 1) InVars {} OutVars{~y~0=v_~y~0_1} AuxVars[] AssignedVars[~y~0][31], [Black: 239#true, 42#L767true, 18#L817true, 63#true, 276#(= ~y~0 1), 56#L749true, Black: 140#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0)), Black: 198#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 265#(and (= ~a~0 1) (= ~__unbuffered_p3_EAX~0 1)), Black: 206#(and (<= ~__unbuffered_cnt~0 3) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 268#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0)) (= ~__unbuffered_p3_EAX~0 1)), 65#true, 260#(= ~a~0 1), Black: 270#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0)) (= ~__unbuffered_p3_EAX~0 1)), 61#true, 138#(< (mod ~main$tmp_guard0~0 256) 1), Black: 73#true, 202#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 72#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), 59#true, Black: 211#(and (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0)), Black: 225#(and (= ~z$w_buff0~0 ~a~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (not (= ~z$w_buff0~0 0)) (= ~z$w_buff0~0 ~__unbuffered_p3_EAX~0) (= ~z~0 0)), Black: 213#(and (= ~z$w_buff0~0 ~a~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (not (= ~z$w_buff0~0 0)) (= ~z~0 0)), 246#(and (= ~a~0 1) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0)))), 215#(or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))), 97#(or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))), Black: 219#(and (= ~z$r_buff0_thd3~0 0) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))) (= ~z$w_buff0~0 0) (= ~z~0 0)), Black: 209#true, Black: 212#(and (= ~a~0 1) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0)), Black: 171#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 146#(or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))), 38#P2EXITtrue, Black: 96#(<= ~y~0 0), Black: 94#true, 12#L852true, Black: 241#(= ~a~0 1), Black: 183#(< (mod ~main$tmp_guard0~0 256) 1), Black: 242#(or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))), Black: 189#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0))]) [2024-11-13 15:53:55,403 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is not cut-off event [2024-11-13 15:53:55,403 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is not cut-off event [2024-11-13 15:53:55,403 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is not cut-off event [2024-11-13 15:53:55,403 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is not cut-off event [2024-11-13 15:53:55,465 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([389] L764-->L767: Formula: (= v_~y~0_1 1) InVars {} OutVars{~y~0=v_~y~0_1} AuxVars[] AssignedVars[~y~0][31], [Black: 239#true, 42#L767true, 18#L817true, 63#true, 276#(= ~y~0 1), 50#L854true, 56#L749true, Black: 140#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0)), Black: 198#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 265#(and (= ~a~0 1) (= ~__unbuffered_p3_EAX~0 1)), Black: 206#(and (<= ~__unbuffered_cnt~0 3) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 268#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0)) (= ~__unbuffered_p3_EAX~0 1)), 65#true, 260#(= ~a~0 1), Black: 270#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0)) (= ~__unbuffered_p3_EAX~0 1)), 61#true, 138#(< (mod ~main$tmp_guard0~0 256) 1), Black: 73#true, 202#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 72#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), 59#true, Black: 211#(and (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0)), Black: 225#(and (= ~z$w_buff0~0 ~a~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (not (= ~z$w_buff0~0 0)) (= ~z$w_buff0~0 ~__unbuffered_p3_EAX~0) (= ~z~0 0)), Black: 213#(and (= ~z$w_buff0~0 ~a~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (not (= ~z$w_buff0~0 0)) (= ~z~0 0)), Black: 219#(and (= ~z$r_buff0_thd3~0 0) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))) (= ~z$w_buff0~0 0) (= ~z~0 0)), 246#(and (= ~a~0 1) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0)))), 215#(or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))), 97#(or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))), Black: 209#true, Black: 212#(and (= ~a~0 1) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0)), Black: 171#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 96#(<= ~y~0 0), 146#(or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))), 38#P2EXITtrue, Black: 94#true, Black: 241#(= ~a~0 1), Black: 183#(< (mod ~main$tmp_guard0~0 256) 1), Black: 242#(or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))), Black: 189#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0))]) [2024-11-13 15:53:55,465 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is not cut-off event [2024-11-13 15:53:55,466 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is not cut-off event [2024-11-13 15:53:55,466 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is not cut-off event [2024-11-13 15:53:55,466 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is not cut-off event [2024-11-13 15:53:56,282 INFO L124 PetriNetUnfolderBase]: 4389/8396 cut-off events. [2024-11-13 15:53:56,283 INFO L125 PetriNetUnfolderBase]: For 32264/33289 co-relation queries the response was YES. [2024-11-13 15:53:56,315 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28469 conditions, 8396 events. 4389/8396 cut-off events. For 32264/33289 co-relation queries the response was YES. Maximal size of possible extension queue 690. Compared 73481 event pairs, 1605 based on Foata normal form. 78/7269 useless extension candidates. Maximal degree in co-relation 28438. Up to 2954 conditions per place. [2024-11-13 15:53:56,321 INFO L140 encePairwiseOnDemand]: 48/53 looper letters, 28 selfloop transitions, 3 changer transitions 25/92 dead transitions. [2024-11-13 15:53:56,321 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 92 transitions, 769 flow [2024-11-13 15:53:56,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 15:53:56,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-13 15:53:56,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 161 transitions. [2024-11-13 15:53:56,322 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6075471698113207 [2024-11-13 15:53:56,323 INFO L175 Difference]: Start difference. First operand has 112 places, 72 transitions, 593 flow. Second operand 5 states and 161 transitions. [2024-11-13 15:53:56,323 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 92 transitions, 769 flow [2024-11-13 15:53:56,415 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 92 transitions, 656 flow, removed 21 selfloop flow, removed 14 redundant places. [2024-11-13 15:53:56,415 INFO L231 Difference]: Finished difference. Result has 97 places, 62 transitions, 398 flow [2024-11-13 15:53:56,415 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=490, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=398, PETRI_PLACES=97, PETRI_TRANSITIONS=62} [2024-11-13 15:53:56,416 INFO L277 CegarLoopForPetriNet]: 60 programPoint places, 37 predicate places. [2024-11-13 15:53:56,416 INFO L471 AbstractCegarLoop]: Abstraction has has 97 places, 62 transitions, 398 flow [2024-11-13 15:53:56,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.8) internal successors, (134), 5 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:53:56,416 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 15:53:56,416 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:53:56,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-13 15:53:56,417 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-13 15:53:56,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:53:56,417 INFO L85 PathProgramCache]: Analyzing trace with hash 428979084, now seen corresponding path program 5 times [2024-11-13 15:53:56,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:53:56,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682058242] [2024-11-13 15:53:56,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:53:56,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:53:56,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:53:57,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 15:53:57,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:53:57,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682058242] [2024-11-13 15:53:57,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682058242] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:53:57,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:53:57,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-13 15:53:57,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855118862] [2024-11-13 15:53:57,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:53:57,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-13 15:53:57,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:53:57,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-13 15:53:57,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-13 15:53:57,086 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 53 [2024-11-13 15:53:57,086 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 62 transitions, 398 flow. Second operand has 8 states, 8 states have (on average 27.125) internal successors, (217), 8 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:53:57,087 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 15:53:57,087 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 53 [2024-11-13 15:53:57,087 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 15:53:57,962 INFO L124 PetriNetUnfolderBase]: 3282/6158 cut-off events. [2024-11-13 15:53:57,963 INFO L125 PetriNetUnfolderBase]: For 9367/10043 co-relation queries the response was YES. [2024-11-13 15:53:57,989 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16686 conditions, 6158 events. 3282/6158 cut-off events. For 9367/10043 co-relation queries the response was YES. Maximal size of possible extension queue 590. Compared 50929 event pairs, 1152 based on Foata normal form. 58/5103 useless extension candidates. Maximal degree in co-relation 16662. Up to 2243 conditions per place. [2024-11-13 15:53:57,995 INFO L140 encePairwiseOnDemand]: 45/53 looper letters, 31 selfloop transitions, 5 changer transitions 16/93 dead transitions. [2024-11-13 15:53:57,995 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 93 transitions, 590 flow [2024-11-13 15:53:57,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 15:53:57,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-13 15:53:57,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 278 transitions. [2024-11-13 15:53:57,996 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5828092243186582 [2024-11-13 15:53:57,996 INFO L175 Difference]: Start difference. First operand has 97 places, 62 transitions, 398 flow. Second operand 9 states and 278 transitions. [2024-11-13 15:53:57,997 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 93 transitions, 590 flow [2024-11-13 15:53:58,039 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 93 transitions, 534 flow, removed 6 selfloop flow, removed 12 redundant places. [2024-11-13 15:53:58,040 INFO L231 Difference]: Finished difference. Result has 95 places, 64 transitions, 378 flow [2024-11-13 15:53:58,040 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=346, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=378, PETRI_PLACES=95, PETRI_TRANSITIONS=64} [2024-11-13 15:53:58,040 INFO L277 CegarLoopForPetriNet]: 60 programPoint places, 35 predicate places. [2024-11-13 15:53:58,041 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 64 transitions, 378 flow [2024-11-13 15:53:58,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 27.125) internal successors, (217), 8 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:53:58,041 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 15:53:58,041 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:53:58,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-13 15:53:58,041 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-13 15:53:58,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:53:58,041 INFO L85 PathProgramCache]: Analyzing trace with hash 177673144, now seen corresponding path program 6 times [2024-11-13 15:53:58,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:53:58,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006940759] [2024-11-13 15:53:58,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:53:58,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:53:58,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 15:53:58,092 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 15:53:58,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 15:53:58,186 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 15:53:58,187 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-13 15:53:58,187 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (7 of 8 remaining) [2024-11-13 15:53:58,191 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONMEMORY_LEAK (6 of 8 remaining) [2024-11-13 15:53:58,191 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (5 of 8 remaining) [2024-11-13 15:53:58,192 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 8 remaining) [2024-11-13 15:53:58,192 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 8 remaining) [2024-11-13 15:53:58,192 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 8 remaining) [2024-11-13 15:53:58,192 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 8 remaining) [2024-11-13 15:53:58,192 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 8 remaining) [2024-11-13 15:53:58,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-13 15:53:58,192 INFO L407 BasicCegarLoop]: Path program histogram: [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:53:58,308 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-13 15:53:58,309 INFO L173 ceAbstractionStarter]: Computing trace abstraction results [2024-11-13 15:53:58,316 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.11 03:53:58 BasicIcfg [2024-11-13 15:53:58,317 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-13 15:53:58,318 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-13 15:53:58,318 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-13 15:53:58,318 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-13 15:53:58,320 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 03:53:09" (3/4) ... [2024-11-13 15:53:58,322 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-13 15:53:58,324 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-13 15:53:58,325 INFO L158 Benchmark]: Toolchain (without parser) took 50792.25ms. Allocated memory was 142.6MB in the beginning and 12.6GB in the end (delta: 12.4GB). Free memory was 117.4MB in the beginning and 10.3GB in the end (delta: -10.2GB). Peak memory consumption was 2.2GB. Max. memory is 16.1GB. [2024-11-13 15:53:58,327 INFO L158 Benchmark]: CDTParser took 0.39ms. Allocated memory is still 167.8MB. Free memory is still 104.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 15:53:58,327 INFO L158 Benchmark]: CACSL2BoogieTranslator took 624.87ms. Allocated memory is still 142.6MB. Free memory was 117.0MB in the beginning and 94.4MB in the end (delta: 22.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-13 15:53:58,328 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.72ms. Allocated memory is still 142.6MB. Free memory was 94.4MB in the beginning and 91.9MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 15:53:58,328 INFO L158 Benchmark]: Boogie Preprocessor took 41.26ms. Allocated memory is still 142.6MB. Free memory was 91.9MB in the beginning and 89.4MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 15:53:58,329 INFO L158 Benchmark]: RCFGBuilder took 966.43ms. Allocated memory is still 142.6MB. Free memory was 89.1MB in the beginning and 110.2MB in the end (delta: -21.2MB). Peak memory consumption was 56.6MB. Max. memory is 16.1GB. [2024-11-13 15:53:58,329 INFO L158 Benchmark]: TraceAbstraction took 49089.26ms. Allocated memory was 142.6MB in the beginning and 12.6GB in the end (delta: 12.4GB). Free memory was 109.5MB in the beginning and 10.3GB in the end (delta: -10.2GB). Peak memory consumption was 2.2GB. Max. memory is 16.1GB. [2024-11-13 15:53:58,330 INFO L158 Benchmark]: Witness Printer took 6.64ms. Allocated memory is still 12.6GB. Free memory was 10.3GB in the beginning and 10.3GB in the end (delta: 140.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 15:53:58,332 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.39ms. Allocated memory is still 167.8MB. Free memory is still 104.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 624.87ms. Allocated memory is still 142.6MB. Free memory was 117.0MB in the beginning and 94.4MB in the end (delta: 22.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.72ms. Allocated memory is still 142.6MB. Free memory was 94.4MB in the beginning and 91.9MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 41.26ms. Allocated memory is still 142.6MB. Free memory was 91.9MB in the beginning and 89.4MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 966.43ms. Allocated memory is still 142.6MB. Free memory was 89.1MB in the beginning and 110.2MB in the end (delta: -21.2MB). Peak memory consumption was 56.6MB. Max. memory is 16.1GB. * TraceAbstraction took 49089.26ms. Allocated memory was 142.6MB in the beginning and 12.6GB in the end (delta: 12.4GB). Free memory was 109.5MB in the beginning and 10.3GB in the end (delta: -10.2GB). Peak memory consumption was 2.2GB. Max. memory is 16.1GB. * Witness Printer took 6.64ms. Allocated memory is still 12.6GB. Free memory was 10.3GB in the beginning and 10.3GB in the end (delta: 140.4kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p2_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int a = 0; [L717] 0 _Bool main$tmp_guard0; [L718] 0 _Bool main$tmp_guard1; [L720] 0 int x = 0; [L722] 0 int y = 0; [L724] 0 int z = 0; [L725] 0 _Bool z$flush_delayed; [L726] 0 int z$mem_tmp; [L727] 0 _Bool z$r_buff0_thd0; [L728] 0 _Bool z$r_buff0_thd1; [L729] 0 _Bool z$r_buff0_thd2; [L730] 0 _Bool z$r_buff0_thd3; [L731] 0 _Bool z$r_buff0_thd4; [L732] 0 _Bool z$r_buff1_thd0; [L733] 0 _Bool z$r_buff1_thd1; [L734] 0 _Bool z$r_buff1_thd2; [L735] 0 _Bool z$r_buff1_thd3; [L736] 0 _Bool z$r_buff1_thd4; [L737] 0 _Bool z$read_delayed; [L738] 0 int *z$read_delayed_var; [L739] 0 int z$w_buff0; [L740] 0 _Bool z$w_buff0_used; [L741] 0 int z$w_buff1; [L742] 0 _Bool z$w_buff1_used; [L743] 0 _Bool weak$$choice0; [L744] 0 _Bool weak$$choice2; [L844] 0 pthread_t t1413; [L845] FCALL, FORK 0 pthread_create(&t1413, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t1413=-2, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L846] 0 pthread_t t1414; [L847] FCALL, FORK 0 pthread_create(&t1414, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t1413=-2, t1414=-1, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L848] 0 pthread_t t1415; [L849] FCALL, FORK 0 pthread_create(&t1415, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t1413=-2, t1414=-1, t1415=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L850] 0 pthread_t t1416; [L851] FCALL, FORK 0 pthread_create(&t1416, ((void *)0), P3, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1413=-2, t1414=-1, t1415=0, t1416=1, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L806] 4 z$w_buff1 = z$w_buff0 [L807] 4 z$w_buff0 = 1 [L808] 4 z$w_buff1_used = z$w_buff0_used [L809] 4 z$w_buff0_used = (_Bool)1 [L810] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L810] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L811] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L812] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L813] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L814] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L815] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L816] 4 z$r_buff0_thd4 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L819] 4 __unbuffered_p3_EAX = a VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L748] 1 a = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L751] 1 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L763] 2 x = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L766] 2 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L778] 3 y = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L781] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L782] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L783] 3 z$flush_delayed = weak$$choice2 [L784] 3 z$mem_tmp = z [L785] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L786] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L787] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L788] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L789] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L790] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L791] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L792] 3 __unbuffered_p2_EAX = z [L793] 3 z = z$flush_delayed ? z$mem_tmp : z [L794] 3 z$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L822] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L823] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L824] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L825] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L826] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L829] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L756] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L771] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L799] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L853] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1413=-2, t1414=-1, t1415=0, t1416=1, weak$$choice0=1, weak$$choice2=1, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L855] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L855] RET 0 assume_abort_if_not(main$tmp_guard0) [L857] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L858] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L859] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L860] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L861] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1413=-2, t1414=-1, t1415=0, t1416=1, weak$$choice0=1, weak$$choice2=1, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L864] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1413=-2, t1414=-1, t1415=0, t1416=1, weak$$choice0=1, weak$$choice2=1, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L866] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L17] 0 __assert_fail ("0", "mix053.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 842]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 849]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 847]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 845]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 851]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 85 locations, 8 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: 48.8s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 43.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 869 SdHoareTripleChecker+Valid, 3.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 846 mSDsluCounter, 369 SdHoareTripleChecker+Invalid, 2.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 287 mSDsCounter, 62 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2224 IncrementalHoareTripleChecker+Invalid, 2286 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 62 mSolverCounterUnsat, 82 mSDtfsCounter, 2224 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 117 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1752occurred in iteration=12, InterpolantAutomatonStates: 103, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.8s InterpolantComputationTime, 432 NumberOfCodeBlocks, 432 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 380 ConstructedInterpolants, 0 QuantifiedInterpolants, 2013 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-13 15:53:58,366 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3b3024b-b024-412f-9855-fa0716ff9611/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3b3024b-b024-412f-9855-fa0716ff9611/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3b3024b-b024-412f-9855-fa0716ff9611/bin/uautomizer-verify-qhAvR1uOyd/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3b3024b-b024-412f-9855-fa0716ff9611/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3b3024b-b024-412f-9855-fa0716ff9611/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix053.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3b3024b-b024-412f-9855-fa0716ff9611/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3b3024b-b024-412f-9855-fa0716ff9611/bin/uautomizer-verify-qhAvR1uOyd --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 998817f829569afa1d1e3eda89c2594d280c8ae81957c207a6b68804966cf3a6 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 15:54:01,235 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 15:54:01,334 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3b3024b-b024-412f-9855-fa0716ff9611/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-13 15:54:01,356 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 15:54:01,357 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 15:54:01,401 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 15:54:01,403 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 15:54:01,410 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 15:54:01,411 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 15:54:01,411 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 15:54:01,412 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 15:54:01,412 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 15:54:01,413 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 15:54:01,413 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 15:54:01,413 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 15:54:01,413 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 15:54:01,413 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 15:54:01,417 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 15:54:01,417 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 15:54:01,417 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 15:54:01,417 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-13 15:54:01,417 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-13 15:54:01,417 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-13 15:54:01,417 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 15:54:01,417 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-13 15:54:01,417 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-13 15:54:01,418 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 15:54:01,418 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-13 15:54:01,418 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-13 15:54:01,418 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 15:54:01,418 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 15:54:01,418 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 15:54:01,418 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 15:54:01,418 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 15:54:01,418 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 15:54:01,418 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 15:54:01,419 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 15:54:01,419 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 15:54:01,419 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-13 15:54:01,419 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-13 15:54:01,419 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 15:54:01,419 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 15:54:01,419 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 15:54:01,419 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 15:54:01,419 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_c3b3024b-b024-412f-9855-fa0716ff9611/bin/uautomizer-verify-qhAvR1uOyd Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 998817f829569afa1d1e3eda89c2594d280c8ae81957c207a6b68804966cf3a6 [2024-11-13 15:54:01,719 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 15:54:01,727 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 15:54:01,730 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 15:54:01,731 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 15:54:01,731 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 15:54:01,732 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3b3024b-b024-412f-9855-fa0716ff9611/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/pthread-wmm/mix053.opt.i Unable to find full path for "g++" [2024-11-13 15:54:03,693 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 15:54:04,090 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 15:54:04,091 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3b3024b-b024-412f-9855-fa0716ff9611/sv-benchmarks/c/pthread-wmm/mix053.opt.i [2024-11-13 15:54:04,111 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3b3024b-b024-412f-9855-fa0716ff9611/bin/uautomizer-verify-qhAvR1uOyd/data/d24a77816/721712ccee68479f889e80841c50363a/FLAG3c6ba6525 [2024-11-13 15:54:04,132 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3b3024b-b024-412f-9855-fa0716ff9611/bin/uautomizer-verify-qhAvR1uOyd/data/d24a77816/721712ccee68479f889e80841c50363a [2024-11-13 15:54:04,134 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 15:54:04,137 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 15:54:04,139 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 15:54:04,139 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 15:54:04,144 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 15:54:04,145 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 03:54:04" (1/1) ... [2024-11-13 15:54:04,148 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@655ba9ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:54:04, skipping insertion in model container [2024-11-13 15:54:04,148 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 03:54:04" (1/1) ... [2024-11-13 15:54:04,200 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 15:54:04,588 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 15:54:04,601 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 15:54:04,689 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 15:54:04,744 INFO L204 MainTranslator]: Completed translation [2024-11-13 15:54:04,745 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:54:04 WrapperNode [2024-11-13 15:54:04,745 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 15:54:04,747 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 15:54:04,747 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 15:54:04,747 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 15:54:04,757 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:54:04" (1/1) ... [2024-11-13 15:54:04,783 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:54:04" (1/1) ... [2024-11-13 15:54:04,821 INFO L138 Inliner]: procedures = 177, calls = 52, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 131 [2024-11-13 15:54:04,823 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 15:54:04,824 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 15:54:04,825 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 15:54:04,825 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 15:54:04,834 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:54:04" (1/1) ... [2024-11-13 15:54:04,835 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:54:04" (1/1) ... [2024-11-13 15:54:04,840 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:54:04" (1/1) ... [2024-11-13 15:54:04,867 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-13 15:54:04,868 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:54:04" (1/1) ... [2024-11-13 15:54:04,868 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:54:04" (1/1) ... [2024-11-13 15:54:04,883 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:54:04" (1/1) ... [2024-11-13 15:54:04,885 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:54:04" (1/1) ... [2024-11-13 15:54:04,891 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:54:04" (1/1) ... [2024-11-13 15:54:04,892 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:54:04" (1/1) ... [2024-11-13 15:54:04,895 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 15:54:04,899 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 15:54:04,900 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 15:54:04,900 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 15:54:04,901 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:54:04" (1/1) ... [2024-11-13 15:54:04,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 15:54:04,931 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3b3024b-b024-412f-9855-fa0716ff9611/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:54:04,945 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3b3024b-b024-412f-9855-fa0716ff9611/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 15:54:04,952 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3b3024b-b024-412f-9855-fa0716ff9611/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 15:54:04,977 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-13 15:54:04,977 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 15:54:04,977 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-13 15:54:04,978 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-13 15:54:04,978 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-13 15:54:04,978 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-13 15:54:04,979 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-13 15:54:04,979 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-11-13 15:54:04,979 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-11-13 15:54:04,979 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2024-11-13 15:54:04,979 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2024-11-13 15:54:04,979 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-13 15:54:04,979 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 15:54:04,979 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 15:54:04,981 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-13 15:54:05,153 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 15:54:05,155 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 15:54:05,582 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-13 15:54:05,582 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 15:54:05,882 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 15:54:05,882 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-13 15:54:05,883 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 03:54:05 BoogieIcfgContainer [2024-11-13 15:54:05,883 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 15:54:05,886 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 15:54:05,886 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 15:54:05,891 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 15:54:05,891 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 03:54:04" (1/3) ... [2024-11-13 15:54:05,892 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1946d37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 03:54:05, skipping insertion in model container [2024-11-13 15:54:05,892 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:54:04" (2/3) ... [2024-11-13 15:54:05,893 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1946d37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 03:54:05, skipping insertion in model container [2024-11-13 15:54:05,893 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 03:54:05" (3/3) ... [2024-11-13 15:54:05,895 INFO L112 eAbstractionObserver]: Analyzing ICFG mix053.opt.i [2024-11-13 15:54:05,910 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 15:54:05,913 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG mix053.opt.i that has 5 procedures, 52 locations, 1 initial locations, 0 loop locations, and 3 error locations. [2024-11-13 15:54:05,913 INFO L492 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-13 15:54:06,034 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-13 15:54:06,075 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 64 places, 53 transitions, 122 flow [2024-11-13 15:54:06,128 INFO L124 PetriNetUnfolderBase]: 2/49 cut-off events. [2024-11-13 15:54:06,131 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-13 15:54:06,135 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62 conditions, 49 events. 2/49 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 101 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 53. Up to 2 conditions per place. [2024-11-13 15:54:06,136 INFO L82 GeneralOperation]: Start removeDead. Operand has 64 places, 53 transitions, 122 flow [2024-11-13 15:54:06,141 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 60 places, 49 transitions, 110 flow [2024-11-13 15:54:06,151 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 15:54:06,169 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, 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;@59552e88, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 15:54:06,170 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-11-13 15:54:06,185 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-13 15:54:06,188 INFO L124 PetriNetUnfolderBase]: 0/25 cut-off events. [2024-11-13 15:54:06,188 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-13 15:54:06,188 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 15:54:06,190 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:54:06,192 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P3Err0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-13 15:54:06,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:54:06,196 INFO L85 PathProgramCache]: Analyzing trace with hash 599884518, now seen corresponding path program 1 times [2024-11-13 15:54:06,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 15:54:06,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1045339091] [2024-11-13 15:54:06,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:54:06,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:54:06,212 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3b3024b-b024-412f-9855-fa0716ff9611/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:54:06,214 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3b3024b-b024-412f-9855-fa0716ff9611/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:54:06,216 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3b3024b-b024-412f-9855-fa0716ff9611/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-13 15:54:06,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:54:06,366 INFO L255 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-13 15:54:06,370 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:54:06,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 15:54:06,419 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 15:54:06,420 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 15:54:06,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1045339091] [2024-11-13 15:54:06,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1045339091] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:54:06,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:54:06,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-13 15:54:06,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468773897] [2024-11-13 15:54:06,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:54:06,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 15:54:06,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 15:54:06,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 15:54:06,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 15:54:06,457 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 53 [2024-11-13 15:54:06,460 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 49 transitions, 110 flow. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:54:06,460 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 15:54:06,460 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 53 [2024-11-13 15:54:06,461 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 15:54:07,000 INFO L124 PetriNetUnfolderBase]: 931/1659 cut-off events. [2024-11-13 15:54:07,000 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-13 15:54:07,009 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3055 conditions, 1659 events. 931/1659 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 11805 event pairs, 199 based on Foata normal form. 96/1722 useless extension candidates. Maximal degree in co-relation 3043. Up to 1021 conditions per place. [2024-11-13 15:54:07,023 INFO L140 encePairwiseOnDemand]: 48/53 looper letters, 29 selfloop transitions, 2 changer transitions 2/56 dead transitions. [2024-11-13 15:54:07,024 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 56 transitions, 190 flow [2024-11-13 15:54:07,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 15:54:07,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-13 15:54:07,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 119 transitions. [2024-11-13 15:54:07,038 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7484276729559748 [2024-11-13 15:54:07,039 INFO L175 Difference]: Start difference. First operand has 60 places, 49 transitions, 110 flow. Second operand 3 states and 119 transitions. [2024-11-13 15:54:07,040 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 56 transitions, 190 flow [2024-11-13 15:54:07,045 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 56 transitions, 186 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-13 15:54:07,048 INFO L231 Difference]: Finished difference. Result has 56 places, 44 transitions, 100 flow [2024-11-13 15:54:07,051 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=100, PETRI_PLACES=56, PETRI_TRANSITIONS=44} [2024-11-13 15:54:07,055 INFO L277 CegarLoopForPetriNet]: 60 programPoint places, -4 predicate places. [2024-11-13 15:54:07,055 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 44 transitions, 100 flow [2024-11-13 15:54:07,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:54:07,056 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 15:54:07,056 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:54:07,077 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3b3024b-b024-412f-9855-fa0716ff9611/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-13 15:54:07,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3b3024b-b024-412f-9855-fa0716ff9611/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:54:07,257 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-13 15:54:07,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:54:07,258 INFO L85 PathProgramCache]: Analyzing trace with hash 76044513, now seen corresponding path program 1 times [2024-11-13 15:54:07,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 15:54:07,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [15823262] [2024-11-13 15:54:07,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:54:07,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:54:07,260 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3b3024b-b024-412f-9855-fa0716ff9611/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:54:07,262 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3b3024b-b024-412f-9855-fa0716ff9611/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:54:07,264 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3b3024b-b024-412f-9855-fa0716ff9611/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-13 15:54:07,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:54:07,402 INFO L255 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-13 15:54:07,403 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:54:07,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 15:54:07,453 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 15:54:07,453 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 15:54:07,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [15823262] [2024-11-13 15:54:07,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [15823262] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:54:07,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:54:07,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-13 15:54:07,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296868535] [2024-11-13 15:54:07,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:54:07,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 15:54:07,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 15:54:07,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 15:54:07,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 15:54:07,457 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 53 [2024-11-13 15:54:07,457 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 44 transitions, 100 flow. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:54:07,457 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 15:54:07,457 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 53 [2024-11-13 15:54:07,458 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 15:54:07,849 INFO L124 PetriNetUnfolderBase]: 815/1495 cut-off events. [2024-11-13 15:54:07,850 INFO L125 PetriNetUnfolderBase]: For 84/84 co-relation queries the response was YES. [2024-11-13 15:54:07,855 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2809 conditions, 1495 events. 815/1495 cut-off events. For 84/84 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 11006 event pairs, 815 based on Foata normal form. 48/1486 useless extension candidates. Maximal degree in co-relation 2799. Up to 1188 conditions per place. [2024-11-13 15:54:07,864 INFO L140 encePairwiseOnDemand]: 51/53 looper letters, 19 selfloop transitions, 1 changer transitions 1/43 dead transitions. [2024-11-13 15:54:07,864 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 43 transitions, 140 flow [2024-11-13 15:54:07,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 15:54:07,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-13 15:54:07,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 100 transitions. [2024-11-13 15:54:07,866 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6289308176100629 [2024-11-13 15:54:07,866 INFO L175 Difference]: Start difference. First operand has 56 places, 44 transitions, 100 flow. Second operand 3 states and 100 transitions. [2024-11-13 15:54:07,866 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 43 transitions, 140 flow [2024-11-13 15:54:07,868 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 43 transitions, 136 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-13 15:54:07,871 INFO L231 Difference]: Finished difference. Result has 54 places, 42 transitions, 94 flow [2024-11-13 15:54:07,872 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=94, PETRI_PLACES=54, PETRI_TRANSITIONS=42} [2024-11-13 15:54:07,873 INFO L277 CegarLoopForPetriNet]: 60 programPoint places, -6 predicate places. [2024-11-13 15:54:07,875 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 42 transitions, 94 flow [2024-11-13 15:54:07,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:54:07,875 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 15:54:07,875 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:54:07,896 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3b3024b-b024-412f-9855-fa0716ff9611/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-13 15:54:08,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3b3024b-b024-412f-9855-fa0716ff9611/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:54:08,078 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-13 15:54:08,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:54:08,078 INFO L85 PathProgramCache]: Analyzing trace with hash 76045798, now seen corresponding path program 1 times [2024-11-13 15:54:08,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 15:54:08,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1728036872] [2024-11-13 15:54:08,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:54:08,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:54:08,079 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3b3024b-b024-412f-9855-fa0716ff9611/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:54:08,082 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3b3024b-b024-412f-9855-fa0716ff9611/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:54:08,084 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3b3024b-b024-412f-9855-fa0716ff9611/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-13 15:54:08,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:54:08,211 INFO L255 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-13 15:54:08,212 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:54:08,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 15:54:08,277 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 15:54:08,278 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 15:54:08,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1728036872] [2024-11-13 15:54:08,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1728036872] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:54:08,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:54:08,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 15:54:08,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919319775] [2024-11-13 15:54:08,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:54:08,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 15:54:08,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 15:54:08,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 15:54:08,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 15:54:08,297 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 53 [2024-11-13 15:54:08,297 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 42 transitions, 94 flow. Second operand has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:54:08,298 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 15:54:08,299 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 53 [2024-11-13 15:54:08,299 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 15:54:09,212 INFO L124 PetriNetUnfolderBase]: 3857/6075 cut-off events. [2024-11-13 15:54:09,213 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-13 15:54:09,229 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11541 conditions, 6075 events. 3857/6075 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 421. Compared 42136 event pairs, 536 based on Foata normal form. 180/6242 useless extension candidates. Maximal degree in co-relation 11535. Up to 3346 conditions per place. [2024-11-13 15:54:09,257 INFO L140 encePairwiseOnDemand]: 46/53 looper letters, 44 selfloop transitions, 6 changer transitions 1/68 dead transitions. [2024-11-13 15:54:09,257 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 68 transitions, 254 flow [2024-11-13 15:54:09,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 15:54:09,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-13 15:54:09,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 141 transitions. [2024-11-13 15:54:09,259 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6650943396226415 [2024-11-13 15:54:09,259 INFO L175 Difference]: Start difference. First operand has 54 places, 42 transitions, 94 flow. Second operand 4 states and 141 transitions. [2024-11-13 15:54:09,259 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 68 transitions, 254 flow [2024-11-13 15:54:09,260 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 68 transitions, 253 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-13 15:54:09,262 INFO L231 Difference]: Finished difference. Result has 57 places, 46 transitions, 135 flow [2024-11-13 15:54:09,262 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=93, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=135, PETRI_PLACES=57, PETRI_TRANSITIONS=46} [2024-11-13 15:54:09,263 INFO L277 CegarLoopForPetriNet]: 60 programPoint places, -3 predicate places. [2024-11-13 15:54:09,263 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 46 transitions, 135 flow [2024-11-13 15:54:09,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:54:09,263 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 15:54:09,263 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:54:09,283 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3b3024b-b024-412f-9855-fa0716ff9611/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-13 15:54:09,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3b3024b-b024-412f-9855-fa0716ff9611/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:54:09,468 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-13 15:54:09,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:54:09,469 INFO L85 PathProgramCache]: Analyzing trace with hash -598175143, now seen corresponding path program 1 times [2024-11-13 15:54:09,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 15:54:09,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [856217945] [2024-11-13 15:54:09,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:54:09,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:54:09,470 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3b3024b-b024-412f-9855-fa0716ff9611/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:54:09,473 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3b3024b-b024-412f-9855-fa0716ff9611/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:54:09,475 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3b3024b-b024-412f-9855-fa0716ff9611/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-13 15:54:09,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:54:09,590 INFO L255 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-13 15:54:09,591 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:54:09,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 15:54:09,652 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 15:54:09,652 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 15:54:09,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [856217945] [2024-11-13 15:54:09,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [856217945] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:54:09,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:54:09,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 15:54:09,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181723147] [2024-11-13 15:54:09,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:54:09,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 15:54:09,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 15:54:09,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 15:54:09,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 15:54:09,672 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 53 [2024-11-13 15:54:09,672 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 46 transitions, 135 flow. Second operand has 5 states, 5 states have (on average 25.0) internal successors, (125), 5 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:54:09,672 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 15:54:09,672 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 53 [2024-11-13 15:54:09,672 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 15:54:10,504 INFO L124 PetriNetUnfolderBase]: 3272/5178 cut-off events. [2024-11-13 15:54:10,505 INFO L125 PetriNetUnfolderBase]: For 1389/1389 co-relation queries the response was YES. [2024-11-13 15:54:10,521 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11810 conditions, 5178 events. 3272/5178 cut-off events. For 1389/1389 co-relation queries the response was YES. Maximal size of possible extension queue 366. Compared 34479 event pairs, 192 based on Foata normal form. 174/5339 useless extension candidates. Maximal degree in co-relation 11801. Up to 2581 conditions per place. [2024-11-13 15:54:10,544 INFO L140 encePairwiseOnDemand]: 46/53 looper letters, 56 selfloop transitions, 10 changer transitions 1/84 dead transitions. [2024-11-13 15:54:10,544 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 84 transitions, 374 flow [2024-11-13 15:54:10,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 15:54:10,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-13 15:54:10,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 179 transitions. [2024-11-13 15:54:10,548 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6754716981132075 [2024-11-13 15:54:10,548 INFO L175 Difference]: Start difference. First operand has 57 places, 46 transitions, 135 flow. Second operand 5 states and 179 transitions. [2024-11-13 15:54:10,548 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 84 transitions, 374 flow [2024-11-13 15:54:10,551 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 84 transitions, 363 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-11-13 15:54:10,554 INFO L231 Difference]: Finished difference. Result has 61 places, 50 transitions, 187 flow [2024-11-13 15:54:10,554 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=61, PETRI_TRANSITIONS=50} [2024-11-13 15:54:10,556 INFO L277 CegarLoopForPetriNet]: 60 programPoint places, 1 predicate places. [2024-11-13 15:54:10,556 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 50 transitions, 187 flow [2024-11-13 15:54:10,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.0) internal successors, (125), 5 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:54:10,557 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 15:54:10,557 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:54:10,577 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3b3024b-b024-412f-9855-fa0716ff9611/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-13 15:54:10,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3b3024b-b024-412f-9855-fa0716ff9611/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:54:10,758 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-13 15:54:10,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:54:10,758 INFO L85 PathProgramCache]: Analyzing trace with hash -163148980, now seen corresponding path program 1 times [2024-11-13 15:54:10,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 15:54:10,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1911999394] [2024-11-13 15:54:10,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:54:10,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:54:10,759 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3b3024b-b024-412f-9855-fa0716ff9611/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:54:10,761 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3b3024b-b024-412f-9855-fa0716ff9611/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:54:10,764 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3b3024b-b024-412f-9855-fa0716ff9611/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-13 15:54:10,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:54:10,886 INFO L255 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-13 15:54:10,888 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:54:10,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 15:54:10,978 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 15:54:10,979 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 15:54:10,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1911999394] [2024-11-13 15:54:10,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1911999394] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:54:10,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:54:10,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 15:54:10,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405280729] [2024-11-13 15:54:10,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:54:10,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 15:54:10,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 15:54:10,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 15:54:10,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-13 15:54:11,011 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 53 [2024-11-13 15:54:11,012 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 50 transitions, 187 flow. Second operand has 6 states, 6 states have (on average 24.666666666666668) internal successors, (148), 6 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:54:11,015 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 15:54:11,015 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 53 [2024-11-13 15:54:11,016 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 15:54:11,643 INFO L124 PetriNetUnfolderBase]: 2201/3461 cut-off events. [2024-11-13 15:54:11,644 INFO L125 PetriNetUnfolderBase]: For 2722/2722 co-relation queries the response was YES. [2024-11-13 15:54:11,653 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8964 conditions, 3461 events. 2201/3461 cut-off events. For 2722/2722 co-relation queries the response was YES. Maximal size of possible extension queue 166. Compared 20238 event pairs, 69 based on Foata normal form. 140/3588 useless extension candidates. Maximal degree in co-relation 8953. Up to 1221 conditions per place. [2024-11-13 15:54:11,667 INFO L140 encePairwiseOnDemand]: 46/53 looper letters, 66 selfloop transitions, 14 changer transitions 1/98 dead transitions. [2024-11-13 15:54:11,667 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 98 transitions, 493 flow [2024-11-13 15:54:11,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 15:54:11,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-13 15:54:11,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 215 transitions. [2024-11-13 15:54:11,669 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6761006289308176 [2024-11-13 15:54:11,669 INFO L175 Difference]: Start difference. First operand has 61 places, 50 transitions, 187 flow. Second operand 6 states and 215 transitions. [2024-11-13 15:54:11,670 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 98 transitions, 493 flow [2024-11-13 15:54:11,680 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 98 transitions, 463 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-11-13 15:54:11,682 INFO L231 Difference]: Finished difference. Result has 64 places, 54 transitions, 237 flow [2024-11-13 15:54:11,683 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=237, PETRI_PLACES=64, PETRI_TRANSITIONS=54} [2024-11-13 15:54:11,684 INFO L277 CegarLoopForPetriNet]: 60 programPoint places, 4 predicate places. [2024-11-13 15:54:11,686 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 54 transitions, 237 flow [2024-11-13 15:54:11,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.666666666666668) internal successors, (148), 6 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:54:11,687 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 15:54:11,687 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:54:11,707 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3b3024b-b024-412f-9855-fa0716ff9611/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-13 15:54:11,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3b3024b-b024-412f-9855-fa0716ff9611/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:54:11,891 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-13 15:54:11,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:54:11,893 INFO L85 PathProgramCache]: Analyzing trace with hash -580349181, now seen corresponding path program 1 times [2024-11-13 15:54:11,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 15:54:11,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [894527599] [2024-11-13 15:54:11,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:54:11,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:54:11,893 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3b3024b-b024-412f-9855-fa0716ff9611/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:54:11,895 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3b3024b-b024-412f-9855-fa0716ff9611/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:54:11,899 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3b3024b-b024-412f-9855-fa0716ff9611/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-13 15:54:12,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:54:12,010 INFO L255 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-13 15:54:12,011 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:54:12,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 15:54:12,110 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 15:54:12,110 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 15:54:12,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [894527599] [2024-11-13 15:54:12,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [894527599] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:54:12,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:54:12,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 15:54:12,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118566297] [2024-11-13 15:54:12,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:54:12,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 15:54:12,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 15:54:12,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 15:54:12,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-13 15:54:12,134 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 53 [2024-11-13 15:54:12,134 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 54 transitions, 237 flow. Second operand has 7 states, 7 states have (on average 24.571428571428573) internal successors, (172), 7 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:54:12,134 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 15:54:12,134 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 53 [2024-11-13 15:54:12,134 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 15:54:12,696 INFO L124 PetriNetUnfolderBase]: 1353/2041 cut-off events. [2024-11-13 15:54:12,696 INFO L125 PetriNetUnfolderBase]: For 3006/3006 co-relation queries the response was YES. [2024-11-13 15:54:12,702 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6053 conditions, 2041 events. 1353/2041 cut-off events. For 3006/3006 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 9998 event pairs, 39 based on Foata normal form. 72/2100 useless extension candidates. Maximal degree in co-relation 6041. Up to 668 conditions per place. [2024-11-13 15:54:12,717 INFO L140 encePairwiseOnDemand]: 46/53 looper letters, 60 selfloop transitions, 18 changer transitions 1/96 dead transitions. [2024-11-13 15:54:12,717 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 96 transitions, 495 flow [2024-11-13 15:54:12,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 15:54:12,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-13 15:54:12,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 235 transitions. [2024-11-13 15:54:12,720 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.633423180592992 [2024-11-13 15:54:12,720 INFO L175 Difference]: Start difference. First operand has 64 places, 54 transitions, 237 flow. Second operand 7 states and 235 transitions. [2024-11-13 15:54:12,720 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 96 transitions, 495 flow [2024-11-13 15:54:12,738 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 96 transitions, 449 flow, removed 9 selfloop flow, removed 5 redundant places. [2024-11-13 15:54:12,741 INFO L231 Difference]: Finished difference. Result has 67 places, 54 transitions, 247 flow [2024-11-13 15:54:12,742 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=194, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=247, PETRI_PLACES=67, PETRI_TRANSITIONS=54} [2024-11-13 15:54:12,743 INFO L277 CegarLoopForPetriNet]: 60 programPoint places, 7 predicate places. [2024-11-13 15:54:12,744 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 54 transitions, 247 flow [2024-11-13 15:54:12,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.571428571428573) internal successors, (172), 7 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:54:12,744 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 15:54:12,744 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:54:12,766 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3b3024b-b024-412f-9855-fa0716ff9611/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-13 15:54:12,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3b3024b-b024-412f-9855-fa0716ff9611/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:54:12,945 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-13 15:54:12,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:54:12,945 INFO L85 PathProgramCache]: Analyzing trace with hash -491422592, now seen corresponding path program 1 times [2024-11-13 15:54:12,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 15:54:12,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [638097239] [2024-11-13 15:54:12,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:54:12,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:54:12,946 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3b3024b-b024-412f-9855-fa0716ff9611/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:54:12,950 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3b3024b-b024-412f-9855-fa0716ff9611/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:54:12,952 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3b3024b-b024-412f-9855-fa0716ff9611/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-13 15:54:13,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:54:13,064 INFO L255 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-13 15:54:13,066 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:54:13,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 15:54:13,166 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 15:54:13,167 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 15:54:13,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [638097239] [2024-11-13 15:54:13,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [638097239] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:54:13,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:54:13,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 15:54:13,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497406155] [2024-11-13 15:54:13,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:54:13,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 15:54:13,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 15:54:13,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 15:54:13,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-13 15:54:13,184 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 53 [2024-11-13 15:54:13,184 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 54 transitions, 247 flow. Second operand has 6 states, 6 states have (on average 26.333333333333332) internal successors, (158), 6 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:54:13,185 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 15:54:13,185 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 53 [2024-11-13 15:54:13,185 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 15:54:13,736 INFO L124 PetriNetUnfolderBase]: 1791/3151 cut-off events. [2024-11-13 15:54:13,736 INFO L125 PetriNetUnfolderBase]: For 1922/2014 co-relation queries the response was YES. [2024-11-13 15:54:13,747 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7625 conditions, 3151 events. 1791/3151 cut-off events. For 1922/2014 co-relation queries the response was YES. Maximal size of possible extension queue 207. Compared 20001 event pairs, 674 based on Foata normal form. 16/2970 useless extension candidates. Maximal degree in co-relation 7612. Up to 1210 conditions per place. [2024-11-13 15:54:13,754 INFO L140 encePairwiseOnDemand]: 47/53 looper letters, 33 selfloop transitions, 2 changer transitions 19/84 dead transitions. [2024-11-13 15:54:13,754 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 84 transitions, 433 flow [2024-11-13 15:54:13,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 15:54:13,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-13 15:54:13,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 193 transitions. [2024-11-13 15:54:13,756 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6069182389937107 [2024-11-13 15:54:13,756 INFO L175 Difference]: Start difference. First operand has 67 places, 54 transitions, 247 flow. Second operand 6 states and 193 transitions. [2024-11-13 15:54:13,756 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 84 transitions, 433 flow [2024-11-13 15:54:13,775 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 84 transitions, 324 flow, removed 22 selfloop flow, removed 10 redundant places. [2024-11-13 15:54:13,776 INFO L231 Difference]: Finished difference. Result has 66 places, 55 transitions, 169 flow [2024-11-13 15:54:13,776 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=151, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=169, PETRI_PLACES=66, PETRI_TRANSITIONS=55} [2024-11-13 15:54:13,779 INFO L277 CegarLoopForPetriNet]: 60 programPoint places, 6 predicate places. [2024-11-13 15:54:13,780 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 55 transitions, 169 flow [2024-11-13 15:54:13,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.333333333333332) internal successors, (158), 6 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:54:13,780 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 15:54:13,780 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:54:13,802 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3b3024b-b024-412f-9855-fa0716ff9611/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-13 15:54:13,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3b3024b-b024-412f-9855-fa0716ff9611/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:54:13,981 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-13 15:54:13,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:54:13,981 INFO L85 PathProgramCache]: Analyzing trace with hash -229047058, now seen corresponding path program 2 times [2024-11-13 15:54:13,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 15:54:13,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1905823555] [2024-11-13 15:54:13,982 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-13 15:54:13,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:54:13,982 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3b3024b-b024-412f-9855-fa0716ff9611/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:54:13,983 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3b3024b-b024-412f-9855-fa0716ff9611/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:54:13,984 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3b3024b-b024-412f-9855-fa0716ff9611/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-13 15:54:14,089 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-13 15:54:14,089 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 15:54:14,091 INFO L255 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-13 15:54:14,093 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:54:14,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 15:54:14,172 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 15:54:14,172 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 15:54:14,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1905823555] [2024-11-13 15:54:14,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1905823555] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:54:14,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:54:14,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 15:54:14,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674777038] [2024-11-13 15:54:14,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:54:14,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 15:54:14,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 15:54:14,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 15:54:14,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-13 15:54:14,184 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 53 [2024-11-13 15:54:14,185 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 55 transitions, 169 flow. Second operand has 6 states, 6 states have (on average 26.333333333333332) internal successors, (158), 6 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:54:14,185 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 15:54:14,185 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 53 [2024-11-13 15:54:14,185 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 15:54:14,846 INFO L124 PetriNetUnfolderBase]: 2876/4901 cut-off events. [2024-11-13 15:54:14,847 INFO L125 PetriNetUnfolderBase]: For 109/117 co-relation queries the response was YES. [2024-11-13 15:54:14,869 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9815 conditions, 4901 events. 2876/4901 cut-off events. For 109/117 co-relation queries the response was YES. Maximal size of possible extension queue 371. Compared 34620 event pairs, 1303 based on Foata normal form. 16/4266 useless extension candidates. Maximal degree in co-relation 9804. Up to 2026 conditions per place. [2024-11-13 15:54:14,879 INFO L140 encePairwiseOnDemand]: 47/53 looper letters, 36 selfloop transitions, 2 changer transitions 18/87 dead transitions. [2024-11-13 15:54:14,879 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 87 transitions, 358 flow [2024-11-13 15:54:14,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 15:54:14,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-13 15:54:14,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 195 transitions. [2024-11-13 15:54:14,881 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6132075471698113 [2024-11-13 15:54:14,881 INFO L175 Difference]: Start difference. First operand has 66 places, 55 transitions, 169 flow. Second operand 6 states and 195 transitions. [2024-11-13 15:54:14,881 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 87 transitions, 358 flow [2024-11-13 15:54:14,883 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 87 transitions, 346 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-11-13 15:54:14,884 INFO L231 Difference]: Finished difference. Result has 68 places, 56 transitions, 179 flow [2024-11-13 15:54:14,884 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=161, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=179, PETRI_PLACES=68, PETRI_TRANSITIONS=56} [2024-11-13 15:54:14,884 INFO L277 CegarLoopForPetriNet]: 60 programPoint places, 8 predicate places. [2024-11-13 15:54:14,884 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 56 transitions, 179 flow [2024-11-13 15:54:14,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.333333333333332) internal successors, (158), 6 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:54:14,885 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 15:54:14,885 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:54:14,906 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3b3024b-b024-412f-9855-fa0716ff9611/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-13 15:54:15,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3b3024b-b024-412f-9855-fa0716ff9611/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:54:15,089 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-13 15:54:15,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:54:15,089 INFO L85 PathProgramCache]: Analyzing trace with hash 1527600116, now seen corresponding path program 3 times [2024-11-13 15:54:15,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 15:54:15,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1451518048] [2024-11-13 15:54:15,090 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-13 15:54:15,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:54:15,090 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3b3024b-b024-412f-9855-fa0716ff9611/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:54:15,095 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3b3024b-b024-412f-9855-fa0716ff9611/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:54:15,097 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3b3024b-b024-412f-9855-fa0716ff9611/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-13 15:54:15,210 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-13 15:54:15,211 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 15:54:15,213 INFO L255 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-13 15:54:15,215 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:54:15,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 15:54:15,479 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 15:54:15,479 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 15:54:15,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1451518048] [2024-11-13 15:54:15,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1451518048] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:54:15,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:54:15,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-13 15:54:15,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50654729] [2024-11-13 15:54:15,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:54:15,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-13 15:54:15,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 15:54:15,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-13 15:54:15,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-13 15:54:15,509 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 53 [2024-11-13 15:54:15,509 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 56 transitions, 179 flow. Second operand has 9 states, 9 states have (on average 21.666666666666668) internal successors, (195), 9 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:54:15,509 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 15:54:15,509 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 53 [2024-11-13 15:54:15,509 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 15:54:16,884 INFO L124 PetriNetUnfolderBase]: 8557/12279 cut-off events. [2024-11-13 15:54:16,884 INFO L125 PetriNetUnfolderBase]: For 2295/3185 co-relation queries the response was YES. [2024-11-13 15:54:16,919 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28580 conditions, 12279 events. 8557/12279 cut-off events. For 2295/3185 co-relation queries the response was YES. Maximal size of possible extension queue 826. Compared 77079 event pairs, 2251 based on Foata normal form. 95/11931 useless extension candidates. Maximal degree in co-relation 28568. Up to 7951 conditions per place. [2024-11-13 15:54:16,933 INFO L140 encePairwiseOnDemand]: 42/53 looper letters, 55 selfloop transitions, 7 changer transitions 47/125 dead transitions. [2024-11-13 15:54:16,934 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 125 transitions, 594 flow [2024-11-13 15:54:16,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 15:54:16,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-13 15:54:16,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 265 transitions. [2024-11-13 15:54:16,935 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5555555555555556 [2024-11-13 15:54:16,936 INFO L175 Difference]: Start difference. First operand has 68 places, 56 transitions, 179 flow. Second operand 9 states and 265 transitions. [2024-11-13 15:54:16,936 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 125 transitions, 594 flow [2024-11-13 15:54:16,938 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 125 transitions, 582 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-11-13 15:54:16,940 INFO L231 Difference]: Finished difference. Result has 75 places, 58 transitions, 211 flow [2024-11-13 15:54:16,940 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=171, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=211, PETRI_PLACES=75, PETRI_TRANSITIONS=58} [2024-11-13 15:54:16,941 INFO L277 CegarLoopForPetriNet]: 60 programPoint places, 15 predicate places. [2024-11-13 15:54:16,941 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 58 transitions, 211 flow [2024-11-13 15:54:16,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 21.666666666666668) internal successors, (195), 9 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:54:16,941 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 15:54:16,941 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:54:16,961 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3b3024b-b024-412f-9855-fa0716ff9611/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-11-13 15:54:17,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3b3024b-b024-412f-9855-fa0716ff9611/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:54:17,142 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-13 15:54:17,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:54:17,143 INFO L85 PathProgramCache]: Analyzing trace with hash -829304458, now seen corresponding path program 4 times [2024-11-13 15:54:17,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 15:54:17,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2023936710] [2024-11-13 15:54:17,144 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-13 15:54:17,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:54:17,144 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3b3024b-b024-412f-9855-fa0716ff9611/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:54:17,146 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3b3024b-b024-412f-9855-fa0716ff9611/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:54:17,149 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3b3024b-b024-412f-9855-fa0716ff9611/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-13 15:54:17,347 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-13 15:54:17,347 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 15:54:17,349 INFO L255 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-13 15:54:17,351 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:54:17,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 15:54:17,633 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 15:54:17,633 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 15:54:17,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2023936710] [2024-11-13 15:54:17,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2023936710] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:54:17,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:54:17,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-13 15:54:17,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845658925] [2024-11-13 15:54:17,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:54:17,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-13 15:54:17,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 15:54:17,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-13 15:54:17,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-13 15:54:17,650 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 53 [2024-11-13 15:54:17,651 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 58 transitions, 211 flow. Second operand has 8 states, 8 states have (on average 27.25) internal successors, (218), 8 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:54:17,652 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 15:54:17,652 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 53 [2024-11-13 15:54:17,652 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 15:54:18,650 INFO L124 PetriNetUnfolderBase]: 4293/7651 cut-off events. [2024-11-13 15:54:18,650 INFO L125 PetriNetUnfolderBase]: For 602/602 co-relation queries the response was YES. [2024-11-13 15:54:18,679 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15537 conditions, 7651 events. 4293/7651 cut-off events. For 602/602 co-relation queries the response was YES. Maximal size of possible extension queue 694. Compared 62125 event pairs, 1666 based on Foata normal form. 16/6886 useless extension candidates. Maximal degree in co-relation 15521. Up to 2475 conditions per place. [2024-11-13 15:54:18,695 INFO L140 encePairwiseOnDemand]: 45/53 looper letters, 37 selfloop transitions, 5 changer transitions 21/99 dead transitions. [2024-11-13 15:54:18,695 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 99 transitions, 437 flow [2024-11-13 15:54:18,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 15:54:18,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-13 15:54:18,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 289 transitions. [2024-11-13 15:54:18,697 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6058700209643606 [2024-11-13 15:54:18,697 INFO L175 Difference]: Start difference. First operand has 75 places, 58 transitions, 211 flow. Second operand 9 states and 289 transitions. [2024-11-13 15:54:18,697 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 99 transitions, 437 flow [2024-11-13 15:54:18,700 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 99 transitions, 409 flow, removed 8 selfloop flow, removed 6 redundant places. [2024-11-13 15:54:18,701 INFO L231 Difference]: Finished difference. Result has 79 places, 62 transitions, 232 flow [2024-11-13 15:54:18,702 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=191, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=232, PETRI_PLACES=79, PETRI_TRANSITIONS=62} [2024-11-13 15:54:18,702 INFO L277 CegarLoopForPetriNet]: 60 programPoint places, 19 predicate places. [2024-11-13 15:54:18,702 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 62 transitions, 232 flow [2024-11-13 15:54:18,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 27.25) internal successors, (218), 8 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:54:18,703 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 15:54:18,703 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:54:18,723 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3b3024b-b024-412f-9855-fa0716ff9611/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-13 15:54:18,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3b3024b-b024-412f-9855-fa0716ff9611/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:54:18,904 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-13 15:54:18,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:54:18,905 INFO L85 PathProgramCache]: Analyzing trace with hash 762926982, now seen corresponding path program 5 times [2024-11-13 15:54:18,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 15:54:18,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [372735950] [2024-11-13 15:54:18,905 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-13 15:54:18,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:54:18,905 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3b3024b-b024-412f-9855-fa0716ff9611/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:54:18,908 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3b3024b-b024-412f-9855-fa0716ff9611/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:54:18,909 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3b3024b-b024-412f-9855-fa0716ff9611/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-13 15:54:19,017 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-13 15:54:19,018 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 15:54:19,020 INFO L255 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-13 15:54:19,022 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:54:19,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 15:54:19,173 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 15:54:19,173 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 15:54:19,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [372735950] [2024-11-13 15:54:19,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [372735950] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:54:19,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:54:19,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-13 15:54:19,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043999099] [2024-11-13 15:54:19,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:54:19,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-13 15:54:19,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 15:54:19,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-13 15:54:19,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-13 15:54:19,222 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 53 [2024-11-13 15:54:19,222 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 62 transitions, 232 flow. Second operand has 9 states, 9 states have (on average 21.666666666666668) internal successors, (195), 9 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:54:19,222 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 15:54:19,222 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 53 [2024-11-13 15:54:19,223 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 15:54:21,144 INFO L124 PetriNetUnfolderBase]: 14593/21373 cut-off events. [2024-11-13 15:54:21,144 INFO L125 PetriNetUnfolderBase]: For 8672/9746 co-relation queries the response was YES. [2024-11-13 15:54:21,200 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54204 conditions, 21373 events. 14593/21373 cut-off events. For 8672/9746 co-relation queries the response was YES. Maximal size of possible extension queue 1585. Compared 151696 event pairs, 2931 based on Foata normal form. 203/21118 useless extension candidates. Maximal degree in co-relation 54186. Up to 11386 conditions per place. [2024-11-13 15:54:21,211 INFO L140 encePairwiseOnDemand]: 42/53 looper letters, 38 selfloop transitions, 6 changer transitions 76/136 dead transitions. [2024-11-13 15:54:21,211 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 136 transitions, 734 flow [2024-11-13 15:54:21,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 15:54:21,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-13 15:54:21,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 262 transitions. [2024-11-13 15:54:21,213 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.549266247379455 [2024-11-13 15:54:21,213 INFO L175 Difference]: Start difference. First operand has 79 places, 62 transitions, 232 flow. Second operand 9 states and 262 transitions. [2024-11-13 15:54:21,213 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 136 transitions, 734 flow [2024-11-13 15:54:21,264 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 136 transitions, 720 flow, removed 7 selfloop flow, removed 4 redundant places. [2024-11-13 15:54:21,265 INFO L231 Difference]: Finished difference. Result has 84 places, 56 transitions, 220 flow [2024-11-13 15:54:21,266 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=224, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=220, PETRI_PLACES=84, PETRI_TRANSITIONS=56} [2024-11-13 15:54:21,266 INFO L277 CegarLoopForPetriNet]: 60 programPoint places, 24 predicate places. [2024-11-13 15:54:21,266 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 56 transitions, 220 flow [2024-11-13 15:54:21,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 21.666666666666668) internal successors, (195), 9 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:54:21,267 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 15:54:21,267 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:54:21,284 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3b3024b-b024-412f-9855-fa0716ff9611/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-11-13 15:54:21,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3b3024b-b024-412f-9855-fa0716ff9611/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:54:21,467 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-13 15:54:21,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:54:21,468 INFO L85 PathProgramCache]: Analyzing trace with hash -2078069578, now seen corresponding path program 6 times [2024-11-13 15:54:21,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 15:54:21,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1412446848] [2024-11-13 15:54:21,468 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-13 15:54:21,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:54:21,468 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3b3024b-b024-412f-9855-fa0716ff9611/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:54:21,470 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3b3024b-b024-412f-9855-fa0716ff9611/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:54:21,471 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3b3024b-b024-412f-9855-fa0716ff9611/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-13 15:54:21,581 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2024-11-13 15:54:21,581 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-13 15:54:21,581 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 15:54:21,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 15:54:21,712 INFO L130 FreeRefinementEngine]: Strategy FOX found a feasible trace [2024-11-13 15:54:21,712 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-13 15:54:21,713 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (7 of 8 remaining) [2024-11-13 15:54:21,715 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONMEMORY_LEAK (6 of 8 remaining) [2024-11-13 15:54:21,715 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (5 of 8 remaining) [2024-11-13 15:54:21,715 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 8 remaining) [2024-11-13 15:54:21,716 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 8 remaining) [2024-11-13 15:54:21,716 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 8 remaining) [2024-11-13 15:54:21,716 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 8 remaining) [2024-11-13 15:54:21,716 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 8 remaining) [2024-11-13 15:54:21,737 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3b3024b-b024-412f-9855-fa0716ff9611/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-11-13 15:54:21,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3b3024b-b024-412f-9855-fa0716ff9611/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:54:21,920 INFO L407 BasicCegarLoop]: Path program histogram: [6, 1, 1, 1, 1, 1, 1] [2024-11-13 15:54:22,014 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-13 15:54:22,015 INFO L173 ceAbstractionStarter]: Computing trace abstraction results [2024-11-13 15:54:22,024 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.11 03:54:22 BasicIcfg [2024-11-13 15:54:22,027 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-13 15:54:22,028 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-13 15:54:22,028 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-13 15:54:22,028 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-13 15:54:22,029 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 03:54:05" (3/4) ... [2024-11-13 15:54:22,031 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-13 15:54:22,033 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-13 15:54:22,034 INFO L158 Benchmark]: Toolchain (without parser) took 17897.86ms. Allocated memory was 117.4MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 91.1MB in the beginning and 761.2MB in the end (delta: -670.1MB). Peak memory consumption was 420.2MB. Max. memory is 16.1GB. [2024-11-13 15:54:22,035 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 117.4MB. Free memory is still 83.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 15:54:22,035 INFO L158 Benchmark]: CACSL2BoogieTranslator took 607.18ms. Allocated memory is still 117.4MB. Free memory was 90.9MB in the beginning and 67.7MB in the end (delta: 23.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-13 15:54:22,035 INFO L158 Benchmark]: Boogie Procedure Inliner took 76.70ms. Allocated memory is still 117.4MB. Free memory was 67.7MB in the beginning and 65.5MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 15:54:22,037 INFO L158 Benchmark]: Boogie Preprocessor took 74.86ms. Allocated memory is still 117.4MB. Free memory was 65.5MB in the beginning and 62.7MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 15:54:22,037 INFO L158 Benchmark]: RCFGBuilder took 983.63ms. Allocated memory is still 117.4MB. Free memory was 62.7MB in the beginning and 44.3MB in the end (delta: 18.4MB). Peak memory consumption was 30.3MB. Max. memory is 16.1GB. [2024-11-13 15:54:22,038 INFO L158 Benchmark]: TraceAbstraction took 16141.37ms. Allocated memory was 117.4MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 43.8MB in the beginning and 761.4MB in the end (delta: -717.5MB). Peak memory consumption was 373.2MB. Max. memory is 16.1GB. [2024-11-13 15:54:22,038 INFO L158 Benchmark]: Witness Printer took 5.49ms. Allocated memory is still 1.2GB. Free memory was 761.4MB in the beginning and 761.2MB in the end (delta: 161.3kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 15:54:22,040 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27ms. Allocated memory is still 117.4MB. Free memory is still 83.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 607.18ms. Allocated memory is still 117.4MB. Free memory was 90.9MB in the beginning and 67.7MB in the end (delta: 23.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 76.70ms. Allocated memory is still 117.4MB. Free memory was 67.7MB in the beginning and 65.5MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 74.86ms. Allocated memory is still 117.4MB. Free memory was 65.5MB in the beginning and 62.7MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 983.63ms. Allocated memory is still 117.4MB. Free memory was 62.7MB in the beginning and 44.3MB in the end (delta: 18.4MB). Peak memory consumption was 30.3MB. Max. memory is 16.1GB. * TraceAbstraction took 16141.37ms. Allocated memory was 117.4MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 43.8MB in the beginning and 761.4MB in the end (delta: -717.5MB). Peak memory consumption was 373.2MB. Max. memory is 16.1GB. * Witness Printer took 5.49ms. Allocated memory is still 1.2GB. Free memory was 761.4MB in the beginning and 761.2MB in the end (delta: 161.3kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p2_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int a = 0; [L717] 0 _Bool main$tmp_guard0; [L718] 0 _Bool main$tmp_guard1; [L720] 0 int x = 0; [L722] 0 int y = 0; [L724] 0 int z = 0; [L725] 0 _Bool z$flush_delayed; [L726] 0 int z$mem_tmp; [L727] 0 _Bool z$r_buff0_thd0; [L728] 0 _Bool z$r_buff0_thd1; [L729] 0 _Bool z$r_buff0_thd2; [L730] 0 _Bool z$r_buff0_thd3; [L731] 0 _Bool z$r_buff0_thd4; [L732] 0 _Bool z$r_buff1_thd0; [L733] 0 _Bool z$r_buff1_thd1; [L734] 0 _Bool z$r_buff1_thd2; [L735] 0 _Bool z$r_buff1_thd3; [L736] 0 _Bool z$r_buff1_thd4; [L737] 0 _Bool z$read_delayed; [L738] 0 int *z$read_delayed_var; [L739] 0 int z$w_buff0; [L740] 0 _Bool z$w_buff0_used; [L741] 0 int z$w_buff1; [L742] 0 _Bool z$w_buff1_used; [L743] 0 _Bool weak$$choice0; [L744] 0 _Bool weak$$choice2; [L844] 0 pthread_t t1413; [L845] FCALL, FORK 0 pthread_create(&t1413, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t1413=29, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L846] 0 pthread_t t1414; [L847] FCALL, FORK 0 pthread_create(&t1414, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t1413=29, t1414=30, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L848] 0 pthread_t t1415; [L849] FCALL, FORK 0 pthread_create(&t1415, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1413=29, t1414=30, t1415=31, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L850] 0 pthread_t t1416; [L851] FCALL, FORK 0 pthread_create(&t1416, ((void *)0), P3, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1413=29, t1414=30, t1415=31, t1416=32, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L806] 4 z$w_buff1 = z$w_buff0 [L807] 4 z$w_buff0 = 1 [L808] 4 z$w_buff1_used = z$w_buff0_used [L809] 4 z$w_buff0_used = (_Bool)1 [L810] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L810] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L811] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L812] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L813] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L814] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L815] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L816] 4 z$r_buff0_thd4 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L819] 4 __unbuffered_p3_EAX = a VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L748] 1 a = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L751] 1 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L763] 2 x = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L766] 2 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L778] 3 y = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L781] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L782] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L783] 3 z$flush_delayed = weak$$choice2 [L784] 3 z$mem_tmp = z [L785] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L786] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L787] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L788] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L789] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L790] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L791] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L792] 3 __unbuffered_p2_EAX = z [L793] 3 z = z$flush_delayed ? z$mem_tmp : z [L794] 3 z$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L822] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L823] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L824] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L825] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L826] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L756] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L771] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L799] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L829] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L853] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1413=29, t1414=30, t1415=31, t1416=32, weak$$choice0=0, weak$$choice2=1, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L855] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L855] RET 0 assume_abort_if_not(main$tmp_guard0) [L857] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L858] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L859] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L860] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L861] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1413=29, t1414=30, t1415=31, t1416=32, weak$$choice0=0, weak$$choice2=1, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L864] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1413=29, t1414=30, t1415=31, t1416=32, weak$$choice0=0, weak$$choice2=1, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L866] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L17] 0 __assert_fail ("0", "mix053.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 842]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 851]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 849]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 847]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 845]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 85 locations, 8 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: 15.9s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 10.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 597 SdHoareTripleChecker+Valid, 2.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 559 mSDsluCounter, 201 SdHoareTripleChecker+Invalid, 2.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 183 mSDsCounter, 29 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2144 IncrementalHoareTripleChecker+Invalid, 2173 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 29 mSolverCounterUnsat, 18 mSDtfsCounter, 2144 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 324 GetRequests, 255 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=247occurred in iteration=6, InterpolantAutomatonStates: 67, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 347 NumberOfCodeBlocks, 346 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 299 ConstructedInterpolants, 0 QuantifiedInterpolants, 953 SizeOfPredicates, 37 NumberOfNonLiveVariables, 1256 ConjunctsInSsa, 75 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-13 15:54:22,072 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3b3024b-b024-412f-9855-fa0716ff9611/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample