./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/mix026_pso.opt_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0006e79-8d33-487c-b435-1f4741572d13/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0006e79-8d33-487c-b435-1f4741572d13/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0006e79-8d33-487c-b435-1f4741572d13/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0006e79-8d33-487c-b435-1f4741572d13/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix026_pso.opt_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0006e79-8d33-487c-b435-1f4741572d13/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0006e79-8d33-487c-b435-1f4741572d13/bin/uautomizer-verify-BQ2R08f2Ya --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 a0c922061e4dc1feb6389a43fa3f654e69e326084cac4d5446a529710663ff29 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 04:02:11,732 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 04:02:11,795 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0006e79-8d33-487c-b435-1f4741572d13/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-29 04:02:11,800 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 04:02:11,800 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 04:02:11,826 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 04:02:11,826 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 04:02:11,827 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 04:02:11,827 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 04:02:11,828 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 04:02:11,828 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 04:02:11,829 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 04:02:11,830 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 04:02:11,830 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 04:02:11,830 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 04:02:11,831 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 04:02:11,832 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 04:02:11,832 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 04:02:11,833 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 04:02:11,833 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 04:02:11,834 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-29 04:02:11,834 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-29 04:02:11,835 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-29 04:02:11,835 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 04:02:11,836 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 04:02:11,836 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 04:02:11,837 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 04:02:11,837 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 04:02:11,838 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 04:02:11,838 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 04:02:11,839 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 04:02:11,839 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 04:02:11,839 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 04:02:11,840 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 04:02:11,840 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 04:02:11,841 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 04:02:11,841 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 04:02:11,841 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 04:02:11,842 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 04:02:11,842 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 04:02:11,842 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 04:02:11,843 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_f0006e79-8d33-487c-b435-1f4741572d13/bin/uautomizer-verify-BQ2R08f2Ya/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_f0006e79-8d33-487c-b435-1f4741572d13/bin/uautomizer-verify-BQ2R08f2Ya 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 -> a0c922061e4dc1feb6389a43fa3f654e69e326084cac4d5446a529710663ff29 [2023-11-29 04:02:12,050 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 04:02:12,082 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 04:02:12,085 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 04:02:12,086 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 04:02:12,087 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 04:02:12,088 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0006e79-8d33-487c-b435-1f4741572d13/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/pthread-wmm/mix026_pso.opt_rmo.opt.i [2023-11-29 04:02:14,882 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 04:02:15,110 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 04:02:15,111 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0006e79-8d33-487c-b435-1f4741572d13/sv-benchmarks/c/pthread-wmm/mix026_pso.opt_rmo.opt.i [2023-11-29 04:02:15,126 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0006e79-8d33-487c-b435-1f4741572d13/bin/uautomizer-verify-BQ2R08f2Ya/data/e64e03553/a52336a0da394abdb14b8f813488629e/FLAGe7e073fbf [2023-11-29 04:02:15,137 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0006e79-8d33-487c-b435-1f4741572d13/bin/uautomizer-verify-BQ2R08f2Ya/data/e64e03553/a52336a0da394abdb14b8f813488629e [2023-11-29 04:02:15,139 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 04:02:15,140 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 04:02:15,141 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 04:02:15,141 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 04:02:15,145 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 04:02:15,146 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 04:02:15" (1/1) ... [2023-11-29 04:02:15,147 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e76332a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:02:15, skipping insertion in model container [2023-11-29 04:02:15,147 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 04:02:15" (1/1) ... [2023-11-29 04:02:15,197 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 04:02:15,495 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 04:02:15,506 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 04:02:15,562 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 04:02:15,591 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 04:02:15,592 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 04:02:15,597 INFO L206 MainTranslator]: Completed translation [2023-11-29 04:02:15,598 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:02:15 WrapperNode [2023-11-29 04:02:15,598 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 04:02:15,599 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 04:02:15,599 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 04:02:15,599 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 04:02:15,605 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:02:15" (1/1) ... [2023-11-29 04:02:15,622 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:02:15" (1/1) ... [2023-11-29 04:02:15,648 INFO L138 Inliner]: procedures = 177, calls = 70, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 150 [2023-11-29 04:02:15,648 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 04:02:15,649 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 04:02:15,649 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 04:02:15,650 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 04:02:15,659 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:02:15" (1/1) ... [2023-11-29 04:02:15,660 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:02:15" (1/1) ... [2023-11-29 04:02:15,664 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:02:15" (1/1) ... [2023-11-29 04:02:15,686 INFO L175 MemorySlicer]: Split 6 memory accesses to 5 slices as follows [2, 1, 1, 1, 1]. 33 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0, 0]. The 4 writes are split as follows [0, 1, 1, 1, 1]. [2023-11-29 04:02:15,687 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:02:15" (1/1) ... [2023-11-29 04:02:15,687 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:02:15" (1/1) ... [2023-11-29 04:02:15,698 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:02:15" (1/1) ... [2023-11-29 04:02:15,700 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:02:15" (1/1) ... [2023-11-29 04:02:15,703 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:02:15" (1/1) ... [2023-11-29 04:02:15,706 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:02:15" (1/1) ... [2023-11-29 04:02:15,711 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 04:02:15,712 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 04:02:15,712 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 04:02:15,712 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 04:02:15,713 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:02:15" (1/1) ... [2023-11-29 04:02:15,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 04:02:15,729 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0006e79-8d33-487c-b435-1f4741572d13/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:02:15,740 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0006e79-8d33-487c-b435-1f4741572d13/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 04:02:15,743 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0006e79-8d33-487c-b435-1f4741572d13/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 04:02:15,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-29 04:02:15,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-29 04:02:15,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-29 04:02:15,771 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-11-29 04:02:15,771 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2023-11-29 04:02:15,771 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-29 04:02:15,771 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 04:02:15,771 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 04:02:15,771 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 04:02:15,771 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-29 04:02:15,772 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-29 04:02:15,772 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-29 04:02:15,772 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-29 04:02:15,772 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-29 04:02:15,772 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-29 04:02:15,772 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-11-29 04:02:15,772 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-11-29 04:02:15,773 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 04:02:15,773 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-29 04:02:15,773 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-29 04:02:15,773 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-11-29 04:02:15,773 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2023-11-29 04:02:15,773 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-29 04:02:15,774 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 04:02:15,774 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 04:02:15,775 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-29 04:02:15,916 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 04:02:15,918 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 04:02:16,216 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 04:02:16,447 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 04:02:16,447 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-29 04:02:16,447 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 04:02:16 BoogieIcfgContainer [2023-11-29 04:02:16,447 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 04:02:16,450 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 04:02:16,450 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 04:02:16,454 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 04:02:16,454 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 04:02:15" (1/3) ... [2023-11-29 04:02:16,455 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@328e3d73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 04:02:16, skipping insertion in model container [2023-11-29 04:02:16,455 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:02:15" (2/3) ... [2023-11-29 04:02:16,455 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@328e3d73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 04:02:16, skipping insertion in model container [2023-11-29 04:02:16,456 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 04:02:16" (3/3) ... [2023-11-29 04:02:16,457 INFO L112 eAbstractionObserver]: Analyzing ICFG mix026_pso.opt_rmo.opt.i [2023-11-29 04:02:16,474 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 04:02:16,474 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2023-11-29 04:02:16,474 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-29 04:02:16,531 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-29 04:02:16,567 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 77 places, 66 transitions, 148 flow [2023-11-29 04:02:16,607 INFO L124 PetriNetUnfolderBase]: 2/62 cut-off events. [2023-11-29 04:02:16,607 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 04:02:16,612 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75 conditions, 62 events. 2/62 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 132 event pairs, 0 based on Foata normal form. 0/49 useless extension candidates. Maximal degree in co-relation 63. Up to 2 conditions per place. [2023-11-29 04:02:16,612 INFO L82 GeneralOperation]: Start removeDead. Operand has 77 places, 66 transitions, 148 flow [2023-11-29 04:02:16,616 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 73 places, 62 transitions, 136 flow [2023-11-29 04:02:16,627 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 04:02:16,633 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4612c871, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 04:02:16,633 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-11-29 04:02:16,637 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-29 04:02:16,637 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-11-29 04:02:16,637 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 04:02:16,637 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:02:16,638 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-29 04:02:16,639 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 04:02:16,644 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:02:16,644 INFO L85 PathProgramCache]: Analyzing trace with hash 13782, now seen corresponding path program 1 times [2023-11-29 04:02:16,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:02:16,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74490591] [2023-11-29 04:02:16,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:02:16,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:02:16,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:02:16,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:02:16,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:02:16,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74490591] [2023-11-29 04:02:16,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74490591] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:02:16,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:02:16,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 04:02:16,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983766571] [2023-11-29 04:02:16,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:02:16,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:02:16,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:02:16,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:02:16,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:02:16,967 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 66 [2023-11-29 04:02:16,970 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 62 transitions, 136 flow. Second operand has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:02:16,970 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:02:16,970 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 66 [2023-11-29 04:02:16,971 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:02:17,700 INFO L124 PetriNetUnfolderBase]: 1941/3575 cut-off events. [2023-11-29 04:02:17,700 INFO L125 PetriNetUnfolderBase]: For 38/38 co-relation queries the response was YES. [2023-11-29 04:02:17,715 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6398 conditions, 3575 events. 1941/3575 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 266. Compared 28307 event pairs, 1467 based on Foata normal form. 180/3414 useless extension candidates. Maximal degree in co-relation 6383. Up to 2085 conditions per place. [2023-11-29 04:02:17,742 INFO L140 encePairwiseOnDemand]: 61/66 looper letters, 32 selfloop transitions, 2 changer transitions 0/67 dead transitions. [2023-11-29 04:02:17,743 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 67 transitions, 214 flow [2023-11-29 04:02:17,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:02:17,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 04:02:17,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 148 transitions. [2023-11-29 04:02:17,756 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7474747474747475 [2023-11-29 04:02:17,756 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 148 transitions. [2023-11-29 04:02:17,757 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 148 transitions. [2023-11-29 04:02:17,758 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:02:17,760 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 148 transitions. [2023-11-29 04:02:17,763 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:02:17,767 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 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) [2023-11-29 04:02:17,767 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 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) [2023-11-29 04:02:17,769 INFO L175 Difference]: Start difference. First operand has 73 places, 62 transitions, 136 flow. Second operand 3 states and 148 transitions. [2023-11-29 04:02:17,770 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 67 transitions, 214 flow [2023-11-29 04:02:17,775 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 67 transitions, 210 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-29 04:02:17,778 INFO L231 Difference]: Finished difference. Result has 69 places, 58 transitions, 128 flow [2023-11-29 04:02:17,780 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=128, PETRI_PLACES=69, PETRI_TRANSITIONS=58} [2023-11-29 04:02:17,784 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, -4 predicate places. [2023-11-29 04:02:17,784 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 58 transitions, 128 flow [2023-11-29 04:02:17,784 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:02:17,784 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:02:17,785 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-29 04:02:17,785 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 04:02:17,785 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 04:02:17,786 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:02:17,786 INFO L85 PathProgramCache]: Analyzing trace with hash 13783, now seen corresponding path program 1 times [2023-11-29 04:02:17,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:02:17,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720729557] [2023-11-29 04:02:17,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:02:17,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:02:17,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:02:17,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:02:17,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:02:17,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720729557] [2023-11-29 04:02:17,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720729557] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:02:17,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:02:17,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 04:02:17,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733760579] [2023-11-29 04:02:17,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:02:17,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:02:17,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:02:17,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:02:17,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:02:17,912 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 66 [2023-11-29 04:02:17,913 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 58 transitions, 128 flow. Second operand has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:02:17,913 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:02:17,913 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 66 [2023-11-29 04:02:17,913 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:02:18,466 INFO L124 PetriNetUnfolderBase]: 1941/3574 cut-off events. [2023-11-29 04:02:18,466 INFO L125 PetriNetUnfolderBase]: For 90/90 co-relation queries the response was YES. [2023-11-29 04:02:18,471 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6484 conditions, 3574 events. 1941/3574 cut-off events. For 90/90 co-relation queries the response was YES. Maximal size of possible extension queue 266. Compared 28351 event pairs, 1467 based on Foata normal form. 1/3234 useless extension candidates. Maximal degree in co-relation 6473. Up to 2084 conditions per place. [2023-11-29 04:02:18,490 INFO L140 encePairwiseOnDemand]: 63/66 looper letters, 31 selfloop transitions, 2 changer transitions 0/66 dead transitions. [2023-11-29 04:02:18,490 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 66 transitions, 210 flow [2023-11-29 04:02:18,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:02:18,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 04:02:18,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 148 transitions. [2023-11-29 04:02:18,493 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7474747474747475 [2023-11-29 04:02:18,493 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 148 transitions. [2023-11-29 04:02:18,493 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 148 transitions. [2023-11-29 04:02:18,493 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:02:18,494 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 148 transitions. [2023-11-29 04:02:18,495 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:02:18,496 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 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) [2023-11-29 04:02:18,496 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 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) [2023-11-29 04:02:18,496 INFO L175 Difference]: Start difference. First operand has 69 places, 58 transitions, 128 flow. Second operand 3 states and 148 transitions. [2023-11-29 04:02:18,497 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 66 transitions, 210 flow [2023-11-29 04:02:18,502 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 66 transitions, 206 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 04:02:18,533 INFO L231 Difference]: Finished difference. Result has 68 places, 57 transitions, 126 flow [2023-11-29 04:02:18,534 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=126, PETRI_PLACES=68, PETRI_TRANSITIONS=57} [2023-11-29 04:02:18,535 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, -5 predicate places. [2023-11-29 04:02:18,535 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 57 transitions, 126 flow [2023-11-29 04:02:18,535 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:02:18,535 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:02:18,535 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-29 04:02:18,536 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 04:02:18,536 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 04:02:18,536 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:02:18,536 INFO L85 PathProgramCache]: Analyzing trace with hash 411002765, now seen corresponding path program 1 times [2023-11-29 04:02:18,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:02:18,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810476451] [2023-11-29 04:02:18,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:02:18,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:02:18,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:02:18,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:02:18,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:02:18,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810476451] [2023-11-29 04:02:18,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810476451] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:02:18,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:02:18,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 04:02:18,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303054620] [2023-11-29 04:02:18,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:02:18,604 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:02:18,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:02:18,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:02:18,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:02:18,622 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 66 [2023-11-29 04:02:18,623 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 57 transitions, 126 flow. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:02:18,623 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:02:18,623 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 66 [2023-11-29 04:02:18,623 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:02:19,187 INFO L124 PetriNetUnfolderBase]: 1942/3572 cut-off events. [2023-11-29 04:02:19,187 INFO L125 PetriNetUnfolderBase]: For 90/90 co-relation queries the response was YES. [2023-11-29 04:02:19,194 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6485 conditions, 3572 events. 1942/3572 cut-off events. For 90/90 co-relation queries the response was YES. Maximal size of possible extension queue 266. Compared 28166 event pairs, 1467 based on Foata normal form. 0/3235 useless extension candidates. Maximal degree in co-relation 6474. Up to 2084 conditions per place. [2023-11-29 04:02:19,216 INFO L140 encePairwiseOnDemand]: 63/66 looper letters, 32 selfloop transitions, 2 changer transitions 0/65 dead transitions. [2023-11-29 04:02:19,216 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 65 transitions, 210 flow [2023-11-29 04:02:19,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:02:19,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 04:02:19,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 146 transitions. [2023-11-29 04:02:19,218 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7373737373737373 [2023-11-29 04:02:19,218 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 146 transitions. [2023-11-29 04:02:19,218 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 146 transitions. [2023-11-29 04:02:19,218 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:02:19,218 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 146 transitions. [2023-11-29 04:02:19,219 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:02:19,220 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 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) [2023-11-29 04:02:19,221 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 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) [2023-11-29 04:02:19,221 INFO L175 Difference]: Start difference. First operand has 68 places, 57 transitions, 126 flow. Second operand 3 states and 146 transitions. [2023-11-29 04:02:19,221 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 65 transitions, 210 flow [2023-11-29 04:02:19,226 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 65 transitions, 206 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 04:02:19,228 INFO L231 Difference]: Finished difference. Result has 67 places, 56 transitions, 124 flow [2023-11-29 04:02:19,228 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=124, PETRI_PLACES=67, PETRI_TRANSITIONS=56} [2023-11-29 04:02:19,229 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, -6 predicate places. [2023-11-29 04:02:19,229 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 56 transitions, 124 flow [2023-11-29 04:02:19,229 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:02:19,229 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:02:19,229 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-29 04:02:19,230 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 04:02:19,230 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 04:02:19,230 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:02:19,230 INFO L85 PathProgramCache]: Analyzing trace with hash 411002766, now seen corresponding path program 1 times [2023-11-29 04:02:19,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:02:19,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369342610] [2023-11-29 04:02:19,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:02:19,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:02:19,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:02:19,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:02:19,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:02:19,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369342610] [2023-11-29 04:02:19,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369342610] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:02:19,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:02:19,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 04:02:19,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698373521] [2023-11-29 04:02:19,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:02:19,304 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:02:19,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:02:19,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:02:19,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:02:19,323 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 66 [2023-11-29 04:02:19,323 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 56 transitions, 124 flow. Second operand has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:02:19,323 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:02:19,324 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 66 [2023-11-29 04:02:19,324 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:02:19,940 INFO L124 PetriNetUnfolderBase]: 1941/3570 cut-off events. [2023-11-29 04:02:19,940 INFO L125 PetriNetUnfolderBase]: For 91/91 co-relation queries the response was YES. [2023-11-29 04:02:19,947 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6481 conditions, 3570 events. 1941/3570 cut-off events. For 91/91 co-relation queries the response was YES. Maximal size of possible extension queue 266. Compared 27876 event pairs, 1250 based on Foata normal form. 2/3236 useless extension candidates. Maximal degree in co-relation 6471. Up to 2081 conditions per place. [2023-11-29 04:02:19,964 INFO L140 encePairwiseOnDemand]: 63/66 looper letters, 31 selfloop transitions, 2 changer transitions 0/64 dead transitions. [2023-11-29 04:02:19,964 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 64 transitions, 206 flow [2023-11-29 04:02:19,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:02:19,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 04:02:19,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 148 transitions. [2023-11-29 04:02:19,966 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7474747474747475 [2023-11-29 04:02:19,966 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 148 transitions. [2023-11-29 04:02:19,966 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 148 transitions. [2023-11-29 04:02:19,966 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:02:19,966 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 148 transitions. [2023-11-29 04:02:19,967 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:02:19,968 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 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) [2023-11-29 04:02:19,968 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 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) [2023-11-29 04:02:19,968 INFO L175 Difference]: Start difference. First operand has 67 places, 56 transitions, 124 flow. Second operand 3 states and 148 transitions. [2023-11-29 04:02:19,968 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 64 transitions, 206 flow [2023-11-29 04:02:19,971 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 64 transitions, 202 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 04:02:19,972 INFO L231 Difference]: Finished difference. Result has 66 places, 55 transitions, 122 flow [2023-11-29 04:02:19,972 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=122, PETRI_PLACES=66, PETRI_TRANSITIONS=55} [2023-11-29 04:02:19,973 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, -7 predicate places. [2023-11-29 04:02:19,973 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 55 transitions, 122 flow [2023-11-29 04:02:19,974 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:02:19,974 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:02:19,974 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:02:19,974 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 04:02:19,974 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 04:02:19,974 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:02:19,975 INFO L85 PathProgramCache]: Analyzing trace with hash -767970052, now seen corresponding path program 1 times [2023-11-29 04:02:19,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:02:19,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766358677] [2023-11-29 04:02:19,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:02:19,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:02:19,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:02:20,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:02:20,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:02:20,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766358677] [2023-11-29 04:02:20,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766358677] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:02:20,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:02:20,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 04:02:20,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129291209] [2023-11-29 04:02:20,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:02:20,028 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:02:20,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:02:20,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:02:20,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:02:20,044 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 66 [2023-11-29 04:02:20,045 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 55 transitions, 122 flow. Second operand has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:02:20,045 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:02:20,045 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 66 [2023-11-29 04:02:20,045 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:02:20,587 INFO L124 PetriNetUnfolderBase]: 1948/3571 cut-off events. [2023-11-29 04:02:20,588 INFO L125 PetriNetUnfolderBase]: For 91/91 co-relation queries the response was YES. [2023-11-29 04:02:20,598 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6495 conditions, 3571 events. 1948/3571 cut-off events. For 91/91 co-relation queries the response was YES. Maximal size of possible extension queue 266. Compared 28077 event pairs, 970 based on Foata normal form. 0/3247 useless extension candidates. Maximal degree in co-relation 6485. Up to 2082 conditions per place. [2023-11-29 04:02:20,622 INFO L140 encePairwiseOnDemand]: 63/66 looper letters, 32 selfloop transitions, 2 changer transitions 0/63 dead transitions. [2023-11-29 04:02:20,622 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 63 transitions, 206 flow [2023-11-29 04:02:20,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:02:20,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 04:02:20,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 146 transitions. [2023-11-29 04:02:20,624 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7373737373737373 [2023-11-29 04:02:20,624 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 146 transitions. [2023-11-29 04:02:20,624 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 146 transitions. [2023-11-29 04:02:20,624 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:02:20,624 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 146 transitions. [2023-11-29 04:02:20,625 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:02:20,626 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 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) [2023-11-29 04:02:20,627 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 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) [2023-11-29 04:02:20,627 INFO L175 Difference]: Start difference. First operand has 66 places, 55 transitions, 122 flow. Second operand 3 states and 146 transitions. [2023-11-29 04:02:20,627 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 63 transitions, 206 flow [2023-11-29 04:02:20,631 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 63 transitions, 202 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 04:02:20,632 INFO L231 Difference]: Finished difference. Result has 65 places, 54 transitions, 120 flow [2023-11-29 04:02:20,633 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=120, PETRI_PLACES=65, PETRI_TRANSITIONS=54} [2023-11-29 04:02:20,634 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, -8 predicate places. [2023-11-29 04:02:20,634 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 54 transitions, 120 flow [2023-11-29 04:02:20,635 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:02:20,635 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:02:20,635 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:02:20,635 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-29 04:02:20,635 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 04:02:20,636 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:02:20,636 INFO L85 PathProgramCache]: Analyzing trace with hash -767970051, now seen corresponding path program 1 times [2023-11-29 04:02:20,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:02:20,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787136804] [2023-11-29 04:02:20,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:02:20,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:02:20,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:02:20,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:02:20,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:02:20,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787136804] [2023-11-29 04:02:20,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787136804] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:02:20,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:02:20,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 04:02:20,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227682924] [2023-11-29 04:02:20,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:02:20,736 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:02:20,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:02:20,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:02:20,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:02:20,764 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 66 [2023-11-29 04:02:20,764 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 54 transitions, 120 flow. Second operand has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:02:20,765 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:02:20,765 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 66 [2023-11-29 04:02:20,765 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:02:21,454 INFO L124 PetriNetUnfolderBase]: 1941/3535 cut-off events. [2023-11-29 04:02:21,454 INFO L125 PetriNetUnfolderBase]: For 94/94 co-relation queries the response was YES. [2023-11-29 04:02:21,466 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6450 conditions, 3535 events. 1941/3535 cut-off events. For 94/94 co-relation queries the response was YES. Maximal size of possible extension queue 264. Compared 27184 event pairs, 1492 based on Foata normal form. 6/3219 useless extension candidates. Maximal degree in co-relation 6440. Up to 2069 conditions per place. [2023-11-29 04:02:21,491 INFO L140 encePairwiseOnDemand]: 63/66 looper letters, 31 selfloop transitions, 2 changer transitions 0/62 dead transitions. [2023-11-29 04:02:21,491 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 62 transitions, 202 flow [2023-11-29 04:02:21,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:02:21,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 04:02:21,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 148 transitions. [2023-11-29 04:02:21,493 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7474747474747475 [2023-11-29 04:02:21,493 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 148 transitions. [2023-11-29 04:02:21,493 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 148 transitions. [2023-11-29 04:02:21,493 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:02:21,494 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 148 transitions. [2023-11-29 04:02:21,495 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:02:21,496 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 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) [2023-11-29 04:02:21,496 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 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) [2023-11-29 04:02:21,496 INFO L175 Difference]: Start difference. First operand has 65 places, 54 transitions, 120 flow. Second operand 3 states and 148 transitions. [2023-11-29 04:02:21,497 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 62 transitions, 202 flow [2023-11-29 04:02:21,502 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 62 transitions, 198 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 04:02:21,504 INFO L231 Difference]: Finished difference. Result has 64 places, 53 transitions, 118 flow [2023-11-29 04:02:21,504 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=118, PETRI_PLACES=64, PETRI_TRANSITIONS=53} [2023-11-29 04:02:21,505 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, -9 predicate places. [2023-11-29 04:02:21,505 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 53 transitions, 118 flow [2023-11-29 04:02:21,506 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:02:21,506 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:02:21,506 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:02:21,506 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-29 04:02:21,507 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting P2Err0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 04:02:21,507 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:02:21,507 INFO L85 PathProgramCache]: Analyzing trace with hash 695392978, now seen corresponding path program 1 times [2023-11-29 04:02:21,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:02:21,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255915975] [2023-11-29 04:02:21,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:02:21,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:02:21,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:02:21,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:02:21,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:02:21,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255915975] [2023-11-29 04:02:21,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255915975] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:02:21,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:02:21,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 04:02:21,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199025400] [2023-11-29 04:02:21,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:02:21,685 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:02:21,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:02:21,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:02:21,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:02:21,686 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 66 [2023-11-29 04:02:21,687 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 53 transitions, 118 flow. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:02:21,687 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:02:21,687 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 66 [2023-11-29 04:02:21,687 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:02:22,137 INFO L124 PetriNetUnfolderBase]: 1525/2662 cut-off events. [2023-11-29 04:02:22,138 INFO L125 PetriNetUnfolderBase]: For 76/76 co-relation queries the response was YES. [2023-11-29 04:02:22,141 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4975 conditions, 2662 events. 1525/2662 cut-off events. For 76/76 co-relation queries the response was YES. Maximal size of possible extension queue 201. Compared 19568 event pairs, 277 based on Foata normal form. 0/2613 useless extension candidates. Maximal degree in co-relation 4965. Up to 1717 conditions per place. [2023-11-29 04:02:22,148 INFO L140 encePairwiseOnDemand]: 63/66 looper letters, 33 selfloop transitions, 2 changer transitions 2/66 dead transitions. [2023-11-29 04:02:22,148 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 66 transitions, 222 flow [2023-11-29 04:02:22,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:02:22,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 04:02:22,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 155 transitions. [2023-11-29 04:02:22,150 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7828282828282829 [2023-11-29 04:02:22,150 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 155 transitions. [2023-11-29 04:02:22,150 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 155 transitions. [2023-11-29 04:02:22,150 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:02:22,150 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 155 transitions. [2023-11-29 04:02:22,151 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:02:22,152 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 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) [2023-11-29 04:02:22,152 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 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) [2023-11-29 04:02:22,152 INFO L175 Difference]: Start difference. First operand has 64 places, 53 transitions, 118 flow. Second operand 3 states and 155 transitions. [2023-11-29 04:02:22,152 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 66 transitions, 222 flow [2023-11-29 04:02:22,153 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 66 transitions, 216 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 04:02:22,154 INFO L231 Difference]: Finished difference. Result has 63 places, 51 transitions, 114 flow [2023-11-29 04:02:22,155 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=114, PETRI_PLACES=63, PETRI_TRANSITIONS=51} [2023-11-29 04:02:22,155 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, -10 predicate places. [2023-11-29 04:02:22,155 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 51 transitions, 114 flow [2023-11-29 04:02:22,156 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:02:22,156 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:02:22,156 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:02:22,156 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-29 04:02:22,156 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 04:02:22,156 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:02:22,157 INFO L85 PathProgramCache]: Analyzing trace with hash 695391480, now seen corresponding path program 1 times [2023-11-29 04:02:22,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:02:22,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606766380] [2023-11-29 04:02:22,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:02:22,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:02:22,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:02:22,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:02:22,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:02:22,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606766380] [2023-11-29 04:02:22,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606766380] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:02:22,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:02:22,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 04:02:22,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624722791] [2023-11-29 04:02:22,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:02:22,210 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:02:22,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:02:22,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:02:22,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:02:22,227 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 66 [2023-11-29 04:02:22,227 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 51 transitions, 114 flow. Second operand has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:02:22,227 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:02:22,227 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 66 [2023-11-29 04:02:22,227 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:02:22,513 INFO L124 PetriNetUnfolderBase]: 1385/2534 cut-off events. [2023-11-29 04:02:22,513 INFO L125 PetriNetUnfolderBase]: For 144/144 co-relation queries the response was YES. [2023-11-29 04:02:22,517 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4726 conditions, 2534 events. 1385/2534 cut-off events. For 144/144 co-relation queries the response was YES. Maximal size of possible extension queue 187. Compared 19115 event pairs, 609 based on Foata normal form. 0/2455 useless extension candidates. Maximal degree in co-relation 4715. Up to 1640 conditions per place. [2023-11-29 04:02:22,528 INFO L140 encePairwiseOnDemand]: 63/66 looper letters, 29 selfloop transitions, 2 changer transitions 0/58 dead transitions. [2023-11-29 04:02:22,528 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 58 transitions, 192 flow [2023-11-29 04:02:22,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:02:22,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 04:02:22,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 143 transitions. [2023-11-29 04:02:22,529 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7222222222222222 [2023-11-29 04:02:22,529 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 143 transitions. [2023-11-29 04:02:22,530 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 143 transitions. [2023-11-29 04:02:22,530 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:02:22,530 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 143 transitions. [2023-11-29 04:02:22,531 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:02:22,531 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 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) [2023-11-29 04:02:22,532 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 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) [2023-11-29 04:02:22,532 INFO L175 Difference]: Start difference. First operand has 63 places, 51 transitions, 114 flow. Second operand 3 states and 143 transitions. [2023-11-29 04:02:22,532 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 58 transitions, 192 flow [2023-11-29 04:02:22,533 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 58 transitions, 186 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 04:02:22,534 INFO L231 Difference]: Finished difference. Result has 61 places, 50 transitions, 112 flow [2023-11-29 04:02:22,535 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=112, PETRI_PLACES=61, PETRI_TRANSITIONS=50} [2023-11-29 04:02:22,535 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, -12 predicate places. [2023-11-29 04:02:22,536 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 50 transitions, 112 flow [2023-11-29 04:02:22,536 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:02:22,536 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:02:22,536 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:02:22,536 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-29 04:02:22,537 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 04:02:22,537 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:02:22,537 INFO L85 PathProgramCache]: Analyzing trace with hash 695391481, now seen corresponding path program 1 times [2023-11-29 04:02:22,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:02:22,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471387347] [2023-11-29 04:02:22,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:02:22,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:02:22,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:02:22,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:02:22,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:02:22,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471387347] [2023-11-29 04:02:22,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471387347] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:02:22,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:02:22,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 04:02:22,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837933790] [2023-11-29 04:02:22,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:02:22,615 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:02:22,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:02:22,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:02:22,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:02:22,632 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 66 [2023-11-29 04:02:22,632 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 50 transitions, 112 flow. Second operand has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:02:22,633 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:02:22,633 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 66 [2023-11-29 04:02:22,633 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:02:22,942 INFO L124 PetriNetUnfolderBase]: 1339/2524 cut-off events. [2023-11-29 04:02:22,942 INFO L125 PetriNetUnfolderBase]: For 90/90 co-relation queries the response was YES. [2023-11-29 04:02:22,946 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4597 conditions, 2524 events. 1339/2524 cut-off events. For 90/90 co-relation queries the response was YES. Maximal size of possible extension queue 188. Compared 19237 event pairs, 417 based on Foata normal form. 24/2469 useless extension candidates. Maximal degree in co-relation 4587. Up to 1570 conditions per place. [2023-11-29 04:02:22,955 INFO L140 encePairwiseOnDemand]: 63/66 looper letters, 28 selfloop transitions, 2 changer transitions 0/57 dead transitions. [2023-11-29 04:02:22,955 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 57 transitions, 186 flow [2023-11-29 04:02:22,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:02:22,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 04:02:22,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 145 transitions. [2023-11-29 04:02:22,957 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7323232323232324 [2023-11-29 04:02:22,957 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 145 transitions. [2023-11-29 04:02:22,957 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 145 transitions. [2023-11-29 04:02:22,957 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:02:22,957 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 145 transitions. [2023-11-29 04:02:22,958 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:02:22,959 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 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) [2023-11-29 04:02:22,959 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 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) [2023-11-29 04:02:22,959 INFO L175 Difference]: Start difference. First operand has 61 places, 50 transitions, 112 flow. Second operand 3 states and 145 transitions. [2023-11-29 04:02:22,959 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 57 transitions, 186 flow [2023-11-29 04:02:22,960 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 57 transitions, 182 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 04:02:22,961 INFO L231 Difference]: Finished difference. Result has 60 places, 49 transitions, 110 flow [2023-11-29 04:02:22,961 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=110, PETRI_PLACES=60, PETRI_TRANSITIONS=49} [2023-11-29 04:02:22,962 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, -13 predicate places. [2023-11-29 04:02:22,962 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 49 transitions, 110 flow [2023-11-29 04:02:22,963 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:02:22,963 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:02:22,963 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:02:22,963 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-29 04:02:22,963 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 04:02:22,964 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:02:22,964 INFO L85 PathProgramCache]: Analyzing trace with hash 1468780422, now seen corresponding path program 1 times [2023-11-29 04:02:22,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:02:22,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516969432] [2023-11-29 04:02:22,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:02:22,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:02:23,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:02:23,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:02:23,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:02:23,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516969432] [2023-11-29 04:02:23,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516969432] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:02:23,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:02:23,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 04:02:23,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729466279] [2023-11-29 04:02:23,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:02:23,614 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 04:02:23,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:02:23,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 04:02:23,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-11-29 04:02:23,827 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 66 [2023-11-29 04:02:23,828 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 49 transitions, 110 flow. Second operand has 9 states, 9 states have (on average 34.77777777777778) internal successors, (313), 9 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:02:23,828 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:02:23,828 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 66 [2023-11-29 04:02:23,828 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:02:24,296 INFO L124 PetriNetUnfolderBase]: 1347/2460 cut-off events. [2023-11-29 04:02:24,296 INFO L125 PetriNetUnfolderBase]: For 90/90 co-relation queries the response was YES. [2023-11-29 04:02:24,299 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4549 conditions, 2460 events. 1347/2460 cut-off events. For 90/90 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 18332 event pairs, 244 based on Foata normal form. 72/2454 useless extension candidates. Maximal degree in co-relation 4539. Up to 1570 conditions per place. [2023-11-29 04:02:24,304 INFO L140 encePairwiseOnDemand]: 60/66 looper letters, 29 selfloop transitions, 4 changer transitions 9/66 dead transitions. [2023-11-29 04:02:24,304 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 66 transitions, 228 flow [2023-11-29 04:02:24,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 04:02:24,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-29 04:02:24,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 274 transitions. [2023-11-29 04:02:24,306 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5930735930735931 [2023-11-29 04:02:24,306 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 274 transitions. [2023-11-29 04:02:24,306 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 274 transitions. [2023-11-29 04:02:24,307 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:02:24,307 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 274 transitions. [2023-11-29 04:02:24,308 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 39.142857142857146) internal successors, (274), 7 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:02:24,309 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 66.0) internal successors, (528), 8 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:02:24,309 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 66.0) internal successors, (528), 8 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:02:24,309 INFO L175 Difference]: Start difference. First operand has 60 places, 49 transitions, 110 flow. Second operand 7 states and 274 transitions. [2023-11-29 04:02:24,309 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 66 transitions, 228 flow [2023-11-29 04:02:24,310 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 66 transitions, 224 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 04:02:24,311 INFO L231 Difference]: Finished difference. Result has 63 places, 47 transitions, 110 flow [2023-11-29 04:02:24,311 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=110, PETRI_PLACES=63, PETRI_TRANSITIONS=47} [2023-11-29 04:02:24,312 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, -10 predicate places. [2023-11-29 04:02:24,312 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 47 transitions, 110 flow [2023-11-29 04:02:24,312 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 34.77777777777778) internal successors, (313), 9 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:02:24,312 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:02:24,312 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:02:24,313 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-29 04:02:24,313 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 04:02:24,313 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:02:24,313 INFO L85 PathProgramCache]: Analyzing trace with hash 1468781681, now seen corresponding path program 1 times [2023-11-29 04:02:24,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:02:24,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398935527] [2023-11-29 04:02:24,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:02:24,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:02:24,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:02:24,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:02:24,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:02:24,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398935527] [2023-11-29 04:02:24,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398935527] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:02:24,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:02:24,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 04:02:24,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693365250] [2023-11-29 04:02:24,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:02:24,492 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 04:02:24,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:02:24,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 04:02:24,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 04:02:24,499 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 66 [2023-11-29 04:02:24,500 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 47 transitions, 110 flow. Second operand has 5 states, 5 states have (on average 38.8) internal successors, (194), 5 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:02:24,500 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:02:24,500 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 66 [2023-11-29 04:02:24,500 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:02:25,211 INFO L124 PetriNetUnfolderBase]: 2477/4022 cut-off events. [2023-11-29 04:02:25,211 INFO L125 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2023-11-29 04:02:25,219 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7626 conditions, 4022 events. 2477/4022 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 331. Compared 29906 event pairs, 413 based on Foata normal form. 0/3907 useless extension candidates. Maximal degree in co-relation 7615. Up to 1831 conditions per place. [2023-11-29 04:02:25,231 INFO L140 encePairwiseOnDemand]: 60/66 looper letters, 30 selfloop transitions, 2 changer transitions 44/99 dead transitions. [2023-11-29 04:02:25,231 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 99 transitions, 366 flow [2023-11-29 04:02:25,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 04:02:25,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-29 04:02:25,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 366 transitions. [2023-11-29 04:02:25,234 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6931818181818182 [2023-11-29 04:02:25,234 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 366 transitions. [2023-11-29 04:02:25,234 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 366 transitions. [2023-11-29 04:02:25,235 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:02:25,235 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 366 transitions. [2023-11-29 04:02:25,237 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 45.75) internal successors, (366), 8 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:02:25,238 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 66.0) internal successors, (594), 9 states have internal predecessors, (594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:02:25,239 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 66.0) internal successors, (594), 9 states have internal predecessors, (594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:02:25,239 INFO L175 Difference]: Start difference. First operand has 63 places, 47 transitions, 110 flow. Second operand 8 states and 366 transitions. [2023-11-29 04:02:25,239 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 99 transitions, 366 flow [2023-11-29 04:02:25,240 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 99 transitions, 359 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-29 04:02:25,242 INFO L231 Difference]: Finished difference. Result has 69 places, 46 transitions, 117 flow [2023-11-29 04:02:25,242 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=103, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=117, PETRI_PLACES=69, PETRI_TRANSITIONS=46} [2023-11-29 04:02:25,242 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, -4 predicate places. [2023-11-29 04:02:25,243 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 46 transitions, 117 flow [2023-11-29 04:02:25,243 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 38.8) internal successors, (194), 5 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:02:25,243 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:02:25,243 INFO L208 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] [2023-11-29 04:02:25,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-29 04:02:25,244 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 04:02:25,244 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:02:25,244 INFO L85 PathProgramCache]: Analyzing trace with hash 386281638, now seen corresponding path program 1 times [2023-11-29 04:02:25,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:02:25,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71155581] [2023-11-29 04:02:25,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:02:25,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:02:25,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:02:25,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:02:25,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:02:25,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71155581] [2023-11-29 04:02:25,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71155581] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:02:25,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:02:25,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 04:02:25,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217977493] [2023-11-29 04:02:25,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:02:25,416 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 04:02:25,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:02:25,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 04:02:25,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 04:02:25,427 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 66 [2023-11-29 04:02:25,427 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 46 transitions, 117 flow. Second operand has 4 states, 4 states have (on average 37.5) internal successors, (150), 4 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:02:25,427 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:02:25,428 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 66 [2023-11-29 04:02:25,428 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:02:26,239 INFO L124 PetriNetUnfolderBase]: 5293/8033 cut-off events. [2023-11-29 04:02:26,239 INFO L125 PetriNetUnfolderBase]: For 912/912 co-relation queries the response was YES. [2023-11-29 04:02:26,252 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16710 conditions, 8033 events. 5293/8033 cut-off events. For 912/912 co-relation queries the response was YES. Maximal size of possible extension queue 506. Compared 54660 event pairs, 663 based on Foata normal form. 240/8229 useless extension candidates. Maximal degree in co-relation 16694. Up to 4461 conditions per place. [2023-11-29 04:02:26,272 INFO L140 encePairwiseOnDemand]: 59/66 looper letters, 47 selfloop transitions, 6 changer transitions 1/74 dead transitions. [2023-11-29 04:02:26,272 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 74 transitions, 288 flow [2023-11-29 04:02:26,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 04:02:26,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-29 04:02:26,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 192 transitions. [2023-11-29 04:02:26,274 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7272727272727273 [2023-11-29 04:02:26,274 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 192 transitions. [2023-11-29 04:02:26,274 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 192 transitions. [2023-11-29 04:02:26,274 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:02:26,274 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 192 transitions. [2023-11-29 04:02:26,275 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 48.0) internal successors, (192), 4 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:02:26,276 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 66.0) internal successors, (330), 5 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:02:26,276 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 66.0) internal successors, (330), 5 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:02:26,276 INFO L175 Difference]: Start difference. First operand has 69 places, 46 transitions, 117 flow. Second operand 4 states and 192 transitions. [2023-11-29 04:02:26,276 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 74 transitions, 288 flow [2023-11-29 04:02:26,327 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 74 transitions, 276 flow, removed 4 selfloop flow, removed 6 redundant places. [2023-11-29 04:02:26,329 INFO L231 Difference]: Finished difference. Result has 62 places, 50 transitions, 147 flow [2023-11-29 04:02:26,329 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=105, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=147, PETRI_PLACES=62, PETRI_TRANSITIONS=50} [2023-11-29 04:02:26,330 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, -11 predicate places. [2023-11-29 04:02:26,330 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 50 transitions, 147 flow [2023-11-29 04:02:26,330 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.5) internal successors, (150), 4 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:02:26,331 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:02:26,331 INFO L208 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] [2023-11-29 04:02:26,331 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-29 04:02:26,331 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 04:02:26,331 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:02:26,332 INFO L85 PathProgramCache]: Analyzing trace with hash 1589108294, now seen corresponding path program 1 times [2023-11-29 04:02:26,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:02:26,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655338583] [2023-11-29 04:02:26,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:02:26,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:02:26,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:02:26,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:02:26,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:02:26,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655338583] [2023-11-29 04:02:26,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655338583] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:02:26,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:02:26,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 04:02:26,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192251232] [2023-11-29 04:02:26,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:02:26,493 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 04:02:26,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:02:26,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 04:02:26,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-29 04:02:26,499 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 66 [2023-11-29 04:02:26,500 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 50 transitions, 147 flow. Second operand has 5 states, 5 states have (on average 37.2) internal successors, (186), 5 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:02:26,500 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:02:26,500 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 66 [2023-11-29 04:02:26,500 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:02:27,176 INFO L124 PetriNetUnfolderBase]: 4321/6601 cut-off events. [2023-11-29 04:02:27,177 INFO L125 PetriNetUnfolderBase]: For 1732/1732 co-relation queries the response was YES. [2023-11-29 04:02:27,185 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15390 conditions, 6601 events. 4321/6601 cut-off events. For 1732/1732 co-relation queries the response was YES. Maximal size of possible extension queue 401. Compared 43533 event pairs, 249 based on Foata normal form. 228/6793 useless extension candidates. Maximal degree in co-relation 15376. Up to 3201 conditions per place. [2023-11-29 04:02:27,200 INFO L140 encePairwiseOnDemand]: 59/66 looper letters, 60 selfloop transitions, 10 changer transitions 1/91 dead transitions. [2023-11-29 04:02:27,200 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 91 transitions, 402 flow [2023-11-29 04:02:27,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 04:02:27,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-29 04:02:27,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 243 transitions. [2023-11-29 04:02:27,202 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7363636363636363 [2023-11-29 04:02:27,202 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 243 transitions. [2023-11-29 04:02:27,202 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 243 transitions. [2023-11-29 04:02:27,202 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:02:27,202 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 243 transitions. [2023-11-29 04:02:27,203 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 48.6) internal successors, (243), 5 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:02:27,204 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 66.0) internal successors, (396), 6 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:02:27,205 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 66.0) internal successors, (396), 6 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:02:27,205 INFO L175 Difference]: Start difference. First operand has 62 places, 50 transitions, 147 flow. Second operand 5 states and 243 transitions. [2023-11-29 04:02:27,205 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 91 transitions, 402 flow [2023-11-29 04:02:27,207 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 91 transitions, 391 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-11-29 04:02:27,208 INFO L231 Difference]: Finished difference. Result has 66 places, 54 transitions, 199 flow [2023-11-29 04:02:27,208 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=199, PETRI_PLACES=66, PETRI_TRANSITIONS=54} [2023-11-29 04:02:27,209 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, -7 predicate places. [2023-11-29 04:02:27,209 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 54 transitions, 199 flow [2023-11-29 04:02:27,209 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 37.2) internal successors, (186), 5 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:02:27,209 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:02:27,209 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:02:27,209 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-29 04:02:27,210 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 04:02:27,210 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:02:27,210 INFO L85 PathProgramCache]: Analyzing trace with hash -1750622039, now seen corresponding path program 1 times [2023-11-29 04:02:27,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:02:27,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606278528] [2023-11-29 04:02:27,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:02:27,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:02:27,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:02:27,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:02:27,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:02:27,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606278528] [2023-11-29 04:02:27,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606278528] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:02:27,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:02:27,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 04:02:27,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784004821] [2023-11-29 04:02:27,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:02:27,391 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 04:02:27,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:02:27,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 04:02:27,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-29 04:02:27,408 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 66 [2023-11-29 04:02:27,408 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 54 transitions, 199 flow. Second operand has 6 states, 6 states have (on average 36.833333333333336) internal successors, (221), 6 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:02:27,408 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:02:27,408 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 66 [2023-11-29 04:02:27,408 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:02:27,926 INFO L124 PetriNetUnfolderBase]: 2837/4325 cut-off events. [2023-11-29 04:02:27,926 INFO L125 PetriNetUnfolderBase]: For 3458/3458 co-relation queries the response was YES. [2023-11-29 04:02:27,932 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11370 conditions, 4325 events. 2837/4325 cut-off events. For 3458/3458 co-relation queries the response was YES. Maximal size of possible extension queue 198. Compared 25384 event pairs, 115 based on Foata normal form. 172/4466 useless extension candidates. Maximal degree in co-relation 11354. Up to 1361 conditions per place. [2023-11-29 04:02:27,942 INFO L140 encePairwiseOnDemand]: 59/66 looper letters, 71 selfloop transitions, 14 changer transitions 1/106 dead transitions. [2023-11-29 04:02:27,942 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 106 transitions, 526 flow [2023-11-29 04:02:27,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 04:02:27,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 04:02:27,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 292 transitions. [2023-11-29 04:02:27,944 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7373737373737373 [2023-11-29 04:02:27,944 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 292 transitions. [2023-11-29 04:02:27,944 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 292 transitions. [2023-11-29 04:02:27,944 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:02:27,944 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 292 transitions. [2023-11-29 04:02:27,945 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 48.666666666666664) internal successors, (292), 6 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:02:27,946 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 66.0) internal successors, (462), 7 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:02:27,946 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 66.0) internal successors, (462), 7 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:02:27,946 INFO L175 Difference]: Start difference. First operand has 66 places, 54 transitions, 199 flow. Second operand 6 states and 292 transitions. [2023-11-29 04:02:27,947 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 106 transitions, 526 flow [2023-11-29 04:02:27,956 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 106 transitions, 496 flow, removed 5 selfloop flow, removed 4 redundant places. [2023-11-29 04:02:27,957 INFO L231 Difference]: Finished difference. Result has 69 places, 58 transitions, 249 flow [2023-11-29 04:02:27,958 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=249, PETRI_PLACES=69, PETRI_TRANSITIONS=58} [2023-11-29 04:02:27,958 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, -4 predicate places. [2023-11-29 04:02:27,958 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 58 transitions, 249 flow [2023-11-29 04:02:27,958 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 36.833333333333336) internal successors, (221), 6 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:02:27,958 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:02:27,958 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:02:27,958 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-29 04:02:27,959 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 04:02:27,959 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:02:27,959 INFO L85 PathProgramCache]: Analyzing trace with hash -1303750266, now seen corresponding path program 1 times [2023-11-29 04:02:27,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:02:27,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50489136] [2023-11-29 04:02:27,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:02:27,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:02:27,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:02:28,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:02:28,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:02:28,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50489136] [2023-11-29 04:02:28,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50489136] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:02:28,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:02:28,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 04:02:28,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981736569] [2023-11-29 04:02:28,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:02:28,193 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 04:02:28,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:02:28,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 04:02:28,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 04:02:28,197 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 66 [2023-11-29 04:02:28,197 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 58 transitions, 249 flow. Second operand has 6 states, 6 states have (on average 38.0) internal successors, (228), 6 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:02:28,197 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:02:28,197 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 66 [2023-11-29 04:02:28,197 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:02:28,993 INFO L124 PetriNetUnfolderBase]: 4040/6742 cut-off events. [2023-11-29 04:02:28,994 INFO L125 PetriNetUnfolderBase]: For 3888/4487 co-relation queries the response was YES. [2023-11-29 04:02:29,009 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15915 conditions, 6742 events. 4040/6742 cut-off events. For 3888/4487 co-relation queries the response was YES. Maximal size of possible extension queue 258. Compared 45119 event pairs, 1186 based on Foata normal form. 165/6499 useless extension candidates. Maximal degree in co-relation 15898. Up to 2731 conditions per place. [2023-11-29 04:02:29,024 INFO L140 encePairwiseOnDemand]: 61/66 looper letters, 54 selfloop transitions, 2 changer transitions 20/110 dead transitions. [2023-11-29 04:02:29,025 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 110 transitions, 535 flow [2023-11-29 04:02:29,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 04:02:29,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 04:02:29,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 287 transitions. [2023-11-29 04:02:29,026 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7247474747474747 [2023-11-29 04:02:29,026 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 287 transitions. [2023-11-29 04:02:29,026 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 287 transitions. [2023-11-29 04:02:29,026 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:02:29,026 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 287 transitions. [2023-11-29 04:02:29,027 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 47.833333333333336) internal successors, (287), 6 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:02:29,028 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 66.0) internal successors, (462), 7 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:02:29,028 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 66.0) internal successors, (462), 7 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:02:29,028 INFO L175 Difference]: Start difference. First operand has 69 places, 58 transitions, 249 flow. Second operand 6 states and 287 transitions. [2023-11-29 04:02:29,028 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 110 transitions, 535 flow [2023-11-29 04:02:29,049 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 110 transitions, 488 flow, removed 11 selfloop flow, removed 5 redundant places. [2023-11-29 04:02:29,050 INFO L231 Difference]: Finished difference. Result has 73 places, 59 transitions, 223 flow [2023-11-29 04:02:29,050 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=206, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=223, PETRI_PLACES=73, PETRI_TRANSITIONS=59} [2023-11-29 04:02:29,051 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, 0 predicate places. [2023-11-29 04:02:29,051 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 59 transitions, 223 flow [2023-11-29 04:02:29,051 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 38.0) internal successors, (228), 6 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:02:29,051 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:02:29,051 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:02:29,051 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-29 04:02:29,051 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 04:02:29,052 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:02:29,052 INFO L85 PathProgramCache]: Analyzing trace with hash 1441701762, now seen corresponding path program 2 times [2023-11-29 04:02:29,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:02:29,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641970569] [2023-11-29 04:02:29,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:02:29,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:02:29,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:02:29,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:02:29,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:02:29,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641970569] [2023-11-29 04:02:29,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641970569] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:02:29,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:02:29,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 04:02:29,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245325174] [2023-11-29 04:02:29,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:02:29,341 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 04:02:29,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:02:29,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 04:02:29,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-29 04:02:29,356 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 66 [2023-11-29 04:02:29,356 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 59 transitions, 223 flow. Second operand has 7 states, 7 states have (on average 34.0) internal successors, (238), 7 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:02:29,356 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:02:29,356 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 66 [2023-11-29 04:02:29,357 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:02:31,844 INFO L124 PetriNetUnfolderBase]: 13757/21894 cut-off events. [2023-11-29 04:02:31,844 INFO L125 PetriNetUnfolderBase]: For 8836/9715 co-relation queries the response was YES. [2023-11-29 04:02:31,915 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51402 conditions, 21894 events. 13757/21894 cut-off events. For 8836/9715 co-relation queries the response was YES. Maximal size of possible extension queue 937. Compared 164150 event pairs, 2811 based on Foata normal form. 529/21378 useless extension candidates. Maximal degree in co-relation 51383. Up to 8112 conditions per place. [2023-11-29 04:02:31,963 INFO L140 encePairwiseOnDemand]: 55/66 looper letters, 92 selfloop transitions, 16 changer transitions 65/203 dead transitions. [2023-11-29 04:02:31,963 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 203 transitions, 967 flow [2023-11-29 04:02:31,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-29 04:02:31,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2023-11-29 04:02:31,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 608 transitions. [2023-11-29 04:02:31,966 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.658008658008658 [2023-11-29 04:02:31,966 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 608 transitions. [2023-11-29 04:02:31,966 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 608 transitions. [2023-11-29 04:02:31,966 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:02:31,967 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 608 transitions. [2023-11-29 04:02:31,968 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 43.42857142857143) internal successors, (608), 14 states have internal predecessors, (608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:02:31,970 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 66.0) internal successors, (990), 15 states have internal predecessors, (990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:02:31,971 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 66.0) internal successors, (990), 15 states have internal predecessors, (990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:02:31,971 INFO L175 Difference]: Start difference. First operand has 73 places, 59 transitions, 223 flow. Second operand 14 states and 608 transitions. [2023-11-29 04:02:31,971 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 203 transitions, 967 flow [2023-11-29 04:02:32,141 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 203 transitions, 942 flow, removed 12 selfloop flow, removed 3 redundant places. [2023-11-29 04:02:32,144 INFO L231 Difference]: Finished difference. Result has 94 places, 73 transitions, 370 flow [2023-11-29 04:02:32,144 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=218, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=370, PETRI_PLACES=94, PETRI_TRANSITIONS=73} [2023-11-29 04:02:32,145 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, 21 predicate places. [2023-11-29 04:02:32,145 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 73 transitions, 370 flow [2023-11-29 04:02:32,145 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 34.0) internal successors, (238), 7 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:02:32,145 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:02:32,145 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:02:32,145 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-29 04:02:32,145 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 04:02:32,146 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:02:32,146 INFO L85 PathProgramCache]: Analyzing trace with hash 1311430866, now seen corresponding path program 1 times [2023-11-29 04:02:32,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:02:32,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896567602] [2023-11-29 04:02:32,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:02:32,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:02:32,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:02:32,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:02:32,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:02:32,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896567602] [2023-11-29 04:02:32,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896567602] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:02:32,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:02:32,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 04:02:32,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465312906] [2023-11-29 04:02:32,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:02:32,362 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 04:02:32,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:02:32,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 04:02:32,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-29 04:02:32,371 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 66 [2023-11-29 04:02:32,371 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 73 transitions, 370 flow. Second operand has 6 states, 6 states have (on average 35.666666666666664) internal successors, (214), 6 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:02:32,371 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:02:32,371 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 66 [2023-11-29 04:02:32,372 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:02:35,665 INFO L124 PetriNetUnfolderBase]: 16746/26993 cut-off events. [2023-11-29 04:02:35,666 INFO L125 PetriNetUnfolderBase]: For 40109/41159 co-relation queries the response was YES. [2023-11-29 04:02:35,762 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78035 conditions, 26993 events. 16746/26993 cut-off events. For 40109/41159 co-relation queries the response was YES. Maximal size of possible extension queue 1295. Compared 214535 event pairs, 5889 based on Foata normal form. 675/26253 useless extension candidates. Maximal degree in co-relation 78004. Up to 11433 conditions per place. [2023-11-29 04:02:35,803 INFO L140 encePairwiseOnDemand]: 58/66 looper letters, 59 selfloop transitions, 12 changer transitions 25/128 dead transitions. [2023-11-29 04:02:35,803 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 128 transitions, 837 flow [2023-11-29 04:02:35,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 04:02:35,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 04:02:35,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 270 transitions. [2023-11-29 04:02:35,804 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6818181818181818 [2023-11-29 04:02:35,805 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 270 transitions. [2023-11-29 04:02:35,805 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 270 transitions. [2023-11-29 04:02:35,805 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:02:35,805 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 270 transitions. [2023-11-29 04:02:35,806 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 45.0) internal successors, (270), 6 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:02:35,807 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 66.0) internal successors, (462), 7 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:02:35,807 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 66.0) internal successors, (462), 7 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:02:35,807 INFO L175 Difference]: Start difference. First operand has 94 places, 73 transitions, 370 flow. Second operand 6 states and 270 transitions. [2023-11-29 04:02:35,807 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 128 transitions, 837 flow [2023-11-29 04:02:36,132 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 128 transitions, 807 flow, removed 15 selfloop flow, removed 6 redundant places. [2023-11-29 04:02:36,133 INFO L231 Difference]: Finished difference. Result has 89 places, 77 transitions, 431 flow [2023-11-29 04:02:36,134 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=358, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=431, PETRI_PLACES=89, PETRI_TRANSITIONS=77} [2023-11-29 04:02:36,134 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, 16 predicate places. [2023-11-29 04:02:36,134 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 77 transitions, 431 flow [2023-11-29 04:02:36,134 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 35.666666666666664) internal successors, (214), 6 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:02:36,134 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:02:36,134 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:02:36,135 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-29 04:02:36,135 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 04:02:36,135 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:02:36,135 INFO L85 PathProgramCache]: Analyzing trace with hash -2087282102, now seen corresponding path program 3 times [2023-11-29 04:02:36,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:02:36,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442765163] [2023-11-29 04:02:36,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:02:36,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:02:36,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:02:36,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:02:36,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:02:36,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442765163] [2023-11-29 04:02:36,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442765163] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:02:36,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:02:36,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 04:02:36,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390566900] [2023-11-29 04:02:36,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:02:36,408 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 04:02:36,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:02:36,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 04:02:36,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-29 04:02:36,420 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 66 [2023-11-29 04:02:36,421 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 77 transitions, 431 flow. Second operand has 7 states, 7 states have (on average 36.714285714285715) internal successors, (257), 7 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:02:36,421 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:02:36,421 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 66 [2023-11-29 04:02:36,421 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:02:37,982 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([450] L832-->L839: Formula: (let ((.cse4 (not (= (mod v_~y$r_buff1_thd4~0_26 256) 0))) (.cse3 (not (= (mod v_~y$w_buff0_used~0_103 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd4~0_28 256) 0)))) (let ((.cse1 (and (not (= (mod v_~y$w_buff0_used~0_104 256) 0)) .cse5)) (.cse0 (and .cse3 .cse5)) (.cse2 (and (not (= (mod v_~y$w_buff1_used~0_97 256) 0)) .cse4))) (and (= v_~y$r_buff0_thd4~0_27 (ite .cse0 0 v_~y$r_buff0_thd4~0_28)) (= (ite .cse1 v_~y$w_buff0~0_46 (ite .cse2 v_~y$w_buff1~0_43 v_~y~0_65)) v_~y~0_64) (= (ite .cse1 0 v_~y$w_buff0_used~0_104) v_~y$w_buff0_used~0_103) (= v_~y$w_buff1_used~0_96 (ite (or .cse0 .cse2) 0 v_~y$w_buff1_used~0_97)) (= (ite (or (and (not (= (mod v_~y$r_buff0_thd4~0_27 256) 0)) .cse3) (and (not (= (mod v_~y$w_buff1_used~0_96 256) 0)) .cse4)) 0 v_~y$r_buff1_thd4~0_26) v_~y$r_buff1_thd4~0_25)))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_28, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_26, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_104, ~y$w_buff1~0=v_~y$w_buff1~0_43, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_65, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_97} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_27, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_25, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_103, ~y$w_buff1~0=v_~y$w_buff1~0_43, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_64, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_96} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][77], [Black: 186#(and (= ~__unbuffered_p0_EAX~0 1) (= ~x~0 1)), P0Thread1of1ForFork2InUse, 47#L784true, P1Thread1of1ForFork0InUse, P3Thread1of1ForFork1InUse, Black: 128#(= ~__unbuffered_p3_EAX~0 0), 239#(= ~z~0 1), P2Thread1of1ForFork3InUse, 181#(= ~x~0 1), Black: 148#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 48#L809true, 264#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1) (<= 0 ~main$tmp_guard0~0)), Black: 210#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0)), 8#P0EXITtrue, Black: 218#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 200#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 198#(= ~a~0 1), Black: 196#true, 53#L864true, Black: 204#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~a~0 1)), 173#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1)), Black: 175#(and (<= ~__unbuffered_cnt~0 2) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256))), 123#(and (not (= |ULTIMATE.start_main_~#t696~0#1.base| |ULTIMATE.start_main_~#t693~0#1.base|)) (not (= |ULTIMATE.start_main_~#t696~0#1.base| |ULTIMATE.start_main_~#t695~0#1.base|)) (= |ULTIMATE.start_main_old_#valid#1| (store (store (store (store |#valid| |ULTIMATE.start_main_~#t693~0#1.base| 0) |ULTIMATE.start_main_~#t694~0#1.base| 0) |ULTIMATE.start_main_~#t695~0#1.base| 0) |ULTIMATE.start_main_~#t696~0#1.base| 0)) (not (= |ULTIMATE.start_main_~#t695~0#1.base| |ULTIMATE.start_main_~#t694~0#1.base|)) (not (= |ULTIMATE.start_main_~#t695~0#1.base| |ULTIMATE.start_main_~#t693~0#1.base|)) (not (= |ULTIMATE.start_main_~#t694~0#1.base| |ULTIMATE.start_main_~#t693~0#1.base|)) (not (= |ULTIMATE.start_main_~#t696~0#1.base| |ULTIMATE.start_main_~#t694~0#1.base|))), 206#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1)), 13#L839true, Black: 240#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 244#(and (= ~z~0 1) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 246#(and (= ~z~0 1) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)))]) [2023-11-29 04:02:37,982 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2023-11-29 04:02:37,982 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-29 04:02:37,982 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-29 04:02:37,982 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-29 04:02:38,078 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([450] L832-->L839: Formula: (let ((.cse4 (not (= (mod v_~y$r_buff1_thd4~0_26 256) 0))) (.cse3 (not (= (mod v_~y$w_buff0_used~0_103 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd4~0_28 256) 0)))) (let ((.cse1 (and (not (= (mod v_~y$w_buff0_used~0_104 256) 0)) .cse5)) (.cse0 (and .cse3 .cse5)) (.cse2 (and (not (= (mod v_~y$w_buff1_used~0_97 256) 0)) .cse4))) (and (= v_~y$r_buff0_thd4~0_27 (ite .cse0 0 v_~y$r_buff0_thd4~0_28)) (= (ite .cse1 v_~y$w_buff0~0_46 (ite .cse2 v_~y$w_buff1~0_43 v_~y~0_65)) v_~y~0_64) (= (ite .cse1 0 v_~y$w_buff0_used~0_104) v_~y$w_buff0_used~0_103) (= v_~y$w_buff1_used~0_96 (ite (or .cse0 .cse2) 0 v_~y$w_buff1_used~0_97)) (= (ite (or (and (not (= (mod v_~y$r_buff0_thd4~0_27 256) 0)) .cse3) (and (not (= (mod v_~y$w_buff1_used~0_96 256) 0)) .cse4)) 0 v_~y$r_buff1_thd4~0_26) v_~y$r_buff1_thd4~0_25)))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_28, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_26, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_104, ~y$w_buff1~0=v_~y$w_buff1~0_43, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_65, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_97} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_27, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_25, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_103, ~y$w_buff1~0=v_~y$w_buff1~0_43, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_64, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_96} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][77], [Black: 181#(= ~x~0 1), P0Thread1of1ForFork2InUse, 47#L784true, 186#(and (= ~__unbuffered_p0_EAX~0 1) (= ~x~0 1)), P1Thread1of1ForFork0InUse, Black: 128#(= ~__unbuffered_p3_EAX~0 0), P3Thread1of1ForFork1InUse, 237#true, P2Thread1of1ForFork3InUse, Black: 148#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 46#L756true, 264#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1) (<= 0 ~main$tmp_guard0~0)), Black: 210#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 218#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 200#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 198#(= ~a~0 1), Black: 196#true, 62#P2EXITtrue, 53#L864true, Black: 204#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~a~0 1)), 173#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1)), Black: 175#(and (<= ~__unbuffered_cnt~0 2) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256))), 123#(and (not (= |ULTIMATE.start_main_~#t696~0#1.base| |ULTIMATE.start_main_~#t693~0#1.base|)) (not (= |ULTIMATE.start_main_~#t696~0#1.base| |ULTIMATE.start_main_~#t695~0#1.base|)) (= |ULTIMATE.start_main_old_#valid#1| (store (store (store (store |#valid| |ULTIMATE.start_main_~#t693~0#1.base| 0) |ULTIMATE.start_main_~#t694~0#1.base| 0) |ULTIMATE.start_main_~#t695~0#1.base| 0) |ULTIMATE.start_main_~#t696~0#1.base| 0)) (not (= |ULTIMATE.start_main_~#t695~0#1.base| |ULTIMATE.start_main_~#t694~0#1.base|)) (not (= |ULTIMATE.start_main_~#t695~0#1.base| |ULTIMATE.start_main_~#t693~0#1.base|)) (not (= |ULTIMATE.start_main_~#t694~0#1.base| |ULTIMATE.start_main_~#t693~0#1.base|)) (not (= |ULTIMATE.start_main_~#t696~0#1.base| |ULTIMATE.start_main_~#t694~0#1.base|))), Black: 240#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 206#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1)), 13#L839true, Black: 244#(and (= ~z~0 1) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 239#(= ~z~0 1), Black: 246#(and (= ~z~0 1) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)))]) [2023-11-29 04:02:38,078 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2023-11-29 04:02:38,078 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-29 04:02:38,078 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-29 04:02:38,078 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-29 04:02:38,530 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([450] L832-->L839: Formula: (let ((.cse4 (not (= (mod v_~y$r_buff1_thd4~0_26 256) 0))) (.cse3 (not (= (mod v_~y$w_buff0_used~0_103 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd4~0_28 256) 0)))) (let ((.cse1 (and (not (= (mod v_~y$w_buff0_used~0_104 256) 0)) .cse5)) (.cse0 (and .cse3 .cse5)) (.cse2 (and (not (= (mod v_~y$w_buff1_used~0_97 256) 0)) .cse4))) (and (= v_~y$r_buff0_thd4~0_27 (ite .cse0 0 v_~y$r_buff0_thd4~0_28)) (= (ite .cse1 v_~y$w_buff0~0_46 (ite .cse2 v_~y$w_buff1~0_43 v_~y~0_65)) v_~y~0_64) (= (ite .cse1 0 v_~y$w_buff0_used~0_104) v_~y$w_buff0_used~0_103) (= v_~y$w_buff1_used~0_96 (ite (or .cse0 .cse2) 0 v_~y$w_buff1_used~0_97)) (= (ite (or (and (not (= (mod v_~y$r_buff0_thd4~0_27 256) 0)) .cse3) (and (not (= (mod v_~y$w_buff1_used~0_96 256) 0)) .cse4)) 0 v_~y$r_buff1_thd4~0_26) v_~y$r_buff1_thd4~0_25)))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_28, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_26, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_104, ~y$w_buff1~0=v_~y$w_buff1~0_43, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_65, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_97} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_27, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_25, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_103, ~y$w_buff1~0=v_~y$w_buff1~0_43, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_64, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_96} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][88], [Black: 186#(and (= ~__unbuffered_p0_EAX~0 1) (= ~x~0 1)), P0Thread1of1ForFork2InUse, P1Thread1of1ForFork0InUse, 239#(= ~z~0 1), P3Thread1of1ForFork1InUse, Black: 128#(= ~__unbuffered_p3_EAX~0 0), P2Thread1of1ForFork3InUse, 181#(= ~x~0 1), Black: 148#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 19#L789true, 48#L809true, Black: 210#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0)), 8#P0EXITtrue, Black: 218#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 160#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1)), Black: 200#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 198#(= ~a~0 1), Black: 196#true, 53#L864true, Black: 204#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~a~0 1)), 266#(and (<= ~__unbuffered_cnt~0 2) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 175#(and (<= ~__unbuffered_cnt~0 2) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256))), 123#(and (not (= |ULTIMATE.start_main_~#t696~0#1.base| |ULTIMATE.start_main_~#t693~0#1.base|)) (not (= |ULTIMATE.start_main_~#t696~0#1.base| |ULTIMATE.start_main_~#t695~0#1.base|)) (= |ULTIMATE.start_main_old_#valid#1| (store (store (store (store |#valid| |ULTIMATE.start_main_~#t693~0#1.base| 0) |ULTIMATE.start_main_~#t694~0#1.base| 0) |ULTIMATE.start_main_~#t695~0#1.base| 0) |ULTIMATE.start_main_~#t696~0#1.base| 0)) (not (= |ULTIMATE.start_main_~#t695~0#1.base| |ULTIMATE.start_main_~#t694~0#1.base|)) (not (= |ULTIMATE.start_main_~#t695~0#1.base| |ULTIMATE.start_main_~#t693~0#1.base|)) (not (= |ULTIMATE.start_main_~#t694~0#1.base| |ULTIMATE.start_main_~#t693~0#1.base|)) (not (= |ULTIMATE.start_main_~#t696~0#1.base| |ULTIMATE.start_main_~#t694~0#1.base|))), 13#L839true, 206#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1)), Black: 240#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 244#(and (= ~z~0 1) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 246#(and (= ~z~0 1) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)))]) [2023-11-29 04:02:38,530 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2023-11-29 04:02:38,530 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-29 04:02:38,530 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-29 04:02:38,530 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-29 04:02:38,635 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([450] L832-->L839: Formula: (let ((.cse4 (not (= (mod v_~y$r_buff1_thd4~0_26 256) 0))) (.cse3 (not (= (mod v_~y$w_buff0_used~0_103 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd4~0_28 256) 0)))) (let ((.cse1 (and (not (= (mod v_~y$w_buff0_used~0_104 256) 0)) .cse5)) (.cse0 (and .cse3 .cse5)) (.cse2 (and (not (= (mod v_~y$w_buff1_used~0_97 256) 0)) .cse4))) (and (= v_~y$r_buff0_thd4~0_27 (ite .cse0 0 v_~y$r_buff0_thd4~0_28)) (= (ite .cse1 v_~y$w_buff0~0_46 (ite .cse2 v_~y$w_buff1~0_43 v_~y~0_65)) v_~y~0_64) (= (ite .cse1 0 v_~y$w_buff0_used~0_104) v_~y$w_buff0_used~0_103) (= v_~y$w_buff1_used~0_96 (ite (or .cse0 .cse2) 0 v_~y$w_buff1_used~0_97)) (= (ite (or (and (not (= (mod v_~y$r_buff0_thd4~0_27 256) 0)) .cse3) (and (not (= (mod v_~y$w_buff1_used~0_96 256) 0)) .cse4)) 0 v_~y$r_buff1_thd4~0_26) v_~y$r_buff1_thd4~0_25)))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_28, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_26, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_104, ~y$w_buff1~0=v_~y$w_buff1~0_43, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_65, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_97} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_27, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_25, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_103, ~y$w_buff1~0=v_~y$w_buff1~0_43, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_64, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_96} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][88], [Black: 181#(= ~x~0 1), P0Thread1of1ForFork2InUse, 186#(and (= ~__unbuffered_p0_EAX~0 1) (= ~x~0 1)), P1Thread1of1ForFork0InUse, Black: 128#(= ~__unbuffered_p3_EAX~0 0), P3Thread1of1ForFork1InUse, 237#true, P2Thread1of1ForFork3InUse, Black: 148#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 46#L756true, 19#L789true, Black: 210#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 218#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 160#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1)), Black: 200#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 198#(= ~a~0 1), Black: 196#true, 53#L864true, 62#P2EXITtrue, 266#(and (<= ~__unbuffered_cnt~0 2) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 204#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~a~0 1)), 175#(and (<= ~__unbuffered_cnt~0 2) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256))), 123#(and (not (= |ULTIMATE.start_main_~#t696~0#1.base| |ULTIMATE.start_main_~#t693~0#1.base|)) (not (= |ULTIMATE.start_main_~#t696~0#1.base| |ULTIMATE.start_main_~#t695~0#1.base|)) (= |ULTIMATE.start_main_old_#valid#1| (store (store (store (store |#valid| |ULTIMATE.start_main_~#t693~0#1.base| 0) |ULTIMATE.start_main_~#t694~0#1.base| 0) |ULTIMATE.start_main_~#t695~0#1.base| 0) |ULTIMATE.start_main_~#t696~0#1.base| 0)) (not (= |ULTIMATE.start_main_~#t695~0#1.base| |ULTIMATE.start_main_~#t694~0#1.base|)) (not (= |ULTIMATE.start_main_~#t695~0#1.base| |ULTIMATE.start_main_~#t693~0#1.base|)) (not (= |ULTIMATE.start_main_~#t694~0#1.base| |ULTIMATE.start_main_~#t693~0#1.base|)) (not (= |ULTIMATE.start_main_~#t696~0#1.base| |ULTIMATE.start_main_~#t694~0#1.base|))), Black: 240#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 13#L839true, 206#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1)), Black: 244#(and (= ~z~0 1) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 239#(= ~z~0 1), Black: 246#(and (= ~z~0 1) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)))]) [2023-11-29 04:02:38,636 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2023-11-29 04:02:38,636 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-29 04:02:38,636 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-29 04:02:38,636 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-29 04:02:38,744 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([450] L832-->L839: Formula: (let ((.cse4 (not (= (mod v_~y$r_buff1_thd4~0_26 256) 0))) (.cse3 (not (= (mod v_~y$w_buff0_used~0_103 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd4~0_28 256) 0)))) (let ((.cse1 (and (not (= (mod v_~y$w_buff0_used~0_104 256) 0)) .cse5)) (.cse0 (and .cse3 .cse5)) (.cse2 (and (not (= (mod v_~y$w_buff1_used~0_97 256) 0)) .cse4))) (and (= v_~y$r_buff0_thd4~0_27 (ite .cse0 0 v_~y$r_buff0_thd4~0_28)) (= (ite .cse1 v_~y$w_buff0~0_46 (ite .cse2 v_~y$w_buff1~0_43 v_~y~0_65)) v_~y~0_64) (= (ite .cse1 0 v_~y$w_buff0_used~0_104) v_~y$w_buff0_used~0_103) (= v_~y$w_buff1_used~0_96 (ite (or .cse0 .cse2) 0 v_~y$w_buff1_used~0_97)) (= (ite (or (and (not (= (mod v_~y$r_buff0_thd4~0_27 256) 0)) .cse3) (and (not (= (mod v_~y$w_buff1_used~0_96 256) 0)) .cse4)) 0 v_~y$r_buff1_thd4~0_26) v_~y$r_buff1_thd4~0_25)))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_28, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_26, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_104, ~y$w_buff1~0=v_~y$w_buff1~0_43, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_65, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_97} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_27, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_25, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_103, ~y$w_buff1~0=v_~y$w_buff1~0_43, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_64, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_96} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][88], [Black: 186#(and (= ~__unbuffered_p0_EAX~0 1) (= ~x~0 1)), P0Thread1of1ForFork2InUse, P1Thread1of1ForFork0InUse, 239#(= ~z~0 1), P3Thread1of1ForFork1InUse, Black: 128#(= ~__unbuffered_p3_EAX~0 0), P2Thread1of1ForFork3InUse, 181#(= ~x~0 1), Black: 148#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 48#L809true, Black: 210#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0)), 8#P0EXITtrue, Black: 218#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 160#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1)), Black: 200#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 198#(= ~a~0 1), Black: 196#true, 53#L864true, Black: 204#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~a~0 1)), 43#P1EXITtrue, 266#(and (<= ~__unbuffered_cnt~0 2) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 175#(and (<= ~__unbuffered_cnt~0 2) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256))), 123#(and (not (= |ULTIMATE.start_main_~#t696~0#1.base| |ULTIMATE.start_main_~#t693~0#1.base|)) (not (= |ULTIMATE.start_main_~#t696~0#1.base| |ULTIMATE.start_main_~#t695~0#1.base|)) (= |ULTIMATE.start_main_old_#valid#1| (store (store (store (store |#valid| |ULTIMATE.start_main_~#t693~0#1.base| 0) |ULTIMATE.start_main_~#t694~0#1.base| 0) |ULTIMATE.start_main_~#t695~0#1.base| 0) |ULTIMATE.start_main_~#t696~0#1.base| 0)) (not (= |ULTIMATE.start_main_~#t695~0#1.base| |ULTIMATE.start_main_~#t694~0#1.base|)) (not (= |ULTIMATE.start_main_~#t695~0#1.base| |ULTIMATE.start_main_~#t693~0#1.base|)) (not (= |ULTIMATE.start_main_~#t694~0#1.base| |ULTIMATE.start_main_~#t693~0#1.base|)) (not (= |ULTIMATE.start_main_~#t696~0#1.base| |ULTIMATE.start_main_~#t694~0#1.base|))), 206#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1)), 13#L839true, Black: 240#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 244#(and (= ~z~0 1) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 246#(and (= ~z~0 1) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)))]) [2023-11-29 04:02:38,744 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2023-11-29 04:02:38,744 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-29 04:02:38,744 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-29 04:02:38,745 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-29 04:02:38,850 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([450] L832-->L839: Formula: (let ((.cse4 (not (= (mod v_~y$r_buff1_thd4~0_26 256) 0))) (.cse3 (not (= (mod v_~y$w_buff0_used~0_103 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd4~0_28 256) 0)))) (let ((.cse1 (and (not (= (mod v_~y$w_buff0_used~0_104 256) 0)) .cse5)) (.cse0 (and .cse3 .cse5)) (.cse2 (and (not (= (mod v_~y$w_buff1_used~0_97 256) 0)) .cse4))) (and (= v_~y$r_buff0_thd4~0_27 (ite .cse0 0 v_~y$r_buff0_thd4~0_28)) (= (ite .cse1 v_~y$w_buff0~0_46 (ite .cse2 v_~y$w_buff1~0_43 v_~y~0_65)) v_~y~0_64) (= (ite .cse1 0 v_~y$w_buff0_used~0_104) v_~y$w_buff0_used~0_103) (= v_~y$w_buff1_used~0_96 (ite (or .cse0 .cse2) 0 v_~y$w_buff1_used~0_97)) (= (ite (or (and (not (= (mod v_~y$r_buff0_thd4~0_27 256) 0)) .cse3) (and (not (= (mod v_~y$w_buff1_used~0_96 256) 0)) .cse4)) 0 v_~y$r_buff1_thd4~0_26) v_~y$r_buff1_thd4~0_25)))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_28, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_26, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_104, ~y$w_buff1~0=v_~y$w_buff1~0_43, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_65, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_97} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_27, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_25, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_103, ~y$w_buff1~0=v_~y$w_buff1~0_43, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_64, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_96} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][88], [Black: 181#(= ~x~0 1), P0Thread1of1ForFork2InUse, 186#(and (= ~__unbuffered_p0_EAX~0 1) (= ~x~0 1)), P1Thread1of1ForFork0InUse, Black: 128#(= ~__unbuffered_p3_EAX~0 0), P3Thread1of1ForFork1InUse, 237#true, P2Thread1of1ForFork3InUse, Black: 148#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 46#L756true, Black: 210#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 218#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 160#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1)), Black: 200#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 198#(= ~a~0 1), Black: 196#true, 53#L864true, 62#P2EXITtrue, 266#(and (<= ~__unbuffered_cnt~0 2) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 204#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~a~0 1)), 43#P1EXITtrue, 175#(and (<= ~__unbuffered_cnt~0 2) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256))), 123#(and (not (= |ULTIMATE.start_main_~#t696~0#1.base| |ULTIMATE.start_main_~#t693~0#1.base|)) (not (= |ULTIMATE.start_main_~#t696~0#1.base| |ULTIMATE.start_main_~#t695~0#1.base|)) (= |ULTIMATE.start_main_old_#valid#1| (store (store (store (store |#valid| |ULTIMATE.start_main_~#t693~0#1.base| 0) |ULTIMATE.start_main_~#t694~0#1.base| 0) |ULTIMATE.start_main_~#t695~0#1.base| 0) |ULTIMATE.start_main_~#t696~0#1.base| 0)) (not (= |ULTIMATE.start_main_~#t695~0#1.base| |ULTIMATE.start_main_~#t694~0#1.base|)) (not (= |ULTIMATE.start_main_~#t695~0#1.base| |ULTIMATE.start_main_~#t693~0#1.base|)) (not (= |ULTIMATE.start_main_~#t694~0#1.base| |ULTIMATE.start_main_~#t693~0#1.base|)) (not (= |ULTIMATE.start_main_~#t696~0#1.base| |ULTIMATE.start_main_~#t694~0#1.base|))), Black: 240#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 13#L839true, 206#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1)), Black: 244#(and (= ~z~0 1) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 239#(= ~z~0 1), Black: 246#(and (= ~z~0 1) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)))]) [2023-11-29 04:02:38,851 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2023-11-29 04:02:38,851 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-29 04:02:38,851 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-29 04:02:38,851 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-29 04:02:39,641 INFO L124 PetriNetUnfolderBase]: 18992/27565 cut-off events. [2023-11-29 04:02:39,642 INFO L125 PetriNetUnfolderBase]: For 37440/41737 co-relation queries the response was YES. [2023-11-29 04:02:39,766 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79648 conditions, 27565 events. 18992/27565 cut-off events. For 37440/41737 co-relation queries the response was YES. Maximal size of possible extension queue 1513. Compared 190626 event pairs, 952 based on Foata normal form. 1132/27689 useless extension candidates. Maximal degree in co-relation 79617. Up to 9055 conditions per place. [2023-11-29 04:02:39,793 INFO L140 encePairwiseOnDemand]: 59/66 looper letters, 56 selfloop transitions, 18 changer transitions 23/127 dead transitions. [2023-11-29 04:02:39,793 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 127 transitions, 783 flow [2023-11-29 04:02:39,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 04:02:39,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-29 04:02:39,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 323 transitions. [2023-11-29 04:02:39,796 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6991341991341992 [2023-11-29 04:02:39,796 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 323 transitions. [2023-11-29 04:02:39,796 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 323 transitions. [2023-11-29 04:02:39,797 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:02:39,797 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 323 transitions. [2023-11-29 04:02:39,799 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 46.142857142857146) internal successors, (323), 7 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:02:39,801 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 66.0) internal successors, (528), 8 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:02:39,801 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 66.0) internal successors, (528), 8 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:02:39,801 INFO L175 Difference]: Start difference. First operand has 89 places, 77 transitions, 431 flow. Second operand 7 states and 323 transitions. [2023-11-29 04:02:39,801 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 127 transitions, 783 flow [2023-11-29 04:02:40,680 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 127 transitions, 763 flow, removed 8 selfloop flow, removed 3 redundant places. [2023-11-29 04:02:40,681 INFO L231 Difference]: Finished difference. Result has 92 places, 69 transitions, 402 flow [2023-11-29 04:02:40,682 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=411, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=402, PETRI_PLACES=92, PETRI_TRANSITIONS=69} [2023-11-29 04:02:40,682 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, 19 predicate places. [2023-11-29 04:02:40,682 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 69 transitions, 402 flow [2023-11-29 04:02:40,682 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 36.714285714285715) internal successors, (257), 7 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:02:40,682 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:02:40,683 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:02:40,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-29 04:02:40,683 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 04:02:40,683 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:02:40,683 INFO L85 PathProgramCache]: Analyzing trace with hash 1918582455, now seen corresponding path program 1 times [2023-11-29 04:02:40,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:02:40,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047764428] [2023-11-29 04:02:40,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:02:40,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:02:40,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:02:41,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:02:41,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:02:41,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047764428] [2023-11-29 04:02:41,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047764428] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:02:41,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:02:41,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 04:02:41,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476467929] [2023-11-29 04:02:41,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:02:41,507 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 04:02:41,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:02:41,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 04:02:41,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-29 04:02:41,524 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 66 [2023-11-29 04:02:41,525 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 69 transitions, 402 flow. Second operand has 8 states, 8 states have (on average 34.875) internal successors, (279), 8 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:02:41,525 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:02:41,525 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 66 [2023-11-29 04:02:41,525 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:02:43,566 INFO L124 PetriNetUnfolderBase]: 7686/13021 cut-off events. [2023-11-29 04:02:43,566 INFO L125 PetriNetUnfolderBase]: For 22150/22585 co-relation queries the response was YES. [2023-11-29 04:02:43,617 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38614 conditions, 13021 events. 7686/13021 cut-off events. For 22150/22585 co-relation queries the response was YES. Maximal size of possible extension queue 857. Compared 102333 event pairs, 2150 based on Foata normal form. 90/12265 useless extension candidates. Maximal degree in co-relation 38582. Up to 4293 conditions per place. [2023-11-29 04:02:43,634 INFO L140 encePairwiseOnDemand]: 54/66 looper letters, 60 selfloop transitions, 16 changer transitions 38/146 dead transitions. [2023-11-29 04:02:43,634 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 146 transitions, 986 flow [2023-11-29 04:02:43,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 04:02:43,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-29 04:02:43,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 418 transitions. [2023-11-29 04:02:43,637 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6333333333333333 [2023-11-29 04:02:43,637 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 418 transitions. [2023-11-29 04:02:43,637 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 418 transitions. [2023-11-29 04:02:43,637 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:02:43,637 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 418 transitions. [2023-11-29 04:02:43,639 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 41.8) internal successors, (418), 10 states have internal predecessors, (418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:02:43,640 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 66.0) internal successors, (726), 11 states have internal predecessors, (726), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:02:43,641 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 66.0) internal successors, (726), 11 states have internal predecessors, (726), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:02:43,641 INFO L175 Difference]: Start difference. First operand has 92 places, 69 transitions, 402 flow. Second operand 10 states and 418 transitions. [2023-11-29 04:02:43,641 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 146 transitions, 986 flow [2023-11-29 04:02:43,905 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 146 transitions, 805 flow, removed 42 selfloop flow, removed 15 redundant places. [2023-11-29 04:02:43,907 INFO L231 Difference]: Finished difference. Result has 92 places, 75 transitions, 371 flow [2023-11-29 04:02:43,907 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=276, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=371, PETRI_PLACES=92, PETRI_TRANSITIONS=75} [2023-11-29 04:02:43,908 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, 19 predicate places. [2023-11-29 04:02:43,908 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 75 transitions, 371 flow [2023-11-29 04:02:43,908 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 34.875) internal successors, (279), 8 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:02:43,908 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:02:43,908 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:02:43,909 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-29 04:02:43,909 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 04:02:43,909 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:02:43,909 INFO L85 PathProgramCache]: Analyzing trace with hash 1369432017, now seen corresponding path program 2 times [2023-11-29 04:02:43,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:02:43,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525552600] [2023-11-29 04:02:43,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:02:43,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:02:43,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:02:44,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:02:44,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:02:44,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525552600] [2023-11-29 04:02:44,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525552600] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:02:44,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:02:44,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 04:02:44,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086181810] [2023-11-29 04:02:44,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:02:44,826 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 04:02:44,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:02:44,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 04:02:44,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-11-29 04:02:44,833 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 66 [2023-11-29 04:02:44,834 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 75 transitions, 371 flow. Second operand has 9 states, 9 states have (on average 39.0) internal successors, (351), 9 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:02:44,834 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:02:44,834 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 66 [2023-11-29 04:02:44,834 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:02:46,043 INFO L124 PetriNetUnfolderBase]: 5413/9438 cut-off events. [2023-11-29 04:02:46,043 INFO L125 PetriNetUnfolderBase]: For 4107/4392 co-relation queries the response was YES. [2023-11-29 04:02:46,066 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21660 conditions, 9438 events. 5413/9438 cut-off events. For 4107/4392 co-relation queries the response was YES. Maximal size of possible extension queue 765. Compared 72995 event pairs, 1894 based on Foata normal form. 72/8511 useless extension candidates. Maximal degree in co-relation 21632. Up to 3290 conditions per place. [2023-11-29 04:02:46,071 INFO L140 encePairwiseOnDemand]: 58/66 looper letters, 28 selfloop transitions, 5 changer transitions 46/118 dead transitions. [2023-11-29 04:02:46,071 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 118 transitions, 640 flow [2023-11-29 04:02:46,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 04:02:46,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-29 04:02:46,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 398 transitions. [2023-11-29 04:02:46,073 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.67003367003367 [2023-11-29 04:02:46,073 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 398 transitions. [2023-11-29 04:02:46,073 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 398 transitions. [2023-11-29 04:02:46,073 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:02:46,073 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 398 transitions. [2023-11-29 04:02:46,074 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 44.22222222222222) internal successors, (398), 9 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:02:46,075 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 66.0) internal successors, (660), 10 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:02:46,075 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 66.0) internal successors, (660), 10 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:02:46,075 INFO L175 Difference]: Start difference. First operand has 92 places, 75 transitions, 371 flow. Second operand 9 states and 398 transitions. [2023-11-29 04:02:46,075 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 118 transitions, 640 flow [2023-11-29 04:02:46,081 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 118 transitions, 626 flow, removed 3 selfloop flow, removed 5 redundant places. [2023-11-29 04:02:46,082 INFO L231 Difference]: Finished difference. Result has 98 places, 65 transitions, 282 flow [2023-11-29 04:02:46,082 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=359, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=282, PETRI_PLACES=98, PETRI_TRANSITIONS=65} [2023-11-29 04:02:46,082 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, 25 predicate places. [2023-11-29 04:02:46,082 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 65 transitions, 282 flow [2023-11-29 04:02:46,083 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 39.0) internal successors, (351), 9 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:02:46,083 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:02:46,083 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:02:46,083 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-29 04:02:46,083 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 04:02:46,083 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:02:46,083 INFO L85 PathProgramCache]: Analyzing trace with hash 462805981, now seen corresponding path program 3 times [2023-11-29 04:02:46,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:02:46,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061298035] [2023-11-29 04:02:46,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:02:46,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:02:46,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 04:02:46,130 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 04:02:46,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 04:02:46,219 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 04:02:46,219 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-29 04:02:46,220 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2023-11-29 04:02:46,222 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2023-11-29 04:02:46,222 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2023-11-29 04:02:46,222 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2023-11-29 04:02:46,222 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2023-11-29 04:02:46,222 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2023-11-29 04:02:46,223 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2023-11-29 04:02:46,223 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2023-11-29 04:02:46,223 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2023-11-29 04:02:46,223 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2023-11-29 04:02:46,223 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2023-11-29 04:02:46,223 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2023-11-29 04:02:46,223 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2023-11-29 04:02:46,223 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2023-11-29 04:02:46,224 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2023-11-29 04:02:46,224 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2023-11-29 04:02:46,224 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-11-29 04:02:46,224 INFO L445 BasicCegarLoop]: Path program histogram: [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:02:46,230 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-29 04:02:46,230 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 04:02:46,290 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-29 04:02:46,292 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-29 04:02:46,293 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-29 04:02:46,294 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated [2023-11-29 04:02:46,308 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-29 04:02:46,309 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-29 04:02:46,321 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 04:02:46 BasicIcfg [2023-11-29 04:02:46,321 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 04:02:46,322 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 04:02:46,322 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 04:02:46,322 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 04:02:46,322 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 04:02:16" (3/4) ... [2023-11-29 04:02:46,324 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-29 04:02:46,325 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 04:02:46,326 INFO L158 Benchmark]: Toolchain (without parser) took 31185.42ms. Allocated memory was 161.5MB in the beginning and 3.7GB in the end (delta: 3.5GB). Free memory was 120.2MB in the beginning and 2.8GB in the end (delta: -2.7GB). Peak memory consumption was 844.1MB. Max. memory is 16.1GB. [2023-11-29 04:02:46,326 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 161.5MB. Free memory was 126.8MB in the beginning and 126.8MB in the end (delta: 28.4kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 04:02:46,326 INFO L158 Benchmark]: CACSL2BoogieTranslator took 457.34ms. Allocated memory is still 161.5MB. Free memory was 120.2MB in the beginning and 96.4MB in the end (delta: 23.8MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-11-29 04:02:46,326 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.76ms. Allocated memory is still 161.5MB. Free memory was 96.4MB in the beginning and 93.6MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 04:02:46,327 INFO L158 Benchmark]: Boogie Preprocessor took 61.87ms. Allocated memory is still 161.5MB. Free memory was 93.6MB in the beginning and 90.1MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-29 04:02:46,327 INFO L158 Benchmark]: RCFGBuilder took 735.86ms. Allocated memory was 161.5MB in the beginning and 201.3MB in the end (delta: 39.8MB). Free memory was 90.1MB in the beginning and 157.8MB in the end (delta: -67.6MB). Peak memory consumption was 52.3MB. Max. memory is 16.1GB. [2023-11-29 04:02:46,327 INFO L158 Benchmark]: TraceAbstraction took 29870.94ms. Allocated memory was 201.3MB in the beginning and 3.7GB in the end (delta: 3.5GB). Free memory was 157.8MB in the beginning and 2.8GB in the end (delta: -2.7GB). Peak memory consumption was 840.1MB. Max. memory is 16.1GB. [2023-11-29 04:02:46,328 INFO L158 Benchmark]: Witness Printer took 3.40ms. Allocated memory is still 3.7GB. Free memory is still 2.8GB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 04:02:46,330 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 161.5MB. Free memory was 126.8MB in the beginning and 126.8MB in the end (delta: 28.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 457.34ms. Allocated memory is still 161.5MB. Free memory was 120.2MB in the beginning and 96.4MB in the end (delta: 23.8MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.76ms. Allocated memory is still 161.5MB. Free memory was 96.4MB in the beginning and 93.6MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 61.87ms. Allocated memory is still 161.5MB. Free memory was 93.6MB in the beginning and 90.1MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 735.86ms. Allocated memory was 161.5MB in the beginning and 201.3MB in the end (delta: 39.8MB). Free memory was 90.1MB in the beginning and 157.8MB in the end (delta: -67.6MB). Peak memory consumption was 52.3MB. Max. memory is 16.1GB. * TraceAbstraction took 29870.94ms. Allocated memory was 201.3MB in the beginning and 3.7GB in the end (delta: 3.5GB). Free memory was 157.8MB in the beginning and 2.8GB in the end (delta: -2.7GB). Peak memory consumption was 840.1MB. Max. memory is 16.1GB. * Witness Printer took 3.40ms. Allocated memory is still 3.7GB. Free memory is still 2.8GB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~nondet0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~nondet0 - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L721] 0 _Bool main$tmp_guard0; [L722] 0 _Bool main$tmp_guard1; [L724] 0 int x = 0; [L726] 0 int y = 0; [L727] 0 _Bool y$flush_delayed; [L728] 0 int y$mem_tmp; [L729] 0 _Bool y$r_buff0_thd0; [L730] 0 _Bool y$r_buff0_thd1; [L731] 0 _Bool y$r_buff0_thd2; [L732] 0 _Bool y$r_buff0_thd3; [L733] 0 _Bool y$r_buff0_thd4; [L734] 0 _Bool y$r_buff1_thd0; [L735] 0 _Bool y$r_buff1_thd1; [L736] 0 _Bool y$r_buff1_thd2; [L737] 0 _Bool y$r_buff1_thd3; [L738] 0 _Bool y$r_buff1_thd4; [L739] 0 _Bool y$read_delayed; [L740] 0 int *y$read_delayed_var; [L741] 0 int y$w_buff0; [L742] 0 _Bool y$w_buff0_used; [L743] 0 int y$w_buff1; [L744] 0 _Bool y$w_buff1_used; [L746] 0 int z = 0; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L856] 0 pthread_t t693; [L857] FCALL, FORK 0 pthread_create(&t693, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t693={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L858] 0 pthread_t t694; [L859] FCALL, FORK 0 pthread_create(&t694, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t693={5:0}, t694={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L860] 0 pthread_t t695; [L861] FCALL, FORK 0 pthread_create(&t695, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t693={5:0}, t694={6:0}, t695={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L862] 0 pthread_t t696; [L863] FCALL, FORK 0 pthread_create(&t696, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t693={5:0}, t694={6:0}, t695={7:0}, t696={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L795] 3 y$w_buff1 = y$w_buff0 [L796] 3 y$w_buff0 = 1 [L797] 3 y$w_buff1_used = y$w_buff0_used [L798] 3 y$w_buff0_used = (_Bool)1 [L799] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L799] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L800] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L801] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L802] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L803] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L804] 3 y$r_buff1_thd4 = y$r_buff0_thd4 [L805] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L808] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L825] 4 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L828] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L831] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L752] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L755] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L767] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L770] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L771] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L772] 2 y$flush_delayed = weak$$choice2 [L773] 2 y$mem_tmp = y [L774] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L775] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L776] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L777] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L778] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L779] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L780] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L781] 2 __unbuffered_p1_EAX = y [L782] 2 y = y$flush_delayed ? y$mem_tmp : y [L783] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L811] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L812] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L813] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L814] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L815] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L818] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L788] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L760] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L834] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L835] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L836] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L837] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L838] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L841] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L865] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t693={5:0}, t694={6:0}, t695={7:0}, t696={3:0}, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L867] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L867] RET 0 assume_abort_if_not(main$tmp_guard0) [L869] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L870] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L871] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L872] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L873] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t693={5:0}, t694={6:0}, t695={7:0}, t696={3:0}, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L876] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t693={5:0}, t694={6:0}, t695={7:0}, t696={3:0}, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L878] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L17] 0 __assert_fail ("0", "mix026_pso.opt_rmo.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 854]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 857]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 859]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 863]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 861]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 99 locations, 16 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 29.7s, OverallIterations: 21, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 24.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1201 SdHoareTripleChecker+Valid, 3.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1036 mSDsluCounter, 262 SdHoareTripleChecker+Invalid, 2.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 191 mSDsCounter, 76 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2814 IncrementalHoareTripleChecker+Invalid, 2890 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 76 mSolverCounterUnsat, 71 mSDtfsCounter, 2814 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 116 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=431occurred in iteration=17, InterpolantAutomatonStates: 109, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.4s InterpolantComputationTime, 462 NumberOfCodeBlocks, 462 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 400 ConstructedInterpolants, 0 QuantifiedInterpolants, 2558 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-11-29 04:02:46,351 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0006e79-8d33-487c-b435-1f4741572d13/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0006e79-8d33-487c-b435-1f4741572d13/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0006e79-8d33-487c-b435-1f4741572d13/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0006e79-8d33-487c-b435-1f4741572d13/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0006e79-8d33-487c-b435-1f4741572d13/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix026_pso.opt_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0006e79-8d33-487c-b435-1f4741572d13/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0006e79-8d33-487c-b435-1f4741572d13/bin/uautomizer-verify-BQ2R08f2Ya --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 a0c922061e4dc1feb6389a43fa3f654e69e326084cac4d5446a529710663ff29 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 04:02:48,310 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 04:02:48,380 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0006e79-8d33-487c-b435-1f4741572d13/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-11-29 04:02:48,390 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 04:02:48,392 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 04:02:48,420 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 04:02:48,420 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 04:02:48,421 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 04:02:48,422 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 04:02:48,422 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 04:02:48,423 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 04:02:48,423 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 04:02:48,424 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 04:02:48,425 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 04:02:48,426 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 04:02:48,426 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 04:02:48,427 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 04:02:48,427 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 04:02:48,428 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 04:02:48,428 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 04:02:48,429 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-29 04:02:48,429 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-29 04:02:48,429 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-29 04:02:48,430 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 04:02:48,430 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 04:02:48,431 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-29 04:02:48,431 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-29 04:02:48,431 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 04:02:48,432 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 04:02:48,432 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 04:02:48,433 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 04:02:48,433 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 04:02:48,433 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 04:02:48,434 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 04:02:48,434 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 04:02:48,434 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 04:02:48,434 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 04:02:48,435 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-29 04:02:48,435 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-29 04:02:48,435 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 04:02:48,435 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 04:02:48,436 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 04:02:48,436 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 04:02:48,436 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-29 04:02:48,436 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_f0006e79-8d33-487c-b435-1f4741572d13/bin/uautomizer-verify-BQ2R08f2Ya/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_f0006e79-8d33-487c-b435-1f4741572d13/bin/uautomizer-verify-BQ2R08f2Ya 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 -> a0c922061e4dc1feb6389a43fa3f654e69e326084cac4d5446a529710663ff29 [2023-11-29 04:02:48,729 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 04:02:48,750 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 04:02:48,752 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 04:02:48,754 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 04:02:48,754 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 04:02:48,755 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0006e79-8d33-487c-b435-1f4741572d13/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/pthread-wmm/mix026_pso.opt_rmo.opt.i [2023-11-29 04:02:51,566 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 04:02:51,817 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 04:02:51,817 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0006e79-8d33-487c-b435-1f4741572d13/sv-benchmarks/c/pthread-wmm/mix026_pso.opt_rmo.opt.i [2023-11-29 04:02:51,834 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0006e79-8d33-487c-b435-1f4741572d13/bin/uautomizer-verify-BQ2R08f2Ya/data/cc57fd3fe/3f087d3f9faf4980b25c3ce9ae820e6c/FLAGdf4dddfde [2023-11-29 04:02:51,848 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0006e79-8d33-487c-b435-1f4741572d13/bin/uautomizer-verify-BQ2R08f2Ya/data/cc57fd3fe/3f087d3f9faf4980b25c3ce9ae820e6c [2023-11-29 04:02:51,850 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 04:02:51,851 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 04:02:51,853 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 04:02:51,853 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 04:02:51,858 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 04:02:51,858 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 04:02:51" (1/1) ... [2023-11-29 04:02:51,859 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24313abc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:02:51, skipping insertion in model container [2023-11-29 04:02:51,860 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 04:02:51" (1/1) ... [2023-11-29 04:02:51,917 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 04:02:52,285 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 04:02:52,301 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 04:02:52,350 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 04:02:52,388 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 04:02:52,388 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 04:02:52,395 INFO L206 MainTranslator]: Completed translation [2023-11-29 04:02:52,396 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:02:52 WrapperNode [2023-11-29 04:02:52,396 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 04:02:52,397 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 04:02:52,397 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 04:02:52,397 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 04:02:52,405 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:02:52" (1/1) ... [2023-11-29 04:02:52,425 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:02:52" (1/1) ... [2023-11-29 04:02:52,451 INFO L138 Inliner]: procedures = 180, calls = 70, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 151 [2023-11-29 04:02:52,451 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 04:02:52,452 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 04:02:52,452 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 04:02:52,453 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 04:02:52,463 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:02:52" (1/1) ... [2023-11-29 04:02:52,464 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:02:52" (1/1) ... [2023-11-29 04:02:52,469 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:02:52" (1/1) ... [2023-11-29 04:02:52,486 INFO L175 MemorySlicer]: Split 6 memory accesses to 5 slices as follows [2, 1, 1, 1, 1]. 33 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0, 0]. The 4 writes are split as follows [0, 1, 1, 1, 1]. [2023-11-29 04:02:52,487 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:02:52" (1/1) ... [2023-11-29 04:02:52,487 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:02:52" (1/1) ... [2023-11-29 04:02:52,497 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:02:52" (1/1) ... [2023-11-29 04:02:52,500 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:02:52" (1/1) ... [2023-11-29 04:02:52,503 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:02:52" (1/1) ... [2023-11-29 04:02:52,505 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:02:52" (1/1) ... [2023-11-29 04:02:52,510 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 04:02:52,511 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 04:02:52,511 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 04:02:52,511 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 04:02:52,512 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:02:52" (1/1) ... [2023-11-29 04:02:52,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 04:02:52,534 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0006e79-8d33-487c-b435-1f4741572d13/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:02:52,546 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0006e79-8d33-487c-b435-1f4741572d13/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 04:02:52,556 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0006e79-8d33-487c-b435-1f4741572d13/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 04:02:52,586 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-29 04:02:52,586 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 04:02:52,586 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 04:02:52,587 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 04:02:52,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-11-29 04:02:52,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-11-29 04:02:52,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2023-11-29 04:02:52,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2023-11-29 04:02:52,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2023-11-29 04:02:52,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-29 04:02:52,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-11-29 04:02:52,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-11-29 04:02:52,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2023-11-29 04:02:52,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2023-11-29 04:02:52,589 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-29 04:02:52,589 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-29 04:02:52,589 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-29 04:02:52,589 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-29 04:02:52,590 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-29 04:02:52,590 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-29 04:02:52,590 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-11-29 04:02:52,590 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-11-29 04:02:52,590 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-29 04:02:52,591 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 04:02:52,591 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 04:02:52,592 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-29 04:02:52,762 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 04:02:52,765 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 04:02:53,099 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 04:02:53,299 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 04:02:53,299 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-29 04:02:53,299 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 04:02:53 BoogieIcfgContainer [2023-11-29 04:02:53,299 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 04:02:53,319 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 04:02:53,319 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 04:02:53,322 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 04:02:53,322 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 04:02:51" (1/3) ... [2023-11-29 04:02:53,323 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70e9ece and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 04:02:53, skipping insertion in model container [2023-11-29 04:02:53,323 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:02:52" (2/3) ... [2023-11-29 04:02:53,324 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70e9ece and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 04:02:53, skipping insertion in model container [2023-11-29 04:02:53,324 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 04:02:53" (3/3) ... [2023-11-29 04:02:53,325 INFO L112 eAbstractionObserver]: Analyzing ICFG mix026_pso.opt_rmo.opt.i [2023-11-29 04:02:53,342 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 04:02:53,342 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2023-11-29 04:02:53,342 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-29 04:02:53,409 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-29 04:02:53,445 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 77 places, 66 transitions, 148 flow [2023-11-29 04:02:53,476 INFO L124 PetriNetUnfolderBase]: 2/62 cut-off events. [2023-11-29 04:02:53,476 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 04:02:53,480 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75 conditions, 62 events. 2/62 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 132 event pairs, 0 based on Foata normal form. 0/49 useless extension candidates. Maximal degree in co-relation 63. Up to 2 conditions per place. [2023-11-29 04:02:53,480 INFO L82 GeneralOperation]: Start removeDead. Operand has 77 places, 66 transitions, 148 flow [2023-11-29 04:02:53,484 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 73 places, 62 transitions, 136 flow [2023-11-29 04:02:53,494 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 04:02:53,501 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3aa3c948, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 04:02:53,501 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-11-29 04:02:53,503 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-29 04:02:53,503 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-11-29 04:02:53,504 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 04:02:53,504 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:02:53,504 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-29 04:02:53,505 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 04:02:53,510 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:02:53,510 INFO L85 PathProgramCache]: Analyzing trace with hash 13846, now seen corresponding path program 1 times [2023-11-29 04:02:53,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:02:53,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [831039865] [2023-11-29 04:02:53,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:02:53,535 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:02:53,536 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0006e79-8d33-487c-b435-1f4741572d13/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:02:53,542 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0006e79-8d33-487c-b435-1f4741572d13/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:02:53,560 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0006e79-8d33-487c-b435-1f4741572d13/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-11-29 04:02:53,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:02:53,682 INFO L262 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 04:02:53,687 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:02:53,748 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 04:02:53,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:02:53,760 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:02:53,760 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:02:53,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [831039865] [2023-11-29 04:02:53,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [831039865] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:02:53,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:02:53,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 04:02:53,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290265188] [2023-11-29 04:02:53,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:02:53,771 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:02:53,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:02:53,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:02:53,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:02:53,838 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 66 [2023-11-29 04:02:53,840 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 62 transitions, 136 flow. Second operand has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:02:53,840 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:02:53,840 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 66 [2023-11-29 04:02:53,841 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:02:54,644 INFO L124 PetriNetUnfolderBase]: 1941/3575 cut-off events. [2023-11-29 04:02:54,644 INFO L125 PetriNetUnfolderBase]: For 38/38 co-relation queries the response was YES. [2023-11-29 04:02:54,658 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6398 conditions, 3575 events. 1941/3575 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 266. Compared 28307 event pairs, 1467 based on Foata normal form. 180/3414 useless extension candidates. Maximal degree in co-relation 6383. Up to 2085 conditions per place. [2023-11-29 04:02:54,688 INFO L140 encePairwiseOnDemand]: 61/66 looper letters, 32 selfloop transitions, 2 changer transitions 0/67 dead transitions. [2023-11-29 04:02:54,688 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 67 transitions, 214 flow [2023-11-29 04:02:54,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:02:54,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 04:02:54,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 148 transitions. [2023-11-29 04:02:54,701 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7474747474747475 [2023-11-29 04:02:54,702 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 148 transitions. [2023-11-29 04:02:54,702 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 148 transitions. [2023-11-29 04:02:54,703 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:02:54,706 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 148 transitions. [2023-11-29 04:02:54,708 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:02:54,712 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 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) [2023-11-29 04:02:54,712 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 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) [2023-11-29 04:02:54,713 INFO L175 Difference]: Start difference. First operand has 73 places, 62 transitions, 136 flow. Second operand 3 states and 148 transitions. [2023-11-29 04:02:54,714 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 67 transitions, 214 flow [2023-11-29 04:02:54,719 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 67 transitions, 210 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-29 04:02:54,722 INFO L231 Difference]: Finished difference. Result has 69 places, 58 transitions, 128 flow [2023-11-29 04:02:54,724 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=128, PETRI_PLACES=69, PETRI_TRANSITIONS=58} [2023-11-29 04:02:54,727 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, -4 predicate places. [2023-11-29 04:02:54,728 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 58 transitions, 128 flow [2023-11-29 04:02:54,728 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:02:54,728 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:02:54,728 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-29 04:02:54,733 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0006e79-8d33-487c-b435-1f4741572d13/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-11-29 04:02:54,929 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0006e79-8d33-487c-b435-1f4741572d13/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:02:54,929 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 04:02:54,930 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:02:54,930 INFO L85 PathProgramCache]: Analyzing trace with hash 13847, now seen corresponding path program 1 times [2023-11-29 04:02:54,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:02:54,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2011497618] [2023-11-29 04:02:54,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:02:54,931 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:02:54,931 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0006e79-8d33-487c-b435-1f4741572d13/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:02:54,932 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0006e79-8d33-487c-b435-1f4741572d13/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:02:54,933 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0006e79-8d33-487c-b435-1f4741572d13/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-11-29 04:02:55,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:02:55,018 INFO L262 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 04:02:55,019 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:02:55,029 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 04:02:55,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:02:55,039 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:02:55,040 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:02:55,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2011497618] [2023-11-29 04:02:55,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2011497618] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:02:55,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:02:55,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 04:02:55,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922983372] [2023-11-29 04:02:55,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:02:55,042 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:02:55,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:02:55,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:02:55,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:02:55,093 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 66 [2023-11-29 04:02:55,094 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 58 transitions, 128 flow. Second operand has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:02:55,094 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:02:55,094 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 66 [2023-11-29 04:02:55,094 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:02:55,612 INFO L124 PetriNetUnfolderBase]: 1941/3574 cut-off events. [2023-11-29 04:02:55,612 INFO L125 PetriNetUnfolderBase]: For 90/90 co-relation queries the response was YES. [2023-11-29 04:02:55,617 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6484 conditions, 3574 events. 1941/3574 cut-off events. For 90/90 co-relation queries the response was YES. Maximal size of possible extension queue 266. Compared 28351 event pairs, 1467 based on Foata normal form. 1/3234 useless extension candidates. Maximal degree in co-relation 6473. Up to 2084 conditions per place. [2023-11-29 04:02:55,636 INFO L140 encePairwiseOnDemand]: 63/66 looper letters, 31 selfloop transitions, 2 changer transitions 0/66 dead transitions. [2023-11-29 04:02:55,636 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 66 transitions, 210 flow [2023-11-29 04:02:55,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:02:55,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 04:02:55,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 148 transitions. [2023-11-29 04:02:55,639 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7474747474747475 [2023-11-29 04:02:55,639 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 148 transitions. [2023-11-29 04:02:55,639 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 148 transitions. [2023-11-29 04:02:55,640 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:02:55,640 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 148 transitions. [2023-11-29 04:02:55,641 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:02:55,643 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 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) [2023-11-29 04:02:55,643 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 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) [2023-11-29 04:02:55,643 INFO L175 Difference]: Start difference. First operand has 69 places, 58 transitions, 128 flow. Second operand 3 states and 148 transitions. [2023-11-29 04:02:55,644 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 66 transitions, 210 flow [2023-11-29 04:02:55,649 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 66 transitions, 206 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 04:02:55,650 INFO L231 Difference]: Finished difference. Result has 68 places, 57 transitions, 126 flow [2023-11-29 04:02:55,651 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=126, PETRI_PLACES=68, PETRI_TRANSITIONS=57} [2023-11-29 04:02:55,651 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, -5 predicate places. [2023-11-29 04:02:55,652 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 57 transitions, 126 flow [2023-11-29 04:02:55,652 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:02:55,652 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:02:55,652 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-29 04:02:55,654 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0006e79-8d33-487c-b435-1f4741572d13/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2023-11-29 04:02:55,852 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0006e79-8d33-487c-b435-1f4741572d13/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:02:55,853 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 04:02:55,854 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:02:55,854 INFO L85 PathProgramCache]: Analyzing trace with hash 412911375, now seen corresponding path program 1 times [2023-11-29 04:02:55,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:02:55,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1954114487] [2023-11-29 04:02:55,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:02:55,855 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:02:55,855 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0006e79-8d33-487c-b435-1f4741572d13/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:02:55,856 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0006e79-8d33-487c-b435-1f4741572d13/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:02:55,858 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0006e79-8d33-487c-b435-1f4741572d13/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-11-29 04:02:55,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:02:55,977 INFO L262 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 04:02:55,979 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:02:55,985 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 04:02:55,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:02:55,993 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:02:55,994 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:02:55,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1954114487] [2023-11-29 04:02:55,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1954114487] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:02:55,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:02:55,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 04:02:55,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131595881] [2023-11-29 04:02:55,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:02:55,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:02:55,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:02:55,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:02:55,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:02:56,041 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 66 [2023-11-29 04:02:56,042 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 57 transitions, 126 flow. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:02:56,042 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:02:56,042 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 66 [2023-11-29 04:02:56,042 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:02:56,822 INFO L124 PetriNetUnfolderBase]: 1942/3572 cut-off events. [2023-11-29 04:02:56,822 INFO L125 PetriNetUnfolderBase]: For 90/90 co-relation queries the response was YES. [2023-11-29 04:02:56,830 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6485 conditions, 3572 events. 1942/3572 cut-off events. For 90/90 co-relation queries the response was YES. Maximal size of possible extension queue 266. Compared 28166 event pairs, 1467 based on Foata normal form. 0/3235 useless extension candidates. Maximal degree in co-relation 6474. Up to 2084 conditions per place. [2023-11-29 04:02:56,857 INFO L140 encePairwiseOnDemand]: 63/66 looper letters, 32 selfloop transitions, 2 changer transitions 0/65 dead transitions. [2023-11-29 04:02:56,857 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 65 transitions, 210 flow [2023-11-29 04:02:56,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:02:56,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 04:02:56,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 146 transitions. [2023-11-29 04:02:56,859 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7373737373737373 [2023-11-29 04:02:56,859 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 146 transitions. [2023-11-29 04:02:56,859 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 146 transitions. [2023-11-29 04:02:56,860 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:02:56,860 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 146 transitions. [2023-11-29 04:02:56,861 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:02:56,862 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 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) [2023-11-29 04:02:56,863 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 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) [2023-11-29 04:02:56,863 INFO L175 Difference]: Start difference. First operand has 68 places, 57 transitions, 126 flow. Second operand 3 states and 146 transitions. [2023-11-29 04:02:56,863 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 65 transitions, 210 flow [2023-11-29 04:02:56,869 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 65 transitions, 206 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 04:02:56,871 INFO L231 Difference]: Finished difference. Result has 67 places, 56 transitions, 124 flow [2023-11-29 04:02:56,871 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=124, PETRI_PLACES=67, PETRI_TRANSITIONS=56} [2023-11-29 04:02:56,872 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, -6 predicate places. [2023-11-29 04:02:56,872 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 56 transitions, 124 flow [2023-11-29 04:02:56,873 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:02:56,873 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:02:56,873 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-29 04:02:56,875 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0006e79-8d33-487c-b435-1f4741572d13/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2023-11-29 04:02:57,073 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0006e79-8d33-487c-b435-1f4741572d13/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:02:57,074 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 04:02:57,074 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:02:57,075 INFO L85 PathProgramCache]: Analyzing trace with hash 412911376, now seen corresponding path program 1 times [2023-11-29 04:02:57,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:02:57,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [881317015] [2023-11-29 04:02:57,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:02:57,076 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:02:57,076 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0006e79-8d33-487c-b435-1f4741572d13/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:02:57,077 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0006e79-8d33-487c-b435-1f4741572d13/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:02:57,079 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0006e79-8d33-487c-b435-1f4741572d13/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-11-29 04:02:57,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:02:57,181 INFO L262 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 04:02:57,183 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:02:57,193 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 04:02:57,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:02:57,208 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:02:57,208 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:02:57,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [881317015] [2023-11-29 04:02:57,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [881317015] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:02:57,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:02:57,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 04:02:57,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562774912] [2023-11-29 04:02:57,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:02:57,210 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:02:57,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:02:57,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:02:57,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:02:57,267 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 66 [2023-11-29 04:02:57,268 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 56 transitions, 124 flow. Second operand has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:02:57,268 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:02:57,268 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 66 [2023-11-29 04:02:57,268 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:02:57,942 INFO L124 PetriNetUnfolderBase]: 1941/3569 cut-off events. [2023-11-29 04:02:57,943 INFO L125 PetriNetUnfolderBase]: For 91/91 co-relation queries the response was YES. [2023-11-29 04:02:57,969 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6480 conditions, 3569 events. 1941/3569 cut-off events. For 91/91 co-relation queries the response was YES. Maximal size of possible extension queue 266. Compared 28204 event pairs, 1466 based on Foata normal form. 2/3235 useless extension candidates. Maximal degree in co-relation 6470. Up to 2081 conditions per place. [2023-11-29 04:02:57,990 INFO L140 encePairwiseOnDemand]: 63/66 looper letters, 31 selfloop transitions, 2 changer transitions 0/64 dead transitions. [2023-11-29 04:02:57,990 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 64 transitions, 206 flow [2023-11-29 04:02:57,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:02:57,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 04:02:57,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 148 transitions. [2023-11-29 04:02:57,992 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7474747474747475 [2023-11-29 04:02:57,993 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 148 transitions. [2023-11-29 04:02:57,993 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 148 transitions. [2023-11-29 04:02:57,993 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:02:57,993 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 148 transitions. [2023-11-29 04:02:57,994 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:02:57,995 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 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) [2023-11-29 04:02:57,996 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 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) [2023-11-29 04:02:57,996 INFO L175 Difference]: Start difference. First operand has 67 places, 56 transitions, 124 flow. Second operand 3 states and 148 transitions. [2023-11-29 04:02:57,996 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 64 transitions, 206 flow [2023-11-29 04:02:58,000 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 64 transitions, 202 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 04:02:58,002 INFO L231 Difference]: Finished difference. Result has 66 places, 55 transitions, 122 flow [2023-11-29 04:02:58,002 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=122, PETRI_PLACES=66, PETRI_TRANSITIONS=55} [2023-11-29 04:02:58,003 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, -7 predicate places. [2023-11-29 04:02:58,003 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 55 transitions, 122 flow [2023-11-29 04:02:58,003 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:02:58,003 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:02:58,004 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:02:58,006 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0006e79-8d33-487c-b435-1f4741572d13/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-11-29 04:02:58,204 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0006e79-8d33-487c-b435-1f4741572d13/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:02:58,204 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 04:02:58,205 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:02:58,205 INFO L85 PathProgramCache]: Analyzing trace with hash 256857596, now seen corresponding path program 1 times [2023-11-29 04:02:58,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:02:58,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1569377216] [2023-11-29 04:02:58,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:02:58,206 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:02:58,206 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0006e79-8d33-487c-b435-1f4741572d13/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:02:58,207 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0006e79-8d33-487c-b435-1f4741572d13/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:02:58,208 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0006e79-8d33-487c-b435-1f4741572d13/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-11-29 04:02:58,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:02:58,319 INFO L262 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 04:02:58,321 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:02:58,328 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 04:02:58,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:02:58,335 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:02:58,336 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:02:58,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1569377216] [2023-11-29 04:02:58,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1569377216] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:02:58,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:02:58,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 04:02:58,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926216583] [2023-11-29 04:02:58,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:02:58,338 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:02:58,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:02:58,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:02:58,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:02:58,376 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 66 [2023-11-29 04:02:58,377 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 55 transitions, 122 flow. Second operand has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:02:58,377 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:02:58,377 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 66 [2023-11-29 04:02:58,377 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:02:59,044 INFO L124 PetriNetUnfolderBase]: 1948/3546 cut-off events. [2023-11-29 04:02:59,044 INFO L125 PetriNetUnfolderBase]: For 91/91 co-relation queries the response was YES. [2023-11-29 04:02:59,051 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6470 conditions, 3546 events. 1948/3546 cut-off events. For 91/91 co-relation queries the response was YES. Maximal size of possible extension queue 264. Compared 27496 event pairs, 1499 based on Foata normal form. 0/3222 useless extension candidates. Maximal degree in co-relation 6460. Up to 2082 conditions per place. [2023-11-29 04:02:59,072 INFO L140 encePairwiseOnDemand]: 63/66 looper letters, 32 selfloop transitions, 2 changer transitions 0/63 dead transitions. [2023-11-29 04:02:59,072 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 63 transitions, 206 flow [2023-11-29 04:02:59,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:02:59,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 04:02:59,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 146 transitions. [2023-11-29 04:02:59,075 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7373737373737373 [2023-11-29 04:02:59,075 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 146 transitions. [2023-11-29 04:02:59,075 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 146 transitions. [2023-11-29 04:02:59,075 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:02:59,076 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 146 transitions. [2023-11-29 04:02:59,077 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:02:59,078 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 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) [2023-11-29 04:02:59,079 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 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) [2023-11-29 04:02:59,079 INFO L175 Difference]: Start difference. First operand has 66 places, 55 transitions, 122 flow. Second operand 3 states and 146 transitions. [2023-11-29 04:02:59,079 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 63 transitions, 206 flow [2023-11-29 04:02:59,084 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 63 transitions, 202 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 04:02:59,086 INFO L231 Difference]: Finished difference. Result has 65 places, 54 transitions, 120 flow [2023-11-29 04:02:59,087 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=120, PETRI_PLACES=65, PETRI_TRANSITIONS=54} [2023-11-29 04:02:59,088 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, -8 predicate places. [2023-11-29 04:02:59,088 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 54 transitions, 120 flow [2023-11-29 04:02:59,089 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:02:59,089 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:02:59,089 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:02:59,093 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0006e79-8d33-487c-b435-1f4741572d13/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2023-11-29 04:02:59,296 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0006e79-8d33-487c-b435-1f4741572d13/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:02:59,297 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 04:02:59,297 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:02:59,297 INFO L85 PathProgramCache]: Analyzing trace with hash 256857597, now seen corresponding path program 1 times [2023-11-29 04:02:59,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:02:59,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1576562810] [2023-11-29 04:02:59,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:02:59,298 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:02:59,299 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0006e79-8d33-487c-b435-1f4741572d13/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:02:59,300 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0006e79-8d33-487c-b435-1f4741572d13/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:02:59,301 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0006e79-8d33-487c-b435-1f4741572d13/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-11-29 04:02:59,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:02:59,411 INFO L262 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 04:02:59,413 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:02:59,427 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 04:02:59,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:02:59,442 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:02:59,443 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:02:59,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1576562810] [2023-11-29 04:02:59,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1576562810] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:02:59,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:02:59,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 04:02:59,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049964287] [2023-11-29 04:02:59,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:02:59,445 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:02:59,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:02:59,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:02:59,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:02:59,500 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 66 [2023-11-29 04:02:59,500 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 54 transitions, 120 flow. Second operand has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:02:59,501 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:02:59,501 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 66 [2023-11-29 04:02:59,501 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:03:00,202 INFO L124 PetriNetUnfolderBase]: 1941/3558 cut-off events. [2023-11-29 04:03:00,202 INFO L125 PetriNetUnfolderBase]: For 94/94 co-relation queries the response was YES. [2023-11-29 04:03:00,207 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6473 conditions, 3558 events. 1941/3558 cut-off events. For 94/94 co-relation queries the response was YES. Maximal size of possible extension queue 266. Compared 27919 event pairs, 970 based on Foata normal form. 6/3244 useless extension candidates. Maximal degree in co-relation 6463. Up to 2069 conditions per place. [2023-11-29 04:03:00,221 INFO L140 encePairwiseOnDemand]: 63/66 looper letters, 31 selfloop transitions, 2 changer transitions 0/62 dead transitions. [2023-11-29 04:03:00,222 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 62 transitions, 202 flow [2023-11-29 04:03:00,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:03:00,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 04:03:00,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 148 transitions. [2023-11-29 04:03:00,223 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7474747474747475 [2023-11-29 04:03:00,223 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 148 transitions. [2023-11-29 04:03:00,224 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 148 transitions. [2023-11-29 04:03:00,224 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:03:00,224 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 148 transitions. [2023-11-29 04:03:00,225 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:03:00,226 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 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) [2023-11-29 04:03:00,226 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 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) [2023-11-29 04:03:00,226 INFO L175 Difference]: Start difference. First operand has 65 places, 54 transitions, 120 flow. Second operand 3 states and 148 transitions. [2023-11-29 04:03:00,226 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 62 transitions, 202 flow [2023-11-29 04:03:00,228 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 62 transitions, 198 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 04:03:00,230 INFO L231 Difference]: Finished difference. Result has 64 places, 53 transitions, 118 flow [2023-11-29 04:03:00,230 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=118, PETRI_PLACES=64, PETRI_TRANSITIONS=53} [2023-11-29 04:03:00,231 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, -9 predicate places. [2023-11-29 04:03:00,231 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 53 transitions, 118 flow [2023-11-29 04:03:00,231 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:03:00,232 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:03:00,232 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:03:00,234 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0006e79-8d33-487c-b435-1f4741572d13/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2023-11-29 04:03:00,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0006e79-8d33-487c-b435-1f4741572d13/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:03:00,435 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting P2Err0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 04:03:00,435 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:03:00,435 INFO L85 PathProgramCache]: Analyzing trace with hash -1586650732, now seen corresponding path program 1 times [2023-11-29 04:03:00,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:03:00,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [192761632] [2023-11-29 04:03:00,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:03:00,436 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:03:00,436 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0006e79-8d33-487c-b435-1f4741572d13/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:03:00,437 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0006e79-8d33-487c-b435-1f4741572d13/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:03:00,438 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0006e79-8d33-487c-b435-1f4741572d13/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-11-29 04:03:00,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:03:00,519 INFO L262 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 04:03:00,520 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:03:00,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:03:00,539 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:03:00,539 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:03:00,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [192761632] [2023-11-29 04:03:00,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [192761632] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:03:00,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:03:00,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 04:03:00,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22542176] [2023-11-29 04:03:00,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:03:00,541 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:03:00,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:03:00,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:03:00,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:03:00,542 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 66 [2023-11-29 04:03:00,542 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 53 transitions, 118 flow. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:03:00,542 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:03:00,543 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 66 [2023-11-29 04:03:00,543 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:03:00,832 INFO L124 PetriNetUnfolderBase]: 1525/2662 cut-off events. [2023-11-29 04:03:00,832 INFO L125 PetriNetUnfolderBase]: For 76/76 co-relation queries the response was YES. [2023-11-29 04:03:00,836 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4975 conditions, 2662 events. 1525/2662 cut-off events. For 76/76 co-relation queries the response was YES. Maximal size of possible extension queue 201. Compared 19549 event pairs, 277 based on Foata normal form. 0/2613 useless extension candidates. Maximal degree in co-relation 4965. Up to 1717 conditions per place. [2023-11-29 04:03:00,844 INFO L140 encePairwiseOnDemand]: 63/66 looper letters, 33 selfloop transitions, 2 changer transitions 2/66 dead transitions. [2023-11-29 04:03:00,844 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 66 transitions, 222 flow [2023-11-29 04:03:00,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:03:00,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 04:03:00,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 155 transitions. [2023-11-29 04:03:00,845 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7828282828282829 [2023-11-29 04:03:00,845 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 155 transitions. [2023-11-29 04:03:00,846 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 155 transitions. [2023-11-29 04:03:00,846 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:03:00,846 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 155 transitions. [2023-11-29 04:03:00,847 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:03:00,847 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 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) [2023-11-29 04:03:00,848 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 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) [2023-11-29 04:03:00,848 INFO L175 Difference]: Start difference. First operand has 64 places, 53 transitions, 118 flow. Second operand 3 states and 155 transitions. [2023-11-29 04:03:00,848 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 66 transitions, 222 flow [2023-11-29 04:03:00,849 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 66 transitions, 216 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 04:03:00,850 INFO L231 Difference]: Finished difference. Result has 63 places, 51 transitions, 114 flow [2023-11-29 04:03:00,851 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=114, PETRI_PLACES=63, PETRI_TRANSITIONS=51} [2023-11-29 04:03:00,851 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, -10 predicate places. [2023-11-29 04:03:00,851 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 51 transitions, 114 flow [2023-11-29 04:03:00,852 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:03:00,852 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:03:00,852 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:03:00,854 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0006e79-8d33-487c-b435-1f4741572d13/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-11-29 04:03:01,052 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0006e79-8d33-487c-b435-1f4741572d13/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:03:01,053 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 04:03:01,053 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:03:01,053 INFO L85 PathProgramCache]: Analyzing trace with hash -1586652230, now seen corresponding path program 1 times [2023-11-29 04:03:01,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:03:01,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1359856234] [2023-11-29 04:03:01,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:03:01,054 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:03:01,054 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0006e79-8d33-487c-b435-1f4741572d13/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:03:01,055 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0006e79-8d33-487c-b435-1f4741572d13/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:03:01,056 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0006e79-8d33-487c-b435-1f4741572d13/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-11-29 04:03:01,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:03:01,148 INFO L262 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 04:03:01,149 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:03:01,160 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 04:03:01,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:03:01,165 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:03:01,165 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:03:01,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1359856234] [2023-11-29 04:03:01,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1359856234] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:03:01,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:03:01,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 04:03:01,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619696925] [2023-11-29 04:03:01,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:03:01,167 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:03:01,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:03:01,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:03:01,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:03:01,196 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 66 [2023-11-29 04:03:01,196 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 51 transitions, 114 flow. Second operand has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:03:01,196 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:03:01,196 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 66 [2023-11-29 04:03:01,196 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:03:01,602 INFO L124 PetriNetUnfolderBase]: 1385/2594 cut-off events. [2023-11-29 04:03:01,602 INFO L125 PetriNetUnfolderBase]: For 144/144 co-relation queries the response was YES. [2023-11-29 04:03:01,608 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4786 conditions, 2594 events. 1385/2594 cut-off events. For 144/144 co-relation queries the response was YES. Maximal size of possible extension queue 190. Compared 19851 event pairs, 417 based on Foata normal form. 0/2515 useless extension candidates. Maximal degree in co-relation 4775. Up to 1640 conditions per place. [2023-11-29 04:03:01,618 INFO L140 encePairwiseOnDemand]: 63/66 looper letters, 29 selfloop transitions, 2 changer transitions 0/58 dead transitions. [2023-11-29 04:03:01,619 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 58 transitions, 192 flow [2023-11-29 04:03:01,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:03:01,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 04:03:01,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 143 transitions. [2023-11-29 04:03:01,620 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7222222222222222 [2023-11-29 04:03:01,620 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 143 transitions. [2023-11-29 04:03:01,620 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 143 transitions. [2023-11-29 04:03:01,621 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:03:01,621 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 143 transitions. [2023-11-29 04:03:01,621 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:03:01,622 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 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) [2023-11-29 04:03:01,622 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 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) [2023-11-29 04:03:01,622 INFO L175 Difference]: Start difference. First operand has 63 places, 51 transitions, 114 flow. Second operand 3 states and 143 transitions. [2023-11-29 04:03:01,623 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 58 transitions, 192 flow [2023-11-29 04:03:01,624 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 58 transitions, 186 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 04:03:01,625 INFO L231 Difference]: Finished difference. Result has 61 places, 50 transitions, 112 flow [2023-11-29 04:03:01,625 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=112, PETRI_PLACES=61, PETRI_TRANSITIONS=50} [2023-11-29 04:03:01,625 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, -12 predicate places. [2023-11-29 04:03:01,626 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 50 transitions, 112 flow [2023-11-29 04:03:01,626 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:03:01,626 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:03:01,626 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:03:01,633 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0006e79-8d33-487c-b435-1f4741572d13/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2023-11-29 04:03:01,833 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0006e79-8d33-487c-b435-1f4741572d13/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:03:01,834 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 04:03:01,834 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:03:01,834 INFO L85 PathProgramCache]: Analyzing trace with hash -1586652229, now seen corresponding path program 1 times [2023-11-29 04:03:01,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:03:01,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [631590363] [2023-11-29 04:03:01,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:03:01,835 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:03:01,835 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0006e79-8d33-487c-b435-1f4741572d13/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:03:01,836 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0006e79-8d33-487c-b435-1f4741572d13/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:03:01,836 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0006e79-8d33-487c-b435-1f4741572d13/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-11-29 04:03:01,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:03:01,934 INFO L262 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 04:03:01,935 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:03:01,943 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 04:03:01,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:03:01,952 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:03:01,952 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:03:01,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [631590363] [2023-11-29 04:03:01,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [631590363] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:03:01,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:03:01,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 04:03:01,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240144571] [2023-11-29 04:03:01,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:03:01,953 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:03:01,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:03:01,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:03:01,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:03:01,989 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 66 [2023-11-29 04:03:01,989 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 50 transitions, 112 flow. Second operand has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:03:01,989 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:03:01,990 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 66 [2023-11-29 04:03:01,990 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:03:02,268 INFO L124 PetriNetUnfolderBase]: 1339/2458 cut-off events. [2023-11-29 04:03:02,268 INFO L125 PetriNetUnfolderBase]: For 90/90 co-relation queries the response was YES. [2023-11-29 04:03:02,273 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4531 conditions, 2458 events. 1339/2458 cut-off events. For 90/90 co-relation queries the response was YES. Maximal size of possible extension queue 185. Compared 18660 event pairs, 597 based on Foata normal form. 24/2403 useless extension candidates. Maximal degree in co-relation 4521. Up to 1570 conditions per place. [2023-11-29 04:03:02,284 INFO L140 encePairwiseOnDemand]: 63/66 looper letters, 28 selfloop transitions, 2 changer transitions 0/57 dead transitions. [2023-11-29 04:03:02,284 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 57 transitions, 186 flow [2023-11-29 04:03:02,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:03:02,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 04:03:02,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 145 transitions. [2023-11-29 04:03:02,285 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7323232323232324 [2023-11-29 04:03:02,285 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 145 transitions. [2023-11-29 04:03:02,285 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 145 transitions. [2023-11-29 04:03:02,286 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:03:02,286 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 145 transitions. [2023-11-29 04:03:02,286 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:03:02,287 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 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) [2023-11-29 04:03:02,287 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 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) [2023-11-29 04:03:02,287 INFO L175 Difference]: Start difference. First operand has 61 places, 50 transitions, 112 flow. Second operand 3 states and 145 transitions. [2023-11-29 04:03:02,288 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 57 transitions, 186 flow [2023-11-29 04:03:02,289 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 57 transitions, 182 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 04:03:02,290 INFO L231 Difference]: Finished difference. Result has 60 places, 49 transitions, 110 flow [2023-11-29 04:03:02,290 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=110, PETRI_PLACES=60, PETRI_TRANSITIONS=49} [2023-11-29 04:03:02,291 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, -13 predicate places. [2023-11-29 04:03:02,291 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 49 transitions, 110 flow [2023-11-29 04:03:02,291 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:03:02,291 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:03:02,292 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:03:02,295 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0006e79-8d33-487c-b435-1f4741572d13/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2023-11-29 04:03:02,494 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0006e79-8d33-487c-b435-1f4741572d13/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:03:02,495 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 04:03:02,495 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:03:02,495 INFO L85 PathProgramCache]: Analyzing trace with hash -1530401528, now seen corresponding path program 1 times [2023-11-29 04:03:02,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:03:02,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1575350862] [2023-11-29 04:03:02,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:03:02,496 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:03:02,496 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0006e79-8d33-487c-b435-1f4741572d13/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:03:02,496 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0006e79-8d33-487c-b435-1f4741572d13/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:03:02,497 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0006e79-8d33-487c-b435-1f4741572d13/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-11-29 04:03:02,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:03:02,617 INFO L262 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 04:03:02,618 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:03:02,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:03:02,657 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:03:02,657 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:03:02,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1575350862] [2023-11-29 04:03:02,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1575350862] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:03:02,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:03:02,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 04:03:02,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799212458] [2023-11-29 04:03:02,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:03:02,658 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 04:03:02,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:03:02,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 04:03:02,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 04:03:02,675 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 66 [2023-11-29 04:03:02,676 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 49 transitions, 110 flow. Second operand has 4 states, 4 states have (on average 37.5) internal successors, (150), 4 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:03:02,676 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:03:02,676 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 66 [2023-11-29 04:03:02,676 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:03:03,502 INFO L124 PetriNetUnfolderBase]: 5957/9381 cut-off events. [2023-11-29 04:03:03,502 INFO L125 PetriNetUnfolderBase]: For 286/286 co-relation queries the response was YES. [2023-11-29 04:03:03,513 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18020 conditions, 9381 events. 5957/9381 cut-off events. For 286/286 co-relation queries the response was YES. Maximal size of possible extension queue 590. Compared 68063 event pairs, 663 based on Foata normal form. 240/9575 useless extension candidates. Maximal degree in co-relation 18010. Up to 5353 conditions per place. [2023-11-29 04:03:03,538 INFO L140 encePairwiseOnDemand]: 59/66 looper letters, 48 selfloop transitions, 6 changer transitions 1/77 dead transitions. [2023-11-29 04:03:03,538 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 77 transitions, 284 flow [2023-11-29 04:03:03,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 04:03:03,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-29 04:03:03,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 193 transitions. [2023-11-29 04:03:03,539 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7310606060606061 [2023-11-29 04:03:03,540 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 193 transitions. [2023-11-29 04:03:03,540 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 193 transitions. [2023-11-29 04:03:03,540 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:03:03,540 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 193 transitions. [2023-11-29 04:03:03,541 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 48.25) internal successors, (193), 4 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:03:03,542 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 66.0) internal successors, (330), 5 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:03:03,542 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 66.0) internal successors, (330), 5 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:03:03,542 INFO L175 Difference]: Start difference. First operand has 60 places, 49 transitions, 110 flow. Second operand 4 states and 193 transitions. [2023-11-29 04:03:03,542 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 77 transitions, 284 flow [2023-11-29 04:03:03,547 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 77 transitions, 278 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 04:03:03,549 INFO L231 Difference]: Finished difference. Result has 63 places, 53 transitions, 148 flow [2023-11-29 04:03:03,549 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=148, PETRI_PLACES=63, PETRI_TRANSITIONS=53} [2023-11-29 04:03:03,550 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, -10 predicate places. [2023-11-29 04:03:03,550 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 53 transitions, 148 flow [2023-11-29 04:03:03,550 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.5) internal successors, (150), 4 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:03:03,550 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:03:03,550 INFO L208 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] [2023-11-29 04:03:03,552 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0006e79-8d33-487c-b435-1f4741572d13/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2023-11-29 04:03:03,750 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0006e79-8d33-487c-b435-1f4741572d13/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:03:03,751 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 04:03:03,751 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:03:03,751 INFO L85 PathProgramCache]: Analyzing trace with hash -1703057209, now seen corresponding path program 1 times [2023-11-29 04:03:03,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:03:03,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2005681874] [2023-11-29 04:03:03,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:03:03,752 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:03:03,752 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0006e79-8d33-487c-b435-1f4741572d13/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:03:03,753 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0006e79-8d33-487c-b435-1f4741572d13/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:03:03,754 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0006e79-8d33-487c-b435-1f4741572d13/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-11-29 04:03:03,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:03:03,851 INFO L262 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 04:03:03,853 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:03:03,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:03:03,892 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:03:03,892 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:03:03,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2005681874] [2023-11-29 04:03:03,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2005681874] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:03:03,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:03:03,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 04:03:03,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294312201] [2023-11-29 04:03:03,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:03:03,893 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 04:03:03,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:03:03,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 04:03:03,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 04:03:03,907 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 66 [2023-11-29 04:03:03,908 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 53 transitions, 148 flow. Second operand has 5 states, 5 states have (on average 37.0) internal successors, (185), 5 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:03:03,908 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:03:03,908 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 66 [2023-11-29 04:03:03,908 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:03:04,684 INFO L124 PetriNetUnfolderBase]: 4789/7585 cut-off events. [2023-11-29 04:03:04,684 INFO L125 PetriNetUnfolderBase]: For 1860/1860 co-relation queries the response was YES. [2023-11-29 04:03:04,695 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16903 conditions, 7585 events. 4789/7585 cut-off events. For 1860/1860 co-relation queries the response was YES. Maximal size of possible extension queue 487. Compared 53109 event pairs, 249 based on Foata normal form. 228/7777 useless extension candidates. Maximal degree in co-relation 16890. Up to 3841 conditions per place. [2023-11-29 04:03:04,725 INFO L140 encePairwiseOnDemand]: 59/66 looper letters, 61 selfloop transitions, 10 changer transitions 1/94 dead transitions. [2023-11-29 04:03:04,725 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 94 transitions, 403 flow [2023-11-29 04:03:04,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 04:03:04,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-29 04:03:04,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 244 transitions. [2023-11-29 04:03:04,727 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7393939393939394 [2023-11-29 04:03:04,727 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 244 transitions. [2023-11-29 04:03:04,727 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 244 transitions. [2023-11-29 04:03:04,727 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:03:04,727 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 244 transitions. [2023-11-29 04:03:04,728 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 48.8) internal successors, (244), 5 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:03:04,730 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 66.0) internal successors, (396), 6 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:03:04,730 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 66.0) internal successors, (396), 6 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:03:04,730 INFO L175 Difference]: Start difference. First operand has 63 places, 53 transitions, 148 flow. Second operand 5 states and 244 transitions. [2023-11-29 04:03:04,730 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 94 transitions, 403 flow [2023-11-29 04:03:04,733 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 94 transitions, 392 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-11-29 04:03:04,734 INFO L231 Difference]: Finished difference. Result has 67 places, 57 transitions, 200 flow [2023-11-29 04:03:04,735 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=139, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=200, PETRI_PLACES=67, PETRI_TRANSITIONS=57} [2023-11-29 04:03:04,735 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, -6 predicate places. [2023-11-29 04:03:04,736 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 57 transitions, 200 flow [2023-11-29 04:03:04,736 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 37.0) internal successors, (185), 5 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:03:04,736 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:03:04,736 INFO L208 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] [2023-11-29 04:03:04,738 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0006e79-8d33-487c-b435-1f4741572d13/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2023-11-29 04:03:04,936 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0006e79-8d33-487c-b435-1f4741572d13/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:03:04,937 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 04:03:04,937 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:03:04,937 INFO L85 PathProgramCache]: Analyzing trace with hash -181850360, now seen corresponding path program 1 times [2023-11-29 04:03:04,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:03:04,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [268032699] [2023-11-29 04:03:04,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:03:04,938 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:03:04,938 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0006e79-8d33-487c-b435-1f4741572d13/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:03:04,939 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0006e79-8d33-487c-b435-1f4741572d13/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:03:04,941 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0006e79-8d33-487c-b435-1f4741572d13/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2023-11-29 04:03:05,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:03:05,086 INFO L262 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 04:03:05,089 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:03:05,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:03:05,166 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:03:05,166 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:03:05,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [268032699] [2023-11-29 04:03:05,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [268032699] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:03:05,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:03:05,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 04:03:05,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968444038] [2023-11-29 04:03:05,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:03:05,168 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 04:03:05,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:03:05,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 04:03:05,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 04:03:05,190 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 66 [2023-11-29 04:03:05,190 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 57 transitions, 200 flow. Second operand has 6 states, 6 states have (on average 36.833333333333336) internal successors, (221), 6 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:03:05,191 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:03:05,191 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 66 [2023-11-29 04:03:05,191 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:03:06,026 INFO L124 PetriNetUnfolderBase]: 3029/4757 cut-off events. [2023-11-29 04:03:06,027 INFO L125 PetriNetUnfolderBase]: For 3554/3554 co-relation queries the response was YES. [2023-11-29 04:03:06,035 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11991 conditions, 4757 events. 3029/4757 cut-off events. For 3554/3554 co-relation queries the response was YES. Maximal size of possible extension queue 198. Compared 29321 event pairs, 115 based on Foata normal form. 172/4898 useless extension candidates. Maximal degree in co-relation 11976. Up to 1633 conditions per place. [2023-11-29 04:03:06,053 INFO L140 encePairwiseOnDemand]: 59/66 looper letters, 72 selfloop transitions, 14 changer transitions 1/109 dead transitions. [2023-11-29 04:03:06,053 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 109 transitions, 526 flow [2023-11-29 04:03:06,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 04:03:06,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 04:03:06,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 293 transitions. [2023-11-29 04:03:06,056 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.73989898989899 [2023-11-29 04:03:06,056 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 293 transitions. [2023-11-29 04:03:06,056 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 293 transitions. [2023-11-29 04:03:06,056 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:03:06,056 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 293 transitions. [2023-11-29 04:03:06,058 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 48.833333333333336) internal successors, (293), 6 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:03:06,059 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 66.0) internal successors, (462), 7 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:03:06,059 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 66.0) internal successors, (462), 7 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:03:06,059 INFO L175 Difference]: Start difference. First operand has 67 places, 57 transitions, 200 flow. Second operand 6 states and 293 transitions. [2023-11-29 04:03:06,059 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 109 transitions, 526 flow [2023-11-29 04:03:06,068 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 109 transitions, 496 flow, removed 5 selfloop flow, removed 4 redundant places. [2023-11-29 04:03:06,070 INFO L231 Difference]: Finished difference. Result has 70 places, 61 transitions, 250 flow [2023-11-29 04:03:06,070 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=173, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=250, PETRI_PLACES=70, PETRI_TRANSITIONS=61} [2023-11-29 04:03:06,070 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, -3 predicate places. [2023-11-29 04:03:06,071 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 61 transitions, 250 flow [2023-11-29 04:03:06,071 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 36.833333333333336) internal successors, (221), 6 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:03:06,071 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:03:06,071 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:03:06,074 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0006e79-8d33-487c-b435-1f4741572d13/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2023-11-29 04:03:06,272 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0006e79-8d33-487c-b435-1f4741572d13/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:03:06,272 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 04:03:06,272 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:03:06,272 INFO L85 PathProgramCache]: Analyzing trace with hash 205112825, now seen corresponding path program 1 times [2023-11-29 04:03:06,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:03:06,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1148613333] [2023-11-29 04:03:06,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:03:06,273 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:03:06,274 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0006e79-8d33-487c-b435-1f4741572d13/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:03:06,275 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0006e79-8d33-487c-b435-1f4741572d13/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:03:06,276 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0006e79-8d33-487c-b435-1f4741572d13/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2023-11-29 04:03:06,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:03:06,436 INFO L262 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 04:03:06,439 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:03:06,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:03:06,523 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:03:06,524 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:03:06,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1148613333] [2023-11-29 04:03:06,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1148613333] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:03:06,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:03:06,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 04:03:06,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882110136] [2023-11-29 04:03:06,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:03:06,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 04:03:06,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:03:06,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 04:03:06,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 04:03:06,547 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 66 [2023-11-29 04:03:06,547 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 61 transitions, 250 flow. Second operand has 7 states, 7 states have (on average 36.857142857142854) internal successors, (258), 7 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:03:06,547 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:03:06,548 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 66 [2023-11-29 04:03:06,548 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:03:07,236 INFO L124 PetriNetUnfolderBase]: 1857/2789 cut-off events. [2023-11-29 04:03:07,236 INFO L125 PetriNetUnfolderBase]: For 3792/3792 co-relation queries the response was YES. [2023-11-29 04:03:07,241 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7968 conditions, 2789 events. 1857/2789 cut-off events. For 3792/3792 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 14561 event pairs, 77 based on Foata normal form. 80/2838 useless extension candidates. Maximal degree in co-relation 7952. Up to 828 conditions per place. [2023-11-29 04:03:07,251 INFO L140 encePairwiseOnDemand]: 59/66 looper letters, 65 selfloop transitions, 18 changer transitions 1/106 dead transitions. [2023-11-29 04:03:07,251 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 106 transitions, 524 flow [2023-11-29 04:03:07,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 04:03:07,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-29 04:03:07,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 324 transitions. [2023-11-29 04:03:07,254 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7012987012987013 [2023-11-29 04:03:07,254 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 324 transitions. [2023-11-29 04:03:07,254 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 324 transitions. [2023-11-29 04:03:07,255 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:03:07,255 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 324 transitions. [2023-11-29 04:03:07,256 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 46.285714285714285) internal successors, (324), 7 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:03:07,257 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 66.0) internal successors, (528), 8 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:03:07,258 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 66.0) internal successors, (528), 8 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:03:07,258 INFO L175 Difference]: Start difference. First operand has 70 places, 61 transitions, 250 flow. Second operand 7 states and 324 transitions. [2023-11-29 04:03:07,258 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 106 transitions, 524 flow [2023-11-29 04:03:07,274 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 106 transitions, 478 flow, removed 9 selfloop flow, removed 5 redundant places. [2023-11-29 04:03:07,275 INFO L231 Difference]: Finished difference. Result has 73 places, 61 transitions, 260 flow [2023-11-29 04:03:07,276 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=207, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=260, PETRI_PLACES=73, PETRI_TRANSITIONS=61} [2023-11-29 04:03:07,276 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, 0 predicate places. [2023-11-29 04:03:07,276 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 61 transitions, 260 flow [2023-11-29 04:03:07,277 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 36.857142857142854) internal successors, (258), 7 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:03:07,277 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:03:07,277 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:03:07,281 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0006e79-8d33-487c-b435-1f4741572d13/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2023-11-29 04:03:07,477 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0006e79-8d33-487c-b435-1f4741572d13/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:03:07,478 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 04:03:07,478 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:03:07,478 INFO L85 PathProgramCache]: Analyzing trace with hash 1330273014, now seen corresponding path program 1 times [2023-11-29 04:03:07,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:03:07,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1576150626] [2023-11-29 04:03:07,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:03:07,479 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:03:07,479 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0006e79-8d33-487c-b435-1f4741572d13/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:03:07,480 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0006e79-8d33-487c-b435-1f4741572d13/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:03:07,481 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0006e79-8d33-487c-b435-1f4741572d13/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2023-11-29 04:03:07,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:03:07,733 INFO L262 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 18 conjunts are in the unsatisfiable core [2023-11-29 04:03:07,737 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:03:08,679 WARN L876 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~#t693~0#1.base_55| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#t694~0#1.base_51| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#t695~0#1.base_45| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#t696~0#1.base_47| (_ BitVec 32))) (let ((.cse1 (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t693~0#1.base_55| (_ bv1 1)))) (let ((.cse0 (store .cse1 |v_ULTIMATE.start_main_~#t694~0#1.base_51| (_ bv1 1)))) (and (= (_ bv0 1) (select (store .cse0 |v_ULTIMATE.start_main_~#t695~0#1.base_45| (_ bv1 1)) |v_ULTIMATE.start_main_~#t696~0#1.base_47|)) (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t693~0#1.base_55|)) (= (select .cse0 |v_ULTIMATE.start_main_~#t695~0#1.base_45|) (_ bv0 1)) (= |c_#valid| (store (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t693~0#1.base_55| (_ bv0 1)) |v_ULTIMATE.start_main_~#t694~0#1.base_51| (_ bv0 1)) |v_ULTIMATE.start_main_~#t695~0#1.base_45| (_ bv0 1)) |v_ULTIMATE.start_main_~#t696~0#1.base_47| (_ bv0 1))) (= (select .cse1 |v_ULTIMATE.start_main_~#t694~0#1.base_51|) (_ bv0 1)))))) is different from true [2023-11-29 04:03:08,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:03:08,681 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:03:08,681 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:03:08,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1576150626] [2023-11-29 04:03:08,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1576150626] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:03:08,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:03:08,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 04:03:08,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194166577] [2023-11-29 04:03:08,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:03:08,682 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 04:03:08,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:03:08,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 04:03:08,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=22, Unknown=1, NotChecked=8, Total=42 [2023-11-29 04:03:08,684 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 66 [2023-11-29 04:03:08,685 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 61 transitions, 260 flow. Second operand has 7 states, 7 states have (on average 29.142857142857142) internal successors, (204), 7 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:03:08,685 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:03:08,685 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 66 [2023-11-29 04:03:08,685 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:03:09,191 INFO L124 PetriNetUnfolderBase]: 934/1730 cut-off events. [2023-11-29 04:03:09,191 INFO L125 PetriNetUnfolderBase]: For 571/614 co-relation queries the response was YES. [2023-11-29 04:03:09,194 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3718 conditions, 1730 events. 934/1730 cut-off events. For 571/614 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 10446 event pairs, 136 based on Foata normal form. 16/1592 useless extension candidates. Maximal degree in co-relation 3700. Up to 1135 conditions per place. [2023-11-29 04:03:09,198 INFO L140 encePairwiseOnDemand]: 56/66 looper letters, 36 selfloop transitions, 9 changer transitions 0/79 dead transitions. [2023-11-29 04:03:09,199 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 79 transitions, 386 flow [2023-11-29 04:03:09,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 04:03:09,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-29 04:03:09,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 228 transitions. [2023-11-29 04:03:09,200 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4935064935064935 [2023-11-29 04:03:09,200 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 228 transitions. [2023-11-29 04:03:09,200 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 228 transitions. [2023-11-29 04:03:09,201 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:03:09,201 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 228 transitions. [2023-11-29 04:03:09,201 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 32.57142857142857) internal successors, (228), 7 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:03:09,202 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 66.0) internal successors, (528), 8 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:03:09,202 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 66.0) internal successors, (528), 8 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:03:09,203 INFO L175 Difference]: Start difference. First operand has 73 places, 61 transitions, 260 flow. Second operand 7 states and 228 transitions. [2023-11-29 04:03:09,203 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 79 transitions, 386 flow [2023-11-29 04:03:09,205 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 79 transitions, 290 flow, removed 17 selfloop flow, removed 10 redundant places. [2023-11-29 04:03:09,207 INFO L231 Difference]: Finished difference. Result has 70 places, 65 transitions, 205 flow [2023-11-29 04:03:09,207 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=205, PETRI_PLACES=70, PETRI_TRANSITIONS=65} [2023-11-29 04:03:09,207 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, -3 predicate places. [2023-11-29 04:03:09,207 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 65 transitions, 205 flow [2023-11-29 04:03:09,208 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 29.142857142857142) internal successors, (204), 7 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:03:09,208 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:03:09,208 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:03:09,211 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0006e79-8d33-487c-b435-1f4741572d13/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2023-11-29 04:03:09,408 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0006e79-8d33-487c-b435-1f4741572d13/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:03:09,408 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 04:03:09,409 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:03:09,409 INFO L85 PathProgramCache]: Analyzing trace with hash 968716353, now seen corresponding path program 1 times [2023-11-29 04:03:09,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:03:09,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [665490065] [2023-11-29 04:03:09,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:03:09,409 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:03:09,409 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0006e79-8d33-487c-b435-1f4741572d13/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:03:09,410 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0006e79-8d33-487c-b435-1f4741572d13/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:03:09,411 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0006e79-8d33-487c-b435-1f4741572d13/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2023-11-29 04:03:09,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:03:09,534 INFO L262 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 04:03:09,536 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:03:09,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:03:09,604 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:03:09,604 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:03:09,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [665490065] [2023-11-29 04:03:09,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [665490065] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:03:09,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:03:09,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 04:03:09,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721003572] [2023-11-29 04:03:09,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:03:09,605 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 04:03:09,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:03:09,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 04:03:09,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 04:03:09,623 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 66 [2023-11-29 04:03:09,623 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 65 transitions, 205 flow. Second operand has 6 states, 6 states have (on average 39.333333333333336) internal successors, (236), 6 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:03:09,623 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:03:09,623 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 66 [2023-11-29 04:03:09,624 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:03:10,182 INFO L124 PetriNetUnfolderBase]: 2679/4563 cut-off events. [2023-11-29 04:03:10,182 INFO L125 PetriNetUnfolderBase]: For 1342/1730 co-relation queries the response was YES. [2023-11-29 04:03:10,191 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10818 conditions, 4563 events. 2679/4563 cut-off events. For 1342/1730 co-relation queries the response was YES. Maximal size of possible extension queue 225. Compared 29297 event pairs, 597 based on Foata normal form. 16/4242 useless extension candidates. Maximal degree in co-relation 10805. Up to 1734 conditions per place. [2023-11-29 04:03:10,205 INFO L140 encePairwiseOnDemand]: 60/66 looper letters, 66 selfloop transitions, 5 changer transitions 0/107 dead transitions. [2023-11-29 04:03:10,205 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 107 transitions, 492 flow [2023-11-29 04:03:10,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 04:03:10,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 04:03:10,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 280 transitions. [2023-11-29 04:03:10,207 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7070707070707071 [2023-11-29 04:03:10,207 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 280 transitions. [2023-11-29 04:03:10,207 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 280 transitions. [2023-11-29 04:03:10,207 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:03:10,207 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 280 transitions. [2023-11-29 04:03:10,208 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 46.666666666666664) internal successors, (280), 6 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:03:10,209 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 66.0) internal successors, (462), 7 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:03:10,209 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 66.0) internal successors, (462), 7 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:03:10,209 INFO L175 Difference]: Start difference. First operand has 70 places, 65 transitions, 205 flow. Second operand 6 states and 280 transitions. [2023-11-29 04:03:10,209 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 107 transitions, 492 flow [2023-11-29 04:03:10,211 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 107 transitions, 466 flow, removed 0 selfloop flow, removed 5 redundant places. [2023-11-29 04:03:10,212 INFO L231 Difference]: Finished difference. Result has 74 places, 69 transitions, 231 flow [2023-11-29 04:03:10,212 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=231, PETRI_PLACES=74, PETRI_TRANSITIONS=69} [2023-11-29 04:03:10,212 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, 1 predicate places. [2023-11-29 04:03:10,212 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 69 transitions, 231 flow [2023-11-29 04:03:10,213 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 39.333333333333336) internal successors, (236), 6 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:03:10,213 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:03:10,213 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:03:10,216 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0006e79-8d33-487c-b435-1f4741572d13/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2023-11-29 04:03:10,413 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0006e79-8d33-487c-b435-1f4741572d13/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:03:10,413 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 04:03:10,414 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:03:10,414 INFO L85 PathProgramCache]: Analyzing trace with hash 1838554137, now seen corresponding path program 2 times [2023-11-29 04:03:10,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:03:10,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [86492259] [2023-11-29 04:03:10,414 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 04:03:10,414 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:03:10,414 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0006e79-8d33-487c-b435-1f4741572d13/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:03:10,415 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0006e79-8d33-487c-b435-1f4741572d13/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:03:10,416 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0006e79-8d33-487c-b435-1f4741572d13/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2023-11-29 04:03:10,531 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-29 04:03:10,531 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 04:03:10,535 INFO L262 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 04:03:10,537 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:03:10,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:03:10,596 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:03:10,596 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:03:10,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [86492259] [2023-11-29 04:03:10,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [86492259] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:03:10,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:03:10,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 04:03:10,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996789552] [2023-11-29 04:03:10,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:03:10,597 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 04:03:10,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:03:10,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 04:03:10,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 04:03:10,608 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 66 [2023-11-29 04:03:10,609 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 69 transitions, 231 flow. Second operand has 6 states, 6 states have (on average 39.333333333333336) internal successors, (236), 6 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:03:10,609 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:03:10,609 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 66 [2023-11-29 04:03:10,609 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:03:11,404 INFO L124 PetriNetUnfolderBase]: 4302/7495 cut-off events. [2023-11-29 04:03:11,404 INFO L125 PetriNetUnfolderBase]: For 2479/2963 co-relation queries the response was YES. [2023-11-29 04:03:11,419 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18045 conditions, 7495 events. 4302/7495 cut-off events. For 2479/2963 co-relation queries the response was YES. Maximal size of possible extension queue 447. Compared 54057 event pairs, 1002 based on Foata normal form. 16/7037 useless extension candidates. Maximal degree in co-relation 18029. Up to 3024 conditions per place. [2023-11-29 04:03:11,438 INFO L140 encePairwiseOnDemand]: 60/66 looper letters, 68 selfloop transitions, 8 changer transitions 0/113 dead transitions. [2023-11-29 04:03:11,439 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 113 transitions, 537 flow [2023-11-29 04:03:11,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 04:03:11,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 04:03:11,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 279 transitions. [2023-11-29 04:03:11,440 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7045454545454546 [2023-11-29 04:03:11,440 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 279 transitions. [2023-11-29 04:03:11,440 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 279 transitions. [2023-11-29 04:03:11,441 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:03:11,441 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 279 transitions. [2023-11-29 04:03:11,442 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 46.5) internal successors, (279), 6 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:03:11,442 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 66.0) internal successors, (462), 7 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:03:11,442 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 66.0) internal successors, (462), 7 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:03:11,443 INFO L175 Difference]: Start difference. First operand has 74 places, 69 transitions, 231 flow. Second operand 6 states and 279 transitions. [2023-11-29 04:03:11,443 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 113 transitions, 537 flow [2023-11-29 04:03:11,451 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 113 transitions, 536 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-29 04:03:11,452 INFO L231 Difference]: Finished difference. Result has 82 places, 76 transitions, 313 flow [2023-11-29 04:03:11,452 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=230, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=313, PETRI_PLACES=82, PETRI_TRANSITIONS=76} [2023-11-29 04:03:11,453 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, 9 predicate places. [2023-11-29 04:03:11,453 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 76 transitions, 313 flow [2023-11-29 04:03:11,453 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 39.333333333333336) internal successors, (236), 6 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:03:11,453 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:03:11,453 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:03:11,456 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0006e79-8d33-487c-b435-1f4741572d13/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Ended with exit code 0 [2023-11-29 04:03:11,654 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0006e79-8d33-487c-b435-1f4741572d13/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:03:11,654 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 04:03:11,654 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:03:11,654 INFO L85 PathProgramCache]: Analyzing trace with hash -1688831749, now seen corresponding path program 3 times [2023-11-29 04:03:11,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:03:11,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1898845214] [2023-11-29 04:03:11,654 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-29 04:03:11,655 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:03:11,655 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0006e79-8d33-487c-b435-1f4741572d13/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:03:11,655 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0006e79-8d33-487c-b435-1f4741572d13/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:03:11,656 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0006e79-8d33-487c-b435-1f4741572d13/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2023-11-29 04:03:11,759 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-11-29 04:03:11,759 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 04:03:11,763 INFO L262 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 14 conjunts are in the unsatisfiable core [2023-11-29 04:03:11,765 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:03:12,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:03:12,107 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:03:12,107 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:03:12,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1898845214] [2023-11-29 04:03:12,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1898845214] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:03:12,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:03:12,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 04:03:12,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965476681] [2023-11-29 04:03:12,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:03:12,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 04:03:12,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:03:12,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 04:03:12,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-11-29 04:03:12,128 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 66 [2023-11-29 04:03:12,129 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 76 transitions, 313 flow. Second operand has 9 states, 9 states have (on average 40.0) internal successors, (360), 9 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:03:12,129 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:03:12,129 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 66 [2023-11-29 04:03:12,129 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:03:13,225 INFO L124 PetriNetUnfolderBase]: 5317/9048 cut-off events. [2023-11-29 04:03:13,226 INFO L125 PetriNetUnfolderBase]: For 4669/5048 co-relation queries the response was YES. [2023-11-29 04:03:13,247 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23334 conditions, 9048 events. 5317/9048 cut-off events. For 4669/5048 co-relation queries the response was YES. Maximal size of possible extension queue 509. Compared 65305 event pairs, 1122 based on Foata normal form. 16/8398 useless extension candidates. Maximal degree in co-relation 23314. Up to 4331 conditions per place. [2023-11-29 04:03:13,273 INFO L140 encePairwiseOnDemand]: 57/66 looper letters, 73 selfloop transitions, 18 changer transitions 0/131 dead transitions. [2023-11-29 04:03:13,273 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 131 transitions, 745 flow [2023-11-29 04:03:13,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 04:03:13,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-29 04:03:13,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 408 transitions. [2023-11-29 04:03:13,275 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6868686868686869 [2023-11-29 04:03:13,275 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 408 transitions. [2023-11-29 04:03:13,275 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 408 transitions. [2023-11-29 04:03:13,276 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:03:13,276 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 408 transitions. [2023-11-29 04:03:13,277 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 45.333333333333336) internal successors, (408), 9 states have internal predecessors, (408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:03:13,278 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 66.0) internal successors, (660), 10 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:03:13,279 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 66.0) internal successors, (660), 10 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:03:13,279 INFO L175 Difference]: Start difference. First operand has 82 places, 76 transitions, 313 flow. Second operand 9 states and 408 transitions. [2023-11-29 04:03:13,279 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 131 transitions, 745 flow [2023-11-29 04:03:13,296 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 131 transitions, 744 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-29 04:03:13,298 INFO L231 Difference]: Finished difference. Result has 93 places, 90 transitions, 512 flow [2023-11-29 04:03:13,298 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=312, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=512, PETRI_PLACES=93, PETRI_TRANSITIONS=90} [2023-11-29 04:03:13,299 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, 20 predicate places. [2023-11-29 04:03:13,299 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 90 transitions, 512 flow [2023-11-29 04:03:13,299 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 40.0) internal successors, (360), 9 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:03:13,299 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:03:13,299 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:03:13,303 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0006e79-8d33-487c-b435-1f4741572d13/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Ended with exit code 0 [2023-11-29 04:03:13,500 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0006e79-8d33-487c-b435-1f4741572d13/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:03:13,500 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 04:03:13,500 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:03:13,500 INFO L85 PathProgramCache]: Analyzing trace with hash 1162175279, now seen corresponding path program 4 times [2023-11-29 04:03:13,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:03:13,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1406681319] [2023-11-29 04:03:13,501 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-29 04:03:13,501 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:03:13,501 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0006e79-8d33-487c-b435-1f4741572d13/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:03:13,502 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0006e79-8d33-487c-b435-1f4741572d13/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:03:13,502 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0006e79-8d33-487c-b435-1f4741572d13/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2023-11-29 04:03:13,611 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-29 04:03:13,612 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 04:03:13,616 INFO L262 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 04:03:13,617 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:03:13,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:03:13,644 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:03:13,644 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:03:13,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1406681319] [2023-11-29 04:03:13,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1406681319] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:03:13,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:03:13,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 04:03:13,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982148650] [2023-11-29 04:03:13,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:03:13,645 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 04:03:13,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:03:13,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 04:03:13,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 04:03:13,654 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 66 [2023-11-29 04:03:13,654 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 90 transitions, 512 flow. Second operand has 5 states, 5 states have (on average 40.0) internal successors, (200), 5 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:03:13,654 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:03:13,654 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 66 [2023-11-29 04:03:13,655 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:03:15,222 INFO L124 PetriNetUnfolderBase]: 10335/17399 cut-off events. [2023-11-29 04:03:15,223 INFO L125 PetriNetUnfolderBase]: For 15080/15851 co-relation queries the response was YES. [2023-11-29 04:03:15,381 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48479 conditions, 17399 events. 10335/17399 cut-off events. For 15080/15851 co-relation queries the response was YES. Maximal size of possible extension queue 973. Compared 138428 event pairs, 4455 based on Foata normal form. 17/15783 useless extension candidates. Maximal degree in co-relation 48454. Up to 8607 conditions per place. [2023-11-29 04:03:15,442 INFO L140 encePairwiseOnDemand]: 60/66 looper letters, 77 selfloop transitions, 26 changer transitions 0/141 dead transitions. [2023-11-29 04:03:15,442 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 141 transitions, 1100 flow [2023-11-29 04:03:15,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 04:03:15,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-29 04:03:15,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 230 transitions. [2023-11-29 04:03:15,444 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.696969696969697 [2023-11-29 04:03:15,444 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 230 transitions. [2023-11-29 04:03:15,444 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 230 transitions. [2023-11-29 04:03:15,444 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:03:15,444 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 230 transitions. [2023-11-29 04:03:15,445 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 46.0) internal successors, (230), 5 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:03:15,446 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 66.0) internal successors, (396), 6 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:03:15,446 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 66.0) internal successors, (396), 6 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:03:15,446 INFO L175 Difference]: Start difference. First operand has 93 places, 90 transitions, 512 flow. Second operand 5 states and 230 transitions. [2023-11-29 04:03:15,446 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 141 transitions, 1100 flow [2023-11-29 04:03:15,550 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 141 transitions, 1092 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-29 04:03:15,553 INFO L231 Difference]: Finished difference. Result has 97 places, 115 transitions, 942 flow [2023-11-29 04:03:15,553 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=506, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=942, PETRI_PLACES=97, PETRI_TRANSITIONS=115} [2023-11-29 04:03:15,553 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, 24 predicate places. [2023-11-29 04:03:15,553 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 115 transitions, 942 flow [2023-11-29 04:03:15,554 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 40.0) internal successors, (200), 5 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:03:15,554 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:03:15,554 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:03:15,557 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0006e79-8d33-487c-b435-1f4741572d13/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Ended with exit code 0 [2023-11-29 04:03:15,754 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0006e79-8d33-487c-b435-1f4741572d13/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:03:15,754 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 04:03:15,755 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:03:15,755 INFO L85 PathProgramCache]: Analyzing trace with hash -499900113, now seen corresponding path program 5 times [2023-11-29 04:03:15,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:03:15,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1228889632] [2023-11-29 04:03:15,755 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-29 04:03:15,755 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:03:15,756 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0006e79-8d33-487c-b435-1f4741572d13/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:03:15,756 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0006e79-8d33-487c-b435-1f4741572d13/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:03:15,757 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0006e79-8d33-487c-b435-1f4741572d13/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2023-11-29 04:03:15,909 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-29 04:03:15,909 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-11-29 04:03:15,909 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 04:03:15,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 04:03:16,067 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-11-29 04:03:16,067 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-29 04:03:16,068 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2023-11-29 04:03:16,070 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2023-11-29 04:03:16,070 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2023-11-29 04:03:16,070 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2023-11-29 04:03:16,070 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2023-11-29 04:03:16,071 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2023-11-29 04:03:16,071 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2023-11-29 04:03:16,071 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2023-11-29 04:03:16,071 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2023-11-29 04:03:16,071 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2023-11-29 04:03:16,071 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2023-11-29 04:03:16,072 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2023-11-29 04:03:16,072 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2023-11-29 04:03:16,072 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2023-11-29 04:03:16,072 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2023-11-29 04:03:16,072 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2023-11-29 04:03:16,077 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0006e79-8d33-487c-b435-1f4741572d13/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Ended with exit code 0 [2023-11-29 04:03:16,273 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0006e79-8d33-487c-b435-1f4741572d13/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:03:16,273 INFO L445 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:03:16,279 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-29 04:03:16,279 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 04:03:16,353 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-29 04:03:16,355 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-29 04:03:16,356 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-29 04:03:16,358 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated [2023-11-29 04:03:16,375 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-29 04:03:16,376 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-29 04:03:16,390 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 04:03:16 BasicIcfg [2023-11-29 04:03:16,390 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 04:03:16,391 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 04:03:16,391 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 04:03:16,391 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 04:03:16,392 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 04:02:53" (3/4) ... [2023-11-29 04:03:16,394 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-29 04:03:16,395 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 04:03:16,395 INFO L158 Benchmark]: Toolchain (without parser) took 24544.27ms. Allocated memory was 79.7MB in the beginning and 1.1GB in the end (delta: 1.0GB). Free memory was 53.2MB in the beginning and 806.4MB in the end (delta: -753.2MB). Peak memory consumption was 292.9MB. Max. memory is 16.1GB. [2023-11-29 04:03:16,396 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 58.7MB. Free memory is still 35.3MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 04:03:16,396 INFO L158 Benchmark]: CACSL2BoogieTranslator took 543.54ms. Allocated memory is still 79.7MB. Free memory was 53.0MB in the beginning and 47.6MB in the end (delta: 5.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-11-29 04:03:16,396 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.70ms. Allocated memory is still 79.7MB. Free memory was 47.6MB in the beginning and 44.9MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 04:03:16,397 INFO L158 Benchmark]: Boogie Preprocessor took 57.62ms. Allocated memory is still 79.7MB. Free memory was 44.9MB in the beginning and 41.3MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-29 04:03:16,397 INFO L158 Benchmark]: RCFGBuilder took 788.98ms. Allocated memory is still 79.7MB. Free memory was 41.0MB in the beginning and 27.4MB in the end (delta: 13.6MB). Peak memory consumption was 17.5MB. Max. memory is 16.1GB. [2023-11-29 04:03:16,397 INFO L158 Benchmark]: TraceAbstraction took 23071.94ms. Allocated memory was 96.5MB in the beginning and 1.1GB in the end (delta: 1.0GB). Free memory was 71.6MB in the beginning and 806.4MB in the end (delta: -734.9MB). Peak memory consumption was 293.3MB. Max. memory is 16.1GB. [2023-11-29 04:03:16,398 INFO L158 Benchmark]: Witness Printer took 3.72ms. Allocated memory is still 1.1GB. Free memory is still 806.4MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 04:03:16,399 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25ms. Allocated memory is still 58.7MB. Free memory is still 35.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 543.54ms. Allocated memory is still 79.7MB. Free memory was 53.0MB in the beginning and 47.6MB in the end (delta: 5.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.70ms. Allocated memory is still 79.7MB. Free memory was 47.6MB in the beginning and 44.9MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 57.62ms. Allocated memory is still 79.7MB. Free memory was 44.9MB in the beginning and 41.3MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 788.98ms. Allocated memory is still 79.7MB. Free memory was 41.0MB in the beginning and 27.4MB in the end (delta: 13.6MB). Peak memory consumption was 17.5MB. Max. memory is 16.1GB. * TraceAbstraction took 23071.94ms. Allocated memory was 96.5MB in the beginning and 1.1GB in the end (delta: 1.0GB). Free memory was 71.6MB in the beginning and 806.4MB in the end (delta: -734.9MB). Peak memory consumption was 293.3MB. Max. memory is 16.1GB. * Witness Printer took 3.72ms. Allocated memory is still 1.1GB. Free memory is still 806.4MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~nondet0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~nondet0 - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L721] 0 _Bool main$tmp_guard0; [L722] 0 _Bool main$tmp_guard1; [L724] 0 int x = 0; [L726] 0 int y = 0; [L727] 0 _Bool y$flush_delayed; [L728] 0 int y$mem_tmp; [L729] 0 _Bool y$r_buff0_thd0; [L730] 0 _Bool y$r_buff0_thd1; [L731] 0 _Bool y$r_buff0_thd2; [L732] 0 _Bool y$r_buff0_thd3; [L733] 0 _Bool y$r_buff0_thd4; [L734] 0 _Bool y$r_buff1_thd0; [L735] 0 _Bool y$r_buff1_thd1; [L736] 0 _Bool y$r_buff1_thd2; [L737] 0 _Bool y$r_buff1_thd3; [L738] 0 _Bool y$r_buff1_thd4; [L739] 0 _Bool y$read_delayed; [L740] 0 int *y$read_delayed_var; [L741] 0 int y$w_buff0; [L742] 0 _Bool y$w_buff0_used; [L743] 0 int y$w_buff1; [L744] 0 _Bool y$w_buff1_used; [L746] 0 int z = 0; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L856] 0 pthread_t t693; [L857] FCALL, FORK 0 pthread_create(&t693, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t693={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L858] 0 pthread_t t694; [L859] FCALL, FORK 0 pthread_create(&t694, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t693={6:0}, t694={-2147483646:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L860] 0 pthread_t t695; [L861] FCALL, FORK 0 pthread_create(&t695, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t693={6:0}, t694={-2147483646:0}, t695={-2147483641:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L795] 3 y$w_buff1 = y$w_buff0 [L796] 3 y$w_buff0 = 1 [L797] 3 y$w_buff1_used = y$w_buff0_used [L798] 3 y$w_buff0_used = (_Bool)1 [L799] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L799] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L800] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L801] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L802] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L803] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L804] 3 y$r_buff1_thd4 = y$r_buff0_thd4 [L805] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L862] 0 pthread_t t696; [L863] FCALL, FORK 0 pthread_create(&t696, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t693={6:0}, t694={-2147483646:0}, t695={-2147483641:0}, t696={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L808] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L825] 4 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L828] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L831] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L752] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L755] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L767] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L770] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L771] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L772] 2 y$flush_delayed = weak$$choice2 [L773] 2 y$mem_tmp = y [L774] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L775] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L776] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L777] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L778] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L779] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L780] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L781] 2 __unbuffered_p1_EAX = y [L782] 2 y = y$flush_delayed ? y$mem_tmp : y [L783] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L760] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L788] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L834] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L835] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L836] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L837] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L838] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L811] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L812] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L813] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L814] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L815] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L818] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L841] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L865] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t693={6:0}, t694={-2147483646:0}, t695={-2147483641:0}, t696={7:0}, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L867] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L867] RET 0 assume_abort_if_not(main$tmp_guard0) [L869] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L870] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L871] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L872] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L873] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t693={6:0}, t694={-2147483646:0}, t695={-2147483641:0}, t696={7:0}, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L876] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t693={6:0}, t694={-2147483646:0}, t695={-2147483641:0}, t696={7:0}, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L878] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L17] 0 __assert_fail ("0", "mix026_pso.opt_rmo.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 854]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 861]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 857]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 859]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 863]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 99 locations, 16 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 22.8s, OverallIterations: 19, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 14.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 846 SdHoareTripleChecker+Valid, 3.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 690 mSDsluCounter, 140 SdHoareTripleChecker+Invalid, 2.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 76 IncrementalHoareTripleChecker+Unchecked, 93 mSDsCounter, 48 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2340 IncrementalHoareTripleChecker+Invalid, 2464 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 48 mSolverCounterUnsat, 47 mSDtfsCounter, 2340 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 391 GetRequests, 323 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=942occurred in iteration=18, InterpolantAutomatonStates: 82, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 429 NumberOfCodeBlocks, 429 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 369 ConstructedInterpolants, 1 QuantifiedInterpolants, 2889 SizeOfPredicates, 18 NumberOfNonLiveVariables, 2516 ConjunctsInSsa, 100 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-11-29 04:03:16,417 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0006e79-8d33-487c-b435-1f4741572d13/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample