./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/weaver/bench-exp3x3-opt.wvr.c --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_7df1f1c0-d9c2-476d-b193-829ea1321e65/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7df1f1c0-d9c2-476d-b193-829ea1321e65/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_7df1f1c0-d9c2-476d-b193-829ea1321e65/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7df1f1c0-d9c2-476d-b193-829ea1321e65/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/weaver/bench-exp3x3-opt.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7df1f1c0-d9c2-476d-b193-829ea1321e65/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_7df1f1c0-d9c2-476d-b193-829ea1321e65/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 df63a9317cd159d15f0c87211084d5e90c66afa781f3187352107d14a3f61024 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 15:06:00,451 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 15:06:00,545 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7df1f1c0-d9c2-476d-b193-829ea1321e65/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-13 15:06:00,554 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 15:06:00,554 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 15:06:00,590 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 15:06:00,592 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 15:06:00,593 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 15:06:00,593 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 15:06:00,594 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 15:06:00,595 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 15:06:00,595 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 15:06:00,595 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 15:06:00,595 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 15:06:00,595 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 15:06:00,596 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 15:06:00,596 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 15:06:00,596 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 15:06:00,596 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 15:06:00,597 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 15:06:00,597 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-13 15:06:00,597 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-13 15:06:00,597 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-13 15:06:00,597 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 15:06:00,597 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-13 15:06:00,597 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 15:06:00,598 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-13 15:06:00,598 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 15:06:00,598 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 15:06:00,598 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 15:06:00,598 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 15:06:00,598 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 15:06:00,598 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 15:06:00,599 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 15:06:00,599 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 15:06:00,599 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 15:06:00,600 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-13 15:06:00,600 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 15:06:00,600 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 15:06:00,600 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 15:06:00,601 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 15:06:00,601 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 15:06:00,601 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_7df1f1c0-d9c2-476d-b193-829ea1321e65/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 -> df63a9317cd159d15f0c87211084d5e90c66afa781f3187352107d14a3f61024 [2024-11-13 15:06:00,995 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 15:06:01,005 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 15:06:01,008 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 15:06:01,009 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 15:06:01,009 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 15:06:01,011 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7df1f1c0-d9c2-476d-b193-829ea1321e65/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/weaver/bench-exp3x3-opt.wvr.c Unable to find full path for "g++" [2024-11-13 15:06:03,033 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 15:06:03,412 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 15:06:03,413 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7df1f1c0-d9c2-476d-b193-829ea1321e65/sv-benchmarks/c/weaver/bench-exp3x3-opt.wvr.c [2024-11-13 15:06:03,422 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7df1f1c0-d9c2-476d-b193-829ea1321e65/bin/uautomizer-verify-qhAvR1uOyd/data/ba193be7a/4f14f91d206f49acb57148443c73fe29/FLAG4eb675e45 [2024-11-13 15:06:03,444 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7df1f1c0-d9c2-476d-b193-829ea1321e65/bin/uautomizer-verify-qhAvR1uOyd/data/ba193be7a/4f14f91d206f49acb57148443c73fe29 [2024-11-13 15:06:03,447 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 15:06:03,448 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 15:06:03,450 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 15:06:03,451 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 15:06:03,456 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 15:06:03,457 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 03:06:03" (1/1) ... [2024-11-13 15:06:03,458 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6222804c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:06:03, skipping insertion in model container [2024-11-13 15:06:03,460 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 03:06:03" (1/1) ... [2024-11-13 15:06:03,481 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 15:06:03,753 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 15:06:03,768 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 15:06:03,810 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 15:06:03,838 INFO L204 MainTranslator]: Completed translation [2024-11-13 15:06:03,839 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:06:03 WrapperNode [2024-11-13 15:06:03,839 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 15:06:03,840 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 15:06:03,840 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 15:06:03,841 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 15:06:03,848 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:06:03" (1/1) ... [2024-11-13 15:06:03,861 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:06:03" (1/1) ... [2024-11-13 15:06:03,892 INFO L138 Inliner]: procedures = 24, calls = 15, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 97 [2024-11-13 15:06:03,892 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 15:06:03,893 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 15:06:03,894 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 15:06:03,894 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 15:06:03,905 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:06:03" (1/1) ... [2024-11-13 15:06:03,906 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:06:03" (1/1) ... [2024-11-13 15:06:03,910 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:06:03" (1/1) ... [2024-11-13 15:06:03,943 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-13 15:06:03,943 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:06:03" (1/1) ... [2024-11-13 15:06:03,944 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:06:03" (1/1) ... [2024-11-13 15:06:03,956 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:06:03" (1/1) ... [2024-11-13 15:06:03,963 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:06:03" (1/1) ... [2024-11-13 15:06:03,969 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:06:03" (1/1) ... [2024-11-13 15:06:03,970 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:06:03" (1/1) ... [2024-11-13 15:06:03,972 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 15:06:03,976 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 15:06:03,976 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 15:06:03,977 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 15:06:03,978 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:06:03" (1/1) ... [2024-11-13 15:06:03,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 15:06:04,008 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7df1f1c0-d9c2-476d-b193-829ea1321e65/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:06:04,023 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7df1f1c0-d9c2-476d-b193-829ea1321e65/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 15:06:04,031 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7df1f1c0-d9c2-476d-b193-829ea1321e65/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 15:06:04,065 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 15:06:04,065 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-13 15:06:04,065 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-13 15:06:04,065 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-13 15:06:04,066 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-13 15:06:04,066 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-11-13 15:06:04,066 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-11-13 15:06:04,066 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2024-11-13 15:06:04,066 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2024-11-13 15:06:04,066 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-13 15:06:04,066 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2024-11-13 15:06:04,066 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2024-11-13 15:06:04,067 INFO L130 BoogieDeclarations]: Found specification of procedure thread6 [2024-11-13 15:06:04,067 INFO L138 BoogieDeclarations]: Found implementation of procedure thread6 [2024-11-13 15:06:04,067 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 15:06:04,067 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 15:06:04,069 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-13 15:06:04,200 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 15:06:04,203 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 15:06:04,585 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-13 15:06:04,585 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 15:06:04,845 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 15:06:04,845 INFO L316 CfgBuilder]: Removed 6 assume(true) statements. [2024-11-13 15:06:04,845 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 03:06:04 BoogieIcfgContainer [2024-11-13 15:06:04,846 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 15:06:04,849 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 15:06:04,849 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 15:06:04,854 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 15:06:04,854 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 03:06:03" (1/3) ... [2024-11-13 15:06:04,855 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f963978 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 03:06:04, skipping insertion in model container [2024-11-13 15:06:04,855 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:06:03" (2/3) ... [2024-11-13 15:06:04,859 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f963978 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 03:06:04, skipping insertion in model container [2024-11-13 15:06:04,859 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 03:06:04" (3/3) ... [2024-11-13 15:06:04,860 INFO L112 eAbstractionObserver]: Analyzing ICFG bench-exp3x3-opt.wvr.c [2024-11-13 15:06:04,877 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 15:06:04,880 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG bench-exp3x3-opt.wvr.c that has 7 procedures, 43 locations, 1 initial locations, 6 loop locations, and 2 error locations. [2024-11-13 15:06:04,880 INFO L492 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-13 15:06:05,005 INFO L143 ThreadInstanceAdder]: Constructed 6 joinOtherThreadTransitions. [2024-11-13 15:06:05,068 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 61 places, 48 transitions, 138 flow [2024-11-13 15:06:05,120 INFO L124 PetriNetUnfolderBase]: 6/42 cut-off events. [2024-11-13 15:06:05,122 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-11-13 15:06:05,126 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67 conditions, 42 events. 6/42 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 34 event pairs, 0 based on Foata normal form. 0/34 useless extension candidates. Maximal degree in co-relation 39. Up to 2 conditions per place. [2024-11-13 15:06:05,126 INFO L82 GeneralOperation]: Start removeDead. Operand has 61 places, 48 transitions, 138 flow [2024-11-13 15:06:05,132 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 54 places, 41 transitions, 118 flow [2024-11-13 15:06:05,142 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 15:06:05,154 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;@2b465485, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 15:06:05,154 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-11-13 15:06:05,172 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-13 15:06:05,172 INFO L124 PetriNetUnfolderBase]: 6/38 cut-off events. [2024-11-13 15:06:05,172 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-11-13 15:06:05,172 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 15:06:05,173 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:06:05,173 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2024-11-13 15:06:05,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:06:05,178 INFO L85 PathProgramCache]: Analyzing trace with hash -16196425, now seen corresponding path program 1 times [2024-11-13 15:06:05,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:06:05,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892182613] [2024-11-13 15:06:05,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:06:05,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:06:05,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:06:05,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 15:06:05,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:06:05,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892182613] [2024-11-13 15:06:05,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892182613] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:06:05,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:06:05,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 15:06:05,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299218957] [2024-11-13 15:06:05,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:06:05,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 15:06:05,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:06:05,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 15:06:05,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 15:06:05,857 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 48 [2024-11-13 15:06:05,859 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 41 transitions, 118 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 15:06:05,860 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 15:06:05,860 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 48 [2024-11-13 15:06:05,861 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 15:06:09,541 INFO L124 PetriNetUnfolderBase]: 21719/25257 cut-off events. [2024-11-13 15:06:09,542 INFO L125 PetriNetUnfolderBase]: For 1331/1331 co-relation queries the response was YES. [2024-11-13 15:06:09,619 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51643 conditions, 25257 events. 21719/25257 cut-off events. For 1331/1331 co-relation queries the response was YES. Maximal size of possible extension queue 888. Compared 87976 event pairs, 3973 based on Foata normal form. 2/13832 useless extension candidates. Maximal degree in co-relation 44649. Up to 16365 conditions per place. [2024-11-13 15:06:09,765 INFO L140 encePairwiseOnDemand]: 43/48 looper letters, 49 selfloop transitions, 3 changer transitions 1/60 dead transitions. [2024-11-13 15:06:09,765 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 60 transitions, 283 flow [2024-11-13 15:06:09,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 15:06:09,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-13 15:06:09,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 97 transitions. [2024-11-13 15:06:09,784 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6736111111111112 [2024-11-13 15:06:09,786 INFO L175 Difference]: Start difference. First operand has 54 places, 41 transitions, 118 flow. Second operand 3 states and 97 transitions. [2024-11-13 15:06:09,789 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 60 transitions, 283 flow [2024-11-13 15:06:09,847 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 60 transitions, 245 flow, removed 0 selfloop flow, removed 12 redundant places. [2024-11-13 15:06:09,855 INFO L231 Difference]: Finished difference. Result has 43 places, 41 transitions, 109 flow [2024-11-13 15:06:09,859 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=109, PETRI_PLACES=43, PETRI_TRANSITIONS=41} [2024-11-13 15:06:09,867 INFO L277 CegarLoopForPetriNet]: 54 programPoint places, -11 predicate places. [2024-11-13 15:06:09,867 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 41 transitions, 109 flow [2024-11-13 15:06:09,867 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 15:06:09,868 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 15:06:09,868 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:06:09,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-13 15:06:09,868 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2024-11-13 15:06:09,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:06:09,869 INFO L85 PathProgramCache]: Analyzing trace with hash -672113289, now seen corresponding path program 1 times [2024-11-13 15:06:09,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:06:09,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914706942] [2024-11-13 15:06:09,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:06:09,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:06:09,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:06:10,227 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 15:06:10,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:06:10,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914706942] [2024-11-13 15:06:10,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914706942] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:06:10,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:06:10,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 15:06:10,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969173030] [2024-11-13 15:06:10,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:06:10,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 15:06:10,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:06:10,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 15:06:10,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 15:06:10,234 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 48 [2024-11-13 15:06:10,234 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 41 transitions, 109 flow. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:06:10,235 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 15:06:10,235 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 48 [2024-11-13 15:06:10,235 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 15:06:13,596 INFO L124 PetriNetUnfolderBase]: 27521/32101 cut-off events. [2024-11-13 15:06:13,597 INFO L125 PetriNetUnfolderBase]: For 4220/4220 co-relation queries the response was YES. [2024-11-13 15:06:13,658 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70084 conditions, 32101 events. 27521/32101 cut-off events. For 4220/4220 co-relation queries the response was YES. Maximal size of possible extension queue 1140. Compared 118156 event pairs, 4314 based on Foata normal form. 1/21691 useless extension candidates. Maximal degree in co-relation 22987. Up to 23265 conditions per place. [2024-11-13 15:06:13,787 INFO L140 encePairwiseOnDemand]: 44/48 looper letters, 55 selfloop transitions, 3 changer transitions 3/68 dead transitions. [2024-11-13 15:06:13,787 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 68 transitions, 304 flow [2024-11-13 15:06:13,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 15:06:13,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-13 15:06:13,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 100 transitions. [2024-11-13 15:06:13,789 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6944444444444444 [2024-11-13 15:06:13,790 INFO L175 Difference]: Start difference. First operand has 43 places, 41 transitions, 109 flow. Second operand 3 states and 100 transitions. [2024-11-13 15:06:13,790 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 68 transitions, 304 flow [2024-11-13 15:06:13,795 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 68 transitions, 299 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-13 15:06:13,797 INFO L231 Difference]: Finished difference. Result has 45 places, 43 transitions, 125 flow [2024-11-13 15:06:13,799 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=125, PETRI_PLACES=45, PETRI_TRANSITIONS=43} [2024-11-13 15:06:13,800 INFO L277 CegarLoopForPetriNet]: 54 programPoint places, -9 predicate places. [2024-11-13 15:06:13,800 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 43 transitions, 125 flow [2024-11-13 15:06:13,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:06:13,802 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 15:06:13,802 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:06:13,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-13 15:06:13,803 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2024-11-13 15:06:13,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:06:13,806 INFO L85 PathProgramCache]: Analyzing trace with hash -804338091, now seen corresponding path program 1 times [2024-11-13 15:06:13,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:06:13,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624926612] [2024-11-13 15:06:13,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:06:13,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:06:13,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:06:14,068 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 15:06:14,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:06:14,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624926612] [2024-11-13 15:06:14,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624926612] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:06:14,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:06:14,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 15:06:14,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885864039] [2024-11-13 15:06:14,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:06:14,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 15:06:14,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:06:14,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 15:06:14,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 15:06:14,071 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 48 [2024-11-13 15:06:14,071 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 43 transitions, 125 flow. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:06:14,071 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 15:06:14,071 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 48 [2024-11-13 15:06:14,071 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 15:06:17,281 INFO L124 PetriNetUnfolderBase]: 36409/42787 cut-off events. [2024-11-13 15:06:17,281 INFO L125 PetriNetUnfolderBase]: For 12454/12454 co-relation queries the response was YES. [2024-11-13 15:06:17,374 INFO L83 FinitePrefix]: Finished finitePrefix Result has 101000 conditions, 42787 events. 36409/42787 cut-off events. For 12454/12454 co-relation queries the response was YES. Maximal size of possible extension queue 1536. Compared 169825 event pairs, 6142 based on Foata normal form. 1/36347 useless extension candidates. Maximal degree in co-relation 33618. Up to 30366 conditions per place. [2024-11-13 15:06:17,570 INFO L140 encePairwiseOnDemand]: 44/48 looper letters, 61 selfloop transitions, 3 changer transitions 5/76 dead transitions. [2024-11-13 15:06:17,570 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 76 transitions, 358 flow [2024-11-13 15:06:17,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 15:06:17,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-13 15:06:17,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 104 transitions. [2024-11-13 15:06:17,574 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7222222222222222 [2024-11-13 15:06:17,574 INFO L175 Difference]: Start difference. First operand has 45 places, 43 transitions, 125 flow. Second operand 3 states and 104 transitions. [2024-11-13 15:06:17,574 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 76 transitions, 358 flow [2024-11-13 15:06:17,580 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 76 transitions, 353 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-13 15:06:17,581 INFO L231 Difference]: Finished difference. Result has 47 places, 45 transitions, 141 flow [2024-11-13 15:06:17,582 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=44, 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=3, PETRI_FLOW=141, PETRI_PLACES=47, PETRI_TRANSITIONS=45} [2024-11-13 15:06:17,583 INFO L277 CegarLoopForPetriNet]: 54 programPoint places, -7 predicate places. [2024-11-13 15:06:17,584 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 45 transitions, 141 flow [2024-11-13 15:06:17,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:06:17,584 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 15:06:17,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, 1, 1, 1, 1, 1] [2024-11-13 15:06:17,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-13 15:06:17,585 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2024-11-13 15:06:17,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:06:17,586 INFO L85 PathProgramCache]: Analyzing trace with hash 978261623, now seen corresponding path program 1 times [2024-11-13 15:06:17,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:06:17,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311021913] [2024-11-13 15:06:17,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:06:17,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:06:17,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:06:17,877 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 15:06:17,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:06:17,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311021913] [2024-11-13 15:06:17,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311021913] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:06:17,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:06:17,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 15:06:17,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833999919] [2024-11-13 15:06:17,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:06:17,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 15:06:17,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:06:17,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 15:06:17,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 15:06:17,882 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 48 [2024-11-13 15:06:17,882 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 45 transitions, 141 flow. Second operand has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:06:17,882 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 15:06:17,883 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 48 [2024-11-13 15:06:17,883 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 15:06:20,669 INFO L124 PetriNetUnfolderBase]: 36293/42562 cut-off events. [2024-11-13 15:06:20,669 INFO L125 PetriNetUnfolderBase]: For 16360/16360 co-relation queries the response was YES. [2024-11-13 15:06:20,751 INFO L83 FinitePrefix]: Finished finitePrefix Result has 106041 conditions, 42562 events. 36293/42562 cut-off events. For 16360/16360 co-relation queries the response was YES. Maximal size of possible extension queue 1529. Compared 167344 event pairs, 975 based on Foata normal form. 418/42926 useless extension candidates. Maximal degree in co-relation 35442. Up to 15423 conditions per place. [2024-11-13 15:06:20,919 INFO L140 encePairwiseOnDemand]: 43/48 looper letters, 106 selfloop transitions, 6 changer transitions 8/127 dead transitions. [2024-11-13 15:06:20,920 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 127 transitions, 619 flow [2024-11-13 15:06:20,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 15:06:20,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-13 15:06:20,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 175 transitions. [2024-11-13 15:06:20,922 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7291666666666666 [2024-11-13 15:06:20,922 INFO L175 Difference]: Start difference. First operand has 47 places, 45 transitions, 141 flow. Second operand 5 states and 175 transitions. [2024-11-13 15:06:20,922 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 127 transitions, 619 flow [2024-11-13 15:06:20,929 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 127 transitions, 615 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-13 15:06:20,931 INFO L231 Difference]: Finished difference. Result has 51 places, 47 transitions, 162 flow [2024-11-13 15:06:20,932 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=162, PETRI_PLACES=51, PETRI_TRANSITIONS=47} [2024-11-13 15:06:20,933 INFO L277 CegarLoopForPetriNet]: 54 programPoint places, -3 predicate places. [2024-11-13 15:06:20,934 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 47 transitions, 162 flow [2024-11-13 15:06:20,935 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:06:20,935 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 15:06:20,936 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:06:20,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-13 15:06:20,936 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2024-11-13 15:06:20,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:06:20,937 INFO L85 PathProgramCache]: Analyzing trace with hash -1065475414, now seen corresponding path program 1 times [2024-11-13 15:06:20,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:06:20,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512904126] [2024-11-13 15:06:20,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:06:20,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:06:20,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:06:21,171 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 15:06:21,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:06:21,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512904126] [2024-11-13 15:06:21,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512904126] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:06:21,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [357470727] [2024-11-13 15:06:21,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:06:21,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:06:21,172 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7df1f1c0-d9c2-476d-b193-829ea1321e65/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:06:21,175 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7df1f1c0-d9c2-476d-b193-829ea1321e65/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:06:21,180 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7df1f1c0-d9c2-476d-b193-829ea1321e65/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-13 15:06:21,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:06:21,324 INFO L255 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-13 15:06:21,329 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:06:21,511 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 15:06:21,511 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 15:06:21,650 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 15:06:21,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [357470727] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 15:06:21,651 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 15:06:21,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2024-11-13 15:06:21,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035178407] [2024-11-13 15:06:21,651 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 15:06:21,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 15:06:21,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:06:21,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 15:06:21,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-13 15:06:21,654 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 48 [2024-11-13 15:06:21,654 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 47 transitions, 162 flow. Second operand has 5 states, 5 states have (on average 21.2) internal successors, (106), 5 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 15:06:21,654 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 15:06:21,655 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 48 [2024-11-13 15:06:21,655 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 15:06:24,688 INFO L124 PetriNetUnfolderBase]: 37123/44080 cut-off events. [2024-11-13 15:06:24,688 INFO L125 PetriNetUnfolderBase]: For 26595/26595 co-relation queries the response was YES. [2024-11-13 15:06:24,750 INFO L83 FinitePrefix]: Finished finitePrefix Result has 118344 conditions, 44080 events. 37123/44080 cut-off events. For 26595/26595 co-relation queries the response was YES. Maximal size of possible extension queue 1610. Compared 183315 event pairs, 5052 based on Foata normal form. 941/44797 useless extension candidates. Maximal degree in co-relation 40003. Up to 21474 conditions per place. [2024-11-13 15:06:24,862 INFO L140 encePairwiseOnDemand]: 42/48 looper letters, 108 selfloop transitions, 6 changer transitions 7/128 dead transitions. [2024-11-13 15:06:24,862 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 128 transitions, 693 flow [2024-11-13 15:06:24,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 15:06:24,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-13 15:06:24,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 170 transitions. [2024-11-13 15:06:24,865 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7083333333333334 [2024-11-13 15:06:24,865 INFO L175 Difference]: Start difference. First operand has 51 places, 47 transitions, 162 flow. Second operand 5 states and 170 transitions. [2024-11-13 15:06:24,865 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 128 transitions, 693 flow [2024-11-13 15:06:24,870 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 128 transitions, 680 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-13 15:06:24,872 INFO L231 Difference]: Finished difference. Result has 56 places, 50 transitions, 195 flow [2024-11-13 15:06:24,872 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=195, PETRI_PLACES=56, PETRI_TRANSITIONS=50} [2024-11-13 15:06:24,873 INFO L277 CegarLoopForPetriNet]: 54 programPoint places, 2 predicate places. [2024-11-13 15:06:24,873 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 50 transitions, 195 flow [2024-11-13 15:06:24,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.2) internal successors, (106), 5 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 15:06:24,873 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 15:06:24,873 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:06:24,896 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7df1f1c0-d9c2-476d-b193-829ea1321e65/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-13 15:06:25,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7df1f1c0-d9c2-476d-b193-829ea1321e65/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:06:25,074 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2024-11-13 15:06:25,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:06:25,075 INFO L85 PathProgramCache]: Analyzing trace with hash -313101682, now seen corresponding path program 1 times [2024-11-13 15:06:25,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:06:25,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402708502] [2024-11-13 15:06:25,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:06:25,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:06:25,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:06:25,239 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 15:06:25,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:06:25,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402708502] [2024-11-13 15:06:25,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402708502] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:06:25,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:06:25,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 15:06:25,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449017114] [2024-11-13 15:06:25,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:06:25,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 15:06:25,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:06:25,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 15:06:25,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 15:06:25,242 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 48 [2024-11-13 15:06:25,243 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 50 transitions, 195 flow. Second operand has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:06:25,243 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 15:06:25,243 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 48 [2024-11-13 15:06:25,243 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 15:06:28,303 INFO L124 PetriNetUnfolderBase]: 36029/42952 cut-off events. [2024-11-13 15:06:28,303 INFO L125 PetriNetUnfolderBase]: For 43123/43141 co-relation queries the response was YES. [2024-11-13 15:06:28,370 INFO L83 FinitePrefix]: Finished finitePrefix Result has 129351 conditions, 42952 events. 36029/42952 cut-off events. For 43123/43141 co-relation queries the response was YES. Maximal size of possible extension queue 1593. Compared 183380 event pairs, 5097 based on Foata normal form. 1143/43437 useless extension candidates. Maximal degree in co-relation 56991. Up to 25585 conditions per place. [2024-11-13 15:06:28,645 INFO L140 encePairwiseOnDemand]: 43/48 looper letters, 118 selfloop transitions, 7 changer transitions 6/138 dead transitions. [2024-11-13 15:06:28,646 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 138 transitions, 793 flow [2024-11-13 15:06:28,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 15:06:28,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-13 15:06:28,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 174 transitions. [2024-11-13 15:06:28,647 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.725 [2024-11-13 15:06:28,648 INFO L175 Difference]: Start difference. First operand has 56 places, 50 transitions, 195 flow. Second operand 5 states and 174 transitions. [2024-11-13 15:06:28,648 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 138 transitions, 793 flow [2024-11-13 15:06:28,673 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 138 transitions, 776 flow, removed 4 selfloop flow, removed 1 redundant places. [2024-11-13 15:06:28,676 INFO L231 Difference]: Finished difference. Result has 61 places, 53 transitions, 229 flow [2024-11-13 15:06:28,677 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=229, PETRI_PLACES=61, PETRI_TRANSITIONS=53} [2024-11-13 15:06:28,677 INFO L277 CegarLoopForPetriNet]: 54 programPoint places, 7 predicate places. [2024-11-13 15:06:28,677 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 53 transitions, 229 flow [2024-11-13 15:06:28,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:06:28,678 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 15:06:28,678 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:06:28,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-13 15:06:28,678 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2024-11-13 15:06:28,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:06:28,678 INFO L85 PathProgramCache]: Analyzing trace with hash -653516819, now seen corresponding path program 1 times [2024-11-13 15:06:28,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:06:28,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255689258] [2024-11-13 15:06:28,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:06:28,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:06:28,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:06:28,939 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 15:06:28,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:06:28,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255689258] [2024-11-13 15:06:28,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255689258] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:06:28,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:06:28,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 15:06:28,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767147785] [2024-11-13 15:06:28,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:06:28,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 15:06:28,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:06:28,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 15:06:28,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 15:06:28,942 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 48 [2024-11-13 15:06:28,942 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 53 transitions, 229 flow. Second operand has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:06:28,942 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 15:06:28,942 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 48 [2024-11-13 15:06:28,943 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 15:06:32,392 INFO L124 PetriNetUnfolderBase]: 35571/42407 cut-off events. [2024-11-13 15:06:32,393 INFO L125 PetriNetUnfolderBase]: For 49770/49776 co-relation queries the response was YES. [2024-11-13 15:06:32,484 INFO L83 FinitePrefix]: Finished finitePrefix Result has 139112 conditions, 42407 events. 35571/42407 cut-off events. For 49770/49776 co-relation queries the response was YES. Maximal size of possible extension queue 1583. Compared 180274 event pairs, 1081 based on Foata normal form. 655/42999 useless extension candidates. Maximal degree in co-relation 68122. Up to 19299 conditions per place. [2024-11-13 15:06:32,568 INFO L140 encePairwiseOnDemand]: 43/48 looper letters, 93 selfloop transitions, 4 changer transitions 34/138 dead transitions. [2024-11-13 15:06:32,568 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 138 transitions, 806 flow [2024-11-13 15:06:32,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 15:06:32,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-13 15:06:32,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 171 transitions. [2024-11-13 15:06:32,570 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7125 [2024-11-13 15:06:32,570 INFO L175 Difference]: Start difference. First operand has 61 places, 53 transitions, 229 flow. Second operand 5 states and 171 transitions. [2024-11-13 15:06:32,570 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 138 transitions, 806 flow [2024-11-13 15:06:33,026 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 138 transitions, 801 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-11-13 15:06:33,027 INFO L231 Difference]: Finished difference. Result has 64 places, 51 transitions, 220 flow [2024-11-13 15:06:33,027 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=217, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=220, PETRI_PLACES=64, PETRI_TRANSITIONS=51} [2024-11-13 15:06:33,028 INFO L277 CegarLoopForPetriNet]: 54 programPoint places, 10 predicate places. [2024-11-13 15:06:33,028 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 51 transitions, 220 flow [2024-11-13 15:06:33,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:06:33,028 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 15:06:33,029 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:06:33,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-13 15:06:33,029 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2024-11-13 15:06:33,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:06:33,029 INFO L85 PathProgramCache]: Analyzing trace with hash -1279339181, now seen corresponding path program 2 times [2024-11-13 15:06:33,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:06:33,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503800294] [2024-11-13 15:06:33,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:06:33,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:06:33,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:06:33,153 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 15:06:33,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:06:33,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503800294] [2024-11-13 15:06:33,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503800294] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:06:33,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:06:33,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 15:06:33,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866980179] [2024-11-13 15:06:33,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:06:33,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 15:06:33,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:06:33,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 15:06:33,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 15:06:33,155 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 48 [2024-11-13 15:06:33,155 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 51 transitions, 220 flow. Second operand has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:06:33,155 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 15:06:33,156 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 48 [2024-11-13 15:06:33,157 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 15:06:35,675 INFO L124 PetriNetUnfolderBase]: 28207/33435 cut-off events. [2024-11-13 15:06:35,676 INFO L125 PetriNetUnfolderBase]: For 51206/51206 co-relation queries the response was YES. [2024-11-13 15:06:35,740 INFO L83 FinitePrefix]: Finished finitePrefix Result has 112940 conditions, 33435 events. 28207/33435 cut-off events. For 51206/51206 co-relation queries the response was YES. Maximal size of possible extension queue 1208. Compared 131711 event pairs, 665 based on Foata normal form. 366/33742 useless extension candidates. Maximal degree in co-relation 57753. Up to 13109 conditions per place. [2024-11-13 15:06:35,811 INFO L140 encePairwiseOnDemand]: 43/48 looper letters, 89 selfloop transitions, 4 changer transitions 34/134 dead transitions. [2024-11-13 15:06:35,812 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 134 transitions, 848 flow [2024-11-13 15:06:35,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 15:06:35,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-13 15:06:35,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 166 transitions. [2024-11-13 15:06:35,813 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6916666666666667 [2024-11-13 15:06:35,813 INFO L175 Difference]: Start difference. First operand has 64 places, 51 transitions, 220 flow. Second operand 5 states and 166 transitions. [2024-11-13 15:06:35,813 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 134 transitions, 848 flow [2024-11-13 15:06:36,141 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 134 transitions, 820 flow, removed 5 selfloop flow, removed 2 redundant places. [2024-11-13 15:06:36,142 INFO L231 Difference]: Finished difference. Result has 65 places, 51 transitions, 223 flow [2024-11-13 15:06:36,142 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=210, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=223, PETRI_PLACES=65, PETRI_TRANSITIONS=51} [2024-11-13 15:06:36,143 INFO L277 CegarLoopForPetriNet]: 54 programPoint places, 11 predicate places. [2024-11-13 15:06:36,143 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 51 transitions, 223 flow [2024-11-13 15:06:36,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:06:36,143 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 15:06:36,144 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:06:36,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-13 15:06:36,144 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2024-11-13 15:06:36,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:06:36,144 INFO L85 PathProgramCache]: Analyzing trace with hash 1736372173, now seen corresponding path program 3 times [2024-11-13 15:06:36,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:06:36,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772270628] [2024-11-13 15:06:36,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:06:36,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:06:36,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:06:36,286 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 15:06:36,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:06:36,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772270628] [2024-11-13 15:06:36,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772270628] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:06:36,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:06:36,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 15:06:36,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115832641] [2024-11-13 15:06:36,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:06:36,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 15:06:36,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:06:36,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 15:06:36,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 15:06:36,288 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 48 [2024-11-13 15:06:36,289 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 51 transitions, 223 flow. Second operand has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:06:36,289 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 15:06:36,289 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 48 [2024-11-13 15:06:36,289 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 15:06:37,798 INFO L124 PetriNetUnfolderBase]: 18417/21767 cut-off events. [2024-11-13 15:06:37,798 INFO L125 PetriNetUnfolderBase]: For 30098/30104 co-relation queries the response was YES. [2024-11-13 15:06:37,846 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75749 conditions, 21767 events. 18417/21767 cut-off events. For 30098/30104 co-relation queries the response was YES. Maximal size of possible extension queue 744. Compared 81845 event pairs, 770 based on Foata normal form. 629/22365 useless extension candidates. Maximal degree in co-relation 42074. Up to 16454 conditions per place. [2024-11-13 15:06:37,913 INFO L140 encePairwiseOnDemand]: 43/48 looper letters, 116 selfloop transitions, 6 changer transitions 0/129 dead transitions. [2024-11-13 15:06:37,913 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 129 transitions, 797 flow [2024-11-13 15:06:37,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 15:06:37,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-13 15:06:37,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 163 transitions. [2024-11-13 15:06:37,914 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6791666666666667 [2024-11-13 15:06:37,915 INFO L175 Difference]: Start difference. First operand has 65 places, 51 transitions, 223 flow. Second operand 5 states and 163 transitions. [2024-11-13 15:06:37,915 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 129 transitions, 797 flow [2024-11-13 15:06:37,999 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 129 transitions, 784 flow, removed 2 selfloop flow, removed 1 redundant places. [2024-11-13 15:06:38,000 INFO L231 Difference]: Finished difference. Result has 69 places, 54 transitions, 257 flow [2024-11-13 15:06:38,000 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=216, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=257, PETRI_PLACES=69, PETRI_TRANSITIONS=54} [2024-11-13 15:06:38,001 INFO L277 CegarLoopForPetriNet]: 54 programPoint places, 15 predicate places. [2024-11-13 15:06:38,001 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 54 transitions, 257 flow [2024-11-13 15:06:38,001 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:06:38,001 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 15:06:38,001 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:06:38,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-13 15:06:38,001 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2024-11-13 15:06:38,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:06:38,002 INFO L85 PathProgramCache]: Analyzing trace with hash 6066831, now seen corresponding path program 1 times [2024-11-13 15:06:38,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:06:38,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190801263] [2024-11-13 15:06:38,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:06:38,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:06:38,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:06:38,194 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 15:06:38,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:06:38,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190801263] [2024-11-13 15:06:38,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190801263] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:06:38,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:06:38,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 15:06:38,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577150890] [2024-11-13 15:06:38,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:06:38,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 15:06:38,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:06:38,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 15:06:38,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 15:06:38,196 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 48 [2024-11-13 15:06:38,197 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 54 transitions, 257 flow. Second operand has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:06:38,197 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 15:06:38,197 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 48 [2024-11-13 15:06:38,197 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 15:06:39,660 INFO L124 PetriNetUnfolderBase]: 17711/21075 cut-off events. [2024-11-13 15:06:39,661 INFO L125 PetriNetUnfolderBase]: For 41500/41500 co-relation queries the response was YES. [2024-11-13 15:06:39,701 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78372 conditions, 21075 events. 17711/21075 cut-off events. For 41500/41500 co-relation queries the response was YES. Maximal size of possible extension queue 707. Compared 79801 event pairs, 661 based on Foata normal form. 708/21736 useless extension candidates. Maximal degree in co-relation 66384. Up to 15166 conditions per place. [2024-11-13 15:06:39,762 INFO L140 encePairwiseOnDemand]: 43/48 looper letters, 122 selfloop transitions, 6 changer transitions 0/135 dead transitions. [2024-11-13 15:06:39,762 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 135 transitions, 948 flow [2024-11-13 15:06:39,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 15:06:39,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-13 15:06:39,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 157 transitions. [2024-11-13 15:06:39,767 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6541666666666667 [2024-11-13 15:06:39,767 INFO L175 Difference]: Start difference. First operand has 69 places, 54 transitions, 257 flow. Second operand 5 states and 157 transitions. [2024-11-13 15:06:39,767 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 135 transitions, 948 flow [2024-11-13 15:06:39,874 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 135 transitions, 915 flow, removed 12 selfloop flow, removed 1 redundant places. [2024-11-13 15:06:39,875 INFO L231 Difference]: Finished difference. Result has 74 places, 57 transitions, 289 flow [2024-11-13 15:06:39,875 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=248, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=289, PETRI_PLACES=74, PETRI_TRANSITIONS=57} [2024-11-13 15:06:39,876 INFO L277 CegarLoopForPetriNet]: 54 programPoint places, 20 predicate places. [2024-11-13 15:06:39,876 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 57 transitions, 289 flow [2024-11-13 15:06:39,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:06:39,876 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 15:06:39,876 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:06:39,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-13 15:06:39,877 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2024-11-13 15:06:39,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:06:39,877 INFO L85 PathProgramCache]: Analyzing trace with hash -1778778359, now seen corresponding path program 1 times [2024-11-13 15:06:39,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:06:39,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824800482] [2024-11-13 15:06:39,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:06:39,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:06:39,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:06:40,017 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-13 15:06:40,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:06:40,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824800482] [2024-11-13 15:06:40,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824800482] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:06:40,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:06:40,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 15:06:40,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281000948] [2024-11-13 15:06:40,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:06:40,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 15:06:40,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:06:40,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 15:06:40,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 15:06:40,019 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 48 [2024-11-13 15:06:40,019 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 57 transitions, 289 flow. Second operand has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 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 15:06:40,019 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 15:06:40,019 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 48 [2024-11-13 15:06:40,019 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 15:06:41,954 INFO L124 PetriNetUnfolderBase]: 19120/23041 cut-off events. [2024-11-13 15:06:41,954 INFO L125 PetriNetUnfolderBase]: For 70870/70916 co-relation queries the response was YES. [2024-11-13 15:06:42,018 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92206 conditions, 23041 events. 19120/23041 cut-off events. For 70870/70916 co-relation queries the response was YES. Maximal size of possible extension queue 792. Compared 90801 event pairs, 2976 based on Foata normal form. 413/23272 useless extension candidates. Maximal degree in co-relation 79333. Up to 8871 conditions per place. [2024-11-13 15:06:42,112 INFO L140 encePairwiseOnDemand]: 42/48 looper letters, 142 selfloop transitions, 6 changer transitions 3/158 dead transitions. [2024-11-13 15:06:42,112 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 158 transitions, 1231 flow [2024-11-13 15:06:42,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 15:06:42,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-13 15:06:42,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 160 transitions. [2024-11-13 15:06:42,114 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2024-11-13 15:06:42,114 INFO L175 Difference]: Start difference. First operand has 74 places, 57 transitions, 289 flow. Second operand 5 states and 160 transitions. [2024-11-13 15:06:42,114 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 158 transitions, 1231 flow [2024-11-13 15:06:42,176 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 158 transitions, 1198 flow, removed 12 selfloop flow, removed 1 redundant places. [2024-11-13 15:06:42,178 INFO L231 Difference]: Finished difference. Result has 79 places, 60 transitions, 317 flow [2024-11-13 15:06:42,179 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=280, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=317, PETRI_PLACES=79, PETRI_TRANSITIONS=60} [2024-11-13 15:06:42,179 INFO L277 CegarLoopForPetriNet]: 54 programPoint places, 25 predicate places. [2024-11-13 15:06:42,180 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 60 transitions, 317 flow [2024-11-13 15:06:42,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 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 15:06:42,180 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 15:06:42,180 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:06:42,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-13 15:06:42,181 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2024-11-13 15:06:42,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:06:42,181 INFO L85 PathProgramCache]: Analyzing trace with hash -1501820656, now seen corresponding path program 1 times [2024-11-13 15:06:42,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:06:42,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349011900] [2024-11-13 15:06:42,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:06:42,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:06:42,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:06:42,363 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-13 15:06:42,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:06:42,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349011900] [2024-11-13 15:06:42,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349011900] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:06:42,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:06:42,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 15:06:42,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806332137] [2024-11-13 15:06:42,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:06:42,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 15:06:42,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:06:42,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 15:06:42,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 15:06:42,366 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 48 [2024-11-13 15:06:42,366 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 60 transitions, 317 flow. Second operand has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 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 15:06:42,366 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 15:06:42,367 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 48 [2024-11-13 15:06:42,367 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 15:06:44,573 INFO L124 PetriNetUnfolderBase]: 18917/22775 cut-off events. [2024-11-13 15:06:44,574 INFO L125 PetriNetUnfolderBase]: For 70209/70255 co-relation queries the response was YES. [2024-11-13 15:06:44,633 INFO L83 FinitePrefix]: Finished finitePrefix Result has 97059 conditions, 22775 events. 18917/22775 cut-off events. For 70209/70255 co-relation queries the response was YES. Maximal size of possible extension queue 780. Compared 87133 event pairs, 941 based on Foata normal form. 210/22839 useless extension candidates. Maximal degree in co-relation 83746. Up to 9092 conditions per place. [2024-11-13 15:06:44,697 INFO L140 encePairwiseOnDemand]: 43/48 looper letters, 112 selfloop transitions, 4 changer transitions 39/162 dead transitions. [2024-11-13 15:06:44,697 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 162 transitions, 1263 flow [2024-11-13 15:06:44,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 15:06:44,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-13 15:06:44,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 158 transitions. [2024-11-13 15:06:44,699 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6583333333333333 [2024-11-13 15:06:44,699 INFO L175 Difference]: Start difference. First operand has 79 places, 60 transitions, 317 flow. Second operand 5 states and 158 transitions. [2024-11-13 15:06:44,699 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 162 transitions, 1263 flow [2024-11-13 15:06:44,832 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 162 transitions, 1257 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-11-13 15:06:44,833 INFO L231 Difference]: Finished difference. Result has 83 places, 60 transitions, 325 flow [2024-11-13 15:06:44,833 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=312, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=325, PETRI_PLACES=83, PETRI_TRANSITIONS=60} [2024-11-13 15:06:44,834 INFO L277 CegarLoopForPetriNet]: 54 programPoint places, 29 predicate places. [2024-11-13 15:06:44,834 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 60 transitions, 325 flow [2024-11-13 15:06:44,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 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 15:06:44,834 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 15:06:44,834 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:06:44,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-13 15:06:44,835 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2024-11-13 15:06:44,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:06:44,835 INFO L85 PathProgramCache]: Analyzing trace with hash -2079518182, now seen corresponding path program 2 times [2024-11-13 15:06:44,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:06:44,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320712224] [2024-11-13 15:06:44,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:06:44,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:06:44,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:06:44,980 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-13 15:06:44,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:06:44,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320712224] [2024-11-13 15:06:44,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320712224] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:06:44,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:06:44,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 15:06:44,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039722668] [2024-11-13 15:06:44,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:06:44,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 15:06:44,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:06:44,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 15:06:44,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 15:06:44,982 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 48 [2024-11-13 15:06:44,982 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 60 transitions, 325 flow. Second operand has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 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 15:06:44,983 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 15:06:44,983 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 48 [2024-11-13 15:06:44,983 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 15:06:46,647 INFO L124 PetriNetUnfolderBase]: 12943/15624 cut-off events. [2024-11-13 15:06:46,648 INFO L125 PetriNetUnfolderBase]: For 47480/47526 co-relation queries the response was YES. [2024-11-13 15:06:46,694 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68812 conditions, 15624 events. 12943/15624 cut-off events. For 47480/47526 co-relation queries the response was YES. Maximal size of possible extension queue 474. Compared 56972 event pairs, 942 based on Foata normal form. 411/15952 useless extension candidates. Maximal degree in co-relation 59400. Up to 10371 conditions per place. [2024-11-13 15:06:46,748 INFO L140 encePairwiseOnDemand]: 43/48 looper letters, 140 selfloop transitions, 6 changer transitions 0/153 dead transitions. [2024-11-13 15:06:46,748 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 153 transitions, 1220 flow [2024-11-13 15:06:46,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 15:06:46,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-13 15:06:46,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 151 transitions. [2024-11-13 15:06:46,750 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6291666666666667 [2024-11-13 15:06:46,750 INFO L175 Difference]: Start difference. First operand has 83 places, 60 transitions, 325 flow. Second operand 5 states and 151 transitions. [2024-11-13 15:06:46,750 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 153 transitions, 1220 flow [2024-11-13 15:06:46,821 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 153 transitions, 1213 flow, removed 2 selfloop flow, removed 1 redundant places. [2024-11-13 15:06:46,823 INFO L231 Difference]: Finished difference. Result has 87 places, 63 transitions, 359 flow [2024-11-13 15:06:46,823 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=318, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=359, PETRI_PLACES=87, PETRI_TRANSITIONS=63} [2024-11-13 15:06:46,824 INFO L277 CegarLoopForPetriNet]: 54 programPoint places, 33 predicate places. [2024-11-13 15:06:46,824 INFO L471 AbstractCegarLoop]: Abstraction has has 87 places, 63 transitions, 359 flow [2024-11-13 15:06:46,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 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 15:06:46,824 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 15:06:46,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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:06:46,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-13 15:06:46,825 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2024-11-13 15:06:46,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:06:46,825 INFO L85 PathProgramCache]: Analyzing trace with hash 1877076218, now seen corresponding path program 1 times [2024-11-13 15:06:46,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:06:46,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002779652] [2024-11-13 15:06:46,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:06:46,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:06:46,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:06:47,761 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-13 15:06:47,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:06:47,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002779652] [2024-11-13 15:06:47,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002779652] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:06:47,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1751864909] [2024-11-13 15:06:47,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:06:47,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:06:47,764 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7df1f1c0-d9c2-476d-b193-829ea1321e65/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:06:47,766 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7df1f1c0-d9c2-476d-b193-829ea1321e65/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:06:47,769 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7df1f1c0-d9c2-476d-b193-829ea1321e65/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-13 15:06:48,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:06:48,150 INFO L255 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-13 15:06:48,153 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:06:55,471 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-13 15:06:55,471 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 15:06:57,625 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-13 15:06:57,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1751864909] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 15:06:57,625 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 15:06:57,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 5] total 15 [2024-11-13 15:06:57,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124300867] [2024-11-13 15:06:57,628 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 15:06:57,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-13 15:06:57,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:06:57,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-13 15:06:57,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2024-11-13 15:06:57,632 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 48 [2024-11-13 15:06:57,634 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 63 transitions, 359 flow. Second operand has 16 states, 16 states have (on average 19.875) internal successors, (318), 16 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:06:57,635 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 15:06:57,636 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 48 [2024-11-13 15:06:57,637 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 15:07:04,685 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 15:07:09,105 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 15:07:19,331 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 15:07:32,644 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 15:07:36,657 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 15:07:39,681 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.00s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 15:07:52,340 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 15:07:56,348 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 15:08:00,983 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 15:08:07,248 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 15:08:12,170 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 15:08:17,124 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 15:08:21,296 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 15:08:25,509 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 15:08:29,583 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 15:08:32,450 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.84s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 15:08:36,474 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 15:08:40,510 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 15:08:43,262 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 15:08:46,572 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.55s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 15:08:49,138 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.55s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 15:09:13,310 WARN L286 SmtUtils]: Spent 15.78s on a formula simplification that was a NOOP. DAG size: 34 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-13 15:09:16,464 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.79s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 15:09:21,361 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 15:09:51,780 WARN L286 SmtUtils]: Spent 10.20s on a formula simplification. DAG size of input: 35 DAG size of output: 32 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-13 15:09:56,074 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 15:10:00,077 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 15:10:04,081 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 15:10:08,087 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 15:10:12,088 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 15:10:16,096 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (mod c_~x5~0 4294967296)) (.cse2 (mod c_~x6~0 4294967296)) (.cse0 (mod c_~n~0 4294967296))) (and (<= .cse0 .cse1) (= .cse2 .cse1) (= (mod c_~x5~0 2) 0) (= .cse2 (mod (* 4294967295 (div (* (- 1) c_~x5~0) 2)) 4294967296)) (<= 1 .cse0))) is different from false [2024-11-13 15:10:20,267 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 15:10:23,103 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.64s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 15:10:27,105 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 15:10:52,166 WARN L286 SmtUtils]: Spent 11.68s on a formula simplification. DAG size of input: 46 DAG size of output: 34 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-13 15:10:57,141 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 15:10:59,058 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.88s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 15:11:03,060 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 15:11:07,097 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 15:11:26,496 WARN L286 SmtUtils]: Spent 14.87s on a formula simplification. DAG size of input: 45 DAG size of output: 37 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-13 15:11:52,898 WARN L286 SmtUtils]: Spent 14.26s on a formula simplification that was a NOOP. DAG size: 40 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-13 15:11:55,476 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.67s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 15:12:00,622 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 15:12:57,244 WARN L286 SmtUtils]: Spent 28.15s on a formula simplification. DAG size of input: 41 DAG size of output: 35 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-13 15:13:02,349 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 15:13:07,920 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 15:13:12,100 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 15:13:44,117 WARN L286 SmtUtils]: Spent 18.10s on a formula simplification. DAG size of input: 52 DAG size of output: 31 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-13 15:13:47,691 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.46s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 15:13:51,902 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 15:13:55,905 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 15:13:59,960 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 15:14:03,962 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 15:14:08,666 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 15:14:13,206 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 15:14:17,265 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 15:14:21,277 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 15:14:23,290 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 15:14:27,293 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 15:14:32,130 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 15:14:36,855 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 15:14:40,867 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 15:14:45,493 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 15:14:49,800 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 15:14:54,484 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 15:14:58,611 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 15:15:04,283 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.40s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 15:15:08,330 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 15:15:12,446 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 15:15:16,502 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 15:15:24,567 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 15:15:26,010 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 15:15:30,013 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 15:15:34,752 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 15:15:38,760 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 15:15:42,890 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 15:15:46,918 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.14s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 15:15:50,926 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 15:15:54,942 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 15:15:59,376 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 15:16:01,038 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 15:16:05,040 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 15:16:09,100 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 15:16:12,001 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.98s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 15:16:16,014 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 15:16:20,018 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 15:16:24,045 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 15:16:24,092 INFO L124 PetriNetUnfolderBase]: 74983/90327 cut-off events. [2024-11-13 15:16:24,092 INFO L125 PetriNetUnfolderBase]: For 320941/320941 co-relation queries the response was YES. [2024-11-13 15:16:24,346 INFO L83 FinitePrefix]: Finished finitePrefix Result has 416260 conditions, 90327 events. 74983/90327 cut-off events. For 320941/320941 co-relation queries the response was YES. Maximal size of possible extension queue 3031. Compared 417747 event pairs, 1534 based on Foata normal form. 755/91079 useless extension candidates. Maximal degree in co-relation 351667. Up to 16556 conditions per place. [2024-11-13 15:16:24,578 INFO L140 encePairwiseOnDemand]: 27/48 looper letters, 462 selfloop transitions, 63 changer transitions 332/864 dead transitions. [2024-11-13 15:16:24,578 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 864 transitions, 7102 flow [2024-11-13 15:16:24,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-13 15:16:24,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2024-11-13 15:16:24,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 893 transitions. [2024-11-13 15:16:24,582 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6644345238095238 [2024-11-13 15:16:24,582 INFO L175 Difference]: Start difference. First operand has 87 places, 63 transitions, 359 flow. Second operand 28 states and 893 transitions. [2024-11-13 15:16:24,582 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 864 transitions, 7102 flow [2024-11-13 15:16:26,838 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 864 transitions, 7075 flow, removed 9 selfloop flow, removed 1 redundant places. [2024-11-13 15:16:26,844 INFO L231 Difference]: Finished difference. Result has 137 places, 123 transitions, 1209 flow [2024-11-13 15:16:26,845 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=350, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=28, PETRI_FLOW=1209, PETRI_PLACES=137, PETRI_TRANSITIONS=123} [2024-11-13 15:16:26,845 INFO L277 CegarLoopForPetriNet]: 54 programPoint places, 83 predicate places. [2024-11-13 15:16:26,845 INFO L471 AbstractCegarLoop]: Abstraction has has 137 places, 123 transitions, 1209 flow [2024-11-13 15:16:26,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 19.875) internal successors, (318), 16 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:16:26,846 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 15:16:26,846 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:16:26,865 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7df1f1c0-d9c2-476d-b193-829ea1321e65/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-13 15:16:27,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7df1f1c0-d9c2-476d-b193-829ea1321e65/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-11-13 15:16:27,047 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2024-11-13 15:16:27,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:16:27,047 INFO L85 PathProgramCache]: Analyzing trace with hash -1207158256, now seen corresponding path program 2 times [2024-11-13 15:16:27,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:16:27,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835533909] [2024-11-13 15:16:27,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:16:27,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:16:27,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:16:27,639 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 15:16:27,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:16:27,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835533909] [2024-11-13 15:16:27,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835533909] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:16:27,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [324352677] [2024-11-13 15:16:27,640 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-13 15:16:27,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:16:27,640 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7df1f1c0-d9c2-476d-b193-829ea1321e65/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:16:27,642 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7df1f1c0-d9c2-476d-b193-829ea1321e65/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:16:27,643 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7df1f1c0-d9c2-476d-b193-829ea1321e65/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-13 15:16:28,074 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-13 15:16:28,074 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 15:16:28,077 INFO L255 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-13 15:16:28,080 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:16:45,557 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 2 refuted. 1 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 15:16:45,557 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 15:17:10,496 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 15:17:10,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [324352677] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 15:17:10,496 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 15:17:10,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 15 [2024-11-13 15:17:10,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282932297] [2024-11-13 15:17:10,496 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 15:17:10,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-13 15:17:10,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:17:10,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-13 15:17:10,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=193, Unknown=8, NotChecked=0, Total=240 [2024-11-13 15:17:10,498 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 48 [2024-11-13 15:17:10,498 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 123 transitions, 1209 flow. Second operand has 16 states, 16 states have (on average 20.0) internal successors, (320), 16 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:17:10,499 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 15:17:10,499 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 48 [2024-11-13 15:17:10,499 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 15:17:16,105 WARN L286 SmtUtils]: Spent 5.41s on a formula simplification that was a NOOP. DAG size: 41 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-13 15:17:26,647 WARN L286 SmtUtils]: Spent 10.20s on a formula simplification that was a NOOP. DAG size: 44 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-13 15:17:40,290 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.58s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 15:18:02,472 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.30s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 15:18:03,588 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 15:18:15,792 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.89s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 15:18:26,450 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.78s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 15:18:32,582 WARN L286 SmtUtils]: Spent 6.09s on a formula simplification. DAG size of input: 39 DAG size of output: 38 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-13 15:18:52,314 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 15:18:58,806 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 15:19:02,822 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 15:19:07,094 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.91s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 15:19:11,111 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers []