./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/safe005_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.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_3110b6f5-718f-4488-b2d0-892e5999e860/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3110b6f5-718f-4488-b2d0-892e5999e860/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_3110b6f5-718f-4488-b2d0-892e5999e860/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3110b6f5-718f-4488-b2d0-892e5999e860/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe005_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3110b6f5-718f-4488-b2d0-892e5999e860/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_3110b6f5-718f-4488-b2d0-892e5999e860/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 40c6d23f476fb49e658cd83073483dddc1740bbd5f458e601d84fe47899d7237 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 13:34:31,271 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 13:34:31,348 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3110b6f5-718f-4488-b2d0-892e5999e860/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-13 13:34:31,355 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 13:34:31,355 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 13:34:31,385 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 13:34:31,386 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 13:34:31,386 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 13:34:31,387 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 13:34:31,387 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 13:34:31,387 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 13:34:31,387 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 13:34:31,388 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 13:34:31,388 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 13:34:31,388 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 13:34:31,388 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 13:34:31,389 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 13:34:31,389 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 13:34:31,389 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 13:34:31,389 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 13:34:31,389 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-13 13:34:31,390 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-13 13:34:31,390 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-13 13:34:31,390 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 13:34:31,390 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-13 13:34:31,390 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 13:34:31,390 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-13 13:34:31,391 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 13:34:31,391 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 13:34:31,391 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 13:34:31,391 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 13:34:31,391 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 13:34:31,392 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 13:34:31,392 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 13:34:31,392 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 13:34:31,392 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 13:34:31,392 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-13 13:34:31,392 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 13:34:31,393 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 13:34:31,393 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 13:34:31,393 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 13:34:31,393 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 13:34:31,393 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_3110b6f5-718f-4488-b2d0-892e5999e860/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 -> 40c6d23f476fb49e658cd83073483dddc1740bbd5f458e601d84fe47899d7237 [2024-11-13 13:34:31,746 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 13:34:31,761 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 13:34:31,767 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 13:34:31,768 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 13:34:31,769 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 13:34:31,770 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3110b6f5-718f-4488-b2d0-892e5999e860/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/pthread-wmm/safe005_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i Unable to find full path for "g++" [2024-11-13 13:34:33,993 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 13:34:34,396 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 13:34:34,399 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3110b6f5-718f-4488-b2d0-892e5999e860/sv-benchmarks/c/pthread-wmm/safe005_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-11-13 13:34:34,429 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3110b6f5-718f-4488-b2d0-892e5999e860/bin/uautomizer-verify-qhAvR1uOyd/data/89e075876/7b900ebc63974746a362fe5b67915ca1/FLAG87db7be3c [2024-11-13 13:34:34,455 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3110b6f5-718f-4488-b2d0-892e5999e860/bin/uautomizer-verify-qhAvR1uOyd/data/89e075876/7b900ebc63974746a362fe5b67915ca1 [2024-11-13 13:34:34,460 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 13:34:34,462 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 13:34:34,465 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 13:34:34,465 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 13:34:34,475 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 13:34:34,476 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 01:34:34" (1/1) ... [2024-11-13 13:34:34,477 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7adeabf1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:34:34, skipping insertion in model container [2024-11-13 13:34:34,477 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 01:34:34" (1/1) ... [2024-11-13 13:34:34,544 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 13:34:35,145 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 13:34:35,167 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 13:34:35,278 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 13:34:35,336 INFO L204 MainTranslator]: Completed translation [2024-11-13 13:34:35,336 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:34:35 WrapperNode [2024-11-13 13:34:35,338 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 13:34:35,339 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 13:34:35,339 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 13:34:35,339 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 13:34:35,348 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:34:35" (1/1) ... [2024-11-13 13:34:35,371 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:34:35" (1/1) ... [2024-11-13 13:34:35,411 INFO L138 Inliner]: procedures = 175, calls = 45, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 119 [2024-11-13 13:34:35,411 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 13:34:35,412 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 13:34:35,412 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 13:34:35,412 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 13:34:35,424 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:34:35" (1/1) ... [2024-11-13 13:34:35,424 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:34:35" (1/1) ... [2024-11-13 13:34:35,427 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:34:35" (1/1) ... [2024-11-13 13:34:35,458 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 13:34:35,459 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:34:35" (1/1) ... [2024-11-13 13:34:35,459 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:34:35" (1/1) ... [2024-11-13 13:34:35,471 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:34:35" (1/1) ... [2024-11-13 13:34:35,474 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:34:35" (1/1) ... [2024-11-13 13:34:35,476 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:34:35" (1/1) ... [2024-11-13 13:34:35,477 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:34:35" (1/1) ... [2024-11-13 13:34:35,481 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 13:34:35,483 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 13:34:35,483 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 13:34:35,484 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 13:34:35,485 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:34:35" (1/1) ... [2024-11-13 13:34:35,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 13:34:35,508 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3110b6f5-718f-4488-b2d0-892e5999e860/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:34:35,523 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3110b6f5-718f-4488-b2d0-892e5999e860/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 13:34:35,527 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3110b6f5-718f-4488-b2d0-892e5999e860/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 13:34:35,566 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-13 13:34:35,566 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 13:34:35,566 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-13 13:34:35,567 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-13 13:34:35,567 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-13 13:34:35,567 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-13 13:34:35,567 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-11-13 13:34:35,568 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-11-13 13:34:35,568 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-13 13:34:35,568 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-13 13:34:35,568 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 13:34:35,569 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 13:34:35,570 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 13:34:35,790 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 13:34:35,793 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 13:34:36,197 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-13 13:34:36,197 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 13:34:36,515 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 13:34:36,515 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-13 13:34:36,515 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 01:34:36 BoogieIcfgContainer [2024-11-13 13:34:36,515 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 13:34:36,522 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 13:34:36,522 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 13:34:36,528 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 13:34:36,528 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 01:34:34" (1/3) ... [2024-11-13 13:34:36,529 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@165b8825 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 01:34:36, skipping insertion in model container [2024-11-13 13:34:36,529 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:34:35" (2/3) ... [2024-11-13 13:34:36,530 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@165b8825 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 01:34:36, skipping insertion in model container [2024-11-13 13:34:36,531 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 01:34:36" (3/3) ... [2024-11-13 13:34:36,533 INFO L112 eAbstractionObserver]: Analyzing ICFG safe005_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-11-13 13:34:36,551 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 13:34:36,553 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG safe005_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i that has 4 procedures, 44 locations, 1 initial locations, 0 loop locations, and 3 error locations. [2024-11-13 13:34:36,553 INFO L492 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-13 13:34:36,627 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-13 13:34:36,671 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 45 transitions, 102 flow [2024-11-13 13:34:36,734 INFO L124 PetriNetUnfolderBase]: 2/42 cut-off events. [2024-11-13 13:34:36,739 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-13 13:34:36,744 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52 conditions, 42 events. 2/42 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 82 event pairs, 0 based on Foata normal form. 0/37 useless extension candidates. Maximal degree in co-relation 44. Up to 2 conditions per place. [2024-11-13 13:34:36,746 INFO L82 GeneralOperation]: Start removeDead. Operand has 53 places, 45 transitions, 102 flow [2024-11-13 13:34:36,750 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 50 places, 42 transitions, 93 flow [2024-11-13 13:34:36,767 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 13:34:36,788 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;@35fc1260, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 13:34:36,792 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-11-13 13:34:36,799 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-13 13:34:36,799 INFO L124 PetriNetUnfolderBase]: 0/10 cut-off events. [2024-11-13 13:34:36,799 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-13 13:34:36,801 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 13:34:36,802 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-13 13:34:36,803 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-13 13:34:36,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:34:36,811 INFO L85 PathProgramCache]: Analyzing trace with hash -1558854706, now seen corresponding path program 1 times [2024-11-13 13:34:36,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:34:36,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885099991] [2024-11-13 13:34:36,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:34:36,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:34:37,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:37,603 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 13:34:37,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:34:37,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885099991] [2024-11-13 13:34:37,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885099991] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:34:37,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:34:37,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-13 13:34:37,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624098078] [2024-11-13 13:34:37,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:34:37,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 13:34:37,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:34:37,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 13:34:37,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 13:34:37,662 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 45 [2024-11-13 13:34:37,666 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 42 transitions, 93 flow. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 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 13:34:37,667 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 13:34:37,667 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 45 [2024-11-13 13:34:37,668 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 13:34:38,469 INFO L124 PetriNetUnfolderBase]: 603/1128 cut-off events. [2024-11-13 13:34:38,469 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2024-11-13 13:34:38,479 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2087 conditions, 1128 events. 603/1128 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 6958 event pairs, 192 based on Foata normal form. 72/1184 useless extension candidates. Maximal degree in co-relation 2076. Up to 742 conditions per place. [2024-11-13 13:34:38,496 INFO L140 encePairwiseOnDemand]: 40/45 looper letters, 29 selfloop transitions, 2 changer transitions 2/51 dead transitions. [2024-11-13 13:34:38,496 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 51 transitions, 180 flow [2024-11-13 13:34:38,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 13:34:38,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-13 13:34:38,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 101 transitions. [2024-11-13 13:34:38,517 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7481481481481481 [2024-11-13 13:34:38,519 INFO L175 Difference]: Start difference. First operand has 50 places, 42 transitions, 93 flow. Second operand 3 states and 101 transitions. [2024-11-13 13:34:38,520 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 51 transitions, 180 flow [2024-11-13 13:34:38,526 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 51 transitions, 176 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-13 13:34:38,533 INFO L231 Difference]: Finished difference. Result has 47 places, 37 transitions, 84 flow [2024-11-13 13:34:38,538 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=84, PETRI_PLACES=47, PETRI_TRANSITIONS=37} [2024-11-13 13:34:38,545 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, -3 predicate places. [2024-11-13 13:34:38,546 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 37 transitions, 84 flow [2024-11-13 13:34:38,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 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 13:34:38,546 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 13:34:38,546 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:34:38,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-13 13:34:38,547 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-13 13:34:38,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:34:38,547 INFO L85 PathProgramCache]: Analyzing trace with hash -636466933, now seen corresponding path program 1 times [2024-11-13 13:34:38,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:34:38,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806638914] [2024-11-13 13:34:38,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:34:38,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:34:38,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:38,710 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 13:34:38,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:34:38,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806638914] [2024-11-13 13:34:38,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806638914] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:34:38,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:34:38,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-13 13:34:38,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250883176] [2024-11-13 13:34:38,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:34:38,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 13:34:38,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:34:38,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 13:34:38,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 13:34:38,722 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 45 [2024-11-13 13:34:38,723 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 37 transitions, 84 flow. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 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 13:34:38,724 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 13:34:38,724 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 45 [2024-11-13 13:34:38,724 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 13:34:39,136 INFO L124 PetriNetUnfolderBase]: 528/1053 cut-off events. [2024-11-13 13:34:39,136 INFO L125 PetriNetUnfolderBase]: For 69/69 co-relation queries the response was YES. [2024-11-13 13:34:39,140 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1969 conditions, 1053 events. 528/1053 cut-off events. For 69/69 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 6925 event pairs, 528 based on Foata normal form. 36/1043 useless extension candidates. Maximal degree in co-relation 1959. Up to 811 conditions per place. [2024-11-13 13:34:39,148 INFO L140 encePairwiseOnDemand]: 43/45 looper letters, 17 selfloop transitions, 1 changer transitions 1/36 dead transitions. [2024-11-13 13:34:39,148 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 36 transitions, 120 flow [2024-11-13 13:34:39,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 13:34:39,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-13 13:34:39,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 80 transitions. [2024-11-13 13:34:39,150 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5925925925925926 [2024-11-13 13:34:39,150 INFO L175 Difference]: Start difference. First operand has 47 places, 37 transitions, 84 flow. Second operand 3 states and 80 transitions. [2024-11-13 13:34:39,150 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 36 transitions, 120 flow [2024-11-13 13:34:39,151 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 36 transitions, 116 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-13 13:34:39,154 INFO L231 Difference]: Finished difference. Result has 45 places, 35 transitions, 78 flow [2024-11-13 13:34:39,155 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=78, PETRI_PLACES=45, PETRI_TRANSITIONS=35} [2024-11-13 13:34:39,155 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, -5 predicate places. [2024-11-13 13:34:39,156 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 35 transitions, 78 flow [2024-11-13 13:34:39,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 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 13:34:39,156 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 13:34:39,156 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:34:39,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-13 13:34:39,156 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-13 13:34:39,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:34:39,157 INFO L85 PathProgramCache]: Analyzing trace with hash -636466982, now seen corresponding path program 1 times [2024-11-13 13:34:39,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:34:39,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756031251] [2024-11-13 13:34:39,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:34:39,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:34:39,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:39,662 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 13:34:39,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:34:39,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756031251] [2024-11-13 13:34:39,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756031251] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:34:39,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:34:39,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 13:34:39,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195021941] [2024-11-13 13:34:39,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:34:39,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 13:34:39,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:34:39,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 13:34:39,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 13:34:39,683 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 45 [2024-11-13 13:34:39,684 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 35 transitions, 78 flow. Second operand has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:34:39,684 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 13:34:39,684 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 45 [2024-11-13 13:34:39,684 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 13:34:41,302 INFO L124 PetriNetUnfolderBase]: 3799/6545 cut-off events. [2024-11-13 13:34:41,302 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-13 13:34:41,321 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12242 conditions, 6545 events. 3799/6545 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 415. Compared 48418 event pairs, 855 based on Foata normal form. 0/6358 useless extension candidates. Maximal degree in co-relation 12236. Up to 1876 conditions per place. [2024-11-13 13:34:41,341 INFO L140 encePairwiseOnDemand]: 35/45 looper letters, 36 selfloop transitions, 6 changer transitions 69/122 dead transitions. [2024-11-13 13:34:41,341 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 122 transitions, 478 flow [2024-11-13 13:34:41,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 13:34:41,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-13 13:34:41,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 248 transitions. [2024-11-13 13:34:41,346 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6123456790123457 [2024-11-13 13:34:41,346 INFO L175 Difference]: Start difference. First operand has 45 places, 35 transitions, 78 flow. Second operand 9 states and 248 transitions. [2024-11-13 13:34:41,346 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 122 transitions, 478 flow [2024-11-13 13:34:41,347 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 122 transitions, 477 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-13 13:34:41,349 INFO L231 Difference]: Finished difference. Result has 59 places, 38 transitions, 149 flow [2024-11-13 13:34:41,352 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=77, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=149, PETRI_PLACES=59, PETRI_TRANSITIONS=38} [2024-11-13 13:34:41,353 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 9 predicate places. [2024-11-13 13:34:41,354 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 38 transitions, 149 flow [2024-11-13 13:34:41,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:34:41,354 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 13:34:41,355 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 13:34:41,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-13 13:34:41,355 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-13 13:34:41,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:34:41,355 INFO L85 PathProgramCache]: Analyzing trace with hash -384916437, now seen corresponding path program 1 times [2024-11-13 13:34:41,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:34:41,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753185931] [2024-11-13 13:34:41,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:34:41,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:34:41,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:41,637 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 13:34:41,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:34:41,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753185931] [2024-11-13 13:34:41,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753185931] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:34:41,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:34:41,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 13:34:41,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356403404] [2024-11-13 13:34:41,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:34:41,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 13:34:41,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:34:41,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 13:34:41,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-13 13:34:41,653 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 45 [2024-11-13 13:34:41,653 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 38 transitions, 149 flow. Second operand has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 6 states have internal predecessors, (103), 0 states have call successors, (0), 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 13:34:41,653 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 13:34:41,653 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 45 [2024-11-13 13:34:41,653 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 13:34:42,789 INFO L124 PetriNetUnfolderBase]: 2613/4607 cut-off events. [2024-11-13 13:34:42,789 INFO L125 PetriNetUnfolderBase]: For 5900/5912 co-relation queries the response was YES. [2024-11-13 13:34:42,807 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12767 conditions, 4607 events. 2613/4607 cut-off events. For 5900/5912 co-relation queries the response was YES. Maximal size of possible extension queue 275. Compared 32284 event pairs, 314 based on Foata normal form. 124/4691 useless extension candidates. Maximal degree in co-relation 12752. Up to 1526 conditions per place. [2024-11-13 13:34:42,831 INFO L140 encePairwiseOnDemand]: 36/45 looper letters, 40 selfloop transitions, 7 changer transitions 59/117 dead transitions. [2024-11-13 13:34:42,831 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 117 transitions, 681 flow [2024-11-13 13:34:42,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-13 13:34:42,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-13 13:34:42,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 252 transitions. [2024-11-13 13:34:42,834 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.56 [2024-11-13 13:34:42,834 INFO L175 Difference]: Start difference. First operand has 59 places, 38 transitions, 149 flow. Second operand 10 states and 252 transitions. [2024-11-13 13:34:42,834 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 117 transitions, 681 flow [2024-11-13 13:34:42,884 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 117 transitions, 611 flow, removed 14 selfloop flow, removed 4 redundant places. [2024-11-13 13:34:42,889 INFO L231 Difference]: Finished difference. Result has 66 places, 40 transitions, 187 flow [2024-11-13 13:34:42,889 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=129, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=187, PETRI_PLACES=66, PETRI_TRANSITIONS=40} [2024-11-13 13:34:42,890 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 16 predicate places. [2024-11-13 13:34:42,891 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 40 transitions, 187 flow [2024-11-13 13:34:42,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 6 states have internal predecessors, (103), 0 states have call successors, (0), 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 13:34:42,891 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 13:34:42,893 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 13:34:42,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-13 13:34:42,893 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-13 13:34:42,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:34:42,894 INFO L85 PathProgramCache]: Analyzing trace with hash -1355429972, now seen corresponding path program 1 times [2024-11-13 13:34:42,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:34:42,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760029910] [2024-11-13 13:34:42,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:34:42,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:34:42,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:43,276 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 13:34:43,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:34:43,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760029910] [2024-11-13 13:34:43,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760029910] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:34:43,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:34:43,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 13:34:43,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005490321] [2024-11-13 13:34:43,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:34:43,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 13:34:43,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:34:43,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 13:34:43,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-13 13:34:43,298 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 45 [2024-11-13 13:34:43,298 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 40 transitions, 187 flow. Second operand has 7 states, 7 states have (on average 17.0) internal successors, (119), 7 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:34:43,298 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 13:34:43,299 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 45 [2024-11-13 13:34:43,299 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 13:34:44,855 INFO L124 PetriNetUnfolderBase]: 3385/6012 cut-off events. [2024-11-13 13:34:44,855 INFO L125 PetriNetUnfolderBase]: For 11165/11174 co-relation queries the response was YES. [2024-11-13 13:34:44,891 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17161 conditions, 6012 events. 3385/6012 cut-off events. For 11165/11174 co-relation queries the response was YES. Maximal size of possible extension queue 369. Compared 45239 event pairs, 435 based on Foata normal form. 114/6074 useless extension candidates. Maximal degree in co-relation 17139. Up to 1923 conditions per place. [2024-11-13 13:34:44,916 INFO L140 encePairwiseOnDemand]: 36/45 looper letters, 47 selfloop transitions, 9 changer transitions 41/108 dead transitions. [2024-11-13 13:34:44,917 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 108 transitions, 701 flow [2024-11-13 13:34:44,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 13:34:44,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-13 13:34:44,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 190 transitions. [2024-11-13 13:34:44,922 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6031746031746031 [2024-11-13 13:34:44,922 INFO L175 Difference]: Start difference. First operand has 66 places, 40 transitions, 187 flow. Second operand 7 states and 190 transitions. [2024-11-13 13:34:44,922 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 108 transitions, 701 flow [2024-11-13 13:34:44,969 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 108 transitions, 667 flow, removed 15 selfloop flow, removed 5 redundant places. [2024-11-13 13:34:44,971 INFO L231 Difference]: Finished difference. Result has 65 places, 42 transitions, 221 flow [2024-11-13 13:34:44,971 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=221, PETRI_PLACES=65, PETRI_TRANSITIONS=42} [2024-11-13 13:34:44,972 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 15 predicate places. [2024-11-13 13:34:44,972 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 42 transitions, 221 flow [2024-11-13 13:34:44,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.0) internal successors, (119), 7 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:34:44,973 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 13:34:44,973 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 13:34:44,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-13 13:34:44,973 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-13 13:34:44,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:34:44,974 INFO L85 PathProgramCache]: Analyzing trace with hash 707364055, now seen corresponding path program 1 times [2024-11-13 13:34:44,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:34:44,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411214250] [2024-11-13 13:34:44,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:34:44,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:34:45,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:45,363 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 13:34:45,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:34:45,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411214250] [2024-11-13 13:34:45,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411214250] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:34:45,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:34:45,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 13:34:45,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824285100] [2024-11-13 13:34:45,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:34:45,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 13:34:45,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:34:45,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 13:34:45,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-13 13:34:45,406 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 45 [2024-11-13 13:34:45,406 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 42 transitions, 221 flow. Second operand has 6 states, 6 states have (on average 18.5) internal successors, (111), 6 states have internal predecessors, (111), 0 states have call successors, (0), 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 13:34:45,410 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 13:34:45,410 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 45 [2024-11-13 13:34:45,410 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 13:34:46,891 INFO L124 PetriNetUnfolderBase]: 3051/5836 cut-off events. [2024-11-13 13:34:46,891 INFO L125 PetriNetUnfolderBase]: For 7632/7687 co-relation queries the response was YES. [2024-11-13 13:34:46,924 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15274 conditions, 5836 events. 3051/5836 cut-off events. For 7632/7687 co-relation queries the response was YES. Maximal size of possible extension queue 407. Compared 48115 event pairs, 949 based on Foata normal form. 154/5876 useless extension candidates. Maximal degree in co-relation 15251. Up to 1362 conditions per place. [2024-11-13 13:34:46,942 INFO L140 encePairwiseOnDemand]: 39/45 looper letters, 39 selfloop transitions, 3 changer transitions 53/108 dead transitions. [2024-11-13 13:34:46,942 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 108 transitions, 645 flow [2024-11-13 13:34:46,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 13:34:46,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-13 13:34:46,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 235 transitions. [2024-11-13 13:34:46,944 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5802469135802469 [2024-11-13 13:34:46,945 INFO L175 Difference]: Start difference. First operand has 65 places, 42 transitions, 221 flow. Second operand 9 states and 235 transitions. [2024-11-13 13:34:46,945 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 108 transitions, 645 flow [2024-11-13 13:34:46,982 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 108 transitions, 584 flow, removed 18 selfloop flow, removed 7 redundant places. [2024-11-13 13:34:46,984 INFO L231 Difference]: Finished difference. Result has 70 places, 38 transitions, 168 flow [2024-11-13 13:34:46,984 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=168, PETRI_PLACES=70, PETRI_TRANSITIONS=38} [2024-11-13 13:34:46,985 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 20 predicate places. [2024-11-13 13:34:46,985 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 38 transitions, 168 flow [2024-11-13 13:34:46,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 6 states have internal predecessors, (111), 0 states have call successors, (0), 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 13:34:46,985 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 13:34:46,985 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 13:34:46,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-13 13:34:46,985 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-13 13:34:46,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:34:46,986 INFO L85 PathProgramCache]: Analyzing trace with hash 295069741, now seen corresponding path program 1 times [2024-11-13 13:34:46,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:34:46,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736762485] [2024-11-13 13:34:46,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:34:46,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:34:47,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:47,302 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 13:34:47,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:34:47,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736762485] [2024-11-13 13:34:47,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736762485] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:34:47,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:34:47,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 13:34:47,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028144740] [2024-11-13 13:34:47,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:34:47,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 13:34:47,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:34:47,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 13:34:47,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-13 13:34:47,319 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 45 [2024-11-13 13:34:47,319 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 38 transitions, 168 flow. Second operand has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 6 states have internal predecessors, (106), 0 states have call successors, (0), 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 13:34:47,320 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 13:34:47,320 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 45 [2024-11-13 13:34:47,320 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 13:34:48,161 INFO L124 PetriNetUnfolderBase]: 1672/3142 cut-off events. [2024-11-13 13:34:48,161 INFO L125 PetriNetUnfolderBase]: For 4411/4413 co-relation queries the response was YES. [2024-11-13 13:34:48,172 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8221 conditions, 3142 events. 1672/3142 cut-off events. For 4411/4413 co-relation queries the response was YES. Maximal size of possible extension queue 209. Compared 22245 event pairs, 356 based on Foata normal form. 78/3198 useless extension candidates. Maximal degree in co-relation 8197. Up to 988 conditions per place. [2024-11-13 13:34:48,181 INFO L140 encePairwiseOnDemand]: 38/45 looper letters, 35 selfloop transitions, 5 changer transitions 40/91 dead transitions. [2024-11-13 13:34:48,181 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 91 transitions, 522 flow [2024-11-13 13:34:48,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-13 13:34:48,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-13 13:34:48,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 229 transitions. [2024-11-13 13:34:48,183 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5088888888888888 [2024-11-13 13:34:48,183 INFO L175 Difference]: Start difference. First operand has 70 places, 38 transitions, 168 flow. Second operand 10 states and 229 transitions. [2024-11-13 13:34:48,183 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 91 transitions, 522 flow [2024-11-13 13:34:48,202 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 91 transitions, 453 flow, removed 21 selfloop flow, removed 11 redundant places. [2024-11-13 13:34:48,203 INFO L231 Difference]: Finished difference. Result has 70 places, 39 transitions, 174 flow [2024-11-13 13:34:48,204 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=174, PETRI_PLACES=70, PETRI_TRANSITIONS=39} [2024-11-13 13:34:48,204 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 20 predicate places. [2024-11-13 13:34:48,205 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 39 transitions, 174 flow [2024-11-13 13:34:48,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 6 states have internal predecessors, (106), 0 states have call successors, (0), 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 13:34:48,205 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 13:34:48,205 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] [2024-11-13 13:34:48,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-13 13:34:48,206 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-13 13:34:48,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:34:48,206 INFO L85 PathProgramCache]: Analyzing trace with hash -2052358014, now seen corresponding path program 1 times [2024-11-13 13:34:48,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:34:48,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128066107] [2024-11-13 13:34:48,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:34:48,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:34:48,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:48,468 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 13:34:48,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:34:48,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128066107] [2024-11-13 13:34:48,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128066107] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:34:48,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:34:48,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 13:34:48,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89764644] [2024-11-13 13:34:48,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:34:48,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 13:34:48,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:34:48,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 13:34:48,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 13:34:48,487 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 45 [2024-11-13 13:34:48,488 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 39 transitions, 174 flow. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:34:48,488 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 13:34:48,488 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 45 [2024-11-13 13:34:48,488 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 13:34:49,428 INFO L124 PetriNetUnfolderBase]: 3057/5017 cut-off events. [2024-11-13 13:34:49,428 INFO L125 PetriNetUnfolderBase]: For 3734/3850 co-relation queries the response was YES. [2024-11-13 13:34:49,456 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12063 conditions, 5017 events. 3057/5017 cut-off events. For 3734/3850 co-relation queries the response was YES. Maximal size of possible extension queue 315. Compared 33261 event pairs, 399 based on Foata normal form. 311/5220 useless extension candidates. Maximal degree in co-relation 12040. Up to 2641 conditions per place. [2024-11-13 13:34:49,470 INFO L140 encePairwiseOnDemand]: 39/45 looper letters, 38 selfloop transitions, 5 changer transitions 5/64 dead transitions. [2024-11-13 13:34:49,470 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 64 transitions, 350 flow [2024-11-13 13:34:49,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 13:34:49,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-13 13:34:49,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 115 transitions. [2024-11-13 13:34:49,472 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6388888888888888 [2024-11-13 13:34:49,472 INFO L175 Difference]: Start difference. First operand has 70 places, 39 transitions, 174 flow. Second operand 4 states and 115 transitions. [2024-11-13 13:34:49,472 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 64 transitions, 350 flow [2024-11-13 13:34:49,496 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 64 transitions, 324 flow, removed 8 selfloop flow, removed 10 redundant places. [2024-11-13 13:34:49,498 INFO L231 Difference]: Finished difference. Result has 59 places, 42 transitions, 184 flow [2024-11-13 13:34:49,498 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=184, PETRI_PLACES=59, PETRI_TRANSITIONS=42} [2024-11-13 13:34:49,499 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 9 predicate places. [2024-11-13 13:34:49,499 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 42 transitions, 184 flow [2024-11-13 13:34:49,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:34:49,499 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 13:34:49,500 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] [2024-11-13 13:34:49,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-13 13:34:49,500 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-13 13:34:49,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:34:49,501 INFO L85 PathProgramCache]: Analyzing trace with hash 1092139185, now seen corresponding path program 1 times [2024-11-13 13:34:49,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:34:49,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366371245] [2024-11-13 13:34:49,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:34:49,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:34:49,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:49,790 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 13:34:49,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:34:49,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366371245] [2024-11-13 13:34:49,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366371245] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:34:49,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:34:49,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 13:34:49,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059692910] [2024-11-13 13:34:49,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:34:49,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 13:34:49,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:34:49,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 13:34:49,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-13 13:34:49,802 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 45 [2024-11-13 13:34:49,802 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 42 transitions, 184 flow. Second operand has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:34:49,802 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 13:34:49,802 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 45 [2024-11-13 13:34:49,802 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 13:34:50,400 INFO L124 PetriNetUnfolderBase]: 2176/3643 cut-off events. [2024-11-13 13:34:50,400 INFO L125 PetriNetUnfolderBase]: For 2411/2459 co-relation queries the response was YES. [2024-11-13 13:34:50,411 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9531 conditions, 3643 events. 2176/3643 cut-off events. For 2411/2459 co-relation queries the response was YES. Maximal size of possible extension queue 202. Compared 22173 event pairs, 164 based on Foata normal form. 256/3823 useless extension candidates. Maximal degree in co-relation 9514. Up to 1417 conditions per place. [2024-11-13 13:34:50,419 INFO L140 encePairwiseOnDemand]: 39/45 looper letters, 46 selfloop transitions, 8 changer transitions 6/76 dead transitions. [2024-11-13 13:34:50,420 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 76 transitions, 429 flow [2024-11-13 13:34:50,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 13:34:50,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-13 13:34:50,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 143 transitions. [2024-11-13 13:34:50,421 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6355555555555555 [2024-11-13 13:34:50,421 INFO L175 Difference]: Start difference. First operand has 59 places, 42 transitions, 184 flow. Second operand 5 states and 143 transitions. [2024-11-13 13:34:50,422 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 76 transitions, 429 flow [2024-11-13 13:34:50,425 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 76 transitions, 419 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-11-13 13:34:50,426 INFO L231 Difference]: Finished difference. Result has 63 places, 45 transitions, 224 flow [2024-11-13 13:34:50,426 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=224, PETRI_PLACES=63, PETRI_TRANSITIONS=45} [2024-11-13 13:34:50,427 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 13 predicate places. [2024-11-13 13:34:50,427 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 45 transitions, 224 flow [2024-11-13 13:34:50,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:34:50,428 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 13:34:50,428 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 13:34:50,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-13 13:34:50,428 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-13 13:34:50,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:34:50,429 INFO L85 PathProgramCache]: Analyzing trace with hash -1460718790, now seen corresponding path program 1 times [2024-11-13 13:34:50,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:34:50,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056734434] [2024-11-13 13:34:50,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:34:50,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:34:50,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:50,796 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 13:34:50,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:34:50,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056734434] [2024-11-13 13:34:50,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056734434] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:34:50,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:34:50,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 13:34:50,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663862626] [2024-11-13 13:34:50,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:34:50,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 13:34:50,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:34:50,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 13:34:50,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-13 13:34:50,808 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 45 [2024-11-13 13:34:50,808 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 45 transitions, 224 flow. Second operand has 6 states, 6 states have (on average 19.833333333333332) internal successors, (119), 6 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:34:50,808 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 13:34:50,808 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 45 [2024-11-13 13:34:50,809 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 13:34:51,284 INFO L124 PetriNetUnfolderBase]: 1312/2195 cut-off events. [2024-11-13 13:34:51,284 INFO L125 PetriNetUnfolderBase]: For 2801/2825 co-relation queries the response was YES. [2024-11-13 13:34:51,292 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6389 conditions, 2195 events. 1312/2195 cut-off events. For 2801/2825 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 11700 event pairs, 118 based on Foata normal form. 146/2278 useless extension candidates. Maximal degree in co-relation 6370. Up to 800 conditions per place. [2024-11-13 13:34:51,297 INFO L140 encePairwiseOnDemand]: 39/45 looper letters, 40 selfloop transitions, 11 changer transitions 6/73 dead transitions. [2024-11-13 13:34:51,298 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 73 transitions, 428 flow [2024-11-13 13:34:51,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 13:34:51,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-13 13:34:51,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 158 transitions. [2024-11-13 13:34:51,299 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5851851851851851 [2024-11-13 13:34:51,299 INFO L175 Difference]: Start difference. First operand has 63 places, 45 transitions, 224 flow. Second operand 6 states and 158 transitions. [2024-11-13 13:34:51,300 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 73 transitions, 428 flow [2024-11-13 13:34:51,310 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 73 transitions, 382 flow, removed 13 selfloop flow, removed 7 redundant places. [2024-11-13 13:34:51,311 INFO L231 Difference]: Finished difference. Result has 63 places, 45 transitions, 225 flow [2024-11-13 13:34:51,311 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=189, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=225, PETRI_PLACES=63, PETRI_TRANSITIONS=45} [2024-11-13 13:34:51,312 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 13 predicate places. [2024-11-13 13:34:51,312 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 45 transitions, 225 flow [2024-11-13 13:34:51,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.833333333333332) internal successors, (119), 6 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:34:51,312 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 13:34:51,312 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] [2024-11-13 13:34:51,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-13 13:34:51,313 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-13 13:34:51,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:34:51,313 INFO L85 PathProgramCache]: Analyzing trace with hash 89787934, now seen corresponding path program 1 times [2024-11-13 13:34:51,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:34:51,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767701208] [2024-11-13 13:34:51,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:34:51,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:34:51,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:51,692 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 13:34:51,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:34:51,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767701208] [2024-11-13 13:34:51,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767701208] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:34:51,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:34:51,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 13:34:51,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414856713] [2024-11-13 13:34:51,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:34:51,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 13:34:51,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:34:51,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 13:34:51,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 13:34:51,714 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 45 [2024-11-13 13:34:51,715 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 45 transitions, 225 flow. Second operand has 5 states, 5 states have (on average 20.6) internal successors, (103), 5 states have internal predecessors, (103), 0 states have call successors, (0), 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 13:34:51,715 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 13:34:51,715 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 45 [2024-11-13 13:34:51,715 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 13:34:52,076 INFO L124 PetriNetUnfolderBase]: 732/1411 cut-off events. [2024-11-13 13:34:52,077 INFO L125 PetriNetUnfolderBase]: For 1235/1264 co-relation queries the response was YES. [2024-11-13 13:34:52,083 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3729 conditions, 1411 events. 732/1411 cut-off events. For 1235/1264 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 8251 event pairs, 372 based on Foata normal form. 8/1302 useless extension candidates. Maximal degree in co-relation 3712. Up to 603 conditions per place. [2024-11-13 13:34:52,086 INFO L140 encePairwiseOnDemand]: 40/45 looper letters, 27 selfloop transitions, 3 changer transitions 14/64 dead transitions. [2024-11-13 13:34:52,086 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 64 transitions, 369 flow [2024-11-13 13:34:52,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 13:34:52,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-13 13:34:52,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 127 transitions. [2024-11-13 13:34:52,087 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5644444444444444 [2024-11-13 13:34:52,088 INFO L175 Difference]: Start difference. First operand has 63 places, 45 transitions, 225 flow. Second operand 5 states and 127 transitions. [2024-11-13 13:34:52,088 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 64 transitions, 369 flow [2024-11-13 13:34:52,098 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 64 transitions, 305 flow, removed 14 selfloop flow, removed 8 redundant places. [2024-11-13 13:34:52,099 INFO L231 Difference]: Finished difference. Result has 62 places, 43 transitions, 172 flow [2024-11-13 13:34:52,100 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=169, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=172, PETRI_PLACES=62, PETRI_TRANSITIONS=43} [2024-11-13 13:34:52,101 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 12 predicate places. [2024-11-13 13:34:52,102 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 43 transitions, 172 flow [2024-11-13 13:34:52,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.6) internal successors, (103), 5 states have internal predecessors, (103), 0 states have call successors, (0), 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 13:34:52,103 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 13:34:52,103 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] [2024-11-13 13:34:52,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-13 13:34:52,104 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-13 13:34:52,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:34:52,105 INFO L85 PathProgramCache]: Analyzing trace with hash 188688264, now seen corresponding path program 2 times [2024-11-13 13:34:52,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:34:52,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328024319] [2024-11-13 13:34:52,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:34:52,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:34:52,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:53,722 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 13:34:53,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:34:53,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328024319] [2024-11-13 13:34:53,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328024319] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:34:53,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:34:53,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-13 13:34:53,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994387891] [2024-11-13 13:34:53,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:34:53,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-13 13:34:53,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:34:53,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-13 13:34:53,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-13 13:34:53,755 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 45 [2024-11-13 13:34:53,756 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 43 transitions, 172 flow. Second operand has 9 states, 9 states have (on average 17.22222222222222) internal successors, (155), 9 states have internal predecessors, (155), 0 states have call successors, (0), 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 13:34:53,756 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 13:34:53,756 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 45 [2024-11-13 13:34:53,756 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 13:34:54,458 INFO L124 PetriNetUnfolderBase]: 667/1323 cut-off events. [2024-11-13 13:34:54,458 INFO L125 PetriNetUnfolderBase]: For 736/740 co-relation queries the response was YES. [2024-11-13 13:34:54,462 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3090 conditions, 1323 events. 667/1323 cut-off events. For 736/740 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 7612 event pairs, 126 based on Foata normal form. 12/1273 useless extension candidates. Maximal degree in co-relation 3075. Up to 330 conditions per place. [2024-11-13 13:34:54,465 INFO L140 encePairwiseOnDemand]: 34/45 looper letters, 40 selfloop transitions, 16 changer transitions 22/95 dead transitions. [2024-11-13 13:34:54,465 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 95 transitions, 514 flow [2024-11-13 13:34:54,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-13 13:34:54,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-13 13:34:54,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 226 transitions. [2024-11-13 13:34:54,467 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5022222222222222 [2024-11-13 13:34:54,468 INFO L175 Difference]: Start difference. First operand has 62 places, 43 transitions, 172 flow. Second operand 10 states and 226 transitions. [2024-11-13 13:34:54,468 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 95 transitions, 514 flow [2024-11-13 13:34:54,470 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 95 transitions, 473 flow, removed 7 selfloop flow, removed 6 redundant places. [2024-11-13 13:34:54,472 INFO L231 Difference]: Finished difference. Result has 69 places, 53 transitions, 272 flow [2024-11-13 13:34:54,472 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=151, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=272, PETRI_PLACES=69, PETRI_TRANSITIONS=53} [2024-11-13 13:34:54,473 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 19 predicate places. [2024-11-13 13:34:54,473 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 53 transitions, 272 flow [2024-11-13 13:34:54,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 17.22222222222222) internal successors, (155), 9 states have internal predecessors, (155), 0 states have call successors, (0), 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 13:34:54,473 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 13:34:54,473 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] [2024-11-13 13:34:54,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-13 13:34:54,474 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-13 13:34:54,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:34:54,474 INFO L85 PathProgramCache]: Analyzing trace with hash 1636063064, now seen corresponding path program 3 times [2024-11-13 13:34:54,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:34:54,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039081039] [2024-11-13 13:34:54,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:34:54,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:34:54,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:54,830 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 13:34:54,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:34:54,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039081039] [2024-11-13 13:34:54,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039081039] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:34:54,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:34:54,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 13:34:54,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392393643] [2024-11-13 13:34:54,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:34:54,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 13:34:54,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:34:54,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 13:34:54,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-13 13:34:54,860 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 45 [2024-11-13 13:34:54,860 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 53 transitions, 272 flow. Second operand has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 6 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:34:54,860 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 13:34:54,861 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 45 [2024-11-13 13:34:54,861 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 13:34:55,212 INFO L124 PetriNetUnfolderBase]: 455/959 cut-off events. [2024-11-13 13:34:55,213 INFO L125 PetriNetUnfolderBase]: For 1089/1105 co-relation queries the response was YES. [2024-11-13 13:34:55,216 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2415 conditions, 959 events. 455/959 cut-off events. For 1089/1105 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 5199 event pairs, 111 based on Foata normal form. 16/938 useless extension candidates. Maximal degree in co-relation 2398. Up to 351 conditions per place. [2024-11-13 13:34:55,218 INFO L140 encePairwiseOnDemand]: 40/45 looper letters, 30 selfloop transitions, 3 changer transitions 24/75 dead transitions. [2024-11-13 13:34:55,218 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 75 transitions, 455 flow [2024-11-13 13:34:55,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 13:34:55,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-13 13:34:55,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 142 transitions. [2024-11-13 13:34:55,220 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5259259259259259 [2024-11-13 13:34:55,220 INFO L175 Difference]: Start difference. First operand has 69 places, 53 transitions, 272 flow. Second operand 6 states and 142 transitions. [2024-11-13 13:34:55,220 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 75 transitions, 455 flow [2024-11-13 13:34:55,223 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 75 transitions, 429 flow, removed 10 selfloop flow, removed 4 redundant places. [2024-11-13 13:34:55,226 INFO L231 Difference]: Finished difference. Result has 71 places, 47 transitions, 203 flow [2024-11-13 13:34:55,227 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=255, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=203, PETRI_PLACES=71, PETRI_TRANSITIONS=47} [2024-11-13 13:34:55,228 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 21 predicate places. [2024-11-13 13:34:55,228 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 47 transitions, 203 flow [2024-11-13 13:34:55,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 6 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:34:55,228 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 13:34:55,229 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] [2024-11-13 13:34:55,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-13 13:34:55,229 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-13 13:34:55,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:34:55,229 INFO L85 PathProgramCache]: Analyzing trace with hash 2094100450, now seen corresponding path program 4 times [2024-11-13 13:34:55,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:34:55,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728386251] [2024-11-13 13:34:55,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:34:55,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:34:55,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:56,353 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 13:34:56,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:34:56,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728386251] [2024-11-13 13:34:56,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728386251] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:34:56,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:34:56,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-13 13:34:56,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376924550] [2024-11-13 13:34:56,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:34:56,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-13 13:34:56,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:34:56,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-13 13:34:56,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-13 13:34:56,361 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 45 [2024-11-13 13:34:56,362 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 47 transitions, 203 flow. Second operand has 9 states, 9 states have (on average 20.77777777777778) internal successors, (187), 9 states have internal predecessors, (187), 0 states have call successors, (0), 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 13:34:56,362 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 13:34:56,362 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 45 [2024-11-13 13:34:56,362 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 13:34:56,813 INFO L124 PetriNetUnfolderBase]: 294/617 cut-off events. [2024-11-13 13:34:56,813 INFO L125 PetriNetUnfolderBase]: For 342/356 co-relation queries the response was YES. [2024-11-13 13:34:56,815 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1437 conditions, 617 events. 294/617 cut-off events. For 342/356 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2824 event pairs, 50 based on Foata normal form. 18/591 useless extension candidates. Maximal degree in co-relation 1420. Up to 194 conditions per place. [2024-11-13 13:34:56,817 INFO L140 encePairwiseOnDemand]: 37/45 looper letters, 25 selfloop transitions, 4 changer transitions 26/76 dead transitions. [2024-11-13 13:34:56,817 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 76 transitions, 379 flow [2024-11-13 13:34:56,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 13:34:56,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-13 13:34:56,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 221 transitions. [2024-11-13 13:34:56,819 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5456790123456791 [2024-11-13 13:34:56,819 INFO L175 Difference]: Start difference. First operand has 71 places, 47 transitions, 203 flow. Second operand 9 states and 221 transitions. [2024-11-13 13:34:56,819 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 76 transitions, 379 flow [2024-11-13 13:34:56,821 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 76 transitions, 342 flow, removed 7 selfloop flow, removed 9 redundant places. [2024-11-13 13:34:56,823 INFO L231 Difference]: Finished difference. Result has 70 places, 40 transitions, 141 flow [2024-11-13 13:34:56,823 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=170, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=141, PETRI_PLACES=70, PETRI_TRANSITIONS=40} [2024-11-13 13:34:56,824 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 20 predicate places. [2024-11-13 13:34:56,824 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 40 transitions, 141 flow [2024-11-13 13:34:56,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 20.77777777777778) internal successors, (187), 9 states have internal predecessors, (187), 0 states have call successors, (0), 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 13:34:56,824 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 13:34:56,824 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] [2024-11-13 13:34:56,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-13 13:34:56,825 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-13 13:34:56,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:34:56,825 INFO L85 PathProgramCache]: Analyzing trace with hash 917883746, now seen corresponding path program 5 times [2024-11-13 13:34:56,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:34:56,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968761270] [2024-11-13 13:34:56,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:34:56,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:34:56,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 13:34:56,903 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 13:34:56,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 13:34:57,016 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 13:34:57,016 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-13 13:34:57,017 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (6 of 7 remaining) [2024-11-13 13:34:57,019 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (5 of 7 remaining) [2024-11-13 13:34:57,020 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (4 of 7 remaining) [2024-11-13 13:34:57,020 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2024-11-13 13:34:57,020 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2024-11-13 13:34:57,020 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2024-11-13 13:34:57,020 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2024-11-13 13:34:57,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-13 13:34:57,021 INFO L407 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:34:57,109 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-13 13:34:57,109 INFO L173 ceAbstractionStarter]: Computing trace abstraction results [2024-11-13 13:34:57,119 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.11 01:34:57 BasicIcfg [2024-11-13 13:34:57,121 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-13 13:34:57,122 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-13 13:34:57,122 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-13 13:34:57,123 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-13 13:34:57,123 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 01:34:36" (3/4) ... [2024-11-13 13:34:57,126 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-13 13:34:57,127 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-13 13:34:57,128 INFO L158 Benchmark]: Toolchain (without parser) took 22665.97ms. Allocated memory was 117.4MB in the beginning and 679.5MB in the end (delta: 562.0MB). Free memory was 92.0MB in the beginning and 266.6MB in the end (delta: -174.6MB). Peak memory consumption was 387.2MB. Max. memory is 16.1GB. [2024-11-13 13:34:57,128 INFO L158 Benchmark]: CDTParser took 0.47ms. Allocated memory is still 167.8MB. Free memory is still 105.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 13:34:57,128 INFO L158 Benchmark]: CACSL2BoogieTranslator took 873.26ms. Allocated memory is still 117.4MB. Free memory was 92.0MB in the beginning and 69.0MB in the end (delta: 23.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-13 13:34:57,129 INFO L158 Benchmark]: Boogie Procedure Inliner took 72.32ms. Allocated memory is still 117.4MB. Free memory was 69.0MB in the beginning and 66.9MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 13:34:57,129 INFO L158 Benchmark]: Boogie Preprocessor took 69.16ms. Allocated memory is still 117.4MB. Free memory was 66.9MB in the beginning and 63.8MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 13:34:57,130 INFO L158 Benchmark]: RCFGBuilder took 1032.38ms. Allocated memory is still 117.4MB. Free memory was 63.8MB in the beginning and 68.8MB in the end (delta: -5.0MB). Peak memory consumption was 41.0MB. Max. memory is 16.1GB. [2024-11-13 13:34:57,130 INFO L158 Benchmark]: TraceAbstraction took 20600.18ms. Allocated memory was 117.4MB in the beginning and 679.5MB in the end (delta: 562.0MB). Free memory was 68.3MB in the beginning and 266.7MB in the end (delta: -198.4MB). Peak memory consumption was 365.1MB. Max. memory is 16.1GB. [2024-11-13 13:34:57,130 INFO L158 Benchmark]: Witness Printer took 4.68ms. Allocated memory is still 679.5MB. Free memory was 266.7MB in the beginning and 266.6MB in the end (delta: 91.7kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 13:34:57,132 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.47ms. Allocated memory is still 167.8MB. Free memory is still 105.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 873.26ms. Allocated memory is still 117.4MB. Free memory was 92.0MB in the beginning and 69.0MB in the end (delta: 23.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 72.32ms. Allocated memory is still 117.4MB. Free memory was 69.0MB in the beginning and 66.9MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 69.16ms. Allocated memory is still 117.4MB. Free memory was 66.9MB in the beginning and 63.8MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 1032.38ms. Allocated memory is still 117.4MB. Free memory was 63.8MB in the beginning and 68.8MB in the end (delta: -5.0MB). Peak memory consumption was 41.0MB. Max. memory is 16.1GB. * TraceAbstraction took 20600.18ms. Allocated memory was 117.4MB in the beginning and 679.5MB in the end (delta: 562.0MB). Free memory was 68.3MB in the beginning and 266.7MB in the end (delta: -198.4MB). Peak memory consumption was 365.1MB. Max. memory is 16.1GB. * Witness Printer took 4.68ms. Allocated memory is still 679.5MB. Free memory was 266.7MB in the beginning and 266.6MB in the end (delta: 91.7kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p2_EBX = 0; [L717] 0 _Bool main$tmp_guard0; [L718] 0 _Bool main$tmp_guard1; [L720] 0 int x = 0; [L721] 0 _Bool x$flush_delayed; [L722] 0 int x$mem_tmp; [L723] 0 _Bool x$r_buff0_thd0; [L724] 0 _Bool x$r_buff0_thd1; [L725] 0 _Bool x$r_buff0_thd2; [L726] 0 _Bool x$r_buff0_thd3; [L727] 0 _Bool x$r_buff1_thd0; [L728] 0 _Bool x$r_buff1_thd1; [L729] 0 _Bool x$r_buff1_thd2; [L730] 0 _Bool x$r_buff1_thd3; [L731] 0 _Bool x$read_delayed; [L732] 0 int *x$read_delayed_var; [L733] 0 int x$w_buff0; [L734] 0 _Bool x$w_buff0_used; [L735] 0 int x$w_buff1; [L736] 0 _Bool x$w_buff1_used; [L738] 0 int y = 0; [L739] 0 _Bool weak$$choice0; [L740] 0 _Bool weak$$choice2; [L831] 0 pthread_t t1897; [L832] FCALL, FORK 0 pthread_create(&t1897, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1897=-2, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L833] 0 pthread_t t1898; [L834] FCALL, FORK 0 pthread_create(&t1898, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1897=-2, t1898=-1, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L835] 0 pthread_t t1899; [L836] FCALL, FORK 0 pthread_create(&t1899, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1897=-2, t1898=-1, t1899=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L774] 2 x$w_buff1 = x$w_buff0 [L775] 2 x$w_buff0 = 1 [L776] 2 x$w_buff1_used = x$w_buff0_used [L777] 2 x$w_buff0_used = (_Bool)1 [L778] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L778] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L779] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L780] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L781] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L782] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L783] 2 x$r_buff0_thd2 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L786] 2 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L803] 3 __unbuffered_p2_EAX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L806] 3 __unbuffered_p2_EBX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L744] 1 y = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L749] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L750] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L751] 1 x$flush_delayed = weak$$choice2 [L752] 1 x$mem_tmp = x [L753] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L754] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L755] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L756] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L757] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L758] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L759] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L760] 1 __unbuffered_p0_EAX = x [L761] 1 x = x$flush_delayed ? x$mem_tmp : x [L762] 1 x$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L809] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L810] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L811] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L812] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L813] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L789] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L790] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L791] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L792] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L793] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L796] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L816] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L767] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L838] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1897=-2, t1898=-1, t1899=0, weak$$choice0=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L840] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L840] RET 0 assume_abort_if_not(main$tmp_guard0) [L842] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L843] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L844] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L845] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L846] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1897=-2, t1898=-1, t1899=0, weak$$choice0=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L849] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 1) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1897=-2, t1898=-1, t1899=0, weak$$choice0=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L851] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] CALL 0 reach_error() [L18] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L18] 0 __assert_fail ("0", "safe005_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 829]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 832]: 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: 834]: 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: 836]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 70 locations, 7 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: 20.4s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 12.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 708 SdHoareTripleChecker+Valid, 3.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 671 mSDsluCounter, 237 SdHoareTripleChecker+Invalid, 3.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 193 mSDsCounter, 69 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1879 IncrementalHoareTripleChecker+Invalid, 1948 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 69 mSolverCounterUnsat, 44 mSDtfsCounter, 1879 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 111 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=272occurred in iteration=12, InterpolantAutomatonStates: 96, 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.6s SatisfiabilityAnalysisTime, 6.3s InterpolantComputationTime, 345 NumberOfCodeBlocks, 345 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 300 ConstructedInterpolants, 0 QuantifiedInterpolants, 1589 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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 13:34:57,171 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3110b6f5-718f-4488-b2d0-892e5999e860/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally 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_3110b6f5-718f-4488-b2d0-892e5999e860/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3110b6f5-718f-4488-b2d0-892e5999e860/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_3110b6f5-718f-4488-b2d0-892e5999e860/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3110b6f5-718f-4488-b2d0-892e5999e860/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe005_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3110b6f5-718f-4488-b2d0-892e5999e860/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_3110b6f5-718f-4488-b2d0-892e5999e860/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 40c6d23f476fb49e658cd83073483dddc1740bbd5f458e601d84fe47899d7237 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 13:35:00,553 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 13:35:00,713 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3110b6f5-718f-4488-b2d0-892e5999e860/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-13 13:35:00,722 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 13:35:00,722 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 13:35:00,748 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 13:35:00,749 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 13:35:00,749 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 13:35:00,749 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 13:35:00,749 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 13:35:00,750 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 13:35:00,750 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 13:35:00,750 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 13:35:00,751 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 13:35:00,751 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 13:35:00,751 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 13:35:00,751 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 13:35:00,751 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 13:35:00,752 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 13:35:00,752 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 13:35:00,752 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-13 13:35:00,752 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-13 13:35:00,752 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-13 13:35:00,752 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 13:35:00,753 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-13 13:35:00,753 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-13 13:35:00,753 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 13:35:00,753 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-13 13:35:00,753 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-13 13:35:00,753 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 13:35:00,754 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 13:35:00,754 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 13:35:00,754 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 13:35:00,754 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 13:35:00,754 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 13:35:00,754 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 13:35:00,755 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 13:35:00,755 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 13:35:00,755 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-13 13:35:00,755 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-13 13:35:00,755 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 13:35:00,755 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 13:35:00,755 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 13:35:00,755 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 13:35:00,755 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_3110b6f5-718f-4488-b2d0-892e5999e860/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 -> 40c6d23f476fb49e658cd83073483dddc1740bbd5f458e601d84fe47899d7237 [2024-11-13 13:35:01,091 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 13:35:01,102 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 13:35:01,105 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 13:35:01,108 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 13:35:01,109 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 13:35:01,111 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3110b6f5-718f-4488-b2d0-892e5999e860/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/pthread-wmm/safe005_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i Unable to find full path for "g++" [2024-11-13 13:35:03,297 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 13:35:03,709 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 13:35:03,710 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3110b6f5-718f-4488-b2d0-892e5999e860/sv-benchmarks/c/pthread-wmm/safe005_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-11-13 13:35:03,726 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3110b6f5-718f-4488-b2d0-892e5999e860/bin/uautomizer-verify-qhAvR1uOyd/data/c653ad6fd/8462ed7a840e49f892cf8cc01846b71d/FLAG9aee4e5b0 [2024-11-13 13:35:03,755 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3110b6f5-718f-4488-b2d0-892e5999e860/bin/uautomizer-verify-qhAvR1uOyd/data/c653ad6fd/8462ed7a840e49f892cf8cc01846b71d [2024-11-13 13:35:03,760 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 13:35:03,762 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 13:35:03,764 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 13:35:03,764 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 13:35:03,770 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 13:35:03,771 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 01:35:03" (1/1) ... [2024-11-13 13:35:03,772 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@153444fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:35:03, skipping insertion in model container [2024-11-13 13:35:03,773 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 01:35:03" (1/1) ... [2024-11-13 13:35:03,840 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 13:35:04,380 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 13:35:04,397 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 13:35:04,483 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 13:35:04,534 INFO L204 MainTranslator]: Completed translation [2024-11-13 13:35:04,534 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:35:04 WrapperNode [2024-11-13 13:35:04,535 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 13:35:04,536 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 13:35:04,537 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 13:35:04,537 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 13:35:04,545 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:35:04" (1/1) ... [2024-11-13 13:35:04,564 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:35:04" (1/1) ... [2024-11-13 13:35:04,591 INFO L138 Inliner]: procedures = 176, calls = 45, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 120 [2024-11-13 13:35:04,592 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 13:35:04,593 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 13:35:04,593 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 13:35:04,593 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 13:35:04,604 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:35:04" (1/1) ... [2024-11-13 13:35:04,604 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:35:04" (1/1) ... [2024-11-13 13:35:04,608 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:35:04" (1/1) ... [2024-11-13 13:35:04,633 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 13:35:04,633 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:35:04" (1/1) ... [2024-11-13 13:35:04,633 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:35:04" (1/1) ... [2024-11-13 13:35:04,645 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:35:04" (1/1) ... [2024-11-13 13:35:04,647 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:35:04" (1/1) ... [2024-11-13 13:35:04,650 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:35:04" (1/1) ... [2024-11-13 13:35:04,652 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:35:04" (1/1) ... [2024-11-13 13:35:04,656 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 13:35:04,657 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 13:35:04,657 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 13:35:04,657 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 13:35:04,659 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:35:04" (1/1) ... [2024-11-13 13:35:04,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 13:35:04,692 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3110b6f5-718f-4488-b2d0-892e5999e860/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:35:04,707 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3110b6f5-718f-4488-b2d0-892e5999e860/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 13:35:04,710 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3110b6f5-718f-4488-b2d0-892e5999e860/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 13:35:04,740 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-13 13:35:04,740 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 13:35:04,740 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-13 13:35:04,741 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-13 13:35:04,741 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-13 13:35:04,741 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-13 13:35:04,741 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-13 13:35:04,741 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-11-13 13:35:04,741 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-11-13 13:35:04,742 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-13 13:35:04,742 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 13:35:04,742 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 13:35:04,745 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 13:35:04,961 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 13:35:04,963 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 13:35:05,517 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-13 13:35:05,517 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 13:35:05,904 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 13:35:05,905 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-13 13:35:05,905 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 01:35:05 BoogieIcfgContainer [2024-11-13 13:35:05,905 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 13:35:05,910 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 13:35:05,911 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 13:35:05,916 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 13:35:05,916 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 01:35:03" (1/3) ... [2024-11-13 13:35:05,917 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66107c12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 01:35:05, skipping insertion in model container [2024-11-13 13:35:05,917 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:35:04" (2/3) ... [2024-11-13 13:35:05,919 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66107c12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 01:35:05, skipping insertion in model container [2024-11-13 13:35:05,919 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 01:35:05" (3/3) ... [2024-11-13 13:35:05,922 INFO L112 eAbstractionObserver]: Analyzing ICFG safe005_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-11-13 13:35:05,940 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 13:35:05,942 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG safe005_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i that has 4 procedures, 44 locations, 1 initial locations, 0 loop locations, and 3 error locations. [2024-11-13 13:35:05,942 INFO L492 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-13 13:35:06,039 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-13 13:35:06,095 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 45 transitions, 102 flow [2024-11-13 13:35:06,166 INFO L124 PetriNetUnfolderBase]: 2/42 cut-off events. [2024-11-13 13:35:06,169 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-13 13:35:06,174 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52 conditions, 42 events. 2/42 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 82 event pairs, 0 based on Foata normal form. 0/37 useless extension candidates. Maximal degree in co-relation 44. Up to 2 conditions per place. [2024-11-13 13:35:06,176 INFO L82 GeneralOperation]: Start removeDead. Operand has 53 places, 45 transitions, 102 flow [2024-11-13 13:35:06,182 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 50 places, 42 transitions, 93 flow [2024-11-13 13:35:06,197 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 13:35:06,222 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;@2a1ce761, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 13:35:06,223 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-11-13 13:35:06,232 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-13 13:35:06,234 INFO L124 PetriNetUnfolderBase]: 0/10 cut-off events. [2024-11-13 13:35:06,234 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-13 13:35:06,234 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 13:35:06,235 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-13 13:35:06,236 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-13 13:35:06,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:35:06,243 INFO L85 PathProgramCache]: Analyzing trace with hash -1499687794, now seen corresponding path program 1 times [2024-11-13 13:35:06,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 13:35:06,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [13681586] [2024-11-13 13:35:06,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:35:06,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:35:06,262 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3110b6f5-718f-4488-b2d0-892e5999e860/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:35:06,265 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3110b6f5-718f-4488-b2d0-892e5999e860/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:35:06,267 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3110b6f5-718f-4488-b2d0-892e5999e860/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-13 13:35:06,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:35:06,449 INFO L255 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-13 13:35:06,454 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:35:06,510 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 13:35:06,511 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 13:35:06,512 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 13:35:06,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [13681586] [2024-11-13 13:35:06,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [13681586] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:35:06,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:35:06,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-13 13:35:06,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467054094] [2024-11-13 13:35:06,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:35:06,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 13:35:06,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 13:35:06,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 13:35:06,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 13:35:06,564 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 45 [2024-11-13 13:35:06,569 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 42 transitions, 93 flow. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 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 13:35:06,570 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 13:35:06,570 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 45 [2024-11-13 13:35:06,571 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 13:35:07,230 INFO L124 PetriNetUnfolderBase]: 603/1152 cut-off events. [2024-11-13 13:35:07,231 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2024-11-13 13:35:07,239 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2111 conditions, 1152 events. 603/1152 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 7359 event pairs, 96 based on Foata normal form. 72/1208 useless extension candidates. Maximal degree in co-relation 2100. Up to 742 conditions per place. [2024-11-13 13:35:07,257 INFO L140 encePairwiseOnDemand]: 40/45 looper letters, 29 selfloop transitions, 2 changer transitions 2/51 dead transitions. [2024-11-13 13:35:07,258 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 51 transitions, 180 flow [2024-11-13 13:35:07,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 13:35:07,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-13 13:35:07,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 101 transitions. [2024-11-13 13:35:07,284 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7481481481481481 [2024-11-13 13:35:07,286 INFO L175 Difference]: Start difference. First operand has 50 places, 42 transitions, 93 flow. Second operand 3 states and 101 transitions. [2024-11-13 13:35:07,288 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 51 transitions, 180 flow [2024-11-13 13:35:07,296 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 51 transitions, 176 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-13 13:35:07,302 INFO L231 Difference]: Finished difference. Result has 47 places, 37 transitions, 84 flow [2024-11-13 13:35:07,306 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=84, PETRI_PLACES=47, PETRI_TRANSITIONS=37} [2024-11-13 13:35:07,314 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, -3 predicate places. [2024-11-13 13:35:07,316 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 37 transitions, 84 flow [2024-11-13 13:35:07,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 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 13:35:07,317 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 13:35:07,317 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:35:07,344 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3110b6f5-718f-4488-b2d0-892e5999e860/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-13 13:35:07,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3110b6f5-718f-4488-b2d0-892e5999e860/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:35:07,518 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-13 13:35:07,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:35:07,519 INFO L85 PathProgramCache]: Analyzing trace with hash -1243164851, now seen corresponding path program 1 times [2024-11-13 13:35:07,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 13:35:07,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1074007599] [2024-11-13 13:35:07,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:35:07,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:35:07,520 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3110b6f5-718f-4488-b2d0-892e5999e860/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:35:07,524 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3110b6f5-718f-4488-b2d0-892e5999e860/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:35:07,526 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3110b6f5-718f-4488-b2d0-892e5999e860/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-13 13:35:07,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:35:07,637 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-13 13:35:07,638 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:35:07,676 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 13:35:07,676 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 13:35:07,677 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 13:35:07,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1074007599] [2024-11-13 13:35:07,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1074007599] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:35:07,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:35:07,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-13 13:35:07,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761341753] [2024-11-13 13:35:07,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:35:07,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 13:35:07,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 13:35:07,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 13:35:07,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 13:35:07,682 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 45 [2024-11-13 13:35:07,682 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 37 transitions, 84 flow. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 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 13:35:07,682 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 13:35:07,682 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 45 [2024-11-13 13:35:07,683 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 13:35:07,951 INFO L124 PetriNetUnfolderBase]: 528/1053 cut-off events. [2024-11-13 13:35:07,951 INFO L125 PetriNetUnfolderBase]: For 69/69 co-relation queries the response was YES. [2024-11-13 13:35:07,954 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1969 conditions, 1053 events. 528/1053 cut-off events. For 69/69 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 6950 event pairs, 528 based on Foata normal form. 36/1043 useless extension candidates. Maximal degree in co-relation 1959. Up to 811 conditions per place. [2024-11-13 13:35:07,959 INFO L140 encePairwiseOnDemand]: 43/45 looper letters, 17 selfloop transitions, 1 changer transitions 1/36 dead transitions. [2024-11-13 13:35:07,959 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 36 transitions, 120 flow [2024-11-13 13:35:07,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 13:35:07,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-13 13:35:07,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 80 transitions. [2024-11-13 13:35:07,961 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5925925925925926 [2024-11-13 13:35:07,961 INFO L175 Difference]: Start difference. First operand has 47 places, 37 transitions, 84 flow. Second operand 3 states and 80 transitions. [2024-11-13 13:35:07,961 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 36 transitions, 120 flow [2024-11-13 13:35:07,962 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 36 transitions, 116 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-13 13:35:07,963 INFO L231 Difference]: Finished difference. Result has 45 places, 35 transitions, 78 flow [2024-11-13 13:35:07,963 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=78, PETRI_PLACES=45, PETRI_TRANSITIONS=35} [2024-11-13 13:35:07,964 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, -5 predicate places. [2024-11-13 13:35:07,964 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 35 transitions, 78 flow [2024-11-13 13:35:07,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 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 13:35:07,964 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 13:35:07,964 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:35:07,986 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3110b6f5-718f-4488-b2d0-892e5999e860/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-13 13:35:08,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3110b6f5-718f-4488-b2d0-892e5999e860/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:35:08,166 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-13 13:35:08,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:35:08,167 INFO L85 PathProgramCache]: Analyzing trace with hash -1243164900, now seen corresponding path program 1 times [2024-11-13 13:35:08,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 13:35:08,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1373953518] [2024-11-13 13:35:08,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:35:08,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:35:08,168 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3110b6f5-718f-4488-b2d0-892e5999e860/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:35:08,170 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3110b6f5-718f-4488-b2d0-892e5999e860/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:35:08,173 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3110b6f5-718f-4488-b2d0-892e5999e860/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-13 13:35:08,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:35:08,319 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-13 13:35:08,323 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:35:08,395 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 13:35:08,395 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 13:35:08,397 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 13:35:08,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1373953518] [2024-11-13 13:35:08,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1373953518] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:35:08,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:35:08,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 13:35:08,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258976691] [2024-11-13 13:35:08,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:35:08,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 13:35:08,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 13:35:08,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 13:35:08,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 13:35:08,421 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 45 [2024-11-13 13:35:08,421 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 35 transitions, 78 flow. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:35:08,421 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 13:35:08,421 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 45 [2024-11-13 13:35:08,421 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 13:35:08,965 INFO L124 PetriNetUnfolderBase]: 1213/2140 cut-off events. [2024-11-13 13:35:08,965 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-13 13:35:08,971 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4036 conditions, 2140 events. 1213/2140 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 13594 event pairs, 147 based on Foata normal form. 80/2187 useless extension candidates. Maximal degree in co-relation 4030. Up to 1081 conditions per place. [2024-11-13 13:35:08,983 INFO L140 encePairwiseOnDemand]: 39/45 looper letters, 39 selfloop transitions, 5 changer transitions 1/58 dead transitions. [2024-11-13 13:35:08,983 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 58 transitions, 218 flow [2024-11-13 13:35:08,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 13:35:08,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-13 13:35:08,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 115 transitions. [2024-11-13 13:35:08,985 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6388888888888888 [2024-11-13 13:35:08,985 INFO L175 Difference]: Start difference. First operand has 45 places, 35 transitions, 78 flow. Second operand 4 states and 115 transitions. [2024-11-13 13:35:08,985 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 58 transitions, 218 flow [2024-11-13 13:35:08,986 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 58 transitions, 217 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-13 13:35:08,991 INFO L231 Difference]: Finished difference. Result has 48 places, 38 transitions, 111 flow [2024-11-13 13:35:08,991 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=77, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=111, PETRI_PLACES=48, PETRI_TRANSITIONS=38} [2024-11-13 13:35:08,992 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, -2 predicate places. [2024-11-13 13:35:08,992 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 38 transitions, 111 flow [2024-11-13 13:35:08,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:35:08,992 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 13:35:08,993 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] [2024-11-13 13:35:09,015 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3110b6f5-718f-4488-b2d0-892e5999e860/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-13 13:35:09,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3110b6f5-718f-4488-b2d0-892e5999e860/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:35:09,197 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-13 13:35:09,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:35:09,198 INFO L85 PathProgramCache]: Analyzing trace with hash -571574532, now seen corresponding path program 1 times [2024-11-13 13:35:09,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 13:35:09,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [688798687] [2024-11-13 13:35:09,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:35:09,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:35:09,201 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3110b6f5-718f-4488-b2d0-892e5999e860/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:35:09,203 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3110b6f5-718f-4488-b2d0-892e5999e860/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:35:09,206 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3110b6f5-718f-4488-b2d0-892e5999e860/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-13 13:35:09,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:35:09,353 INFO L255 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-13 13:35:09,355 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:35:09,440 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 13:35:09,442 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 13:35:09,442 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 13:35:09,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [688798687] [2024-11-13 13:35:09,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [688798687] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:35:09,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:35:09,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 13:35:09,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260353006] [2024-11-13 13:35:09,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:35:09,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 13:35:09,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 13:35:09,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 13:35:09,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 13:35:09,459 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 45 [2024-11-13 13:35:09,460 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 38 transitions, 111 flow. Second operand has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:35:09,460 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 13:35:09,460 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 45 [2024-11-13 13:35:09,461 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 13:35:10,022 INFO L124 PetriNetUnfolderBase]: 809/1436 cut-off events. [2024-11-13 13:35:10,023 INFO L125 PetriNetUnfolderBase]: For 366/366 co-relation queries the response was YES. [2024-11-13 13:35:10,026 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3243 conditions, 1436 events. 809/1436 cut-off events. For 366/366 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 8040 event pairs, 73 based on Foata normal form. 68/1478 useless extension candidates. Maximal degree in co-relation 3234. Up to 521 conditions per place. [2024-11-13 13:35:10,032 INFO L140 encePairwiseOnDemand]: 39/45 looper letters, 49 selfloop transitions, 8 changer transitions 1/71 dead transitions. [2024-11-13 13:35:10,032 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 71 transitions, 314 flow [2024-11-13 13:35:10,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 13:35:10,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-13 13:35:10,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 145 transitions. [2024-11-13 13:35:10,034 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6444444444444445 [2024-11-13 13:35:10,034 INFO L175 Difference]: Start difference. First operand has 48 places, 38 transitions, 111 flow. Second operand 5 states and 145 transitions. [2024-11-13 13:35:10,034 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 71 transitions, 314 flow [2024-11-13 13:35:10,037 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 71 transitions, 304 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-11-13 13:35:10,038 INFO L231 Difference]: Finished difference. Result has 52 places, 41 transitions, 151 flow [2024-11-13 13:35:10,038 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=103, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=151, PETRI_PLACES=52, PETRI_TRANSITIONS=41} [2024-11-13 13:35:10,039 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 2 predicate places. [2024-11-13 13:35:10,039 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 41 transitions, 151 flow [2024-11-13 13:35:10,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:35:10,040 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 13:35:10,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, 1, 1, 1, 1, 1, 1] [2024-11-13 13:35:10,067 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3110b6f5-718f-4488-b2d0-892e5999e860/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-13 13:35:10,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3110b6f5-718f-4488-b2d0-892e5999e860/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:35:10,242 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-13 13:35:10,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:35:10,243 INFO L85 PathProgramCache]: Analyzing trace with hash 1468163773, now seen corresponding path program 1 times [2024-11-13 13:35:10,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 13:35:10,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [886564124] [2024-11-13 13:35:10,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:35:10,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:35:10,245 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3110b6f5-718f-4488-b2d0-892e5999e860/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:35:10,247 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3110b6f5-718f-4488-b2d0-892e5999e860/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:35:10,250 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3110b6f5-718f-4488-b2d0-892e5999e860/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-13 13:35:10,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:35:10,398 INFO L255 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-13 13:35:10,400 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:35:10,514 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 13:35:10,517 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 13:35:10,517 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 13:35:10,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [886564124] [2024-11-13 13:35:10,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [886564124] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:35:10,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:35:10,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 13:35:10,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219437174] [2024-11-13 13:35:10,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:35:10,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 13:35:10,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 13:35:10,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 13:35:10,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-13 13:35:10,533 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 45 [2024-11-13 13:35:10,535 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 41 transitions, 151 flow. Second operand has 6 states, 6 states have (on average 19.833333333333332) internal successors, (119), 6 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:35:10,535 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 13:35:10,535 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 45 [2024-11-13 13:35:10,535 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 13:35:10,980 INFO L124 PetriNetUnfolderBase]: 477/820 cut-off events. [2024-11-13 13:35:10,981 INFO L125 PetriNetUnfolderBase]: For 680/680 co-relation queries the response was YES. [2024-11-13 13:35:10,984 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2133 conditions, 820 events. 477/820 cut-off events. For 680/680 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 3781 event pairs, 59 based on Foata normal form. 36/832 useless extension candidates. Maximal degree in co-relation 2122. Up to 268 conditions per place. [2024-11-13 13:35:10,988 INFO L140 encePairwiseOnDemand]: 39/45 looper letters, 43 selfloop transitions, 11 changer transitions 1/68 dead transitions. [2024-11-13 13:35:10,989 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 68 transitions, 325 flow [2024-11-13 13:35:10,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 13:35:10,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-13 13:35:10,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 159 transitions. [2024-11-13 13:35:10,990 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5888888888888889 [2024-11-13 13:35:10,991 INFO L175 Difference]: Start difference. First operand has 52 places, 41 transitions, 151 flow. Second operand 6 states and 159 transitions. [2024-11-13 13:35:10,991 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 68 transitions, 325 flow [2024-11-13 13:35:10,999 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 68 transitions, 300 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-11-13 13:35:11,001 INFO L231 Difference]: Finished difference. Result has 55 places, 41 transitions, 165 flow [2024-11-13 13:35:11,002 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=129, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=165, PETRI_PLACES=55, PETRI_TRANSITIONS=41} [2024-11-13 13:35:11,003 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 5 predicate places. [2024-11-13 13:35:11,003 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 41 transitions, 165 flow [2024-11-13 13:35:11,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.833333333333332) internal successors, (119), 6 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:35:11,005 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 13:35:11,005 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] [2024-11-13 13:35:11,028 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3110b6f5-718f-4488-b2d0-892e5999e860/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-13 13:35:11,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3110b6f5-718f-4488-b2d0-892e5999e860/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:35:11,206 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-13 13:35:11,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:35:11,207 INFO L85 PathProgramCache]: Analyzing trace with hash -1919173412, now seen corresponding path program 1 times [2024-11-13 13:35:11,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 13:35:11,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1658731350] [2024-11-13 13:35:11,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:35:11,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:35:11,209 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3110b6f5-718f-4488-b2d0-892e5999e860/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:35:11,211 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3110b6f5-718f-4488-b2d0-892e5999e860/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:35:11,213 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3110b6f5-718f-4488-b2d0-892e5999e860/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-13 13:35:11,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:35:11,344 INFO L255 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-13 13:35:11,347 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:35:11,523 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 13:35:11,523 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 13:35:11,523 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 13:35:11,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1658731350] [2024-11-13 13:35:11,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1658731350] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:35:11,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:35:11,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 13:35:11,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472003705] [2024-11-13 13:35:11,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:35:11,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 13:35:11,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 13:35:11,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 13:35:11,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-13 13:35:11,568 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 45 [2024-11-13 13:35:11,568 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 41 transitions, 165 flow. Second operand has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 6 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:35:11,568 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 13:35:11,568 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 45 [2024-11-13 13:35:11,569 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 13:35:11,980 INFO L124 PetriNetUnfolderBase]: 611/1146 cut-off events. [2024-11-13 13:35:11,980 INFO L125 PetriNetUnfolderBase]: For 424/446 co-relation queries the response was YES. [2024-11-13 13:35:11,985 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2625 conditions, 1146 events. 611/1146 cut-off events. For 424/446 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 6148 event pairs, 284 based on Foata normal form. 8/1078 useless extension candidates. Maximal degree in co-relation 2613. Up to 551 conditions per place. [2024-11-13 13:35:11,989 INFO L140 encePairwiseOnDemand]: 39/45 looper letters, 27 selfloop transitions, 2 changer transitions 17/65 dead transitions. [2024-11-13 13:35:11,989 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 65 transitions, 319 flow [2024-11-13 13:35:11,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 13:35:11,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-13 13:35:11,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 149 transitions. [2024-11-13 13:35:11,991 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5518518518518518 [2024-11-13 13:35:11,991 INFO L175 Difference]: Start difference. First operand has 55 places, 41 transitions, 165 flow. Second operand 6 states and 149 transitions. [2024-11-13 13:35:11,991 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 65 transitions, 319 flow [2024-11-13 13:35:11,996 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 65 transitions, 252 flow, removed 14 selfloop flow, removed 8 redundant places. [2024-11-13 13:35:11,998 INFO L231 Difference]: Finished difference. Result has 56 places, 41 transitions, 123 flow [2024-11-13 13:35:11,998 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=109, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=123, PETRI_PLACES=56, PETRI_TRANSITIONS=41} [2024-11-13 13:35:11,999 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 6 predicate places. [2024-11-13 13:35:11,999 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 41 transitions, 123 flow [2024-11-13 13:35:11,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 6 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:35:11,999 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 13:35:12,000 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] [2024-11-13 13:35:12,025 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3110b6f5-718f-4488-b2d0-892e5999e860/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-13 13:35:12,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3110b6f5-718f-4488-b2d0-892e5999e860/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:35:12,205 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-13 13:35:12,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:35:12,205 INFO L85 PathProgramCache]: Analyzing trace with hash 261478274, now seen corresponding path program 2 times [2024-11-13 13:35:12,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 13:35:12,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1536391373] [2024-11-13 13:35:12,206 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-13 13:35:12,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:35:12,206 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3110b6f5-718f-4488-b2d0-892e5999e860/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:35:12,209 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3110b6f5-718f-4488-b2d0-892e5999e860/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:35:12,211 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3110b6f5-718f-4488-b2d0-892e5999e860/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-13 13:35:12,332 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-13 13:35:12,333 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 13:35:12,335 INFO L255 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-13 13:35:12,337 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:35:12,629 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 13:35:12,629 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 13:35:12,629 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 13:35:12,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1536391373] [2024-11-13 13:35:12,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1536391373] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:35:12,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:35:12,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-13 13:35:12,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214339705] [2024-11-13 13:35:12,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:35:12,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-13 13:35:12,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 13:35:12,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-13 13:35:12,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-13 13:35:12,686 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 45 [2024-11-13 13:35:12,686 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 41 transitions, 123 flow. Second operand has 8 states, 8 states have (on average 15.875) internal successors, (127), 8 states have internal predecessors, (127), 0 states have call successors, (0), 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 13:35:12,686 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 13:35:12,686 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 45 [2024-11-13 13:35:12,687 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 13:35:13,239 INFO L124 PetriNetUnfolderBase]: 883/1484 cut-off events. [2024-11-13 13:35:13,239 INFO L125 PetriNetUnfolderBase]: For 270/270 co-relation queries the response was YES. [2024-11-13 13:35:13,243 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3431 conditions, 1484 events. 883/1484 cut-off events. For 270/270 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 7060 event pairs, 155 based on Foata normal form. 8/1472 useless extension candidates. Maximal degree in co-relation 3420. Up to 614 conditions per place. [2024-11-13 13:35:13,247 INFO L140 encePairwiseOnDemand]: 36/45 looper letters, 46 selfloop transitions, 6 changer transitions 24/85 dead transitions. [2024-11-13 13:35:13,247 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 85 transitions, 403 flow [2024-11-13 13:35:13,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 13:35:13,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-13 13:35:13,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 159 transitions. [2024-11-13 13:35:13,249 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5047619047619047 [2024-11-13 13:35:13,249 INFO L175 Difference]: Start difference. First operand has 56 places, 41 transitions, 123 flow. Second operand 7 states and 159 transitions. [2024-11-13 13:35:13,249 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 85 transitions, 403 flow [2024-11-13 13:35:13,251 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 85 transitions, 379 flow, removed 7 selfloop flow, removed 5 redundant places. [2024-11-13 13:35:13,255 INFO L231 Difference]: Finished difference. Result has 59 places, 44 transitions, 156 flow [2024-11-13 13:35:13,256 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=156, PETRI_PLACES=59, PETRI_TRANSITIONS=44} [2024-11-13 13:35:13,257 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 9 predicate places. [2024-11-13 13:35:13,258 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 44 transitions, 156 flow [2024-11-13 13:35:13,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 15.875) internal successors, (127), 8 states have internal predecessors, (127), 0 states have call successors, (0), 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 13:35:13,259 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 13:35:13,259 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] [2024-11-13 13:35:13,281 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3110b6f5-718f-4488-b2d0-892e5999e860/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-13 13:35:13,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3110b6f5-718f-4488-b2d0-892e5999e860/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:35:13,460 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-13 13:35:13,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:35:13,461 INFO L85 PathProgramCache]: Analyzing trace with hash 2040570006, now seen corresponding path program 3 times [2024-11-13 13:35:13,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 13:35:13,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1207529020] [2024-11-13 13:35:13,461 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-13 13:35:13,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:35:13,462 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3110b6f5-718f-4488-b2d0-892e5999e860/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:35:13,465 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3110b6f5-718f-4488-b2d0-892e5999e860/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:35:13,466 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3110b6f5-718f-4488-b2d0-892e5999e860/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-13 13:35:13,590 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-13 13:35:13,590 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 13:35:13,592 INFO L255 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-13 13:35:13,594 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:35:13,745 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 13:35:13,745 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 13:35:13,745 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 13:35:13,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1207529020] [2024-11-13 13:35:13,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1207529020] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:35:13,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:35:13,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-13 13:35:13,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757379610] [2024-11-13 13:35:13,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:35:13,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 13:35:13,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 13:35:13,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 13:35:13,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-13 13:35:13,783 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 45 [2024-11-13 13:35:13,783 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 44 transitions, 156 flow. Second operand has 7 states, 7 states have (on average 18.857142857142858) internal successors, (132), 7 states have internal predecessors, (132), 0 states have call successors, (0), 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 13:35:13,784 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 13:35:13,784 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 45 [2024-11-13 13:35:13,784 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 13:35:14,224 INFO L124 PetriNetUnfolderBase]: 544/1109 cut-off events. [2024-11-13 13:35:14,225 INFO L125 PetriNetUnfolderBase]: For 185/199 co-relation queries the response was YES. [2024-11-13 13:35:14,228 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2317 conditions, 1109 events. 544/1109 cut-off events. For 185/199 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 5915 event pairs, 98 based on Foata normal form. 12/1109 useless extension candidates. Maximal degree in co-relation 2304. Up to 422 conditions per place. [2024-11-13 13:35:14,231 INFO L140 encePairwiseOnDemand]: 39/45 looper letters, 28 selfloop transitions, 1 changer transitions 26/74 dead transitions. [2024-11-13 13:35:14,231 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 74 transitions, 337 flow [2024-11-13 13:35:14,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 13:35:14,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-13 13:35:14,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 165 transitions. [2024-11-13 13:35:14,232 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5238095238095238 [2024-11-13 13:35:14,233 INFO L175 Difference]: Start difference. First operand has 59 places, 44 transitions, 156 flow. Second operand 7 states and 165 transitions. [2024-11-13 13:35:14,233 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 74 transitions, 337 flow [2024-11-13 13:35:14,235 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 74 transitions, 312 flow, removed 6 selfloop flow, removed 6 redundant places. [2024-11-13 13:35:14,238 INFO L231 Difference]: Finished difference. Result has 62 places, 43 transitions, 146 flow [2024-11-13 13:35:14,239 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=146, PETRI_PLACES=62, PETRI_TRANSITIONS=43} [2024-11-13 13:35:14,240 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 12 predicate places. [2024-11-13 13:35:14,240 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 43 transitions, 146 flow [2024-11-13 13:35:14,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.857142857142858) internal successors, (132), 7 states have internal predecessors, (132), 0 states have call successors, (0), 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 13:35:14,242 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 13:35:14,243 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] [2024-11-13 13:35:14,266 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3110b6f5-718f-4488-b2d0-892e5999e860/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-13 13:35:14,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3110b6f5-718f-4488-b2d0-892e5999e860/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:35:14,447 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-13 13:35:14,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:35:14,448 INFO L85 PathProgramCache]: Analyzing trace with hash -834867108, now seen corresponding path program 4 times [2024-11-13 13:35:14,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 13:35:14,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1619702086] [2024-11-13 13:35:14,449 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-13 13:35:14,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:35:14,449 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3110b6f5-718f-4488-b2d0-892e5999e860/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:35:14,452 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3110b6f5-718f-4488-b2d0-892e5999e860/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:35:14,453 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3110b6f5-718f-4488-b2d0-892e5999e860/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-13 13:35:14,581 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-13 13:35:14,581 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 13:35:14,583 INFO L255 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-13 13:35:14,586 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:35:14,958 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 13:35:14,958 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 13:35:14,958 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 13:35:14,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1619702086] [2024-11-13 13:35:14,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1619702086] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:35:14,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:35:14,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-13 13:35:14,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805902077] [2024-11-13 13:35:14,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:35:14,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-13 13:35:14,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 13:35:14,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-13 13:35:14,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-13 13:35:14,982 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 45 [2024-11-13 13:35:14,983 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 43 transitions, 146 flow. Second operand has 9 states, 9 states have (on average 20.88888888888889) internal successors, (188), 9 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:35:14,983 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 13:35:14,983 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 45 [2024-11-13 13:35:14,983 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 13:35:15,570 INFO L124 PetriNetUnfolderBase]: 386/815 cut-off events. [2024-11-13 13:35:15,570 INFO L125 PetriNetUnfolderBase]: For 102/115 co-relation queries the response was YES. [2024-11-13 13:35:15,573 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1691 conditions, 815 events. 386/815 cut-off events. For 102/115 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 4122 event pairs, 176 based on Foata normal form. 12/791 useless extension candidates. Maximal degree in co-relation 1678. Up to 324 conditions per place. [2024-11-13 13:35:15,576 INFO L140 encePairwiseOnDemand]: 37/45 looper letters, 22 selfloop transitions, 3 changer transitions 31/77 dead transitions. [2024-11-13 13:35:15,576 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 77 transitions, 335 flow [2024-11-13 13:35:15,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-13 13:35:15,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-13 13:35:15,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 207 transitions. [2024-11-13 13:35:15,578 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.575 [2024-11-13 13:35:15,578 INFO L175 Difference]: Start difference. First operand has 62 places, 43 transitions, 146 flow. Second operand 8 states and 207 transitions. [2024-11-13 13:35:15,579 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 77 transitions, 335 flow [2024-11-13 13:35:15,581 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 77 transitions, 320 flow, removed 7 selfloop flow, removed 5 redundant places. [2024-11-13 13:35:15,582 INFO L231 Difference]: Finished difference. Result has 66 places, 43 transitions, 154 flow [2024-11-13 13:35:15,583 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=137, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=154, PETRI_PLACES=66, PETRI_TRANSITIONS=43} [2024-11-13 13:35:15,584 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 16 predicate places. [2024-11-13 13:35:15,584 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 43 transitions, 154 flow [2024-11-13 13:35:15,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 20.88888888888889) internal successors, (188), 9 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:35:15,584 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 13:35:15,584 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] [2024-11-13 13:35:15,608 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3110b6f5-718f-4488-b2d0-892e5999e860/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-11-13 13:35:15,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3110b6f5-718f-4488-b2d0-892e5999e860/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:35:15,789 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-13 13:35:15,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:35:15,790 INFO L85 PathProgramCache]: Analyzing trace with hash -1110269900, now seen corresponding path program 5 times [2024-11-13 13:35:15,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 13:35:15,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [943048324] [2024-11-13 13:35:15,790 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-13 13:35:15,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:35:15,790 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3110b6f5-718f-4488-b2d0-892e5999e860/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:35:15,793 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3110b6f5-718f-4488-b2d0-892e5999e860/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:35:15,794 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3110b6f5-718f-4488-b2d0-892e5999e860/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-13 13:35:15,928 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-13 13:35:15,928 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 13:35:15,933 INFO L255 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-13 13:35:15,935 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:35:16,095 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 13:35:16,096 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 13:35:16,096 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 13:35:16,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [943048324] [2024-11-13 13:35:16,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [943048324] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:35:16,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:35:16,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-13 13:35:16,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821298969] [2024-11-13 13:35:16,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:35:16,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 13:35:16,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 13:35:16,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 13:35:16,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-13 13:35:16,146 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 45 [2024-11-13 13:35:16,147 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 43 transitions, 154 flow. Second operand has 7 states, 7 states have (on average 18.857142857142858) internal successors, (132), 7 states have internal predecessors, (132), 0 states have call successors, (0), 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 13:35:16,147 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 13:35:16,147 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 45 [2024-11-13 13:35:16,147 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 13:35:16,520 INFO L124 PetriNetUnfolderBase]: 434/836 cut-off events. [2024-11-13 13:35:16,520 INFO L125 PetriNetUnfolderBase]: For 279/295 co-relation queries the response was YES. [2024-11-13 13:35:16,523 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1928 conditions, 836 events. 434/836 cut-off events. For 279/295 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 4017 event pairs, 166 based on Foata normal form. 8/804 useless extension candidates. Maximal degree in co-relation 1913. Up to 350 conditions per place. [2024-11-13 13:35:16,525 INFO L140 encePairwiseOnDemand]: 39/45 looper letters, 29 selfloop transitions, 1 changer transitions 26/74 dead transitions. [2024-11-13 13:35:16,526 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 74 transitions, 356 flow [2024-11-13 13:35:16,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 13:35:16,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-13 13:35:16,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 165 transitions. [2024-11-13 13:35:16,528 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5238095238095238 [2024-11-13 13:35:16,528 INFO L175 Difference]: Start difference. First operand has 66 places, 43 transitions, 154 flow. Second operand 7 states and 165 transitions. [2024-11-13 13:35:16,528 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 74 transitions, 356 flow [2024-11-13 13:35:16,531 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 74 transitions, 332 flow, removed 9 selfloop flow, removed 6 redundant places. [2024-11-13 13:35:16,535 INFO L231 Difference]: Finished difference. Result has 65 places, 43 transitions, 154 flow [2024-11-13 13:35:16,536 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=141, PETRI_DIFFERENCE_MINUEND_PLACES=54, 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=7, PETRI_FLOW=154, PETRI_PLACES=65, PETRI_TRANSITIONS=43} [2024-11-13 13:35:16,537 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 15 predicate places. [2024-11-13 13:35:16,538 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 43 transitions, 154 flow [2024-11-13 13:35:16,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.857142857142858) internal successors, (132), 7 states have internal predecessors, (132), 0 states have call successors, (0), 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 13:35:16,538 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 13:35:16,538 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] [2024-11-13 13:35:16,562 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3110b6f5-718f-4488-b2d0-892e5999e860/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-13 13:35:16,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3110b6f5-718f-4488-b2d0-892e5999e860/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:35:16,739 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-13 13:35:16,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:35:16,739 INFO L85 PathProgramCache]: Analyzing trace with hash 1009842200, now seen corresponding path program 6 times [2024-11-13 13:35:16,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 13:35:16,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2056858602] [2024-11-13 13:35:16,740 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-13 13:35:16,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:35:16,740 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3110b6f5-718f-4488-b2d0-892e5999e860/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:35:16,743 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3110b6f5-718f-4488-b2d0-892e5999e860/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:35:16,746 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3110b6f5-718f-4488-b2d0-892e5999e860/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-13 13:35:16,877 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2024-11-13 13:35:16,877 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-13 13:35:16,877 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 13:35:16,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 13:35:16,985 INFO L130 FreeRefinementEngine]: Strategy FOX found a feasible trace [2024-11-13 13:35:16,985 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-13 13:35:16,986 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (6 of 7 remaining) [2024-11-13 13:35:16,988 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (5 of 7 remaining) [2024-11-13 13:35:16,988 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (4 of 7 remaining) [2024-11-13 13:35:16,989 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2024-11-13 13:35:16,989 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2024-11-13 13:35:16,989 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2024-11-13 13:35:16,989 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2024-11-13 13:35:17,013 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3110b6f5-718f-4488-b2d0-892e5999e860/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-13 13:35:17,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3110b6f5-718f-4488-b2d0-892e5999e860/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:35:17,190 INFO L407 BasicCegarLoop]: Path program histogram: [6, 1, 1, 1, 1, 1] [2024-11-13 13:35:17,263 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-13 13:35:17,263 INFO L173 ceAbstractionStarter]: Computing trace abstraction results [2024-11-13 13:35:17,269 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.11 01:35:17 BasicIcfg [2024-11-13 13:35:17,269 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-13 13:35:17,270 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-13 13:35:17,270 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-13 13:35:17,270 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-13 13:35:17,271 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 01:35:05" (3/4) ... [2024-11-13 13:35:17,273 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-13 13:35:17,274 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-13 13:35:17,275 INFO L158 Benchmark]: Toolchain (without parser) took 13513.81ms. Allocated memory was 83.9MB in the beginning and 226.5MB in the end (delta: 142.6MB). Free memory was 58.8MB in the beginning and 174.1MB in the end (delta: -115.2MB). Peak memory consumption was 24.8MB. Max. memory is 16.1GB. [2024-11-13 13:35:17,276 INFO L158 Benchmark]: CDTParser took 1.66ms. Allocated memory is still 83.9MB. Free memory is still 64.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 13:35:17,276 INFO L158 Benchmark]: CACSL2BoogieTranslator took 771.73ms. Allocated memory is still 83.9MB. Free memory was 58.8MB in the beginning and 35.7MB in the end (delta: 23.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-13 13:35:17,276 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.86ms. Allocated memory is still 83.9MB. Free memory was 35.7MB in the beginning and 33.6MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 13:35:17,277 INFO L158 Benchmark]: Boogie Preprocessor took 63.57ms. Allocated memory is still 83.9MB. Free memory was 33.3MB in the beginning and 30.6MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 13:35:17,277 INFO L158 Benchmark]: RCFGBuilder took 1248.09ms. Allocated memory is still 83.9MB. Free memory was 30.6MB in the beginning and 38.6MB in the end (delta: -8.0MB). Peak memory consumption was 29.0MB. Max. memory is 16.1GB. [2024-11-13 13:35:17,278 INFO L158 Benchmark]: TraceAbstraction took 11358.98ms. Allocated memory was 83.9MB in the beginning and 226.5MB in the end (delta: 142.6MB). Free memory was 38.1MB in the beginning and 176.5MB in the end (delta: -138.4MB). Peak memory consumption was 2.3MB. Max. memory is 16.1GB. [2024-11-13 13:35:17,278 INFO L158 Benchmark]: Witness Printer took 4.52ms. Allocated memory is still 226.5MB. Free memory was 174.1MB in the beginning and 174.1MB in the end (delta: 21.0kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 13:35:17,280 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.66ms. Allocated memory is still 83.9MB. Free memory is still 64.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 771.73ms. Allocated memory is still 83.9MB. Free memory was 58.8MB in the beginning and 35.7MB in the end (delta: 23.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.86ms. Allocated memory is still 83.9MB. Free memory was 35.7MB in the beginning and 33.6MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 63.57ms. Allocated memory is still 83.9MB. Free memory was 33.3MB in the beginning and 30.6MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 1248.09ms. Allocated memory is still 83.9MB. Free memory was 30.6MB in the beginning and 38.6MB in the end (delta: -8.0MB). Peak memory consumption was 29.0MB. Max. memory is 16.1GB. * TraceAbstraction took 11358.98ms. Allocated memory was 83.9MB in the beginning and 226.5MB in the end (delta: 142.6MB). Free memory was 38.1MB in the beginning and 176.5MB in the end (delta: -138.4MB). Peak memory consumption was 2.3MB. Max. memory is 16.1GB. * Witness Printer took 4.52ms. Allocated memory is still 226.5MB. Free memory was 174.1MB in the beginning and 174.1MB in the end (delta: 21.0kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p2_EBX = 0; [L717] 0 _Bool main$tmp_guard0; [L718] 0 _Bool main$tmp_guard1; [L720] 0 int x = 0; [L721] 0 _Bool x$flush_delayed; [L722] 0 int x$mem_tmp; [L723] 0 _Bool x$r_buff0_thd0; [L724] 0 _Bool x$r_buff0_thd1; [L725] 0 _Bool x$r_buff0_thd2; [L726] 0 _Bool x$r_buff0_thd3; [L727] 0 _Bool x$r_buff1_thd0; [L728] 0 _Bool x$r_buff1_thd1; [L729] 0 _Bool x$r_buff1_thd2; [L730] 0 _Bool x$r_buff1_thd3; [L731] 0 _Bool x$read_delayed; [L732] 0 int *x$read_delayed_var; [L733] 0 int x$w_buff0; [L734] 0 _Bool x$w_buff0_used; [L735] 0 int x$w_buff1; [L736] 0 _Bool x$w_buff1_used; [L738] 0 int y = 0; [L739] 0 _Bool weak$$choice0; [L740] 0 _Bool weak$$choice2; [L831] 0 pthread_t t1897; [L832] FCALL, FORK 0 pthread_create(&t1897, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1897=16777214, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L833] 0 pthread_t t1898; [L834] FCALL, FORK 0 pthread_create(&t1898, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1897=16777214, t1898=16777215, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L774] 2 x$w_buff1 = x$w_buff0 [L775] 2 x$w_buff0 = 1 [L776] 2 x$w_buff1_used = x$w_buff0_used [L777] 2 x$w_buff0_used = (_Bool)1 [L778] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L778] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L779] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L780] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L781] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L782] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L783] 2 x$r_buff0_thd2 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L835] 0 pthread_t t1899; [L836] FCALL, FORK 0 pthread_create(&t1899, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1897=16777214, t1898=16777215, t1899=16777216, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L786] 2 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L803] 3 __unbuffered_p2_EAX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L806] 3 __unbuffered_p2_EBX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L744] 1 y = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L749] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L750] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L751] 1 x$flush_delayed = weak$$choice2 [L752] 1 x$mem_tmp = x [L753] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L754] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L755] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L756] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L757] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L758] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L759] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L760] 1 __unbuffered_p0_EAX = x [L761] 1 x = x$flush_delayed ? x$mem_tmp : x [L762] 1 x$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L789] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L790] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L791] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L792] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L793] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L809] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L810] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L811] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L812] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L813] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L816] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L796] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L767] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L838] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1897=16777214, t1898=16777215, t1899=16777216, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L840] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L840] RET 0 assume_abort_if_not(main$tmp_guard0) [L842] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L843] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L844] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L845] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L846] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1897=16777214, t1898=16777215, t1899=16777216, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L849] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 1) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1897=16777214, t1898=16777215, t1899=16777216, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L851] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] CALL 0 reach_error() [L18] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L18] 0 __assert_fail ("0", "safe005_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 829]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 832]: 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: 834]: 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: 836]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 70 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 11.1s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 5.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 444 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 402 mSDsluCounter, 221 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 190 mSDsCounter, 20 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1385 IncrementalHoareTripleChecker+Invalid, 1405 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 20 mSolverCounterUnsat, 31 mSDtfsCounter, 1385 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 246 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=165occurred in iteration=5, InterpolantAutomatonStates: 56, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 267 NumberOfCodeBlocks, 266 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 226 ConstructedInterpolants, 0 QuantifiedInterpolants, 833 SizeOfPredicates, 36 NumberOfNonLiveVariables, 1023 ConjunctsInSsa, 72 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-13 13:35:17,318 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3110b6f5-718f-4488-b2d0-892e5999e860/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample