./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/weaver/bench-exp2x3.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version a0165632 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31da613e-98b8-43ce-b175-f7880ccb330e/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31da613e-98b8-43ce-b175-f7880ccb330e/bin/uautomizer-verify-jihMAELWvX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31da613e-98b8-43ce-b175-f7880ccb330e/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31da613e-98b8-43ce-b175-f7880ccb330e/bin/uautomizer-verify-jihMAELWvX/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/weaver/bench-exp2x3.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31da613e-98b8-43ce-b175-f7880ccb330e/bin/uautomizer-verify-jihMAELWvX/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31da613e-98b8-43ce-b175-f7880ccb330e/bin/uautomizer-verify-jihMAELWvX --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 f25d9c7e70f7f3d19e85c7cfc6427443102f5451f704dd6a19dd9a78d021a612 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 19:13:03,004 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 19:13:03,096 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31da613e-98b8-43ce-b175-f7880ccb330e/bin/uautomizer-verify-jihMAELWvX/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-08 19:13:03,102 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 19:13:03,105 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 19:13:03,143 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 19:13:03,146 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 19:13:03,146 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 19:13:03,147 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 19:13:03,148 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 19:13:03,149 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 19:13:03,149 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 19:13:03,150 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 19:13:03,152 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 19:13:03,153 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 19:13:03,153 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 19:13:03,154 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 19:13:03,154 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 19:13:03,154 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 19:13:03,154 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 19:13:03,155 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-08 19:13:03,159 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-08 19:13:03,159 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-08 19:13:03,160 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 19:13:03,160 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 19:13:03,160 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 19:13:03,160 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-08 19:13:03,160 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 19:13:03,161 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 19:13:03,161 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 19:13:03,161 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 19:13:03,161 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 19:13:03,162 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 19:13:03,162 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 19:13:03,162 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 19:13:03,162 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 19:13:03,163 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 19:13:03,164 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 19:13:03,165 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 19:13:03,165 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 19:13:03,166 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 19:13:03,166 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 19:13:03,167 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31da613e-98b8-43ce-b175-f7880ccb330e/bin/uautomizer-verify-jihMAELWvX/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31da613e-98b8-43ce-b175-f7880ccb330e/bin/uautomizer-verify-jihMAELWvX 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 -> f25d9c7e70f7f3d19e85c7cfc6427443102f5451f704dd6a19dd9a78d021a612 [2024-11-08 19:13:03,472 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 19:13:03,501 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 19:13:03,518 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 19:13:03,520 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 19:13:03,520 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 19:13:03,522 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31da613e-98b8-43ce-b175-f7880ccb330e/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/weaver/bench-exp2x3.wvr.c Unable to find full path for "g++" [2024-11-08 19:13:05,642 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 19:13:05,818 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 19:13:05,819 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31da613e-98b8-43ce-b175-f7880ccb330e/sv-benchmarks/c/weaver/bench-exp2x3.wvr.c [2024-11-08 19:13:05,827 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31da613e-98b8-43ce-b175-f7880ccb330e/bin/uautomizer-verify-jihMAELWvX/data/cc56cab00/cd89c10986a944e092c73d33e5c4b448/FLAGd682e5d7e [2024-11-08 19:13:06,209 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31da613e-98b8-43ce-b175-f7880ccb330e/bin/uautomizer-verify-jihMAELWvX/data/cc56cab00/cd89c10986a944e092c73d33e5c4b448 [2024-11-08 19:13:06,211 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 19:13:06,213 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 19:13:06,214 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 19:13:06,215 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 19:13:06,223 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 19:13:06,224 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 07:13:06" (1/1) ... [2024-11-08 19:13:06,225 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40266a54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:13:06, skipping insertion in model container [2024-11-08 19:13:06,225 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 07:13:06" (1/1) ... [2024-11-08 19:13:06,257 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 19:13:06,474 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 19:13:06,484 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 19:13:06,506 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 19:13:06,525 INFO L204 MainTranslator]: Completed translation [2024-11-08 19:13:06,525 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:13:06 WrapperNode [2024-11-08 19:13:06,526 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 19:13:06,527 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 19:13:06,527 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 19:13:06,527 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 19:13:06,535 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:13:06" (1/1) ... [2024-11-08 19:13:06,543 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:13:06" (1/1) ... [2024-11-08 19:13:06,561 INFO L138 Inliner]: procedures = 19, calls = 13, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 73 [2024-11-08 19:13:06,562 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 19:13:06,563 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 19:13:06,563 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 19:13:06,563 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 19:13:06,575 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:13:06" (1/1) ... [2024-11-08 19:13:06,575 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:13:06" (1/1) ... [2024-11-08 19:13:06,577 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:13:06" (1/1) ... [2024-11-08 19:13:06,591 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-08 19:13:06,591 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:13:06" (1/1) ... [2024-11-08 19:13:06,591 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:13:06" (1/1) ... [2024-11-08 19:13:06,596 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:13:06" (1/1) ... [2024-11-08 19:13:06,599 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:13:06" (1/1) ... [2024-11-08 19:13:06,605 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:13:06" (1/1) ... [2024-11-08 19:13:06,606 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:13:06" (1/1) ... [2024-11-08 19:13:06,612 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 19:13:06,613 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 19:13:06,613 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 19:13:06,613 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 19:13:06,614 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:13:06" (1/1) ... [2024-11-08 19:13:06,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 19:13:06,634 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31da613e-98b8-43ce-b175-f7880ccb330e/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 19:13:06,651 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31da613e-98b8-43ce-b175-f7880ccb330e/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 19:13:06,654 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31da613e-98b8-43ce-b175-f7880ccb330e/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 19:13:06,689 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 19:13:06,689 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-08 19:13:06,689 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-08 19:13:06,689 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-08 19:13:06,690 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-08 19:13:06,690 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-11-08 19:13:06,690 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-11-08 19:13:06,690 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2024-11-08 19:13:06,690 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2024-11-08 19:13:06,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 19:13:06,690 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 19:13:06,691 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 19:13:06,694 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-08 19:13:06,795 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 19:13:06,798 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 19:13:07,027 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-08 19:13:07,027 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 19:13:07,258 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 19:13:07,259 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-08 19:13:07,259 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:13:07 BoogieIcfgContainer [2024-11-08 19:13:07,259 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 19:13:07,262 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 19:13:07,262 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 19:13:07,265 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 19:13:07,265 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 07:13:06" (1/3) ... [2024-11-08 19:13:07,266 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3210cc63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 07:13:07, skipping insertion in model container [2024-11-08 19:13:07,266 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:13:06" (2/3) ... [2024-11-08 19:13:07,267 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3210cc63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 07:13:07, skipping insertion in model container [2024-11-08 19:13:07,267 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:13:07" (3/3) ... [2024-11-08 19:13:07,268 INFO L112 eAbstractionObserver]: Analyzing ICFG bench-exp2x3.wvr.c [2024-11-08 19:13:07,282 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 19:13:07,283 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-08 19:13:07,283 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-08 19:13:07,355 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-11-08 19:13:07,392 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 46 transitions, 120 flow [2024-11-08 19:13:07,433 INFO L124 PetriNetUnfolderBase]: 8/42 cut-off events. [2024-11-08 19:13:07,433 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-08 19:13:07,438 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59 conditions, 42 events. 8/42 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 54 event pairs, 0 based on Foata normal form. 0/32 useless extension candidates. Maximal degree in co-relation 37. Up to 2 conditions per place. [2024-11-08 19:13:07,438 INFO L82 GeneralOperation]: Start removeDead. Operand has 51 places, 46 transitions, 120 flow [2024-11-08 19:13:07,443 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 46 places, 41 transitions, 106 flow [2024-11-08 19:13:07,458 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 19:13:07,465 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;@2f4f9ea6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 19:13:07,465 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-11-08 19:13:07,482 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-08 19:13:07,483 INFO L124 PetriNetUnfolderBase]: 8/38 cut-off events. [2024-11-08 19:13:07,483 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-08 19:13:07,483 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 19:13:07,484 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:13:07,484 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-08 19:13:07,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:13:07,490 INFO L85 PathProgramCache]: Analyzing trace with hash 525570682, now seen corresponding path program 1 times [2024-11-08 19:13:07,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:13:07,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601497787] [2024-11-08 19:13:07,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:13:07,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:13:07,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:13:08,118 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-08 19:13:08,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:13:08,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601497787] [2024-11-08 19:13:08,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601497787] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:13:08,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:13:08,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 19:13:08,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624830904] [2024-11-08 19:13:08,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:13:08,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 19:13:08,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:13:08,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 19:13:08,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 19:13:08,212 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 46 [2024-11-08 19:13:08,215 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 41 transitions, 106 flow. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:13:08,215 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 19:13:08,215 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 46 [2024-11-08 19:13:08,217 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 19:13:08,658 INFO L124 PetriNetUnfolderBase]: 1587/2392 cut-off events. [2024-11-08 19:13:08,658 INFO L125 PetriNetUnfolderBase]: For 141/141 co-relation queries the response was YES. [2024-11-08 19:13:08,677 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4271 conditions, 2392 events. 1587/2392 cut-off events. For 141/141 co-relation queries the response was YES. Maximal size of possible extension queue 157. Compared 11631 event pairs, 123 based on Foata normal form. 2/2138 useless extension candidates. Maximal degree in co-relation 3676. Up to 1541 conditions per place. [2024-11-08 19:13:08,698 INFO L140 encePairwiseOnDemand]: 39/46 looper letters, 35 selfloop transitions, 5 changer transitions 1/58 dead transitions. [2024-11-08 19:13:08,698 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 58 transitions, 243 flow [2024-11-08 19:13:08,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 19:13:08,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-08 19:13:08,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 109 transitions. [2024-11-08 19:13:08,713 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7898550724637681 [2024-11-08 19:13:08,715 INFO L175 Difference]: Start difference. First operand has 46 places, 41 transitions, 106 flow. Second operand 3 states and 109 transitions. [2024-11-08 19:13:08,716 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 58 transitions, 243 flow [2024-11-08 19:13:08,722 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 58 transitions, 213 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-11-08 19:13:08,729 INFO L231 Difference]: Finished difference. Result has 39 places, 43 transitions, 119 flow [2024-11-08 19:13:08,732 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=119, PETRI_PLACES=39, PETRI_TRANSITIONS=43} [2024-11-08 19:13:08,737 INFO L277 CegarLoopForPetriNet]: 46 programPoint places, -7 predicate places. [2024-11-08 19:13:08,738 INFO L471 AbstractCegarLoop]: Abstraction has has 39 places, 43 transitions, 119 flow [2024-11-08 19:13:08,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:13:08,739 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 19:13:08,740 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] [2024-11-08 19:13:08,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 19:13:08,740 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-08 19:13:08,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:13:08,741 INFO L85 PathProgramCache]: Analyzing trace with hash -569920587, now seen corresponding path program 1 times [2024-11-08 19:13:08,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:13:08,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353346890] [2024-11-08 19:13:08,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:13:08,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:13:08,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:13:08,957 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:13:08,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:13:08,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353346890] [2024-11-08 19:13:08,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353346890] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:13:08,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:13:08,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 19:13:08,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249954165] [2024-11-08 19:13:08,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:13:08,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 19:13:08,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:13:08,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 19:13:08,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 19:13:09,005 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 46 [2024-11-08 19:13:09,006 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 43 transitions, 119 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-08 19:13:09,006 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 19:13:09,006 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 46 [2024-11-08 19:13:09,006 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 19:13:10,027 INFO L124 PetriNetUnfolderBase]: 5738/7741 cut-off events. [2024-11-08 19:13:10,027 INFO L125 PetriNetUnfolderBase]: For 1567/1769 co-relation queries the response was YES. [2024-11-08 19:13:10,055 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16838 conditions, 7741 events. 5738/7741 cut-off events. For 1567/1769 co-relation queries the response was YES. Maximal size of possible extension queue 472. Compared 39217 event pairs, 671 based on Foata normal form. 98/6659 useless extension candidates. Maximal degree in co-relation 2399. Up to 2460 conditions per place. [2024-11-08 19:13:10,112 INFO L140 encePairwiseOnDemand]: 37/46 looper letters, 80 selfloop transitions, 14 changer transitions 0/105 dead transitions. [2024-11-08 19:13:10,112 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 105 transitions, 475 flow [2024-11-08 19:13:10,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 19:13:10,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-08 19:13:10,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 169 transitions. [2024-11-08 19:13:10,116 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7347826086956522 [2024-11-08 19:13:10,116 INFO L175 Difference]: Start difference. First operand has 39 places, 43 transitions, 119 flow. Second operand 5 states and 169 transitions. [2024-11-08 19:13:10,116 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 105 transitions, 475 flow [2024-11-08 19:13:10,118 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 105 transitions, 467 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-08 19:13:10,120 INFO L231 Difference]: Finished difference. Result has 45 places, 54 transitions, 213 flow [2024-11-08 19:13:10,121 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=213, PETRI_PLACES=45, PETRI_TRANSITIONS=54} [2024-11-08 19:13:10,122 INFO L277 CegarLoopForPetriNet]: 46 programPoint places, -1 predicate places. [2024-11-08 19:13:10,122 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 54 transitions, 213 flow [2024-11-08 19:13:10,123 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-08 19:13:10,123 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 19:13:10,124 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] [2024-11-08 19:13:10,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 19:13:10,124 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-08 19:13:10,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:13:10,126 INFO L85 PathProgramCache]: Analyzing trace with hash 924536523, now seen corresponding path program 1 times [2024-11-08 19:13:10,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:13:10,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695831686] [2024-11-08 19:13:10,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:13:10,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:13:10,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:13:10,295 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:13:10,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:13:10,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695831686] [2024-11-08 19:13:10,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695831686] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:13:10,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:13:10,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 19:13:10,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737993916] [2024-11-08 19:13:10,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:13:10,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 19:13:10,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:13:10,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 19:13:10,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 19:13:10,345 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 46 [2024-11-08 19:13:10,346 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 54 transitions, 213 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-08 19:13:10,347 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 19:13:10,347 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 46 [2024-11-08 19:13:10,347 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 19:13:11,671 INFO L124 PetriNetUnfolderBase]: 7618/10514 cut-off events. [2024-11-08 19:13:11,671 INFO L125 PetriNetUnfolderBase]: For 6119/6119 co-relation queries the response was YES. [2024-11-08 19:13:11,716 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26448 conditions, 10514 events. 7618/10514 cut-off events. For 6119/6119 co-relation queries the response was YES. Maximal size of possible extension queue 696. Compared 59459 event pairs, 1308 based on Foata normal form. 528/10503 useless extension candidates. Maximal degree in co-relation 7376. Up to 3276 conditions per place. [2024-11-08 19:13:11,796 INFO L140 encePairwiseOnDemand]: 37/46 looper letters, 94 selfloop transitions, 14 changer transitions 0/119 dead transitions. [2024-11-08 19:13:11,796 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 119 transitions, 640 flow [2024-11-08 19:13:11,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 19:13:11,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-08 19:13:11,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 176 transitions. [2024-11-08 19:13:11,799 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7652173913043478 [2024-11-08 19:13:11,800 INFO L175 Difference]: Start difference. First operand has 45 places, 54 transitions, 213 flow. Second operand 5 states and 176 transitions. [2024-11-08 19:13:11,800 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 119 transitions, 640 flow [2024-11-08 19:13:11,803 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 119 transitions, 640 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-08 19:13:11,806 INFO L231 Difference]: Finished difference. Result has 53 places, 58 transitions, 310 flow [2024-11-08 19:13:11,806 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=310, PETRI_PLACES=53, PETRI_TRANSITIONS=58} [2024-11-08 19:13:11,807 INFO L277 CegarLoopForPetriNet]: 46 programPoint places, 7 predicate places. [2024-11-08 19:13:11,807 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 58 transitions, 310 flow [2024-11-08 19:13:11,808 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-08 19:13:11,808 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 19:13:11,808 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] [2024-11-08 19:13:11,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 19:13:11,809 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-08 19:13:11,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:13:11,810 INFO L85 PathProgramCache]: Analyzing trace with hash 1320704051, now seen corresponding path program 2 times [2024-11-08 19:13:11,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:13:11,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004588250] [2024-11-08 19:13:11,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:13:11,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:13:11,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:13:11,965 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:13:11,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:13:11,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004588250] [2024-11-08 19:13:11,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004588250] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:13:11,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:13:11,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 19:13:11,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496823078] [2024-11-08 19:13:11,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:13:11,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 19:13:11,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:13:11,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 19:13:11,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 19:13:12,022 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 46 [2024-11-08 19:13:12,023 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 58 transitions, 310 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-08 19:13:12,023 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 19:13:12,023 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 46 [2024-11-08 19:13:12,024 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 19:13:12,972 INFO L124 PetriNetUnfolderBase]: 5799/7818 cut-off events. [2024-11-08 19:13:12,972 INFO L125 PetriNetUnfolderBase]: For 10955/11167 co-relation queries the response was YES. [2024-11-08 19:13:13,003 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23033 conditions, 7818 events. 5799/7818 cut-off events. For 10955/11167 co-relation queries the response was YES. Maximal size of possible extension queue 526. Compared 40843 event pairs, 587 based on Foata normal form. 106/7526 useless extension candidates. Maximal degree in co-relation 9277. Up to 2289 conditions per place. [2024-11-08 19:13:13,046 INFO L140 encePairwiseOnDemand]: 38/46 looper letters, 79 selfloop transitions, 16 changer transitions 0/106 dead transitions. [2024-11-08 19:13:13,046 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 106 transitions, 660 flow [2024-11-08 19:13:13,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 19:13:13,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-08 19:13:13,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 161 transitions. [2024-11-08 19:13:13,050 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7 [2024-11-08 19:13:13,050 INFO L175 Difference]: Start difference. First operand has 53 places, 58 transitions, 310 flow. Second operand 5 states and 161 transitions. [2024-11-08 19:13:13,050 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 106 transitions, 660 flow [2024-11-08 19:13:13,071 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 106 transitions, 658 flow, removed 1 selfloop flow, removed 0 redundant places. [2024-11-08 19:13:13,073 INFO L231 Difference]: Finished difference. Result has 60 places, 61 transitions, 398 flow [2024-11-08 19:13:13,074 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=284, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=398, PETRI_PLACES=60, PETRI_TRANSITIONS=61} [2024-11-08 19:13:13,075 INFO L277 CegarLoopForPetriNet]: 46 programPoint places, 14 predicate places. [2024-11-08 19:13:13,076 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 61 transitions, 398 flow [2024-11-08 19:13:13,076 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-08 19:13:13,077 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 19:13:13,077 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] [2024-11-08 19:13:13,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 19:13:13,078 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-08 19:13:13,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:13:13,079 INFO L85 PathProgramCache]: Analyzing trace with hash -1834063863, now seen corresponding path program 1 times [2024-11-08 19:13:13,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:13:13,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26901622] [2024-11-08 19:13:13,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:13:13,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:13:13,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:13:13,183 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:13:13,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:13:13,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26901622] [2024-11-08 19:13:13,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26901622] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 19:13:13,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1952190745] [2024-11-08 19:13:13,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:13:13,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 19:13:13,185 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31da613e-98b8-43ce-b175-f7880ccb330e/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 19:13:13,187 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31da613e-98b8-43ce-b175-f7880ccb330e/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 19:13:13,189 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31da613e-98b8-43ce-b175-f7880ccb330e/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 19:13:13,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:13:13,281 INFO L255 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 19:13:13,286 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 19:13:13,635 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:13:13,635 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 19:13:13,749 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:13:13,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1952190745] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 19:13:13,750 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 19:13:13,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2024-11-08 19:13:13,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500117979] [2024-11-08 19:13:13,751 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 19:13:13,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 19:13:13,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:13:13,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 19:13:13,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-08 19:13:13,823 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 46 [2024-11-08 19:13:13,823 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 61 transitions, 398 flow. Second operand has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 6 states have internal predecessors, (131), 0 states have call successors, (0), 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-08 19:13:13,823 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 19:13:13,823 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 46 [2024-11-08 19:13:13,824 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 19:13:15,960 INFO L124 PetriNetUnfolderBase]: 12357/16091 cut-off events. [2024-11-08 19:13:15,961 INFO L125 PetriNetUnfolderBase]: For 64913/79414 co-relation queries the response was YES. [2024-11-08 19:13:16,019 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49810 conditions, 16091 events. 12357/16091 cut-off events. For 64913/79414 co-relation queries the response was YES. Maximal size of possible extension queue 1376. Compared 92931 event pairs, 1292 based on Foata normal form. 2784/15892 useless extension candidates. Maximal degree in co-relation 27188. Up to 4771 conditions per place. [2024-11-08 19:13:16,104 INFO L140 encePairwiseOnDemand]: 37/46 looper letters, 142 selfloop transitions, 16 changer transitions 0/181 dead transitions. [2024-11-08 19:13:16,104 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 181 transitions, 1510 flow [2024-11-08 19:13:16,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 19:13:16,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-08 19:13:16,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 252 transitions. [2024-11-08 19:13:16,107 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6847826086956522 [2024-11-08 19:13:16,107 INFO L175 Difference]: Start difference. First operand has 60 places, 61 transitions, 398 flow. Second operand 8 states and 252 transitions. [2024-11-08 19:13:16,108 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 181 transitions, 1510 flow [2024-11-08 19:13:16,124 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 181 transitions, 1490 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-11-08 19:13:16,128 INFO L231 Difference]: Finished difference. Result has 72 places, 72 transitions, 503 flow [2024-11-08 19:13:16,130 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=386, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=503, PETRI_PLACES=72, PETRI_TRANSITIONS=72} [2024-11-08 19:13:16,131 INFO L277 CegarLoopForPetriNet]: 46 programPoint places, 26 predicate places. [2024-11-08 19:13:16,131 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 72 transitions, 503 flow [2024-11-08 19:13:16,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 6 states have internal predecessors, (131), 0 states have call successors, (0), 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-08 19:13:16,131 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 19:13:16,132 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] [2024-11-08 19:13:16,155 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31da613e-98b8-43ce-b175-f7880ccb330e/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-08 19:13:16,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31da613e-98b8-43ce-b175-f7880ccb330e/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 19:13:16,338 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-08 19:13:16,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:13:16,339 INFO L85 PathProgramCache]: Analyzing trace with hash 524546583, now seen corresponding path program 2 times [2024-11-08 19:13:16,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:13:16,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217814631] [2024-11-08 19:13:16,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:13:16,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:13:16,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:13:16,449 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:13:16,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:13:16,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217814631] [2024-11-08 19:13:16,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217814631] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:13:16,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:13:16,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 19:13:16,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721827750] [2024-11-08 19:13:16,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:13:16,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 19:13:16,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:13:16,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 19:13:16,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 19:13:16,484 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 46 [2024-11-08 19:13:16,485 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 72 transitions, 503 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-08 19:13:16,485 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 19:13:16,485 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 46 [2024-11-08 19:13:16,485 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 19:13:18,046 INFO L124 PetriNetUnfolderBase]: 9533/13536 cut-off events. [2024-11-08 19:13:18,046 INFO L125 PetriNetUnfolderBase]: For 48712/52901 co-relation queries the response was YES. [2024-11-08 19:13:18,191 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50834 conditions, 13536 events. 9533/13536 cut-off events. For 48712/52901 co-relation queries the response was YES. Maximal size of possible extension queue 953. Compared 83932 event pairs, 2132 based on Foata normal form. 1210/13759 useless extension candidates. Maximal degree in co-relation 32777. Up to 5422 conditions per place. [2024-11-08 19:13:18,262 INFO L140 encePairwiseOnDemand]: 38/46 looper letters, 105 selfloop transitions, 14 changer transitions 0/136 dead transitions. [2024-11-08 19:13:18,262 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 136 transitions, 1047 flow [2024-11-08 19:13:18,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 19:13:18,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-08 19:13:18,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 164 transitions. [2024-11-08 19:13:18,264 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7130434782608696 [2024-11-08 19:13:18,264 INFO L175 Difference]: Start difference. First operand has 72 places, 72 transitions, 503 flow. Second operand 5 states and 164 transitions. [2024-11-08 19:13:18,264 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 136 transitions, 1047 flow [2024-11-08 19:13:18,329 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 136 transitions, 1041 flow, removed 3 selfloop flow, removed 0 redundant places. [2024-11-08 19:13:18,331 INFO L231 Difference]: Finished difference. Result has 79 places, 74 transitions, 573 flow [2024-11-08 19:13:18,331 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=469, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=573, PETRI_PLACES=79, PETRI_TRANSITIONS=74} [2024-11-08 19:13:18,332 INFO L277 CegarLoopForPetriNet]: 46 programPoint places, 33 predicate places. [2024-11-08 19:13:18,332 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 74 transitions, 573 flow [2024-11-08 19:13:18,333 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-08 19:13:18,333 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 19:13:18,333 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] [2024-11-08 19:13:18,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 19:13:18,333 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-08 19:13:18,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:13:18,334 INFO L85 PathProgramCache]: Analyzing trace with hash 1790066771, now seen corresponding path program 1 times [2024-11-08 19:13:18,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:13:18,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447093531] [2024-11-08 19:13:18,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:13:18,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:13:18,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:13:18,426 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:13:18,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:13:18,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447093531] [2024-11-08 19:13:18,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447093531] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:13:18,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:13:18,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 19:13:18,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216022494] [2024-11-08 19:13:18,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:13:18,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 19:13:18,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:13:18,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 19:13:18,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 19:13:18,467 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 46 [2024-11-08 19:13:18,468 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 74 transitions, 573 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-08 19:13:18,468 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 19:13:18,468 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 46 [2024-11-08 19:13:18,468 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 19:13:20,072 INFO L124 PetriNetUnfolderBase]: 10946/14523 cut-off events. [2024-11-08 19:13:20,072 INFO L125 PetriNetUnfolderBase]: For 97061/109027 co-relation queries the response was YES. [2024-11-08 19:13:20,127 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59093 conditions, 14523 events. 10946/14523 cut-off events. For 97061/109027 co-relation queries the response was YES. Maximal size of possible extension queue 996. Compared 84119 event pairs, 1012 based on Foata normal form. 2143/16033 useless extension candidates. Maximal degree in co-relation 39996. Up to 5380 conditions per place. [2024-11-08 19:13:20,223 INFO L140 encePairwiseOnDemand]: 39/46 looper letters, 112 selfloop transitions, 12 changer transitions 0/147 dead transitions. [2024-11-08 19:13:20,223 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 147 transitions, 1420 flow [2024-11-08 19:13:20,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 19:13:20,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-08 19:13:20,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 155 transitions. [2024-11-08 19:13:20,226 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6739130434782609 [2024-11-08 19:13:20,226 INFO L175 Difference]: Start difference. First operand has 79 places, 74 transitions, 573 flow. Second operand 5 states and 155 transitions. [2024-11-08 19:13:20,226 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 147 transitions, 1420 flow [2024-11-08 19:13:20,294 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 147 transitions, 1415 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-11-08 19:13:20,302 INFO L231 Difference]: Finished difference. Result has 85 places, 81 transitions, 670 flow [2024-11-08 19:13:20,302 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=568, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=670, PETRI_PLACES=85, PETRI_TRANSITIONS=81} [2024-11-08 19:13:20,303 INFO L277 CegarLoopForPetriNet]: 46 programPoint places, 39 predicate places. [2024-11-08 19:13:20,303 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 81 transitions, 670 flow [2024-11-08 19:13:20,303 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-08 19:13:20,303 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 19:13:20,304 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] [2024-11-08 19:13:20,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 19:13:20,304 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-08 19:13:20,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:13:20,305 INFO L85 PathProgramCache]: Analyzing trace with hash 978412961, now seen corresponding path program 2 times [2024-11-08 19:13:20,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:13:20,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872236490] [2024-11-08 19:13:20,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:13:20,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:13:20,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:13:20,438 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:13:20,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:13:20,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872236490] [2024-11-08 19:13:20,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872236490] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:13:20,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:13:20,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 19:13:20,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750647525] [2024-11-08 19:13:20,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:13:20,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 19:13:20,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:13:20,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 19:13:20,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 19:13:20,485 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 46 [2024-11-08 19:13:20,485 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 81 transitions, 670 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-08 19:13:20,485 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 19:13:20,486 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 46 [2024-11-08 19:13:20,486 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 19:13:21,932 INFO L124 PetriNetUnfolderBase]: 9572/12851 cut-off events. [2024-11-08 19:13:21,933 INFO L125 PetriNetUnfolderBase]: For 92858/103665 co-relation queries the response was YES. [2024-11-08 19:13:21,965 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56464 conditions, 12851 events. 9572/12851 cut-off events. For 92858/103665 co-relation queries the response was YES. Maximal size of possible extension queue 869. Compared 75417 event pairs, 1228 based on Foata normal form. 2663/14917 useless extension candidates. Maximal degree in co-relation 41738. Up to 6239 conditions per place. [2024-11-08 19:13:22,023 INFO L140 encePairwiseOnDemand]: 38/46 looper letters, 109 selfloop transitions, 16 changer transitions 0/148 dead transitions. [2024-11-08 19:13:22,024 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 148 transitions, 1493 flow [2024-11-08 19:13:22,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 19:13:22,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-08 19:13:22,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 156 transitions. [2024-11-08 19:13:22,025 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6782608695652174 [2024-11-08 19:13:22,025 INFO L175 Difference]: Start difference. First operand has 85 places, 81 transitions, 670 flow. Second operand 5 states and 156 transitions. [2024-11-08 19:13:22,025 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 148 transitions, 1493 flow [2024-11-08 19:13:22,128 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 148 transitions, 1479 flow, removed 7 selfloop flow, removed 0 redundant places. [2024-11-08 19:13:22,130 INFO L231 Difference]: Finished difference. Result has 92 places, 83 transitions, 757 flow [2024-11-08 19:13:22,131 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=643, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=757, PETRI_PLACES=92, PETRI_TRANSITIONS=83} [2024-11-08 19:13:22,136 INFO L277 CegarLoopForPetriNet]: 46 programPoint places, 46 predicate places. [2024-11-08 19:13:22,138 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 83 transitions, 757 flow [2024-11-08 19:13:22,138 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-08 19:13:22,138 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 19:13:22,138 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] [2024-11-08 19:13:22,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 19:13:22,139 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-08 19:13:22,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:13:22,141 INFO L85 PathProgramCache]: Analyzing trace with hash -910636645, now seen corresponding path program 2 times [2024-11-08 19:13:22,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:13:22,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253154290] [2024-11-08 19:13:22,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:13:22,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:13:22,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:13:22,253 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:13:22,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:13:22,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253154290] [2024-11-08 19:13:22,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253154290] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:13:22,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:13:22,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 19:13:22,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434005399] [2024-11-08 19:13:22,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:13:22,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 19:13:22,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:13:22,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 19:13:22,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 19:13:22,291 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 46 [2024-11-08 19:13:22,292 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 83 transitions, 757 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-08 19:13:22,292 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 19:13:22,292 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 46 [2024-11-08 19:13:22,292 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 19:13:23,822 INFO L124 PetriNetUnfolderBase]: 8389/11252 cut-off events. [2024-11-08 19:13:23,822 INFO L125 PetriNetUnfolderBase]: For 91556/101021 co-relation queries the response was YES. [2024-11-08 19:13:23,870 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52498 conditions, 11252 events. 8389/11252 cut-off events. For 91556/101021 co-relation queries the response was YES. Maximal size of possible extension queue 735. Compared 64576 event pairs, 724 based on Foata normal form. 1709/12440 useless extension candidates. Maximal degree in co-relation 43005. Up to 4661 conditions per place. [2024-11-08 19:13:23,935 INFO L140 encePairwiseOnDemand]: 39/46 looper letters, 109 selfloop transitions, 14 changer transitions 0/146 dead transitions. [2024-11-08 19:13:23,935 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 146 transitions, 1533 flow [2024-11-08 19:13:23,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 19:13:23,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-08 19:13:23,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 152 transitions. [2024-11-08 19:13:23,936 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6608695652173913 [2024-11-08 19:13:23,936 INFO L175 Difference]: Start difference. First operand has 92 places, 83 transitions, 757 flow. Second operand 5 states and 152 transitions. [2024-11-08 19:13:23,937 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 146 transitions, 1533 flow [2024-11-08 19:13:24,076 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 146 transitions, 1522 flow, removed 4 selfloop flow, removed 1 redundant places. [2024-11-08 19:13:24,078 INFO L231 Difference]: Finished difference. Result has 98 places, 86 transitions, 817 flow [2024-11-08 19:13:24,078 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=714, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=817, PETRI_PLACES=98, PETRI_TRANSITIONS=86} [2024-11-08 19:13:24,079 INFO L277 CegarLoopForPetriNet]: 46 programPoint places, 52 predicate places. [2024-11-08 19:13:24,079 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 86 transitions, 817 flow [2024-11-08 19:13:24,079 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-08 19:13:24,079 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 19:13:24,079 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:13:24,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-08 19:13:24,080 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-08 19:13:24,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:13:24,080 INFO L85 PathProgramCache]: Analyzing trace with hash -1795572710, now seen corresponding path program 1 times [2024-11-08 19:13:24,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:13:24,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762264658] [2024-11-08 19:13:24,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:13:24,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:13:24,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:13:24,842 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:13:24,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:13:24,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762264658] [2024-11-08 19:13:24,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762264658] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 19:13:24,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [741860970] [2024-11-08 19:13:24,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:13:24,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 19:13:24,843 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31da613e-98b8-43ce-b175-f7880ccb330e/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 19:13:24,845 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31da613e-98b8-43ce-b175-f7880ccb330e/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 19:13:24,847 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31da613e-98b8-43ce-b175-f7880ccb330e/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-08 19:13:25,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:13:25,241 INFO L255 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-08 19:13:25,243 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 19:13:29,098 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:13:29,098 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 19:13:30,494 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:13:30,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [741860970] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 19:13:30,494 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 19:13:30,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 18 [2024-11-08 19:13:30,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581483875] [2024-11-08 19:13:30,495 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 19:13:30,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-08 19:13:30,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:13:30,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-08 19:13:30,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2024-11-08 19:13:31,875 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 46 [2024-11-08 19:13:31,876 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 86 transitions, 817 flow. Second operand has 19 states, 19 states have (on average 15.947368421052632) internal successors, (303), 19 states have internal predecessors, (303), 0 states have call successors, (0), 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-08 19:13:31,876 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 19:13:31,876 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 46 [2024-11-08 19:13:31,876 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 19:13:40,281 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-08 19:13:47,172 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([296] L46-1-->L46-3: Formula: (and (< (mod v_~x2~0_12 4294967296) (mod v_~n~0_21 4294967296)) (= (* v_~x2~0_12 2) v_~x2~0_11)) InVars {~n~0=v_~n~0_21, ~x2~0=v_~x2~0_12} OutVars{~n~0=v_~n~0_21, ~x2~0=v_~x2~0_11} AuxVars[] AssignedVars[~x2~0][35], [Black: 60#(<= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)), Black: 61#(<= (mod ~n~0 4294967296) (mod ~x1~0 4294967296)), 24#L62-1true, Black: 63#(and (<= (mod ~n~0 4294967296) (mod ~x1~0 4294967296)) (<= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296))), 308#true, 302#(<= (mod ~n~0 4294967296) (mod ~x3~0 4294967296)), Black: 69#(<= (mod ~x1~0 4294967296) (mod ~x2~0 4294967296)), Black: 86#true, Black: 72#(and (<= (+ (mod ~x1~0 4294967296) 1) (mod ~n~0 4294967296)) (<= (mod ~x1~0 4294967296) (mod ~x2~0 4294967296))), 290#true, Black: 67#true, Black: 93#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (<= 1 (mod ~x3~0 4294967296))), 263#(and (<= 1 (mod ~x4~0 4294967296)) (<= (+ (mod ~x4~0 4294967296) 1) (mod ~n~0 4294967296)) (<= (mod ~x4~0 4294967296) (mod ~x3~0 4294967296))), Black: 121#(and (<= 1 (mod ~x4~0 4294967296)) (<= (+ (mod ~x4~0 4294967296) 1) (mod ~n~0 4294967296))), Black: 89#(<= (+ (mod ~x4~0 4294967296) 1) (mod ~n~0 4294967296)), Black: 261#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (<= (+ (mod ~x4~0 4294967296) 1) (mod ~n~0 4294967296)) (<= 1 (mod ~x3~0 4294967296))), Black: 80#(<= (mod ~n~0 4294967296) (mod ~x2~0 4294967296)), Black: 82#(and (<= (mod ~n~0 4294967296) (mod ~x2~0 4294967296)) (<= (mod ~x1~0 4294967296) (mod ~x2~0 4294967296))), Black: 277#(and (<= (+ (mod ~x2~0 4294967296) 1) (mod ~n~0 4294967296)) (<= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296))), Black: 275#(<= (+ (mod ~x2~0 4294967296) 1) (mod ~n~0 4294967296)), 58#true, 272#true, Black: 283#(<= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)), 23#L85-4true, 281#true, Black: 286#(and (<= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (<= (mod ~n~0 4294967296) (mod ~x4~0 4294967296))), Black: 284#(<= (mod ~n~0 4294967296) (mod ~x4~0 4294967296)), 26#L38-1true, 77#true, 70#(<= (+ (mod ~x1~0 4294967296) 1) (mod ~n~0 4294967296)), Black: 293#(<= (+ (mod ~x3~0 4294967296) 1) (mod ~n~0 4294967296)), Black: 295#(and (<= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (<= (+ (mod ~x3~0 4294967296) 1) (mod ~n~0 4294967296))), Black: 299#true, Black: 304#(and (<= (mod ~n~0 4294967296) (mod ~x3~0 4294967296)) (<= (mod ~x4~0 4294967296) (mod ~x3~0 4294967296))), 12#L54-4true, Black: 56#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296))), 11#L46-3true]) [2024-11-08 19:13:47,173 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2024-11-08 19:13:47,173 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-11-08 19:13:47,173 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-11-08 19:13:47,173 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-11-08 19:13:47,180 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([296] L46-1-->L46-3: Formula: (and (< (mod v_~x2~0_12 4294967296) (mod v_~n~0_21 4294967296)) (= (* v_~x2~0_12 2) v_~x2~0_11)) InVars {~n~0=v_~n~0_21, ~x2~0=v_~x2~0_12} OutVars{~n~0=v_~n~0_21, ~x2~0=v_~x2~0_11} AuxVars[] AssignedVars[~x2~0][35], [Black: 60#(<= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)), Black: 61#(<= (mod ~n~0 4294967296) (mod ~x1~0 4294967296)), Black: 63#(and (<= (mod ~n~0 4294967296) (mod ~x1~0 4294967296)) (<= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296))), 308#true, 24#L62-1true, 302#(<= (mod ~n~0 4294967296) (mod ~x3~0 4294967296)), Black: 69#(<= (mod ~x1~0 4294967296) (mod ~x2~0 4294967296)), Black: 86#true, Black: 72#(and (<= (+ (mod ~x1~0 4294967296) 1) (mod ~n~0 4294967296)) (<= (mod ~x1~0 4294967296) (mod ~x2~0 4294967296))), 290#true, Black: 67#true, Black: 93#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (<= 1 (mod ~x3~0 4294967296))), 263#(and (<= 1 (mod ~x4~0 4294967296)) (<= (+ (mod ~x4~0 4294967296) 1) (mod ~n~0 4294967296)) (<= (mod ~x4~0 4294967296) (mod ~x3~0 4294967296))), Black: 121#(and (<= 1 (mod ~x4~0 4294967296)) (<= (+ (mod ~x4~0 4294967296) 1) (mod ~n~0 4294967296))), Black: 89#(<= (+ (mod ~x4~0 4294967296) 1) (mod ~n~0 4294967296)), Black: 261#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (<= (+ (mod ~x4~0 4294967296) 1) (mod ~n~0 4294967296)) (<= 1 (mod ~x3~0 4294967296))), Black: 80#(<= (mod ~n~0 4294967296) (mod ~x2~0 4294967296)), Black: 82#(and (<= (mod ~n~0 4294967296) (mod ~x2~0 4294967296)) (<= (mod ~x1~0 4294967296) (mod ~x2~0 4294967296))), Black: 277#(and (<= (+ (mod ~x2~0 4294967296) 1) (mod ~n~0 4294967296)) (<= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296))), Black: 275#(<= (+ (mod ~x2~0 4294967296) 1) (mod ~n~0 4294967296)), 58#true, 272#true, Black: 283#(<= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)), 23#L85-4true, 281#true, Black: 286#(and (<= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (<= (mod ~n~0 4294967296) (mod ~x4~0 4294967296))), Black: 284#(<= (mod ~n~0 4294967296) (mod ~x4~0 4294967296)), 26#L38-1true, 77#true, 70#(<= (+ (mod ~x1~0 4294967296) 1) (mod ~n~0 4294967296)), Black: 293#(<= (+ (mod ~x3~0 4294967296) 1) (mod ~n~0 4294967296)), Black: 295#(and (<= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (<= (+ (mod ~x3~0 4294967296) 1) (mod ~n~0 4294967296))), 43#thread3EXITtrue, Black: 299#true, Black: 304#(and (<= (mod ~n~0 4294967296) (mod ~x3~0 4294967296)) (<= (mod ~x4~0 4294967296) (mod ~x3~0 4294967296))), Black: 56#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296))), 11#L46-3true]) [2024-11-08 19:13:47,181 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2024-11-08 19:13:47,181 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-11-08 19:13:47,181 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-11-08 19:13:47,181 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-11-08 19:13:48,163 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([296] L46-1-->L46-3: Formula: (and (< (mod v_~x2~0_12 4294967296) (mod v_~n~0_21 4294967296)) (= (* v_~x2~0_12 2) v_~x2~0_11)) InVars {~n~0=v_~n~0_21, ~x2~0=v_~x2~0_12} OutVars{~n~0=v_~n~0_21, ~x2~0=v_~x2~0_11} AuxVars[] AssignedVars[~x2~0][35], [Black: 60#(<= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)), Black: 61#(<= (mod ~n~0 4294967296) (mod ~x1~0 4294967296)), Black: 63#(and (<= (mod ~n~0 4294967296) (mod ~x1~0 4294967296)) (<= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296))), 308#true, 24#L62-1true, 302#(<= (mod ~n~0 4294967296) (mod ~x3~0 4294967296)), Black: 69#(<= (mod ~x1~0 4294967296) (mod ~x2~0 4294967296)), Black: 72#(and (<= (+ (mod ~x1~0 4294967296) 1) (mod ~n~0 4294967296)) (<= (mod ~x1~0 4294967296) (mod ~x2~0 4294967296))), Black: 86#true, Black: 67#true, 290#true, Black: 93#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (<= 1 (mod ~x3~0 4294967296))), 263#(and (<= 1 (mod ~x4~0 4294967296)) (<= (+ (mod ~x4~0 4294967296) 1) (mod ~n~0 4294967296)) (<= (mod ~x4~0 4294967296) (mod ~x3~0 4294967296))), Black: 121#(and (<= 1 (mod ~x4~0 4294967296)) (<= (+ (mod ~x4~0 4294967296) 1) (mod ~n~0 4294967296))), Black: 89#(<= (+ (mod ~x4~0 4294967296) 1) (mod ~n~0 4294967296)), Black: 261#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (<= (+ (mod ~x4~0 4294967296) 1) (mod ~n~0 4294967296)) (<= 1 (mod ~x3~0 4294967296))), Black: 80#(<= (mod ~n~0 4294967296) (mod ~x2~0 4294967296)), Black: 82#(and (<= (mod ~n~0 4294967296) (mod ~x2~0 4294967296)) (<= (mod ~x1~0 4294967296) (mod ~x2~0 4294967296))), Black: 277#(and (<= (+ (mod ~x2~0 4294967296) 1) (mod ~n~0 4294967296)) (<= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296))), Black: 275#(<= (+ (mod ~x2~0 4294967296) 1) (mod ~n~0 4294967296)), 58#true, 272#true, Black: 283#(<= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)), Black: 286#(and (<= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (<= (mod ~n~0 4294967296) (mod ~x4~0 4294967296))), 281#true, Black: 284#(<= (mod ~n~0 4294967296) (mod ~x4~0 4294967296)), 26#L38-1true, 77#true, 70#(<= (+ (mod ~x1~0 4294967296) 1) (mod ~n~0 4294967296)), Black: 293#(<= (+ (mod ~x3~0 4294967296) 1) (mod ~n~0 4294967296)), Black: 295#(and (<= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (<= (+ (mod ~x3~0 4294967296) 1) (mod ~n~0 4294967296))), Black: 299#true, 4#L86true, Black: 304#(and (<= (mod ~n~0 4294967296) (mod ~x3~0 4294967296)) (<= (mod ~x4~0 4294967296) (mod ~x3~0 4294967296))), 12#L54-4true, Black: 56#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296))), 11#L46-3true]) [2024-11-08 19:13:48,163 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2024-11-08 19:13:48,163 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-11-08 19:13:48,163 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-11-08 19:13:48,163 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-11-08 19:13:48,172 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([296] L46-1-->L46-3: Formula: (and (< (mod v_~x2~0_12 4294967296) (mod v_~n~0_21 4294967296)) (= (* v_~x2~0_12 2) v_~x2~0_11)) InVars {~n~0=v_~n~0_21, ~x2~0=v_~x2~0_12} OutVars{~n~0=v_~n~0_21, ~x2~0=v_~x2~0_11} AuxVars[] AssignedVars[~x2~0][35], [Black: 60#(<= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)), Black: 61#(<= (mod ~n~0 4294967296) (mod ~x1~0 4294967296)), 24#L62-1true, Black: 63#(and (<= (mod ~n~0 4294967296) (mod ~x1~0 4294967296)) (<= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296))), 308#true, 302#(<= (mod ~n~0 4294967296) (mod ~x3~0 4294967296)), Black: 69#(<= (mod ~x1~0 4294967296) (mod ~x2~0 4294967296)), Black: 72#(and (<= (+ (mod ~x1~0 4294967296) 1) (mod ~n~0 4294967296)) (<= (mod ~x1~0 4294967296) (mod ~x2~0 4294967296))), Black: 86#true, Black: 67#true, 290#true, Black: 93#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (<= 1 (mod ~x3~0 4294967296))), 263#(and (<= 1 (mod ~x4~0 4294967296)) (<= (+ (mod ~x4~0 4294967296) 1) (mod ~n~0 4294967296)) (<= (mod ~x4~0 4294967296) (mod ~x3~0 4294967296))), Black: 121#(and (<= 1 (mod ~x4~0 4294967296)) (<= (+ (mod ~x4~0 4294967296) 1) (mod ~n~0 4294967296))), Black: 89#(<= (+ (mod ~x4~0 4294967296) 1) (mod ~n~0 4294967296)), Black: 261#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (<= (+ (mod ~x4~0 4294967296) 1) (mod ~n~0 4294967296)) (<= 1 (mod ~x3~0 4294967296))), Black: 80#(<= (mod ~n~0 4294967296) (mod ~x2~0 4294967296)), Black: 82#(and (<= (mod ~n~0 4294967296) (mod ~x2~0 4294967296)) (<= (mod ~x1~0 4294967296) (mod ~x2~0 4294967296))), Black: 277#(and (<= (+ (mod ~x2~0 4294967296) 1) (mod ~n~0 4294967296)) (<= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296))), Black: 275#(<= (+ (mod ~x2~0 4294967296) 1) (mod ~n~0 4294967296)), 58#true, 272#true, Black: 283#(<= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)), Black: 286#(and (<= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (<= (mod ~n~0 4294967296) (mod ~x4~0 4294967296))), 281#true, Black: 284#(<= (mod ~n~0 4294967296) (mod ~x4~0 4294967296)), 26#L38-1true, 77#true, 70#(<= (+ (mod ~x1~0 4294967296) 1) (mod ~n~0 4294967296)), Black: 293#(<= (+ (mod ~x3~0 4294967296) 1) (mod ~n~0 4294967296)), Black: 295#(and (<= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (<= (+ (mod ~x3~0 4294967296) 1) (mod ~n~0 4294967296))), 43#thread3EXITtrue, Black: 299#true, 4#L86true, Black: 304#(and (<= (mod ~n~0 4294967296) (mod ~x3~0 4294967296)) (<= (mod ~x4~0 4294967296) (mod ~x3~0 4294967296))), Black: 56#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296))), 11#L46-3true]) [2024-11-08 19:13:48,172 INFO L294 olderBase$Statistics]: this new event has 25 ancestors and is cut-off event [2024-11-08 19:13:48,172 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-11-08 19:13:48,173 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-11-08 19:13:48,173 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-11-08 19:13:48,293 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([296] L46-1-->L46-3: Formula: (and (< (mod v_~x2~0_12 4294967296) (mod v_~n~0_21 4294967296)) (= (* v_~x2~0_12 2) v_~x2~0_11)) InVars {~n~0=v_~n~0_21, ~x2~0=v_~x2~0_12} OutVars{~n~0=v_~n~0_21, ~x2~0=v_~x2~0_11} AuxVars[] AssignedVars[~x2~0][95], [Black: 60#(<= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)), Black: 61#(<= (mod ~n~0 4294967296) (mod ~x1~0 4294967296)), Black: 63#(and (<= (mod ~n~0 4294967296) (mod ~x1~0 4294967296)) (<= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296))), 24#L62-1true, 308#true, 299#true, Black: 69#(<= (mod ~x1~0 4294967296) (mod ~x2~0 4294967296)), Black: 72#(and (<= (+ (mod ~x1~0 4294967296) 1) (mod ~n~0 4294967296)) (<= (mod ~x1~0 4294967296) (mod ~x2~0 4294967296))), Black: 86#true, Black: 67#true, Black: 93#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (<= 1 (mod ~x3~0 4294967296))), Black: 263#(and (<= 1 (mod ~x4~0 4294967296)) (<= (+ (mod ~x4~0 4294967296) 1) (mod ~n~0 4294967296)) (<= (mod ~x4~0 4294967296) (mod ~x3~0 4294967296))), Black: 89#(<= (+ (mod ~x4~0 4294967296) 1) (mod ~n~0 4294967296)), Black: 261#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (<= (+ (mod ~x4~0 4294967296) 1) (mod ~n~0 4294967296)) (<= 1 (mod ~x3~0 4294967296))), Black: 80#(<= (mod ~n~0 4294967296) (mod ~x2~0 4294967296)), Black: 82#(and (<= (mod ~n~0 4294967296) (mod ~x2~0 4294967296)) (<= (mod ~x1~0 4294967296) (mod ~x2~0 4294967296))), Black: 277#(and (<= (+ (mod ~x2~0 4294967296) 1) (mod ~n~0 4294967296)) (<= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296))), 39#L54-1true, Black: 275#(<= (+ (mod ~x2~0 4294967296) 1) (mod ~n~0 4294967296)), 58#true, 272#true, 121#(and (<= 1 (mod ~x4~0 4294967296)) (<= (+ (mod ~x4~0 4294967296) 1) (mod ~n~0 4294967296))), Black: 283#(<= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)), 23#L85-4true, 281#true, Black: 286#(and (<= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (<= (mod ~n~0 4294967296) (mod ~x4~0 4294967296))), Black: 284#(<= (mod ~n~0 4294967296) (mod ~x4~0 4294967296)), 26#L38-1true, 77#true, 70#(<= (+ (mod ~x1~0 4294967296) 1) (mod ~n~0 4294967296)), Black: 290#true, Black: 295#(and (<= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (<= (+ (mod ~x3~0 4294967296) 1) (mod ~n~0 4294967296))), Black: 302#(<= (mod ~n~0 4294967296) (mod ~x3~0 4294967296)), Black: 304#(and (<= (mod ~n~0 4294967296) (mod ~x3~0 4294967296)) (<= (mod ~x4~0 4294967296) (mod ~x3~0 4294967296))), Black: 56#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296))), 11#L46-3true, 293#(<= (+ (mod ~x3~0 4294967296) 1) (mod ~n~0 4294967296))]) [2024-11-08 19:13:48,293 INFO L294 olderBase$Statistics]: this new event has 25 ancestors and is cut-off event [2024-11-08 19:13:48,293 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-11-08 19:13:48,294 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-11-08 19:13:48,294 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-11-08 19:13:48,670 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([296] L46-1-->L46-3: Formula: (and (< (mod v_~x2~0_12 4294967296) (mod v_~n~0_21 4294967296)) (= (* v_~x2~0_12 2) v_~x2~0_11)) InVars {~n~0=v_~n~0_21, ~x2~0=v_~x2~0_12} OutVars{~n~0=v_~n~0_21, ~x2~0=v_~x2~0_11} AuxVars[] AssignedVars[~x2~0][95], [Black: 60#(<= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)), Black: 61#(<= (mod ~n~0 4294967296) (mod ~x1~0 4294967296)), 24#L62-1true, Black: 63#(and (<= (mod ~n~0 4294967296) (mod ~x1~0 4294967296)) (<= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296))), 308#true, 299#true, Black: 69#(<= (mod ~x1~0 4294967296) (mod ~x2~0 4294967296)), Black: 86#true, Black: 72#(and (<= (+ (mod ~x1~0 4294967296) 1) (mod ~n~0 4294967296)) (<= (mod ~x1~0 4294967296) (mod ~x2~0 4294967296))), Black: 67#true, Black: 93#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (<= 1 (mod ~x3~0 4294967296))), Black: 263#(and (<= 1 (mod ~x4~0 4294967296)) (<= (+ (mod ~x4~0 4294967296) 1) (mod ~n~0 4294967296)) (<= (mod ~x4~0 4294967296) (mod ~x3~0 4294967296))), Black: 89#(<= (+ (mod ~x4~0 4294967296) 1) (mod ~n~0 4294967296)), Black: 261#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (<= (+ (mod ~x4~0 4294967296) 1) (mod ~n~0 4294967296)) (<= 1 (mod ~x3~0 4294967296))), Black: 80#(<= (mod ~n~0 4294967296) (mod ~x2~0 4294967296)), Black: 82#(and (<= (mod ~n~0 4294967296) (mod ~x2~0 4294967296)) (<= (mod ~x1~0 4294967296) (mod ~x2~0 4294967296))), Black: 277#(and (<= (+ (mod ~x2~0 4294967296) 1) (mod ~n~0 4294967296)) (<= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296))), 39#L54-1true, Black: 275#(<= (+ (mod ~x2~0 4294967296) 1) (mod ~n~0 4294967296)), 58#true, 272#true, 121#(and (<= 1 (mod ~x4~0 4294967296)) (<= (+ (mod ~x4~0 4294967296) 1) (mod ~n~0 4294967296))), Black: 283#(<= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)), 281#true, Black: 286#(and (<= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (<= (mod ~n~0 4294967296) (mod ~x4~0 4294967296))), Black: 284#(<= (mod ~n~0 4294967296) (mod ~x4~0 4294967296)), 26#L38-1true, 77#true, 70#(<= (+ (mod ~x1~0 4294967296) 1) (mod ~n~0 4294967296)), Black: 290#true, Black: 295#(and (<= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (<= (+ (mod ~x3~0 4294967296) 1) (mod ~n~0 4294967296))), Black: 302#(<= (mod ~n~0 4294967296) (mod ~x3~0 4294967296)), 4#L86true, Black: 304#(and (<= (mod ~n~0 4294967296) (mod ~x3~0 4294967296)) (<= (mod ~x4~0 4294967296) (mod ~x3~0 4294967296))), Black: 56#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296))), 11#L46-3true, 293#(<= (+ (mod ~x3~0 4294967296) 1) (mod ~n~0 4294967296))]) [2024-11-08 19:13:48,670 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2024-11-08 19:13:48,670 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-11-08 19:13:48,670 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-11-08 19:13:48,671 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-11-08 19:13:50,251 INFO L124 PetriNetUnfolderBase]: 38773/52625 cut-off events. [2024-11-08 19:13:50,251 INFO L125 PetriNetUnfolderBase]: For 383173/394071 co-relation queries the response was YES. [2024-11-08 19:13:50,675 INFO L83 FinitePrefix]: Finished finitePrefix Result has 265173 conditions, 52625 events. 38773/52625 cut-off events. For 383173/394071 co-relation queries the response was YES. Maximal size of possible extension queue 2243. Compared 323167 event pairs, 2832 based on Foata normal form. 1951/52790 useless extension candidates. Maximal degree in co-relation 180100. Up to 20699 conditions per place. [2024-11-08 19:13:50,864 INFO L140 encePairwiseOnDemand]: 36/46 looper letters, 443 selfloop transitions, 300 changer transitions 23/781 dead transitions. [2024-11-08 19:13:50,864 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 781 transitions, 8278 flow [2024-11-08 19:13:50,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-08 19:13:50,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2024-11-08 19:13:50,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 808 transitions. [2024-11-08 19:13:50,867 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6273291925465838 [2024-11-08 19:13:50,868 INFO L175 Difference]: Start difference. First operand has 98 places, 86 transitions, 817 flow. Second operand 28 states and 808 transitions. [2024-11-08 19:13:50,868 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 781 transitions, 8278 flow [2024-11-08 19:13:52,125 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 781 transitions, 8225 flow, removed 19 selfloop flow, removed 1 redundant places. [2024-11-08 19:13:52,136 INFO L231 Difference]: Finished difference. Result has 141 places, 394 transitions, 5821 flow [2024-11-08 19:13:52,136 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=806, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=28, PETRI_FLOW=5821, PETRI_PLACES=141, PETRI_TRANSITIONS=394} [2024-11-08 19:13:52,137 INFO L277 CegarLoopForPetriNet]: 46 programPoint places, 95 predicate places. [2024-11-08 19:13:52,137 INFO L471 AbstractCegarLoop]: Abstraction has has 141 places, 394 transitions, 5821 flow [2024-11-08 19:13:52,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 15.947368421052632) internal successors, (303), 19 states have internal predecessors, (303), 0 states have call successors, (0), 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-08 19:13:52,137 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 19:13:52,138 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:13:52,160 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31da613e-98b8-43ce-b175-f7880ccb330e/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-08 19:13:52,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31da613e-98b8-43ce-b175-f7880ccb330e/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-08 19:13:52,338 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-08 19:13:52,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:13:52,339 INFO L85 PathProgramCache]: Analyzing trace with hash -459910624, now seen corresponding path program 2 times [2024-11-08 19:13:52,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:13:52,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905959690] [2024-11-08 19:13:52,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:13:52,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:13:52,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:13:53,193 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:13:53,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:13:53,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905959690] [2024-11-08 19:13:53,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905959690] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 19:13:53,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [615285546] [2024-11-08 19:13:53,194 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-08 19:13:53,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 19:13:53,195 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31da613e-98b8-43ce-b175-f7880ccb330e/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 19:13:53,196 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31da613e-98b8-43ce-b175-f7880ccb330e/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 19:13:53,199 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31da613e-98b8-43ce-b175-f7880ccb330e/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-08 19:13:53,405 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-08 19:13:53,405 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 19:13:53,406 INFO L255 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-08 19:13:53,408 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 19:15:39,814 WARN L286 SmtUtils]: Spent 12.15s 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-08 19:16:24,298 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:16:24,298 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 19:17:02,452 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:17:02,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [615285546] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 19:17:02,453 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 19:17:02,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 18 [2024-11-08 19:17:02,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264836340] [2024-11-08 19:17:02,453 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 19:17:02,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-08 19:17:02,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:17:02,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-08 19:17:02,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=243, Unknown=23, NotChecked=0, Total=342 [2024-11-08 19:17:06,459 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-08 19:17:10,466 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-08 19:17:14,474 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-08 19:17:18,480 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-08 19:17:22,487 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-08 19:17:26,496 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-08 19:17:30,503 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-08 19:17:34,510 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-08 19:17:38,517 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-08 19:17:42,523 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-08 19:17:46,531 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-08 19:17:50,538 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-08 19:17:50,539 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2024-11-08 19:17:50,539 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 394 transitions, 5821 flow. Second operand has 19 states, 19 states have (on average 13.894736842105264) internal successors, (264), 19 states have internal predecessors, (264), 0 states have call successors, (0), 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-08 19:17:50,539 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 19:17:50,539 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2024-11-08 19:17:50,539 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 19:17:56,207 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-08 19:18:01,964 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-08 19:18:06,021 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-08 19:18:16,536 WARN L286 SmtUtils]: Spent 5.71s on a formula simplification. DAG size of input: 52 DAG size of output: 38 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-08 19:18:32,254 WARN L286 SmtUtils]: Spent 7.05s on a formula simplification. DAG size of input: 58 DAG size of output: 39 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-08 19:18:36,707 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-08 19:18:38,309 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.59s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 19:18:40,087 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.78s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 19:18:42,376 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.25s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 19:18:46,410 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-08 19:18:47,431 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 19:19:02,961 WARN L286 SmtUtils]: Spent 6.23s on a formula simplification. DAG size of input: 58 DAG size of output: 45 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-08 19:19:07,236 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-08 19:19:12,687 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-08 19:19:16,312 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.53s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 19:19:17,691 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 19:19:21,791 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-08 19:19:26,252 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-08 19:19:30,363 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-08 19:19:31,870 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 19:19:55,570 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-08 19:19:59,782 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-08 19:20:01,564 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.78s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 19:20:05,728 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-08 19:20:07,650 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.89s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 19:20:12,320 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-08 19:20:16,325 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-08 19:20:20,328 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-08 19:20:24,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-08 19:20:28,654 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-08 19:20:37,773 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-08 19:20:42,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-08 19:20:46,476 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-08 19:20:50,216 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.72s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 19:20:53,080 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.85s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 19:20:57,089 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-08 19:21:01,229 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-08 19:21:05,247 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-08 19:21:10,284 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-08 19:21:13,924 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.64s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 19:21:26,947 WARN L286 SmtUtils]: Spent 8.08s on a formula simplification. DAG size of input: 38 DAG size of output: 35 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-08 19:21:30,969 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-08 19:21:34,977 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-08 19:21:37,664 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.69s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 19:21:41,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-08 19:21:44,340 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.67s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 19:21:48,682 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.44s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 19:21:51,062 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.85s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 19:21:56,958 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-08 19:22:00,969 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-08 19:22:02,989 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.74s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 19:22:18,341 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-08 19:22:22,492 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-08 19:22:32,197 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-08 19:22:37,038 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-08 19:22:52,258 INFO L124 PetriNetUnfolderBase]: 83290/110801 cut-off events. [2024-11-08 19:22:52,258 INFO L125 PetriNetUnfolderBase]: For 1107229/1107243 co-relation queries the response was YES. [2024-11-08 19:22:53,012 INFO L83 FinitePrefix]: Finished finitePrefix Result has 644211 conditions, 110801 events. 83290/110801 cut-off events. For 1107229/1107243 co-relation queries the response was YES. Maximal size of possible extension queue 4530. Compared 706410 event pairs, 10788 based on Foata normal form. 70/110850 useless extension candidates. Maximal degree in co-relation 640668. Up to 61910 conditions per place. [2024-11-08 19:22:53,832 INFO L140 encePairwiseOnDemand]: 36/46 looper letters, 711 selfloop transitions, 528 changer transitions 23/1267 dead transitions. [2024-11-08 19:22:53,832 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 1267 transitions, 18588 flow [2024-11-08 19:22:53,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-08 19:22:53,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2024-11-08 19:22:53,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 683 transitions. [2024-11-08 19:22:53,837 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5939130434782609 [2024-11-08 19:22:53,838 INFO L175 Difference]: Start difference. First operand has 141 places, 394 transitions, 5821 flow. Second operand 25 states and 683 transitions. [2024-11-08 19:22:53,838 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 1267 transitions, 18588 flow [2024-11-08 19:23:23,361 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 1267 transitions, 17947 flow, removed 317 selfloop flow, removed 1 redundant places. [2024-11-08 19:23:23,376 INFO L231 Difference]: Finished difference. Result has 177 places, 802 transitions, 14273 flow [2024-11-08 19:23:23,377 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=5462, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=394, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=189, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=14273, PETRI_PLACES=177, PETRI_TRANSITIONS=802} [2024-11-08 19:23:23,377 INFO L277 CegarLoopForPetriNet]: 46 programPoint places, 131 predicate places. [2024-11-08 19:23:23,378 INFO L471 AbstractCegarLoop]: Abstraction has has 177 places, 802 transitions, 14273 flow [2024-11-08 19:23:23,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 13.894736842105264) internal successors, (264), 19 states have internal predecessors, (264), 0 states have call successors, (0), 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-08 19:23:23,378 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 19:23:23,378 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:23:23,391 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31da613e-98b8-43ce-b175-f7880ccb330e/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-08 19:23:23,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31da613e-98b8-43ce-b175-f7880ccb330e/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 19:23:23,579 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-08 19:23:23,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:23:23,580 INFO L85 PathProgramCache]: Analyzing trace with hash 1197200002, now seen corresponding path program 1 times [2024-11-08 19:23:23,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:23:23,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841812384] [2024-11-08 19:23:23,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:23:23,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:23:23,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:23:24,405 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:23:24,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:23:24,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841812384] [2024-11-08 19:23:24,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841812384] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 19:23:24,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1120628756] [2024-11-08 19:23:24,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:23:24,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 19:23:24,406 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31da613e-98b8-43ce-b175-f7880ccb330e/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 19:23:24,408 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31da613e-98b8-43ce-b175-f7880ccb330e/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 19:23:24,409 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31da613e-98b8-43ce-b175-f7880ccb330e/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-08 19:23:24,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:23:24,597 INFO L255 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-08 19:23:24,599 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 19:23:27,344 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:23:27,344 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 19:23:29,166 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:23:29,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1120628756] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 19:23:29,167 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 19:23:29,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 18 [2024-11-08 19:23:29,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368640594] [2024-11-08 19:23:29,167 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 19:23:29,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-08 19:23:29,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:23:29,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-08 19:23:29,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2024-11-08 19:23:33,651 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.78s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 19:23:38,013 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.80s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 19:23:38,143 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 46 [2024-11-08 19:23:38,144 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 802 transitions, 14273 flow. Second operand has 19 states, 19 states have (on average 15.789473684210526) internal successors, (300), 19 states have internal predecessors, (300), 0 states have call successors, (0), 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-08 19:23:38,144 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 19:23:38,144 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 46 [2024-11-08 19:23:38,144 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand