./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/mix043.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0a5ee5-2912-4d0b-86d1-079a9fce3d5e/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0a5ee5-2912-4d0b-86d1-079a9fce3d5e/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_ce0a5ee5-2912-4d0b-86d1-079a9fce3d5e/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0a5ee5-2912-4d0b-86d1-079a9fce3d5e/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix043.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0a5ee5-2912-4d0b-86d1-079a9fce3d5e/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_ce0a5ee5-2912-4d0b-86d1-079a9fce3d5e/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 8b566ddb7b309d9ba7ea7e298fcc3be9218751e5387d333007519a12118bc5db --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 05:54:48,879 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 05:54:48,943 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0a5ee5-2912-4d0b-86d1-079a9fce3d5e/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-29 05:54:48,948 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 05:54:48,948 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 05:54:48,970 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 05:54:48,971 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 05:54:48,972 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 05:54:48,972 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 05:54:48,973 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 05:54:48,973 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 05:54:48,974 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 05:54:48,974 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 05:54:48,975 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 05:54:48,975 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 05:54:48,976 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 05:54:48,976 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 05:54:48,977 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 05:54:48,977 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 05:54:48,978 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 05:54:48,978 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-29 05:54:48,979 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-29 05:54:48,979 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-29 05:54:48,980 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 05:54:48,980 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 05:54:48,980 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 05:54:48,981 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 05:54:48,981 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 05:54:48,981 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 05:54:48,982 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 05:54:48,982 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 05:54:48,982 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 05:54:48,983 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 05:54:48,983 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 05:54:48,983 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 05:54:48,983 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 05:54:48,984 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 05:54:48,984 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 05:54:48,984 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 05:54:48,984 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 05:54:48,984 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 05:54:48,985 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_ce0a5ee5-2912-4d0b-86d1-079a9fce3d5e/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_ce0a5ee5-2912-4d0b-86d1-079a9fce3d5e/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 -> 8b566ddb7b309d9ba7ea7e298fcc3be9218751e5387d333007519a12118bc5db [2023-11-29 05:54:49,220 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 05:54:49,242 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 05:54:49,245 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 05:54:49,246 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 05:54:49,247 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 05:54:49,248 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0a5ee5-2912-4d0b-86d1-079a9fce3d5e/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/pthread-wmm/mix043.opt.i [2023-11-29 05:54:52,041 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 05:54:52,272 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 05:54:52,272 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0a5ee5-2912-4d0b-86d1-079a9fce3d5e/sv-benchmarks/c/pthread-wmm/mix043.opt.i [2023-11-29 05:54:52,288 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0a5ee5-2912-4d0b-86d1-079a9fce3d5e/bin/uautomizer-verify-BQ2R08f2Ya/data/77fe15784/a7ae3781ca7c4d69ab844db9143dc63f/FLAG38fb0bf12 [2023-11-29 05:54:52,301 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0a5ee5-2912-4d0b-86d1-079a9fce3d5e/bin/uautomizer-verify-BQ2R08f2Ya/data/77fe15784/a7ae3781ca7c4d69ab844db9143dc63f [2023-11-29 05:54:52,304 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 05:54:52,305 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 05:54:52,307 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 05:54:52,307 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 05:54:52,312 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 05:54:52,312 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 05:54:52" (1/1) ... [2023-11-29 05:54:52,313 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e7c7757 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:54:52, skipping insertion in model container [2023-11-29 05:54:52,313 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 05:54:52" (1/1) ... [2023-11-29 05:54:52,366 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 05:54:52,691 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 05:54:52,703 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 05:54:52,766 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 05:54:52,798 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 05:54:52,798 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 05:54:52,804 INFO L206 MainTranslator]: Completed translation [2023-11-29 05:54:52,804 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:54:52 WrapperNode [2023-11-29 05:54:52,805 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 05:54:52,805 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 05:54:52,806 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 05:54:52,806 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 05:54:52,812 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:54:52" (1/1) ... [2023-11-29 05:54:52,830 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:54:52" (1/1) ... [2023-11-29 05:54:52,860 INFO L138 Inliner]: procedures = 177, calls = 72, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 174 [2023-11-29 05:54:52,860 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 05:54:52,861 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 05:54:52,861 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 05:54:52,862 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 05:54:52,872 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:54:52" (1/1) ... [2023-11-29 05:54:52,873 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:54:52" (1/1) ... [2023-11-29 05:54:52,877 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:54:52" (1/1) ... [2023-11-29 05:54:52,896 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 05:54:52,897 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:54:52" (1/1) ... [2023-11-29 05:54:52,897 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:54:52" (1/1) ... [2023-11-29 05:54:52,907 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:54:52" (1/1) ... [2023-11-29 05:54:52,909 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:54:52" (1/1) ... [2023-11-29 05:54:52,912 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:54:52" (1/1) ... [2023-11-29 05:54:52,915 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:54:52" (1/1) ... [2023-11-29 05:54:52,920 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 05:54:52,921 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 05:54:52,921 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 05:54:52,922 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 05:54:52,922 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:54:52" (1/1) ... [2023-11-29 05:54:52,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 05:54:52,940 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0a5ee5-2912-4d0b-86d1-079a9fce3d5e/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:54:52,953 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0a5ee5-2912-4d0b-86d1-079a9fce3d5e/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 05:54:52,956 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0a5ee5-2912-4d0b-86d1-079a9fce3d5e/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 05:54:52,989 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-29 05:54:52,989 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-29 05:54:52,990 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-29 05:54:52,990 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-11-29 05:54:52,990 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2023-11-29 05:54:52,990 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-29 05:54:52,990 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 05:54:52,990 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 05:54:52,990 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 05:54:52,991 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-29 05:54:52,991 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-29 05:54:52,991 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-29 05:54:52,991 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-29 05:54:52,992 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-29 05:54:52,992 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-29 05:54:52,992 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-11-29 05:54:52,992 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-11-29 05:54:52,992 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 05:54:52,993 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-29 05:54:52,993 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-29 05:54:52,993 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-11-29 05:54:52,993 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2023-11-29 05:54:52,994 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-29 05:54:52,994 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 05:54:52,994 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 05:54:52,996 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 05:54:53,162 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 05:54:53,165 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 05:54:53,488 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 05:54:53,685 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 05:54:53,686 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-29 05:54:53,686 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 05:54:53 BoogieIcfgContainer [2023-11-29 05:54:53,686 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 05:54:53,689 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 05:54:53,689 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 05:54:53,692 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 05:54:53,693 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 05:54:52" (1/3) ... [2023-11-29 05:54:53,693 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c444d68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 05:54:53, skipping insertion in model container [2023-11-29 05:54:53,693 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:54:52" (2/3) ... [2023-11-29 05:54:53,694 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c444d68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 05:54:53, skipping insertion in model container [2023-11-29 05:54:53,694 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 05:54:53" (3/3) ... [2023-11-29 05:54:53,695 INFO L112 eAbstractionObserver]: Analyzing ICFG mix043.opt.i [2023-11-29 05:54:53,715 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 05:54:53,715 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2023-11-29 05:54:53,715 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-29 05:54:53,764 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-29 05:54:53,799 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 78 places, 67 transitions, 150 flow [2023-11-29 05:54:53,829 INFO L124 PetriNetUnfolderBase]: 2/63 cut-off events. [2023-11-29 05:54:53,830 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 05:54:53,834 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76 conditions, 63 events. 2/63 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 133 event pairs, 0 based on Foata normal form. 0/50 useless extension candidates. Maximal degree in co-relation 64. Up to 2 conditions per place. [2023-11-29 05:54:53,834 INFO L82 GeneralOperation]: Start removeDead. Operand has 78 places, 67 transitions, 150 flow [2023-11-29 05:54:53,837 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 74 places, 63 transitions, 138 flow [2023-11-29 05:54:53,846 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 05:54:53,852 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;@55c49acd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 05:54:53,852 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-11-29 05:54:53,855 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-29 05:54:53,855 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-11-29 05:54:53,856 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 05:54:53,856 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:54:53,856 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-29 05:54:53,857 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 05:54:53,861 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:54:53,861 INFO L85 PathProgramCache]: Analyzing trace with hash 13699, now seen corresponding path program 1 times [2023-11-29 05:54:53,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:54:53,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202737768] [2023-11-29 05:54:53,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:54:53,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:54:53,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:54:54,119 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 05:54:54,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:54:54,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202737768] [2023-11-29 05:54:54,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202737768] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:54:54,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:54:54,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 05:54:54,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699827279] [2023-11-29 05:54:54,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:54:54,131 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:54:54,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:54:54,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:54:54,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:54:54,183 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 67 [2023-11-29 05:54:54,186 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 63 transitions, 138 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 05:54:54,186 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:54:54,187 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 67 [2023-11-29 05:54:54,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:54:54,756 INFO L124 PetriNetUnfolderBase]: 1323/2347 cut-off events. [2023-11-29 05:54:54,756 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2023-11-29 05:54:54,768 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4292 conditions, 2347 events. 1323/2347 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 203. Compared 17871 event pairs, 1027 based on Foata normal form. 120/2266 useless extension candidates. Maximal degree in co-relation 4277. Up to 1485 conditions per place. [2023-11-29 05:54:54,790 INFO L140 encePairwiseOnDemand]: 62/67 looper letters, 31 selfloop transitions, 2 changer transitions 0/67 dead transitions. [2023-11-29 05:54:54,790 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 67 transitions, 212 flow [2023-11-29 05:54:54,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:54:54,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:54:54,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 150 transitions. [2023-11-29 05:54:54,804 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.746268656716418 [2023-11-29 05:54:54,805 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 150 transitions. [2023-11-29 05:54:54,806 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 150 transitions. [2023-11-29 05:54:54,807 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:54:54,809 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 150 transitions. [2023-11-29 05:54:54,812 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 50.0) internal successors, (150), 3 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 05:54:54,816 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 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 05:54:54,817 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 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 05:54:54,819 INFO L175 Difference]: Start difference. First operand has 74 places, 63 transitions, 138 flow. Second operand 3 states and 150 transitions. [2023-11-29 05:54:54,820 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 67 transitions, 212 flow [2023-11-29 05:54:54,824 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 67 transitions, 208 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-29 05:54:54,828 INFO L231 Difference]: Finished difference. Result has 70 places, 59 transitions, 130 flow [2023-11-29 05:54:54,830 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=130, PETRI_PLACES=70, PETRI_TRANSITIONS=59} [2023-11-29 05:54:54,834 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -4 predicate places. [2023-11-29 05:54:54,834 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 59 transitions, 130 flow [2023-11-29 05:54:54,835 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 05:54:54,835 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:54:54,835 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-29 05:54:54,835 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 05:54:54,836 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 05:54:54,836 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:54:54,836 INFO L85 PathProgramCache]: Analyzing trace with hash 13700, now seen corresponding path program 1 times [2023-11-29 05:54:54,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:54:54,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695334740] [2023-11-29 05:54:54,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:54:54,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:54:54,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:54:54,945 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 05:54:54,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:54:54,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695334740] [2023-11-29 05:54:54,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695334740] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:54:54,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:54:54,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 05:54:54,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738622586] [2023-11-29 05:54:54,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:54:54,948 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:54:54,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:54:54,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:54:54,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:54:54,970 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 67 [2023-11-29 05:54:54,971 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 59 transitions, 130 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 05:54:54,971 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:54:54,971 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 67 [2023-11-29 05:54:54,971 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:54:55,470 INFO L124 PetriNetUnfolderBase]: 1323/2346 cut-off events. [2023-11-29 05:54:55,470 INFO L125 PetriNetUnfolderBase]: For 60/60 co-relation queries the response was YES. [2023-11-29 05:54:55,478 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4348 conditions, 2346 events. 1323/2346 cut-off events. For 60/60 co-relation queries the response was YES. Maximal size of possible extension queue 203. Compared 17821 event pairs, 1027 based on Foata normal form. 1/2146 useless extension candidates. Maximal degree in co-relation 4337. Up to 1484 conditions per place. [2023-11-29 05:54:55,496 INFO L140 encePairwiseOnDemand]: 64/67 looper letters, 30 selfloop transitions, 2 changer transitions 0/66 dead transitions. [2023-11-29 05:54:55,496 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 66 transitions, 208 flow [2023-11-29 05:54:55,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:54:55,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:54:55,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 150 transitions. [2023-11-29 05:54:55,499 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.746268656716418 [2023-11-29 05:54:55,499 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 150 transitions. [2023-11-29 05:54:55,499 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 150 transitions. [2023-11-29 05:54:55,500 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:54:55,500 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 150 transitions. [2023-11-29 05:54:55,501 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 50.0) internal successors, (150), 3 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 05:54:55,502 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 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 05:54:55,503 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 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 05:54:55,503 INFO L175 Difference]: Start difference. First operand has 70 places, 59 transitions, 130 flow. Second operand 3 states and 150 transitions. [2023-11-29 05:54:55,503 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 66 transitions, 208 flow [2023-11-29 05:54:55,507 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 66 transitions, 204 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 05:54:55,508 INFO L231 Difference]: Finished difference. Result has 69 places, 58 transitions, 128 flow [2023-11-29 05:54:55,508 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, 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 05:54:55,509 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -5 predicate places. [2023-11-29 05:54:55,509 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 58 transitions, 128 flow [2023-11-29 05:54:55,510 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 05:54:55,510 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:54:55,510 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-29 05:54:55,510 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 05:54:55,510 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 05:54:55,511 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:54:55,511 INFO L85 PathProgramCache]: Analyzing trace with hash 408533979, now seen corresponding path program 1 times [2023-11-29 05:54:55,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:54:55,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306567725] [2023-11-29 05:54:55,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:54:55,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:54:55,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:54:55,572 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 05:54:55,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:54:55,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306567725] [2023-11-29 05:54:55,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306567725] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:54:55,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:54:55,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:54:55,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039521990] [2023-11-29 05:54:55,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:54:55,574 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:54:55,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:54:55,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:54:55,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:54:55,592 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 67 [2023-11-29 05:54:55,593 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 58 transitions, 128 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 05:54:55,593 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:54:55,593 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 67 [2023-11-29 05:54:55,593 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:54:55,981 INFO L124 PetriNetUnfolderBase]: 1324/2344 cut-off events. [2023-11-29 05:54:55,982 INFO L125 PetriNetUnfolderBase]: For 60/60 co-relation queries the response was YES. [2023-11-29 05:54:55,987 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4349 conditions, 2344 events. 1324/2344 cut-off events. For 60/60 co-relation queries the response was YES. Maximal size of possible extension queue 203. Compared 17786 event pairs, 1027 based on Foata normal form. 0/2147 useless extension candidates. Maximal degree in co-relation 4338. Up to 1484 conditions per place. [2023-11-29 05:54:56,005 INFO L140 encePairwiseOnDemand]: 64/67 looper letters, 31 selfloop transitions, 2 changer transitions 0/65 dead transitions. [2023-11-29 05:54:56,005 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 65 transitions, 208 flow [2023-11-29 05:54:56,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:54:56,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:54:56,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 148 transitions. [2023-11-29 05:54:56,008 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.736318407960199 [2023-11-29 05:54:56,008 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 148 transitions. [2023-11-29 05:54:56,008 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 148 transitions. [2023-11-29 05:54:56,009 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:54:56,009 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 148 transitions. [2023-11-29 05:54:56,010 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 05:54:56,011 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 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 05:54:56,011 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 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 05:54:56,012 INFO L175 Difference]: Start difference. First operand has 69 places, 58 transitions, 128 flow. Second operand 3 states and 148 transitions. [2023-11-29 05:54:56,012 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 65 transitions, 208 flow [2023-11-29 05:54:56,015 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 65 transitions, 204 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 05:54:56,016 INFO L231 Difference]: Finished difference. Result has 68 places, 57 transitions, 126 flow [2023-11-29 05:54:56,017 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, 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 05:54:56,018 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -6 predicate places. [2023-11-29 05:54:56,018 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 57 transitions, 126 flow [2023-11-29 05:54:56,018 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 05:54:56,018 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:54:56,018 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-29 05:54:56,019 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 05:54:56,019 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 05:54:56,019 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:54:56,019 INFO L85 PathProgramCache]: Analyzing trace with hash 408533980, now seen corresponding path program 1 times [2023-11-29 05:54:56,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:54:56,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689179496] [2023-11-29 05:54:56,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:54:56,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:54:56,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:54:56,090 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 05:54:56,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:54:56,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689179496] [2023-11-29 05:54:56,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689179496] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:54:56,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:54:56,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:54:56,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960984081] [2023-11-29 05:54:56,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:54:56,092 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:54:56,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:54:56,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:54:56,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:54:56,111 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 67 [2023-11-29 05:54:56,111 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 57 transitions, 126 flow. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:54:56,111 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:54:56,112 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 67 [2023-11-29 05:54:56,112 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:54:56,414 INFO L124 PetriNetUnfolderBase]: 1323/2342 cut-off events. [2023-11-29 05:54:56,415 INFO L125 PetriNetUnfolderBase]: For 61/61 co-relation queries the response was YES. [2023-11-29 05:54:56,418 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4345 conditions, 2342 events. 1323/2342 cut-off events. For 61/61 co-relation queries the response was YES. Maximal size of possible extension queue 203. Compared 17701 event pairs, 860 based on Foata normal form. 2/2148 useless extension candidates. Maximal degree in co-relation 4335. Up to 1481 conditions per place. [2023-11-29 05:54:56,430 INFO L140 encePairwiseOnDemand]: 64/67 looper letters, 30 selfloop transitions, 2 changer transitions 0/64 dead transitions. [2023-11-29 05:54:56,430 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 64 transitions, 204 flow [2023-11-29 05:54:56,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:54:56,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:54:56,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 150 transitions. [2023-11-29 05:54:56,432 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.746268656716418 [2023-11-29 05:54:56,433 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 150 transitions. [2023-11-29 05:54:56,433 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 150 transitions. [2023-11-29 05:54:56,433 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:54:56,433 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 150 transitions. [2023-11-29 05:54:56,434 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 50.0) internal successors, (150), 3 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 05:54:56,435 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 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 05:54:56,435 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 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 05:54:56,435 INFO L175 Difference]: Start difference. First operand has 68 places, 57 transitions, 126 flow. Second operand 3 states and 150 transitions. [2023-11-29 05:54:56,435 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 64 transitions, 204 flow [2023-11-29 05:54:56,438 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 64 transitions, 200 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 05:54:56,439 INFO L231 Difference]: Finished difference. Result has 67 places, 56 transitions, 124 flow [2023-11-29 05:54:56,439 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, 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 05:54:56,440 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -7 predicate places. [2023-11-29 05:54:56,441 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 56 transitions, 124 flow [2023-11-29 05:54:56,441 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:54:56,441 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:54:56,441 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:54:56,441 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 05:54:56,441 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 05:54:56,442 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:54:56,442 INFO L85 PathProgramCache]: Analyzing trace with hash -1301125338, now seen corresponding path program 1 times [2023-11-29 05:54:56,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:54:56,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316748662] [2023-11-29 05:54:56,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:54:56,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:54:56,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:54:56,493 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 05:54:56,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:54:56,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316748662] [2023-11-29 05:54:56,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316748662] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:54:56,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:54:56,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:54:56,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645291635] [2023-11-29 05:54:56,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:54:56,496 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:54:56,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:54:56,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:54:56,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:54:56,516 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 67 [2023-11-29 05:54:56,516 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 56 transitions, 124 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 05:54:56,516 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:54:56,517 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 67 [2023-11-29 05:54:56,517 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:54:56,924 INFO L124 PetriNetUnfolderBase]: 1327/2339 cut-off events. [2023-11-29 05:54:56,924 INFO L125 PetriNetUnfolderBase]: For 61/61 co-relation queries the response was YES. [2023-11-29 05:54:56,929 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4350 conditions, 2339 events. 1327/2339 cut-off events. For 61/61 co-relation queries the response was YES. Maximal size of possible extension queue 203. Compared 18030 event pairs, 1028 based on Foata normal form. 0/2154 useless extension candidates. Maximal degree in co-relation 4340. Up to 1480 conditions per place. [2023-11-29 05:54:56,944 INFO L140 encePairwiseOnDemand]: 64/67 looper letters, 31 selfloop transitions, 2 changer transitions 0/63 dead transitions. [2023-11-29 05:54:56,944 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 63 transitions, 204 flow [2023-11-29 05:54:56,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:54:56,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:54:56,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 148 transitions. [2023-11-29 05:54:56,945 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.736318407960199 [2023-11-29 05:54:56,946 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 148 transitions. [2023-11-29 05:54:56,946 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 148 transitions. [2023-11-29 05:54:56,946 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:54:56,946 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 148 transitions. [2023-11-29 05:54:56,947 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 05:54:56,948 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 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 05:54:56,948 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 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 05:54:56,948 INFO L175 Difference]: Start difference. First operand has 67 places, 56 transitions, 124 flow. Second operand 3 states and 148 transitions. [2023-11-29 05:54:56,948 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 63 transitions, 204 flow [2023-11-29 05:54:56,951 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 63 transitions, 200 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 05:54:56,953 INFO L231 Difference]: Finished difference. Result has 66 places, 55 transitions, 122 flow [2023-11-29 05:54:56,953 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, 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 05:54:56,954 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -8 predicate places. [2023-11-29 05:54:56,954 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 55 transitions, 122 flow [2023-11-29 05:54:56,954 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 05:54:56,954 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:54:56,955 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:54:56,955 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-29 05:54:56,955 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 05:54:56,955 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:54:56,956 INFO L85 PathProgramCache]: Analyzing trace with hash -1301125337, now seen corresponding path program 1 times [2023-11-29 05:54:56,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:54:56,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898681383] [2023-11-29 05:54:56,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:54:56,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:54:56,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:54:57,038 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 05:54:57,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:54:57,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898681383] [2023-11-29 05:54:57,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898681383] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:54:57,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:54:57,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:54:57,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544605896] [2023-11-29 05:54:57,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:54:57,040 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:54:57,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:54:57,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:54:57,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:54:57,059 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 67 [2023-11-29 05:54:57,059 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 55 transitions, 122 flow. Second operand has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 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 05:54:57,059 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:54:57,059 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 67 [2023-11-29 05:54:57,060 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:54:57,409 INFO L124 PetriNetUnfolderBase]: 1323/2334 cut-off events. [2023-11-29 05:54:57,409 INFO L125 PetriNetUnfolderBase]: For 62/62 co-relation queries the response was YES. [2023-11-29 05:54:57,415 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4339 conditions, 2334 events. 1323/2334 cut-off events. For 62/62 co-relation queries the response was YES. Maximal size of possible extension queue 203. Compared 17400 event pairs, 699 based on Foata normal form. 4/2152 useless extension candidates. Maximal degree in co-relation 4329. Up to 1472 conditions per place. [2023-11-29 05:54:57,428 INFO L140 encePairwiseOnDemand]: 64/67 looper letters, 30 selfloop transitions, 2 changer transitions 0/62 dead transitions. [2023-11-29 05:54:57,428 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 62 transitions, 200 flow [2023-11-29 05:54:57,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:54:57,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:54:57,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 150 transitions. [2023-11-29 05:54:57,430 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.746268656716418 [2023-11-29 05:54:57,430 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 150 transitions. [2023-11-29 05:54:57,430 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 150 transitions. [2023-11-29 05:54:57,430 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:54:57,430 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 150 transitions. [2023-11-29 05:54:57,431 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 50.0) internal successors, (150), 3 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 05:54:57,432 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 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 05:54:57,432 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 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 05:54:57,432 INFO L175 Difference]: Start difference. First operand has 66 places, 55 transitions, 122 flow. Second operand 3 states and 150 transitions. [2023-11-29 05:54:57,432 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 62 transitions, 200 flow [2023-11-29 05:54:57,434 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 62 transitions, 196 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 05:54:57,435 INFO L231 Difference]: Finished difference. Result has 65 places, 54 transitions, 120 flow [2023-11-29 05:54:57,436 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, 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 05:54:57,436 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -9 predicate places. [2023-11-29 05:54:57,437 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 54 transitions, 120 flow [2023-11-29 05:54:57,437 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 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 05:54:57,437 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:54:57,437 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:54:57,437 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-29 05:54:57,437 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 05:54:57,438 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:54:57,438 INFO L85 PathProgramCache]: Analyzing trace with hash 255332791, now seen corresponding path program 1 times [2023-11-29 05:54:57,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:54:57,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542473485] [2023-11-29 05:54:57,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:54:57,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:54:57,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:54:57,494 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 05:54:57,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:54:57,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542473485] [2023-11-29 05:54:57,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542473485] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:54:57,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:54:57,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:54:57,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243990722] [2023-11-29 05:54:57,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:54:57,495 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:54:57,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:54:57,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:54:57,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:54:57,513 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 67 [2023-11-29 05:54:57,513 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.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 05:54:57,513 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:54:57,513 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 67 [2023-11-29 05:54:57,513 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:54:57,854 INFO L124 PetriNetUnfolderBase]: 1343/2294 cut-off events. [2023-11-29 05:54:57,855 INFO L125 PetriNetUnfolderBase]: For 62/62 co-relation queries the response was YES. [2023-11-29 05:54:57,860 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4331 conditions, 2294 events. 1343/2294 cut-off events. For 62/62 co-relation queries the response was YES. Maximal size of possible extension queue 199. Compared 16260 event pairs, 895 based on Foata normal form. 0/2147 useless extension candidates. Maximal degree in co-relation 4321. Up to 1472 conditions per place. [2023-11-29 05:54:57,873 INFO L140 encePairwiseOnDemand]: 64/67 looper letters, 31 selfloop transitions, 2 changer transitions 0/61 dead transitions. [2023-11-29 05:54:57,873 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 61 transitions, 200 flow [2023-11-29 05:54:57,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:54:57,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:54:57,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 148 transitions. [2023-11-29 05:54:57,874 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.736318407960199 [2023-11-29 05:54:57,874 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 148 transitions. [2023-11-29 05:54:57,875 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 148 transitions. [2023-11-29 05:54:57,875 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:54:57,875 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 148 transitions. [2023-11-29 05:54:57,876 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 05:54:57,876 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 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 05:54:57,877 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 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 05:54:57,877 INFO L175 Difference]: Start difference. First operand has 65 places, 54 transitions, 120 flow. Second operand 3 states and 148 transitions. [2023-11-29 05:54:57,877 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 61 transitions, 200 flow [2023-11-29 05:54:57,879 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 61 transitions, 196 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 05:54:57,880 INFO L231 Difference]: Finished difference. Result has 64 places, 53 transitions, 118 flow [2023-11-29 05:54:57,880 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, 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 05:54:57,881 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -10 predicate places. [2023-11-29 05:54:57,881 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 53 transitions, 118 flow [2023-11-29 05:54:57,882 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 05:54:57,882 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:54:57,882 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:54:57,882 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-29 05:54:57,882 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 05:54:57,882 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:54:57,882 INFO L85 PathProgramCache]: Analyzing trace with hash 255332792, now seen corresponding path program 1 times [2023-11-29 05:54:57,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:54:57,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248270565] [2023-11-29 05:54:57,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:54:57,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:54:57,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:54:57,966 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 05:54:57,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:54:57,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248270565] [2023-11-29 05:54:57,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248270565] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:54:57,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:54:57,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:54:57,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759254590] [2023-11-29 05:54:57,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:54:57,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:54:57,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:54:57,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:54:57,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:54:57,985 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 67 [2023-11-29 05:54:57,985 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.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:54:57,986 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:54:57,986 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 67 [2023-11-29 05:54:57,986 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:54:58,315 INFO L124 PetriNetUnfolderBase]: 1323/2252 cut-off events. [2023-11-29 05:54:58,315 INFO L125 PetriNetUnfolderBase]: For 68/68 co-relation queries the response was YES. [2023-11-29 05:54:58,319 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4265 conditions, 2252 events. 1323/2252 cut-off events. For 68/68 co-relation queries the response was YES. Maximal size of possible extension queue 197. Compared 15702 event pairs, 881 based on Foata normal form. 12/2131 useless extension candidates. Maximal degree in co-relation 4255. Up to 1440 conditions per place. [2023-11-29 05:54:58,328 INFO L140 encePairwiseOnDemand]: 64/67 looper letters, 30 selfloop transitions, 2 changer transitions 0/60 dead transitions. [2023-11-29 05:54:58,328 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 60 transitions, 196 flow [2023-11-29 05:54:58,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:54:58,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:54:58,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 150 transitions. [2023-11-29 05:54:58,329 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.746268656716418 [2023-11-29 05:54:58,330 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 150 transitions. [2023-11-29 05:54:58,330 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 150 transitions. [2023-11-29 05:54:58,330 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:54:58,330 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 150 transitions. [2023-11-29 05:54:58,331 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 50.0) internal successors, (150), 3 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 05:54:58,331 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 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 05:54:58,332 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 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 05:54:58,332 INFO L175 Difference]: Start difference. First operand has 64 places, 53 transitions, 118 flow. Second operand 3 states and 150 transitions. [2023-11-29 05:54:58,332 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 60 transitions, 196 flow [2023-11-29 05:54:58,334 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 60 transitions, 192 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 05:54:58,335 INFO L231 Difference]: Finished difference. Result has 63 places, 52 transitions, 116 flow [2023-11-29 05:54:58,335 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, 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=116, PETRI_PLACES=63, PETRI_TRANSITIONS=52} [2023-11-29 05:54:58,336 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -11 predicate places. [2023-11-29 05:54:58,337 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 52 transitions, 116 flow [2023-11-29 05:54:58,337 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:54:58,337 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:54:58,337 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:54:58,337 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-29 05:54:58,337 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting P3Err0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 05:54:58,338 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:54:58,338 INFO L85 PathProgramCache]: Analyzing trace with hash 232523064, now seen corresponding path program 1 times [2023-11-29 05:54:58,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:54:58,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559720401] [2023-11-29 05:54:58,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:54:58,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:54:58,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:54:58,481 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 05:54:58,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:54:58,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559720401] [2023-11-29 05:54:58,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559720401] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:54:58,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:54:58,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 05:54:58,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129662485] [2023-11-29 05:54:58,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:54:58,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:54:58,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:54:58,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:54:58,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:54:58,484 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 67 [2023-11-29 05:54:58,485 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 52 transitions, 116 flow. Second operand has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:54:58,485 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:54:58,485 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 67 [2023-11-29 05:54:58,485 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:54:58,818 INFO L124 PetriNetUnfolderBase]: 1047/2070 cut-off events. [2023-11-29 05:54:58,818 INFO L125 PetriNetUnfolderBase]: For 56/56 co-relation queries the response was YES. [2023-11-29 05:54:58,823 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3687 conditions, 2070 events. 1047/2070 cut-off events. For 56/56 co-relation queries the response was YES. Maximal size of possible extension queue 170. Compared 15949 event pairs, 219 based on Foata normal form. 0/2053 useless extension candidates. Maximal degree in co-relation 3677. Up to 1153 conditions per place. [2023-11-29 05:54:58,833 INFO L140 encePairwiseOnDemand]: 64/67 looper letters, 31 selfloop transitions, 2 changer transitions 2/63 dead transitions. [2023-11-29 05:54:58,833 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 63 transitions, 210 flow [2023-11-29 05:54:58,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:54:58,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:54:58,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 156 transitions. [2023-11-29 05:54:58,835 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7761194029850746 [2023-11-29 05:54:58,835 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 156 transitions. [2023-11-29 05:54:58,835 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 156 transitions. [2023-11-29 05:54:58,835 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:54:58,836 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 156 transitions. [2023-11-29 05:54:58,836 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 0 states have call successors, (0), 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 05:54:58,837 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 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 05:54:58,837 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 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 05:54:58,837 INFO L175 Difference]: Start difference. First operand has 63 places, 52 transitions, 116 flow. Second operand 3 states and 156 transitions. [2023-11-29 05:54:58,838 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 63 transitions, 210 flow [2023-11-29 05:54:58,838 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 63 transitions, 204 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 05:54:58,840 INFO L231 Difference]: Finished difference. Result has 62 places, 50 transitions, 112 flow [2023-11-29 05:54:58,840 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=112, PETRI_PLACES=62, PETRI_TRANSITIONS=50} [2023-11-29 05:54:58,841 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -12 predicate places. [2023-11-29 05:54:58,841 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 50 transitions, 112 flow [2023-11-29 05:54:58,841 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:54:58,841 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:54:58,841 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 05:54:58,841 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-29 05:54:58,842 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 05:54:58,842 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:54:58,842 INFO L85 PathProgramCache]: Analyzing trace with hash 2055837465, now seen corresponding path program 1 times [2023-11-29 05:54:58,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:54:58,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922042691] [2023-11-29 05:54:58,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:54:58,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:54:58,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:54:59,710 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 05:54:59,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:54:59,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922042691] [2023-11-29 05:54:59,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922042691] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:54:59,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:54:59,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-29 05:54:59,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323681522] [2023-11-29 05:54:59,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:54:59,711 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-29 05:54:59,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:54:59,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-29 05:54:59,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2023-11-29 05:55:00,122 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 67 [2023-11-29 05:55:00,123 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 50 transitions, 112 flow. Second operand has 11 states, 11 states have (on average 36.63636363636363) internal successors, (403), 11 states have internal predecessors, (403), 0 states have call successors, (0), 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 05:55:00,123 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:55:00,123 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 67 [2023-11-29 05:55:00,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:55:00,558 INFO L124 PetriNetUnfolderBase]: 1180/2035 cut-off events. [2023-11-29 05:55:00,559 INFO L125 PetriNetUnfolderBase]: For 96/96 co-relation queries the response was YES. [2023-11-29 05:55:00,561 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3877 conditions, 2035 events. 1180/2035 cut-off events. For 96/96 co-relation queries the response was YES. Maximal size of possible extension queue 179. Compared 14447 event pairs, 72 based on Foata normal form. 60/2077 useless extension candidates. Maximal degree in co-relation 3865. Up to 888 conditions per place. [2023-11-29 05:55:00,567 INFO L140 encePairwiseOnDemand]: 60/67 looper letters, 37 selfloop transitions, 5 changer transitions 10/75 dead transitions. [2023-11-29 05:55:00,567 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 75 transitions, 268 flow [2023-11-29 05:55:00,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 05:55:00,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-29 05:55:00,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 333 transitions. [2023-11-29 05:55:00,569 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.621268656716418 [2023-11-29 05:55:00,569 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 333 transitions. [2023-11-29 05:55:00,569 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 333 transitions. [2023-11-29 05:55:00,570 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:55:00,570 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 333 transitions. [2023-11-29 05:55:00,571 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 41.625) internal successors, (333), 8 states have internal predecessors, (333), 0 states have call successors, (0), 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 05:55:00,572 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 67.0) internal successors, (603), 9 states have internal predecessors, (603), 0 states have call successors, (0), 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 05:55:00,572 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 67.0) internal successors, (603), 9 states have internal predecessors, (603), 0 states have call successors, (0), 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 05:55:00,572 INFO L175 Difference]: Start difference. First operand has 62 places, 50 transitions, 112 flow. Second operand 8 states and 333 transitions. [2023-11-29 05:55:00,572 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 75 transitions, 268 flow [2023-11-29 05:55:00,573 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 75 transitions, 262 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 05:55:00,574 INFO L231 Difference]: Finished difference. Result has 65 places, 48 transitions, 114 flow [2023-11-29 05:55:00,574 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=114, PETRI_PLACES=65, PETRI_TRANSITIONS=48} [2023-11-29 05:55:00,575 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -9 predicate places. [2023-11-29 05:55:00,575 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 48 transitions, 114 flow [2023-11-29 05:55:00,575 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 36.63636363636363) internal successors, (403), 11 states have internal predecessors, (403), 0 states have call successors, (0), 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 05:55:00,575 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:55:00,576 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 05:55:00,576 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-29 05:55:00,576 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 05:55:00,576 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:55:00,576 INFO L85 PathProgramCache]: Analyzing trace with hash 2055838870, now seen corresponding path program 1 times [2023-11-29 05:55:00,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:55:00,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928999763] [2023-11-29 05:55:00,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:55:00,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:55:00,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:55:00,716 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 05:55:00,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:55:00,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928999763] [2023-11-29 05:55:00,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928999763] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:55:00,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:55:00,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 05:55:00,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351520561] [2023-11-29 05:55:00,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:55:00,718 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 05:55:00,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:55:00,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 05:55:00,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 05:55:00,727 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 67 [2023-11-29 05:55:00,728 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 48 transitions, 114 flow. Second operand has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 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 05:55:00,728 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:55:00,728 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 67 [2023-11-29 05:55:00,728 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:55:01,294 INFO L124 PetriNetUnfolderBase]: 4352/6579 cut-off events. [2023-11-29 05:55:01,295 INFO L125 PetriNetUnfolderBase]: For 45/45 co-relation queries the response was YES. [2023-11-29 05:55:01,306 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12764 conditions, 6579 events. 4352/6579 cut-off events. For 45/45 co-relation queries the response was YES. Maximal size of possible extension queue 446. Compared 44067 event pairs, 536 based on Foata normal form. 180/6745 useless extension candidates. Maximal degree in co-relation 12753. Up to 4015 conditions per place. [2023-11-29 05:55:01,333 INFO L140 encePairwiseOnDemand]: 60/67 looper letters, 45 selfloop transitions, 6 changer transitions 1/74 dead transitions. [2023-11-29 05:55:01,333 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 74 transitions, 282 flow [2023-11-29 05:55:01,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 05:55:01,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-29 05:55:01,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 194 transitions. [2023-11-29 05:55:01,335 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7238805970149254 [2023-11-29 05:55:01,335 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 194 transitions. [2023-11-29 05:55:01,335 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 194 transitions. [2023-11-29 05:55:01,335 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:55:01,335 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 194 transitions. [2023-11-29 05:55:01,336 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 48.5) internal successors, (194), 4 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 05:55:01,337 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 67.0) internal successors, (335), 5 states have internal predecessors, (335), 0 states have call successors, (0), 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 05:55:01,337 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 67.0) internal successors, (335), 5 states have internal predecessors, (335), 0 states have call successors, (0), 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 05:55:01,337 INFO L175 Difference]: Start difference. First operand has 65 places, 48 transitions, 114 flow. Second operand 4 states and 194 transitions. [2023-11-29 05:55:01,337 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 74 transitions, 282 flow [2023-11-29 05:55:01,338 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 74 transitions, 267 flow, removed 0 selfloop flow, removed 5 redundant places. [2023-11-29 05:55:01,339 INFO L231 Difference]: Finished difference. Result has 63 places, 52 transitions, 147 flow [2023-11-29 05:55:01,339 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=105, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=147, PETRI_PLACES=63, PETRI_TRANSITIONS=52} [2023-11-29 05:55:01,340 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -11 predicate places. [2023-11-29 05:55:01,340 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 52 transitions, 147 flow [2023-11-29 05:55:01,340 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 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 05:55:01,340 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:55:01,341 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 05:55:01,341 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-29 05:55:01,341 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 05:55:01,341 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:55:01,341 INFO L85 PathProgramCache]: Analyzing trace with hash 2045910145, now seen corresponding path program 1 times [2023-11-29 05:55:01,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:55:01,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481220159] [2023-11-29 05:55:01,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:55:01,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:55:01,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:55:01,526 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 05:55:01,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:55:01,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481220159] [2023-11-29 05:55:01,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481220159] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:55:01,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:55:01,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 05:55:01,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849688451] [2023-11-29 05:55:01,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:55:01,528 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 05:55:01,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:55:01,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 05:55:01,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-29 05:55:01,538 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 67 [2023-11-29 05:55:01,538 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 52 transitions, 147 flow. Second operand has 5 states, 5 states have (on average 38.2) internal successors, (191), 5 states have internal predecessors, (191), 0 states have call successors, (0), 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 05:55:01,538 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:55:01,538 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 67 [2023-11-29 05:55:01,539 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:55:02,142 INFO L124 PetriNetUnfolderBase]: 3648/5563 cut-off events. [2023-11-29 05:55:02,143 INFO L125 PetriNetUnfolderBase]: For 1509/1509 co-relation queries the response was YES. [2023-11-29 05:55:02,149 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12828 conditions, 5563 events. 3648/5563 cut-off events. For 1509/1509 co-relation queries the response was YES. Maximal size of possible extension queue 399. Compared 36364 event pairs, 192 based on Foata normal form. 174/5725 useless extension candidates. Maximal degree in co-relation 12815. Up to 3097 conditions per place. [2023-11-29 05:55:02,164 INFO L140 encePairwiseOnDemand]: 60/67 looper letters, 57 selfloop transitions, 10 changer transitions 1/90 dead transitions. [2023-11-29 05:55:02,165 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 90 transitions, 388 flow [2023-11-29 05:55:02,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 05:55:02,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-29 05:55:02,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 245 transitions. [2023-11-29 05:55:02,166 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7313432835820896 [2023-11-29 05:55:02,167 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 245 transitions. [2023-11-29 05:55:02,167 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 245 transitions. [2023-11-29 05:55:02,167 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:55:02,167 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 245 transitions. [2023-11-29 05:55:02,168 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 49.0) internal successors, (245), 5 states have internal predecessors, (245), 0 states have call successors, (0), 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 05:55:02,169 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 67.0) internal successors, (402), 6 states have internal predecessors, (402), 0 states have call successors, (0), 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 05:55:02,169 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 67.0) internal successors, (402), 6 states have internal predecessors, (402), 0 states have call successors, (0), 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 05:55:02,170 INFO L175 Difference]: Start difference. First operand has 63 places, 52 transitions, 147 flow. Second operand 5 states and 245 transitions. [2023-11-29 05:55:02,170 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 90 transitions, 388 flow [2023-11-29 05:55:02,171 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 90 transitions, 377 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-11-29 05:55:02,172 INFO L231 Difference]: Finished difference. Result has 67 places, 56 transitions, 199 flow [2023-11-29 05:55:02,173 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=199, PETRI_PLACES=67, PETRI_TRANSITIONS=56} [2023-11-29 05:55:02,173 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -7 predicate places. [2023-11-29 05:55:02,174 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 56 transitions, 199 flow [2023-11-29 05:55:02,174 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 38.2) internal successors, (191), 5 states have internal predecessors, (191), 0 states have call successors, (0), 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 05:55:02,174 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:55:02,174 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 05:55:02,174 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-29 05:55:02,174 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 05:55:02,175 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:55:02,175 INFO L85 PathProgramCache]: Analyzing trace with hash 1269271992, now seen corresponding path program 1 times [2023-11-29 05:55:02,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:55:02,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068594278] [2023-11-29 05:55:02,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:55:02,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:55:02,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:55:02,348 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 05:55:02,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:55:02,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068594278] [2023-11-29 05:55:02,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068594278] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:55:02,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:55:02,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 05:55:02,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017996096] [2023-11-29 05:55:02,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:55:02,349 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 05:55:02,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:55:02,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 05:55:02,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-29 05:55:02,354 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 67 [2023-11-29 05:55:02,355 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 56 transitions, 199 flow. Second operand has 6 states, 6 states have (on average 37.833333333333336) internal successors, (227), 6 states have internal predecessors, (227), 0 states have call successors, (0), 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 05:55:02,355 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:55:02,355 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 67 [2023-11-29 05:55:02,355 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:55:02,789 INFO L124 PetriNetUnfolderBase]: 2373/3642 cut-off events. [2023-11-29 05:55:02,789 INFO L125 PetriNetUnfolderBase]: For 2865/2865 co-relation queries the response was YES. [2023-11-29 05:55:02,794 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9454 conditions, 3642 events. 2373/3642 cut-off events. For 2865/2865 co-relation queries the response was YES. Maximal size of possible extension queue 204. Compared 21110 event pairs, 69 based on Foata normal form. 140/3771 useless extension candidates. Maximal degree in co-relation 9439. Up to 1465 conditions per place. [2023-11-29 05:55:02,806 INFO L140 encePairwiseOnDemand]: 60/67 looper letters, 67 selfloop transitions, 14 changer transitions 1/104 dead transitions. [2023-11-29 05:55:02,807 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 104 transitions, 507 flow [2023-11-29 05:55:02,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 05:55:02,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 05:55:02,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 294 transitions. [2023-11-29 05:55:02,809 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7313432835820896 [2023-11-29 05:55:02,809 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 294 transitions. [2023-11-29 05:55:02,809 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 294 transitions. [2023-11-29 05:55:02,809 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:55:02,809 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 294 transitions. [2023-11-29 05:55:02,810 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 49.0) internal successors, (294), 6 states have internal predecessors, (294), 0 states have call successors, (0), 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 05:55:02,812 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 67.0) internal successors, (469), 7 states have internal predecessors, (469), 0 states have call successors, (0), 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 05:55:02,812 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 67.0) internal successors, (469), 7 states have internal predecessors, (469), 0 states have call successors, (0), 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 05:55:02,812 INFO L175 Difference]: Start difference. First operand has 67 places, 56 transitions, 199 flow. Second operand 6 states and 294 transitions. [2023-11-29 05:55:02,812 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 104 transitions, 507 flow [2023-11-29 05:55:02,819 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 104 transitions, 477 flow, removed 5 selfloop flow, removed 4 redundant places. [2023-11-29 05:55:02,821 INFO L231 Difference]: Finished difference. Result has 70 places, 60 transitions, 249 flow [2023-11-29 05:55:02,821 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=249, PETRI_PLACES=70, PETRI_TRANSITIONS=60} [2023-11-29 05:55:02,822 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -4 predicate places. [2023-11-29 05:55:02,822 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 60 transitions, 249 flow [2023-11-29 05:55:02,823 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 37.833333333333336) internal successors, (227), 6 states have internal predecessors, (227), 0 states have call successors, (0), 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 05:55:02,823 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:55:02,823 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 05:55:02,823 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-29 05:55:02,823 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 05:55:02,823 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:55:02,823 INFO L85 PathProgramCache]: Analyzing trace with hash -1488730393, now seen corresponding path program 1 times [2023-11-29 05:55:02,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:55:02,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500959006] [2023-11-29 05:55:02,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:55:02,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:55:02,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:55:03,074 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 05:55:03,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:55:03,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500959006] [2023-11-29 05:55:03,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500959006] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:55:03,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:55:03,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 05:55:03,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177793445] [2023-11-29 05:55:03,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:55:03,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 05:55:03,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:55:03,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 05:55:03,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-29 05:55:03,081 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 67 [2023-11-29 05:55:03,082 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 60 transitions, 249 flow. Second operand has 7 states, 7 states have (on average 37.714285714285715) internal successors, (264), 7 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 05:55:03,082 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:55:03,082 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 67 [2023-11-29 05:55:03,082 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:55:03,398 INFO L124 PetriNetUnfolderBase]: 1385/2082 cut-off events. [2023-11-29 05:55:03,398 INFO L125 PetriNetUnfolderBase]: For 3115/3115 co-relation queries the response was YES. [2023-11-29 05:55:03,401 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6143 conditions, 2082 events. 1385/2082 cut-off events. For 3115/3115 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 10149 event pairs, 39 based on Foata normal form. 72/2143 useless extension candidates. Maximal degree in co-relation 6127. Up to 668 conditions per place. [2023-11-29 05:55:03,407 INFO L140 encePairwiseOnDemand]: 60/67 looper letters, 61 selfloop transitions, 18 changer transitions 1/102 dead transitions. [2023-11-29 05:55:03,407 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 102 transitions, 509 flow [2023-11-29 05:55:03,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 05:55:03,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-29 05:55:03,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 327 transitions. [2023-11-29 05:55:03,408 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.697228144989339 [2023-11-29 05:55:03,408 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 327 transitions. [2023-11-29 05:55:03,408 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 327 transitions. [2023-11-29 05:55:03,409 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:55:03,409 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 327 transitions. [2023-11-29 05:55:03,409 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 46.714285714285715) internal successors, (327), 7 states have internal predecessors, (327), 0 states have call successors, (0), 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 05:55:03,410 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 67.0) internal successors, (536), 8 states have internal predecessors, (536), 0 states have call successors, (0), 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 05:55:03,411 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 67.0) internal successors, (536), 8 states have internal predecessors, (536), 0 states have call successors, (0), 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 05:55:03,411 INFO L175 Difference]: Start difference. First operand has 70 places, 60 transitions, 249 flow. Second operand 7 states and 327 transitions. [2023-11-29 05:55:03,411 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 102 transitions, 509 flow [2023-11-29 05:55:03,420 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 102 transitions, 463 flow, removed 9 selfloop flow, removed 5 redundant places. [2023-11-29 05:55:03,421 INFO L231 Difference]: Finished difference. Result has 73 places, 60 transitions, 259 flow [2023-11-29 05:55:03,422 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=206, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=259, PETRI_PLACES=73, PETRI_TRANSITIONS=60} [2023-11-29 05:55:03,422 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -1 predicate places. [2023-11-29 05:55:03,422 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 60 transitions, 259 flow [2023-11-29 05:55:03,422 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 37.714285714285715) internal successors, (264), 7 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 05:55:03,422 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:55:03,422 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, 1] [2023-11-29 05:55:03,422 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-29 05:55:03,423 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 05:55:03,423 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:55:03,423 INFO L85 PathProgramCache]: Analyzing trace with hash -1857007229, now seen corresponding path program 1 times [2023-11-29 05:55:03,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:55:03,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919392129] [2023-11-29 05:55:03,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:55:03,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:55:03,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:55:04,018 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 05:55:04,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:55:04,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919392129] [2023-11-29 05:55:04,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919392129] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:55:04,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:55:04,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 05:55:04,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302133154] [2023-11-29 05:55:04,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:55:04,020 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 05:55:04,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:55:04,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 05:55:04,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-29 05:55:04,048 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 67 [2023-11-29 05:55:04,048 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 60 transitions, 259 flow. Second operand has 7 states, 7 states have (on average 38.142857142857146) internal successors, (267), 7 states have internal predecessors, (267), 0 states have call successors, (0), 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 05:55:04,048 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:55:04,049 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 67 [2023-11-29 05:55:04,049 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:55:04,764 INFO L124 PetriNetUnfolderBase]: 3033/5142 cut-off events. [2023-11-29 05:55:04,764 INFO L125 PetriNetUnfolderBase]: For 2620/2760 co-relation queries the response was YES. [2023-11-29 05:55:04,774 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12278 conditions, 5142 events. 3033/5142 cut-off events. For 2620/2760 co-relation queries the response was YES. Maximal size of possible extension queue 302. Compared 34595 event pairs, 492 based on Foata normal form. 16/4970 useless extension candidates. Maximal degree in co-relation 12261. Up to 1973 conditions per place. [2023-11-29 05:55:04,785 INFO L140 encePairwiseOnDemand]: 58/67 looper letters, 58 selfloop transitions, 11 changer transitions 12/115 dead transitions. [2023-11-29 05:55:04,786 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 115 transitions, 555 flow [2023-11-29 05:55:04,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 05:55:04,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-29 05:55:04,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 362 transitions. [2023-11-29 05:55:04,788 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6753731343283582 [2023-11-29 05:55:04,788 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 362 transitions. [2023-11-29 05:55:04,788 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 362 transitions. [2023-11-29 05:55:04,788 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:55:04,789 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 362 transitions. [2023-11-29 05:55:04,789 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 45.25) internal successors, (362), 8 states have internal predecessors, (362), 0 states have call successors, (0), 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 05:55:04,790 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 67.0) internal successors, (603), 9 states have internal predecessors, (603), 0 states have call successors, (0), 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 05:55:04,791 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 67.0) internal successors, (603), 9 states have internal predecessors, (603), 0 states have call successors, (0), 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 05:55:04,791 INFO L175 Difference]: Start difference. First operand has 73 places, 60 transitions, 259 flow. Second operand 8 states and 362 transitions. [2023-11-29 05:55:04,791 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 115 transitions, 555 flow [2023-11-29 05:55:04,826 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 115 transitions, 449 flow, removed 22 selfloop flow, removed 10 redundant places. [2023-11-29 05:55:04,827 INFO L231 Difference]: Finished difference. Result has 75 places, 69 transitions, 233 flow [2023-11-29 05:55:04,827 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=163, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=233, PETRI_PLACES=75, PETRI_TRANSITIONS=69} [2023-11-29 05:55:04,828 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 1 predicate places. [2023-11-29 05:55:04,828 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 69 transitions, 233 flow [2023-11-29 05:55:04,828 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 38.142857142857146) internal successors, (267), 7 states have internal predecessors, (267), 0 states have call successors, (0), 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 05:55:04,828 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:55:04,828 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, 1] [2023-11-29 05:55:04,828 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-29 05:55:04,829 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 05:55:04,829 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:55:04,829 INFO L85 PathProgramCache]: Analyzing trace with hash 1673422977, now seen corresponding path program 2 times [2023-11-29 05:55:04,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:55:04,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621487500] [2023-11-29 05:55:04,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:55:04,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:55:04,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:55:05,268 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 05:55:05,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:55:05,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621487500] [2023-11-29 05:55:05,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621487500] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:55:05,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:55:05,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 05:55:05,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384823305] [2023-11-29 05:55:05,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:55:05,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 05:55:05,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:55:05,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 05:55:05,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-29 05:55:05,307 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 67 [2023-11-29 05:55:05,307 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 69 transitions, 233 flow. Second operand has 7 states, 7 states have (on average 38.142857142857146) internal successors, (267), 7 states have internal predecessors, (267), 0 states have call successors, (0), 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 05:55:05,307 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:55:05,307 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 67 [2023-11-29 05:55:05,307 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:55:06,239 INFO L124 PetriNetUnfolderBase]: 4734/7878 cut-off events. [2023-11-29 05:55:06,240 INFO L125 PetriNetUnfolderBase]: For 2492/2527 co-relation queries the response was YES. [2023-11-29 05:55:06,254 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17771 conditions, 7878 events. 4734/7878 cut-off events. For 2492/2527 co-relation queries the response was YES. Maximal size of possible extension queue 490. Compared 56095 event pairs, 1160 based on Foata normal form. 28/7482 useless extension candidates. Maximal degree in co-relation 17754. Up to 3704 conditions per place. [2023-11-29 05:55:06,261 INFO L140 encePairwiseOnDemand]: 57/67 looper letters, 36 selfloop transitions, 4 changer transitions 52/126 dead transitions. [2023-11-29 05:55:06,261 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 126 transitions, 588 flow [2023-11-29 05:55:06,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 05:55:06,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-29 05:55:06,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 364 transitions. [2023-11-29 05:55:06,263 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6791044776119403 [2023-11-29 05:55:06,263 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 364 transitions. [2023-11-29 05:55:06,263 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 364 transitions. [2023-11-29 05:55:06,264 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:55:06,264 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 364 transitions. [2023-11-29 05:55:06,265 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 45.5) internal successors, (364), 8 states have internal predecessors, (364), 0 states have call successors, (0), 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 05:55:06,267 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 67.0) internal successors, (603), 9 states have internal predecessors, (603), 0 states have call successors, (0), 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 05:55:06,267 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 67.0) internal successors, (603), 9 states have internal predecessors, (603), 0 states have call successors, (0), 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 05:55:06,267 INFO L175 Difference]: Start difference. First operand has 75 places, 69 transitions, 233 flow. Second operand 8 states and 364 transitions. [2023-11-29 05:55:06,267 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 126 transitions, 588 flow [2023-11-29 05:55:06,271 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 126 transitions, 582 flow, removed 3 selfloop flow, removed 2 redundant places. [2023-11-29 05:55:06,272 INFO L231 Difference]: Finished difference. Result has 82 places, 62 transitions, 209 flow [2023-11-29 05:55:06,273 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=229, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=209, PETRI_PLACES=82, PETRI_TRANSITIONS=62} [2023-11-29 05:55:06,273 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 8 predicate places. [2023-11-29 05:55:06,273 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 62 transitions, 209 flow [2023-11-29 05:55:06,273 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 38.142857142857146) internal successors, (267), 7 states have internal predecessors, (267), 0 states have call successors, (0), 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 05:55:06,273 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:55:06,274 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, 1] [2023-11-29 05:55:06,274 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-29 05:55:06,274 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 05:55:06,274 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:55:06,274 INFO L85 PathProgramCache]: Analyzing trace with hash -187602249, now seen corresponding path program 3 times [2023-11-29 05:55:06,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:55:06,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712857053] [2023-11-29 05:55:06,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:55:06,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:55:06,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:55:06,483 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 05:55:06,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:55:06,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712857053] [2023-11-29 05:55:06,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712857053] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:55:06,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:55:06,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 05:55:06,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027490050] [2023-11-29 05:55:06,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:55:06,484 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 05:55:06,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:55:06,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 05:55:06,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 05:55:06,493 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 67 [2023-11-29 05:55:06,493 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 62 transitions, 209 flow. Second operand has 6 states, 6 states have (on average 41.166666666666664) internal successors, (247), 6 states have internal predecessors, (247), 0 states have call successors, (0), 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 05:55:06,493 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:55:06,493 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 67 [2023-11-29 05:55:06,494 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:55:06,960 INFO L124 PetriNetUnfolderBase]: 1938/3528 cut-off events. [2023-11-29 05:55:06,960 INFO L125 PetriNetUnfolderBase]: For 722/749 co-relation queries the response was YES. [2023-11-29 05:55:06,970 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7704 conditions, 3528 events. 1938/3528 cut-off events. For 722/749 co-relation queries the response was YES. Maximal size of possible extension queue 241. Compared 23317 event pairs, 669 based on Foata normal form. 16/3335 useless extension candidates. Maximal degree in co-relation 7683. Up to 1150 conditions per place. [2023-11-29 05:55:06,975 INFO L140 encePairwiseOnDemand]: 62/67 looper letters, 28 selfloop transitions, 1 changer transitions 32/98 dead transitions. [2023-11-29 05:55:06,975 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 98 transitions, 432 flow [2023-11-29 05:55:06,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 05:55:06,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 05:55:06,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 288 transitions. [2023-11-29 05:55:06,977 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7164179104477612 [2023-11-29 05:55:06,977 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 288 transitions. [2023-11-29 05:55:06,977 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 288 transitions. [2023-11-29 05:55:06,977 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:55:06,977 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 288 transitions. [2023-11-29 05:55:06,978 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 48.0) internal successors, (288), 6 states have internal predecessors, (288), 0 states have call successors, (0), 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 05:55:06,979 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 67.0) internal successors, (469), 7 states have internal predecessors, (469), 0 states have call successors, (0), 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 05:55:06,979 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 67.0) internal successors, (469), 7 states have internal predecessors, (469), 0 states have call successors, (0), 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 05:55:06,979 INFO L175 Difference]: Start difference. First operand has 82 places, 62 transitions, 209 flow. Second operand 6 states and 288 transitions. [2023-11-29 05:55:06,979 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 98 transitions, 432 flow [2023-11-29 05:55:06,982 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 98 transitions, 414 flow, removed 7 selfloop flow, removed 5 redundant places. [2023-11-29 05:55:06,983 INFO L231 Difference]: Finished difference. Result has 80 places, 60 transitions, 197 flow [2023-11-29 05:55:06,983 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=197, PETRI_PLACES=80, PETRI_TRANSITIONS=60} [2023-11-29 05:55:06,983 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 6 predicate places. [2023-11-29 05:55:06,983 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 60 transitions, 197 flow [2023-11-29 05:55:06,984 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 41.166666666666664) internal successors, (247), 6 states have internal predecessors, (247), 0 states have call successors, (0), 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 05:55:06,984 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:55:06,984 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, 1] [2023-11-29 05:55:06,984 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-29 05:55:06,984 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 05:55:06,984 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:55:06,984 INFO L85 PathProgramCache]: Analyzing trace with hash -896771163, now seen corresponding path program 4 times [2023-11-29 05:55:06,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:55:06,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835122129] [2023-11-29 05:55:06,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:55:06,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:55:07,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:55:08,029 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 05:55:08,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:55:08,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835122129] [2023-11-29 05:55:08,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835122129] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:55:08,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:55:08,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 05:55:08,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299822553] [2023-11-29 05:55:08,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:55:08,030 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 05:55:08,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:55:08,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 05:55:08,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-11-29 05:55:08,058 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 67 [2023-11-29 05:55:08,059 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 60 transitions, 197 flow. Second operand has 9 states, 9 states have (on average 37.44444444444444) internal successors, (337), 9 states have internal predecessors, (337), 0 states have call successors, (0), 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 05:55:08,059 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:55:08,059 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 67 [2023-11-29 05:55:08,059 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:55:08,519 INFO L124 PetriNetUnfolderBase]: 1674/3039 cut-off events. [2023-11-29 05:55:08,519 INFO L125 PetriNetUnfolderBase]: For 425/425 co-relation queries the response was YES. [2023-11-29 05:55:08,528 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6559 conditions, 3039 events. 1674/3039 cut-off events. For 425/425 co-relation queries the response was YES. Maximal size of possible extension queue 222. Compared 19375 event pairs, 327 based on Foata normal form. 16/2928 useless extension candidates. Maximal degree in co-relation 6538. Up to 1152 conditions per place. [2023-11-29 05:55:08,533 INFO L140 encePairwiseOnDemand]: 58/67 looper letters, 31 selfloop transitions, 4 changer transitions 18/87 dead transitions. [2023-11-29 05:55:08,533 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 87 transitions, 381 flow [2023-11-29 05:55:08,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 05:55:08,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-29 05:55:08,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 299 transitions. [2023-11-29 05:55:08,535 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6375266524520256 [2023-11-29 05:55:08,535 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 299 transitions. [2023-11-29 05:55:08,535 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 299 transitions. [2023-11-29 05:55:08,535 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:55:08,536 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 299 transitions. [2023-11-29 05:55:08,537 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 42.714285714285715) internal successors, (299), 7 states have internal predecessors, (299), 0 states have call successors, (0), 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 05:55:08,538 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 67.0) internal successors, (536), 8 states have internal predecessors, (536), 0 states have call successors, (0), 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 05:55:08,538 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 67.0) internal successors, (536), 8 states have internal predecessors, (536), 0 states have call successors, (0), 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 05:55:08,538 INFO L175 Difference]: Start difference. First operand has 80 places, 60 transitions, 197 flow. Second operand 7 states and 299 transitions. [2023-11-29 05:55:08,538 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 87 transitions, 381 flow [2023-11-29 05:55:08,541 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 87 transitions, 360 flow, removed 8 selfloop flow, removed 6 redundant places. [2023-11-29 05:55:08,543 INFO L231 Difference]: Finished difference. Result has 81 places, 61 transitions, 210 flow [2023-11-29 05:55:08,543 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=210, PETRI_PLACES=81, PETRI_TRANSITIONS=61} [2023-11-29 05:55:08,544 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 7 predicate places. [2023-11-29 05:55:08,544 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 61 transitions, 210 flow [2023-11-29 05:55:08,544 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 37.44444444444444) internal successors, (337), 9 states have internal predecessors, (337), 0 states have call successors, (0), 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 05:55:08,544 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:55:08,544 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, 1] [2023-11-29 05:55:08,544 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-29 05:55:08,545 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 05:55:08,545 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:55:08,545 INFO L85 PathProgramCache]: Analyzing trace with hash 1486640423, now seen corresponding path program 5 times [2023-11-29 05:55:08,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:55:08,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268287973] [2023-11-29 05:55:08,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:55:08,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:55:08,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:55:08,601 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 05:55:08,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:55:08,691 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 05:55:08,691 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-29 05:55:08,692 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2023-11-29 05:55:08,694 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2023-11-29 05:55:08,694 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2023-11-29 05:55:08,694 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2023-11-29 05:55:08,695 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2023-11-29 05:55:08,695 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2023-11-29 05:55:08,695 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2023-11-29 05:55:08,695 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2023-11-29 05:55:08,695 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2023-11-29 05:55:08,695 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2023-11-29 05:55:08,695 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2023-11-29 05:55:08,696 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2023-11-29 05:55:08,696 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2023-11-29 05:55:08,696 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2023-11-29 05:55:08,696 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2023-11-29 05:55:08,696 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2023-11-29 05:55:08,696 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-29 05:55:08,697 INFO L445 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:55:08,703 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-29 05:55:08,703 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 05:55:08,769 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre3 could not be translated [2023-11-29 05:55:08,771 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-29 05:55:08,773 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-29 05:55:08,774 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-29 05:55:08,790 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-29 05:55:08,790 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-29 05:55:08,804 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 05:55:08 BasicIcfg [2023-11-29 05:55:08,804 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 05:55:08,805 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 05:55:08,805 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 05:55:08,805 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 05:55:08,805 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 05:54:53" (3/4) ... [2023-11-29 05:55:08,807 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-29 05:55:08,808 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 05:55:08,809 INFO L158 Benchmark]: Toolchain (without parser) took 16503.66ms. Allocated memory was 161.5MB in the beginning and 457.2MB in the end (delta: 295.7MB). Free memory was 121.5MB in the beginning and 257.9MB in the end (delta: -136.4MB). Peak memory consumption was 161.0MB. Max. memory is 16.1GB. [2023-11-29 05:55:08,809 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 115.3MB. Free memory is still 83.3MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 05:55:08,810 INFO L158 Benchmark]: CACSL2BoogieTranslator took 498.18ms. Allocated memory is still 161.5MB. Free memory was 120.9MB in the beginning and 97.2MB in the end (delta: 23.6MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-11-29 05:55:08,810 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.11ms. Allocated memory is still 161.5MB. Free memory was 97.2MB in the beginning and 94.3MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-29 05:55:08,810 INFO L158 Benchmark]: Boogie Preprocessor took 58.99ms. Allocated memory is still 161.5MB. Free memory was 94.3MB in the beginning and 90.9MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 05:55:08,811 INFO L158 Benchmark]: RCFGBuilder took 765.57ms. Allocated memory is still 161.5MB. Free memory was 90.9MB in the beginning and 124.5MB in the end (delta: -33.6MB). Peak memory consumption was 56.4MB. Max. memory is 16.1GB. [2023-11-29 05:55:08,811 INFO L158 Benchmark]: TraceAbstraction took 15115.14ms. Allocated memory was 161.5MB in the beginning and 457.2MB in the end (delta: 295.7MB). Free memory was 123.6MB in the beginning and 257.9MB in the end (delta: -134.3MB). Peak memory consumption was 161.2MB. Max. memory is 16.1GB. [2023-11-29 05:55:08,811 INFO L158 Benchmark]: Witness Printer took 3.60ms. Allocated memory is still 457.2MB. Free memory is still 257.9MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 05:55:08,813 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.17ms. Allocated memory is still 115.3MB. Free memory is still 83.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 498.18ms. Allocated memory is still 161.5MB. Free memory was 120.9MB in the beginning and 97.2MB in the end (delta: 23.6MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.11ms. Allocated memory is still 161.5MB. Free memory was 97.2MB in the beginning and 94.3MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 58.99ms. Allocated memory is still 161.5MB. Free memory was 94.3MB in the beginning and 90.9MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 765.57ms. Allocated memory is still 161.5MB. Free memory was 90.9MB in the beginning and 124.5MB in the end (delta: -33.6MB). Peak memory consumption was 56.4MB. Max. memory is 16.1GB. * TraceAbstraction took 15115.14ms. Allocated memory was 161.5MB in the beginning and 457.2MB in the end (delta: 295.7MB). Free memory was 123.6MB in the beginning and 257.9MB in the end (delta: -134.3MB). Peak memory consumption was 161.2MB. Max. memory is 16.1GB. * Witness Printer took 3.60ms. Allocated memory is still 457.2MB. Free memory is still 257.9MB. 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~pre3 could not be translated - 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: 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; [L722] 0 int b = 0; [L723] 0 _Bool main$tmp_guard0; [L724] 0 _Bool main$tmp_guard1; [L726] 0 int x = 0; [L728] 0 int y = 0; [L730] 0 int z = 0; [L731] 0 _Bool z$flush_delayed; [L732] 0 int z$mem_tmp; [L733] 0 _Bool z$r_buff0_thd0; [L734] 0 _Bool z$r_buff0_thd1; [L735] 0 _Bool z$r_buff0_thd2; [L736] 0 _Bool z$r_buff0_thd3; [L737] 0 _Bool z$r_buff0_thd4; [L738] 0 _Bool z$r_buff1_thd0; [L739] 0 _Bool z$r_buff1_thd1; [L740] 0 _Bool z$r_buff1_thd2; [L741] 0 _Bool z$r_buff1_thd3; [L742] 0 _Bool z$r_buff1_thd4; [L743] 0 _Bool z$read_delayed; [L744] 0 int *z$read_delayed_var; [L745] 0 int z$w_buff0; [L746] 0 _Bool z$w_buff0_used; [L747] 0 int z$w_buff1; [L748] 0 _Bool z$w_buff1_used; [L749] 0 _Bool weak$$choice0; [L750] 0 _Bool weak$$choice2; [L848] 0 pthread_t t1133; [L849] FCALL, FORK 0 pthread_create(&t1133, ((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}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1133={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L850] 0 pthread_t t1134; [L851] FCALL, FORK 0 pthread_create(&t1134, ((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}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1133={5:0}, t1134={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L852] 0 pthread_t t1135; [L853] FCALL, FORK 0 pthread_create(&t1135, ((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}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1133={5:0}, t1134={6:0}, t1135={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L854] 0 pthread_t t1136; [L855] FCALL, FORK 0 pthread_create(&t1136, ((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}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1133={5:0}, t1134={6:0}, t1135={7:0}, t1136={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L804] 4 z$w_buff1 = z$w_buff0 [L805] 4 z$w_buff0 = 2 [L806] 4 z$w_buff1_used = z$w_buff0_used [L807] 4 z$w_buff0_used = (_Bool)1 [L808] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L808] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L809] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L810] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L811] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L812] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L813] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L814] 4 z$r_buff0_thd4 = (_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}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L817] 4 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L820] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L823] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L754] 1 b = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L757] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L762] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L769] 2 x = 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L772] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L777] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L784] 3 y = 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L787] 3 z = 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=1] [L790] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L791] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L792] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L793] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L794] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=1] [L797] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=1] [L826] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L827] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L828] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L829] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L830] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __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}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L833] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __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}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L857] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1133={5:0}, t1134={6:0}, t1135={7:0}, t1136={3:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L859] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L859] RET 0 assume_abort_if_not(main$tmp_guard0) [L861] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L862] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L863] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L864] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L865] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1133={5:0}, t1134={6:0}, t1135={7:0}, t1136={3:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L868] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L869] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L870] 0 z$flush_delayed = weak$$choice2 [L871] 0 z$mem_tmp = z [L872] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L873] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L874] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L875] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L876] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L877] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L878] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L879] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L880] 0 z = z$flush_delayed ? z$mem_tmp : z [L881] 0 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1133={5:0}, t1134={6:0}, t1135={7:0}, t1136={3:0}, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L883] 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=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L17] 0 __assert_fail ("0", "mix043.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, 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: 846]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 853]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 849]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 855]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 851]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 101 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: 14.9s, OverallIterations: 19, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 9.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1109 SdHoareTripleChecker+Valid, 2.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 930 mSDsluCounter, 257 SdHoareTripleChecker+Invalid, 2.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 216 mSDsCounter, 61 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2470 IncrementalHoareTripleChecker+Invalid, 2531 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 61 mSolverCounterUnsat, 41 mSDtfsCounter, 2470 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 96 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=259occurred in iteration=14, InterpolantAutomatonStates: 86, 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.1s InterpolantComputationTime, 416 NumberOfCodeBlocks, 416 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 355 ConstructedInterpolants, 0 QuantifiedInterpolants, 2264 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 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 05:55:08,835 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0a5ee5-2912-4d0b-86d1-079a9fce3d5e/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-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0a5ee5-2912-4d0b-86d1-079a9fce3d5e/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0a5ee5-2912-4d0b-86d1-079a9fce3d5e/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_ce0a5ee5-2912-4d0b-86d1-079a9fce3d5e/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0a5ee5-2912-4d0b-86d1-079a9fce3d5e/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix043.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0a5ee5-2912-4d0b-86d1-079a9fce3d5e/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_ce0a5ee5-2912-4d0b-86d1-079a9fce3d5e/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 8b566ddb7b309d9ba7ea7e298fcc3be9218751e5387d333007519a12118bc5db --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 05:55:10,777 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 05:55:10,846 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0a5ee5-2912-4d0b-86d1-079a9fce3d5e/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-11-29 05:55:10,859 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 05:55:10,860 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 05:55:10,890 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 05:55:10,891 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 05:55:10,891 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 05:55:10,892 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 05:55:10,893 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 05:55:10,893 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 05:55:10,894 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 05:55:10,895 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 05:55:10,896 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 05:55:10,896 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 05:55:10,897 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 05:55:10,897 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 05:55:10,898 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 05:55:10,899 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 05:55:10,899 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 05:55:10,900 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-29 05:55:10,900 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-29 05:55:10,901 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-29 05:55:10,901 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 05:55:10,902 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 05:55:10,902 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-29 05:55:10,903 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-29 05:55:10,903 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 05:55:10,903 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 05:55:10,904 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 05:55:10,904 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 05:55:10,905 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 05:55:10,905 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 05:55:10,905 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 05:55:10,905 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 05:55:10,906 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 05:55:10,906 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 05:55:10,906 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-29 05:55:10,907 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-29 05:55:10,907 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 05:55:10,907 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 05:55:10,907 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 05:55:10,908 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 05:55:10,908 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-29 05:55:10,908 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_ce0a5ee5-2912-4d0b-86d1-079a9fce3d5e/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_ce0a5ee5-2912-4d0b-86d1-079a9fce3d5e/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 -> 8b566ddb7b309d9ba7ea7e298fcc3be9218751e5387d333007519a12118bc5db [2023-11-29 05:55:11,221 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 05:55:11,242 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 05:55:11,245 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 05:55:11,246 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 05:55:11,247 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 05:55:11,248 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0a5ee5-2912-4d0b-86d1-079a9fce3d5e/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/pthread-wmm/mix043.opt.i [2023-11-29 05:55:14,080 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 05:55:14,332 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 05:55:14,332 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0a5ee5-2912-4d0b-86d1-079a9fce3d5e/sv-benchmarks/c/pthread-wmm/mix043.opt.i [2023-11-29 05:55:14,351 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0a5ee5-2912-4d0b-86d1-079a9fce3d5e/bin/uautomizer-verify-BQ2R08f2Ya/data/7d44ff793/4144baeda33640498df5bc8cbc2aa9c7/FLAG375365545 [2023-11-29 05:55:14,368 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0a5ee5-2912-4d0b-86d1-079a9fce3d5e/bin/uautomizer-verify-BQ2R08f2Ya/data/7d44ff793/4144baeda33640498df5bc8cbc2aa9c7 [2023-11-29 05:55:14,370 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 05:55:14,372 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 05:55:14,373 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 05:55:14,374 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 05:55:14,379 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 05:55:14,380 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 05:55:14" (1/1) ... [2023-11-29 05:55:14,381 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37355cc5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:55:14, skipping insertion in model container [2023-11-29 05:55:14,381 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 05:55:14" (1/1) ... [2023-11-29 05:55:14,434 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 05:55:14,814 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 05:55:14,831 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 05:55:14,890 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 05:55:14,931 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 05:55:14,931 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 05:55:14,940 INFO L206 MainTranslator]: Completed translation [2023-11-29 05:55:14,940 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:55:14 WrapperNode [2023-11-29 05:55:14,940 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 05:55:14,942 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 05:55:14,942 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 05:55:14,942 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 05:55:14,950 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:55:14" (1/1) ... [2023-11-29 05:55:14,970 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:55:14" (1/1) ... [2023-11-29 05:55:14,998 INFO L138 Inliner]: procedures = 180, calls = 72, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 175 [2023-11-29 05:55:14,999 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 05:55:15,000 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 05:55:15,000 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 05:55:15,000 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 05:55:15,012 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:55:14" (1/1) ... [2023-11-29 05:55:15,012 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:55:14" (1/1) ... [2023-11-29 05:55:15,017 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:55:14" (1/1) ... [2023-11-29 05:55:15,036 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 05:55:15,036 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:55:14" (1/1) ... [2023-11-29 05:55:15,037 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:55:14" (1/1) ... [2023-11-29 05:55:15,048 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:55:14" (1/1) ... [2023-11-29 05:55:15,050 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:55:14" (1/1) ... [2023-11-29 05:55:15,054 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:55:14" (1/1) ... [2023-11-29 05:55:15,056 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:55:14" (1/1) ... [2023-11-29 05:55:15,061 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 05:55:15,062 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 05:55:15,062 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 05:55:15,062 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 05:55:15,063 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:55:14" (1/1) ... [2023-11-29 05:55:15,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 05:55:15,082 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0a5ee5-2912-4d0b-86d1-079a9fce3d5e/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:55:15,094 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0a5ee5-2912-4d0b-86d1-079a9fce3d5e/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 05:55:15,102 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0a5ee5-2912-4d0b-86d1-079a9fce3d5e/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 05:55:15,134 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-29 05:55:15,134 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 05:55:15,134 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 05:55:15,135 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 05:55:15,135 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-11-29 05:55:15,135 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-11-29 05:55:15,135 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2023-11-29 05:55:15,135 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2023-11-29 05:55:15,135 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2023-11-29 05:55:15,136 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-29 05:55:15,136 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-11-29 05:55:15,136 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-11-29 05:55:15,136 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2023-11-29 05:55:15,137 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2023-11-29 05:55:15,137 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-29 05:55:15,137 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-29 05:55:15,137 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-29 05:55:15,138 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-29 05:55:15,138 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-29 05:55:15,138 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-29 05:55:15,138 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-11-29 05:55:15,138 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-11-29 05:55:15,139 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-29 05:55:15,139 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 05:55:15,139 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 05:55:15,141 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 05:55:15,316 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 05:55:15,319 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 05:55:15,716 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 05:55:15,927 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 05:55:15,927 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-29 05:55:15,927 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 05:55:15 BoogieIcfgContainer [2023-11-29 05:55:15,928 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 05:55:15,941 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 05:55:15,942 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 05:55:15,945 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 05:55:15,945 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 05:55:14" (1/3) ... [2023-11-29 05:55:15,946 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cf4efab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 05:55:15, skipping insertion in model container [2023-11-29 05:55:15,946 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:55:14" (2/3) ... [2023-11-29 05:55:15,947 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cf4efab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 05:55:15, skipping insertion in model container [2023-11-29 05:55:15,947 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 05:55:15" (3/3) ... [2023-11-29 05:55:15,948 INFO L112 eAbstractionObserver]: Analyzing ICFG mix043.opt.i [2023-11-29 05:55:15,977 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 05:55:15,977 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2023-11-29 05:55:15,977 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-29 05:55:16,076 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-29 05:55:16,113 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 78 places, 67 transitions, 150 flow [2023-11-29 05:55:16,148 INFO L124 PetriNetUnfolderBase]: 2/63 cut-off events. [2023-11-29 05:55:16,148 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 05:55:16,152 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76 conditions, 63 events. 2/63 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 133 event pairs, 0 based on Foata normal form. 0/50 useless extension candidates. Maximal degree in co-relation 64. Up to 2 conditions per place. [2023-11-29 05:55:16,152 INFO L82 GeneralOperation]: Start removeDead. Operand has 78 places, 67 transitions, 150 flow [2023-11-29 05:55:16,156 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 74 places, 63 transitions, 138 flow [2023-11-29 05:55:16,167 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 05:55:16,174 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;@1b003b10, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 05:55:16,174 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-11-29 05:55:16,177 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-29 05:55:16,178 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-11-29 05:55:16,178 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 05:55:16,178 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:55:16,179 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-29 05:55:16,179 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 05:55:16,185 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:55:16,185 INFO L85 PathProgramCache]: Analyzing trace with hash 13763, now seen corresponding path program 1 times [2023-11-29 05:55:16,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:55:16,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [54258823] [2023-11-29 05:55:16,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:55:16,199 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 05:55:16,199 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0a5ee5-2912-4d0b-86d1-079a9fce3d5e/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:55:16,202 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0a5ee5-2912-4d0b-86d1-079a9fce3d5e/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 05:55:16,203 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0a5ee5-2912-4d0b-86d1-079a9fce3d5e/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 05:55:16,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:55:16,320 INFO L262 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 05:55:16,324 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:55:16,391 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 05:55:16,403 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 05:55:16,403 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:55:16,404 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:55:16,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [54258823] [2023-11-29 05:55:16,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [54258823] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:55:16,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:55:16,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 05:55:16,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34689963] [2023-11-29 05:55:16,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:55:16,417 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:55:16,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:55:16,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:55:16,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:55:16,489 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 67 [2023-11-29 05:55:16,492 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 63 transitions, 138 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 05:55:16,492 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:55:16,492 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 67 [2023-11-29 05:55:16,493 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:55:17,119 INFO L124 PetriNetUnfolderBase]: 1323/2347 cut-off events. [2023-11-29 05:55:17,120 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2023-11-29 05:55:17,129 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4292 conditions, 2347 events. 1323/2347 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 203. Compared 17871 event pairs, 1027 based on Foata normal form. 120/2266 useless extension candidates. Maximal degree in co-relation 4277. Up to 1485 conditions per place. [2023-11-29 05:55:17,150 INFO L140 encePairwiseOnDemand]: 62/67 looper letters, 31 selfloop transitions, 2 changer transitions 0/67 dead transitions. [2023-11-29 05:55:17,150 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 67 transitions, 212 flow [2023-11-29 05:55:17,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:55:17,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:55:17,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 150 transitions. [2023-11-29 05:55:17,164 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.746268656716418 [2023-11-29 05:55:17,164 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 150 transitions. [2023-11-29 05:55:17,165 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 150 transitions. [2023-11-29 05:55:17,166 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:55:17,168 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 150 transitions. [2023-11-29 05:55:17,171 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 50.0) internal successors, (150), 3 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 05:55:17,175 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 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 05:55:17,176 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 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 05:55:17,178 INFO L175 Difference]: Start difference. First operand has 74 places, 63 transitions, 138 flow. Second operand 3 states and 150 transitions. [2023-11-29 05:55:17,179 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 67 transitions, 212 flow [2023-11-29 05:55:17,183 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 67 transitions, 208 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-29 05:55:17,186 INFO L231 Difference]: Finished difference. Result has 70 places, 59 transitions, 130 flow [2023-11-29 05:55:17,188 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=130, PETRI_PLACES=70, PETRI_TRANSITIONS=59} [2023-11-29 05:55:17,192 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -4 predicate places. [2023-11-29 05:55:17,192 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 59 transitions, 130 flow [2023-11-29 05:55:17,193 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 05:55:17,193 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:55:17,193 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-29 05:55:17,197 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0a5ee5-2912-4d0b-86d1-079a9fce3d5e/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 05:55:17,394 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0a5ee5-2912-4d0b-86d1-079a9fce3d5e/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 05:55:17,394 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 05:55:17,395 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:55:17,395 INFO L85 PathProgramCache]: Analyzing trace with hash 13764, now seen corresponding path program 1 times [2023-11-29 05:55:17,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:55:17,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1719875465] [2023-11-29 05:55:17,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:55:17,396 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 05:55:17,396 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0a5ee5-2912-4d0b-86d1-079a9fce3d5e/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:55:17,397 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0a5ee5-2912-4d0b-86d1-079a9fce3d5e/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 05:55:17,398 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0a5ee5-2912-4d0b-86d1-079a9fce3d5e/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 05:55:17,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:55:17,479 INFO L262 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 05:55:17,481 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:55:17,491 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 05:55:17,503 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 05:55:17,504 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:55:17,504 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:55:17,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1719875465] [2023-11-29 05:55:17,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1719875465] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:55:17,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:55:17,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 05:55:17,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760886070] [2023-11-29 05:55:17,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:55:17,507 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:55:17,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:55:17,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:55:17,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:55:17,562 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 67 [2023-11-29 05:55:17,562 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 59 transitions, 130 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 05:55:17,562 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:55:17,563 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 67 [2023-11-29 05:55:17,563 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:55:18,069 INFO L124 PetriNetUnfolderBase]: 1323/2346 cut-off events. [2023-11-29 05:55:18,069 INFO L125 PetriNetUnfolderBase]: For 60/60 co-relation queries the response was YES. [2023-11-29 05:55:18,078 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4348 conditions, 2346 events. 1323/2346 cut-off events. For 60/60 co-relation queries the response was YES. Maximal size of possible extension queue 203. Compared 17821 event pairs, 1027 based on Foata normal form. 1/2146 useless extension candidates. Maximal degree in co-relation 4337. Up to 1484 conditions per place. [2023-11-29 05:55:18,101 INFO L140 encePairwiseOnDemand]: 64/67 looper letters, 30 selfloop transitions, 2 changer transitions 0/66 dead transitions. [2023-11-29 05:55:18,101 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 66 transitions, 208 flow [2023-11-29 05:55:18,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:55:18,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:55:18,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 150 transitions. [2023-11-29 05:55:18,104 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.746268656716418 [2023-11-29 05:55:18,104 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 150 transitions. [2023-11-29 05:55:18,104 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 150 transitions. [2023-11-29 05:55:18,105 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:55:18,105 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 150 transitions. [2023-11-29 05:55:18,106 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 50.0) internal successors, (150), 3 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 05:55:18,108 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 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 05:55:18,108 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 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 05:55:18,108 INFO L175 Difference]: Start difference. First operand has 70 places, 59 transitions, 130 flow. Second operand 3 states and 150 transitions. [2023-11-29 05:55:18,108 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 66 transitions, 208 flow [2023-11-29 05:55:18,112 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 66 transitions, 204 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 05:55:18,114 INFO L231 Difference]: Finished difference. Result has 69 places, 58 transitions, 128 flow [2023-11-29 05:55:18,115 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, 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 05:55:18,116 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -5 predicate places. [2023-11-29 05:55:18,116 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 58 transitions, 128 flow [2023-11-29 05:55:18,116 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 05:55:18,116 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:55:18,116 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-29 05:55:18,119 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0a5ee5-2912-4d0b-86d1-079a9fce3d5e/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 05:55:18,317 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0a5ee5-2912-4d0b-86d1-079a9fce3d5e/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 05:55:18,317 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 05:55:18,318 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:55:18,318 INFO L85 PathProgramCache]: Analyzing trace with hash 410442589, now seen corresponding path program 1 times [2023-11-29 05:55:18,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:55:18,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [411350803] [2023-11-29 05:55:18,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:55:18,319 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 05:55:18,319 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0a5ee5-2912-4d0b-86d1-079a9fce3d5e/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:55:18,320 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0a5ee5-2912-4d0b-86d1-079a9fce3d5e/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 05:55:18,321 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0a5ee5-2912-4d0b-86d1-079a9fce3d5e/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 05:55:18,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:55:18,437 INFO L262 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 05:55:18,439 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:55:18,445 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 05:55:18,452 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 05:55:18,452 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:55:18,452 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:55:18,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [411350803] [2023-11-29 05:55:18,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [411350803] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:55:18,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:55:18,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:55:18,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745309539] [2023-11-29 05:55:18,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:55:18,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:55:18,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:55:18,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:55:18,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:55:18,492 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 67 [2023-11-29 05:55:18,492 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 58 transitions, 128 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 05:55:18,492 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:55:18,493 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 67 [2023-11-29 05:55:18,493 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:55:18,917 INFO L124 PetriNetUnfolderBase]: 1324/2344 cut-off events. [2023-11-29 05:55:18,917 INFO L125 PetriNetUnfolderBase]: For 60/60 co-relation queries the response was YES. [2023-11-29 05:55:18,924 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4349 conditions, 2344 events. 1324/2344 cut-off events. For 60/60 co-relation queries the response was YES. Maximal size of possible extension queue 203. Compared 17786 event pairs, 1027 based on Foata normal form. 0/2147 useless extension candidates. Maximal degree in co-relation 4338. Up to 1484 conditions per place. [2023-11-29 05:55:18,942 INFO L140 encePairwiseOnDemand]: 64/67 looper letters, 31 selfloop transitions, 2 changer transitions 0/65 dead transitions. [2023-11-29 05:55:18,943 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 65 transitions, 208 flow [2023-11-29 05:55:18,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:55:18,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:55:18,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 148 transitions. [2023-11-29 05:55:18,945 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.736318407960199 [2023-11-29 05:55:18,945 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 148 transitions. [2023-11-29 05:55:18,945 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 148 transitions. [2023-11-29 05:55:18,946 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:55:18,946 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 148 transitions. [2023-11-29 05:55:18,947 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 05:55:18,948 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 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 05:55:18,948 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 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 05:55:18,949 INFO L175 Difference]: Start difference. First operand has 69 places, 58 transitions, 128 flow. Second operand 3 states and 148 transitions. [2023-11-29 05:55:18,949 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 65 transitions, 208 flow [2023-11-29 05:55:18,952 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 65 transitions, 204 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 05:55:18,954 INFO L231 Difference]: Finished difference. Result has 68 places, 57 transitions, 126 flow [2023-11-29 05:55:18,954 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, 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 05:55:18,955 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -6 predicate places. [2023-11-29 05:55:18,955 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 57 transitions, 126 flow [2023-11-29 05:55:18,955 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 05:55:18,955 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:55:18,956 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-29 05:55:18,958 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0a5ee5-2912-4d0b-86d1-079a9fce3d5e/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 05:55:19,156 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0a5ee5-2912-4d0b-86d1-079a9fce3d5e/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 05:55:19,156 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 05:55:19,157 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:55:19,157 INFO L85 PathProgramCache]: Analyzing trace with hash 410442590, now seen corresponding path program 1 times [2023-11-29 05:55:19,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:55:19,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [938695977] [2023-11-29 05:55:19,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:55:19,158 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 05:55:19,158 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0a5ee5-2912-4d0b-86d1-079a9fce3d5e/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:55:19,159 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0a5ee5-2912-4d0b-86d1-079a9fce3d5e/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 05:55:19,160 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0a5ee5-2912-4d0b-86d1-079a9fce3d5e/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 05:55:19,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:55:19,240 INFO L262 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 05:55:19,241 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:55:19,249 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 05:55:19,260 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 05:55:19,260 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:55:19,261 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:55:19,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [938695977] [2023-11-29 05:55:19,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [938695977] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:55:19,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:55:19,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:55:19,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129496135] [2023-11-29 05:55:19,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:55:19,262 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:55:19,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:55:19,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:55:19,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:55:19,316 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 67 [2023-11-29 05:55:19,316 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 57 transitions, 126 flow. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:55:19,316 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:55:19,316 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 67 [2023-11-29 05:55:19,316 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:55:19,764 INFO L124 PetriNetUnfolderBase]: 1323/2342 cut-off events. [2023-11-29 05:55:19,764 INFO L125 PetriNetUnfolderBase]: For 61/61 co-relation queries the response was YES. [2023-11-29 05:55:19,772 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4345 conditions, 2342 events. 1323/2342 cut-off events. For 61/61 co-relation queries the response was YES. Maximal size of possible extension queue 203. Compared 17701 event pairs, 860 based on Foata normal form. 2/2148 useless extension candidates. Maximal degree in co-relation 4335. Up to 1481 conditions per place. [2023-11-29 05:55:19,789 INFO L140 encePairwiseOnDemand]: 64/67 looper letters, 30 selfloop transitions, 2 changer transitions 0/64 dead transitions. [2023-11-29 05:55:19,789 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 64 transitions, 204 flow [2023-11-29 05:55:19,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:55:19,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:55:19,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 150 transitions. [2023-11-29 05:55:19,792 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.746268656716418 [2023-11-29 05:55:19,792 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 150 transitions. [2023-11-29 05:55:19,792 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 150 transitions. [2023-11-29 05:55:19,792 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:55:19,792 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 150 transitions. [2023-11-29 05:55:19,793 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 50.0) internal successors, (150), 3 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 05:55:19,794 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 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 05:55:19,795 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 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 05:55:19,795 INFO L175 Difference]: Start difference. First operand has 68 places, 57 transitions, 126 flow. Second operand 3 states and 150 transitions. [2023-11-29 05:55:19,795 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 64 transitions, 204 flow [2023-11-29 05:55:19,797 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 64 transitions, 200 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 05:55:19,798 INFO L231 Difference]: Finished difference. Result has 67 places, 56 transitions, 124 flow [2023-11-29 05:55:19,799 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, 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 05:55:19,800 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -7 predicate places. [2023-11-29 05:55:19,800 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 56 transitions, 124 flow [2023-11-29 05:55:19,800 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:55:19,800 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:55:19,800 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:55:19,803 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0a5ee5-2912-4d0b-86d1-079a9fce3d5e/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)] Ended with exit code 0 [2023-11-29 05:55:20,001 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0a5ee5-2912-4d0b-86d1-079a9fce3d5e/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 05:55:20,001 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 05:55:20,001 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:55:20,002 INFO L85 PathProgramCache]: Analyzing trace with hash -276297690, now seen corresponding path program 1 times [2023-11-29 05:55:20,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:55:20,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [548929646] [2023-11-29 05:55:20,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:55:20,002 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 05:55:20,002 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0a5ee5-2912-4d0b-86d1-079a9fce3d5e/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:55:20,003 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0a5ee5-2912-4d0b-86d1-079a9fce3d5e/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 05:55:20,004 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0a5ee5-2912-4d0b-86d1-079a9fce3d5e/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 05:55:20,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:55:20,089 INFO L262 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 05:55:20,091 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:55:20,101 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 05:55:20,108 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 05:55:20,108 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:55:20,108 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:55:20,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [548929646] [2023-11-29 05:55:20,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [548929646] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:55:20,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:55:20,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:55:20,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427688788] [2023-11-29 05:55:20,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:55:20,109 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:55:20,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:55:20,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:55:20,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:55:20,136 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 67 [2023-11-29 05:55:20,136 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 56 transitions, 124 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 05:55:20,136 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:55:20,136 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 67 [2023-11-29 05:55:20,136 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:55:20,534 INFO L124 PetriNetUnfolderBase]: 1327/2342 cut-off events. [2023-11-29 05:55:20,534 INFO L125 PetriNetUnfolderBase]: For 61/61 co-relation queries the response was YES. [2023-11-29 05:55:20,541 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4353 conditions, 2342 events. 1327/2342 cut-off events. For 61/61 co-relation queries the response was YES. Maximal size of possible extension queue 203. Compared 17581 event pairs, 699 based on Foata normal form. 0/2154 useless extension candidates. Maximal degree in co-relation 4343. Up to 1480 conditions per place. [2023-11-29 05:55:20,557 INFO L140 encePairwiseOnDemand]: 64/67 looper letters, 31 selfloop transitions, 2 changer transitions 0/63 dead transitions. [2023-11-29 05:55:20,557 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 63 transitions, 204 flow [2023-11-29 05:55:20,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:55:20,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:55:20,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 148 transitions. [2023-11-29 05:55:20,558 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.736318407960199 [2023-11-29 05:55:20,558 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 148 transitions. [2023-11-29 05:55:20,559 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 148 transitions. [2023-11-29 05:55:20,559 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:55:20,559 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 148 transitions. [2023-11-29 05:55:20,560 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 05:55:20,561 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 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 05:55:20,561 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 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 05:55:20,561 INFO L175 Difference]: Start difference. First operand has 67 places, 56 transitions, 124 flow. Second operand 3 states and 148 transitions. [2023-11-29 05:55:20,561 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 63 transitions, 204 flow [2023-11-29 05:55:20,564 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 63 transitions, 200 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 05:55:20,565 INFO L231 Difference]: Finished difference. Result has 66 places, 55 transitions, 122 flow [2023-11-29 05:55:20,566 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, 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 05:55:20,567 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -8 predicate places. [2023-11-29 05:55:20,567 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 55 transitions, 122 flow [2023-11-29 05:55:20,567 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 05:55:20,567 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:55:20,567 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:55:20,570 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0a5ee5-2912-4d0b-86d1-079a9fce3d5e/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 05:55:20,770 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0a5ee5-2912-4d0b-86d1-079a9fce3d5e/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 05:55:20,770 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 05:55:20,771 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:55:20,771 INFO L85 PathProgramCache]: Analyzing trace with hash -276297689, now seen corresponding path program 1 times [2023-11-29 05:55:20,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:55:20,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [392199100] [2023-11-29 05:55:20,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:55:20,772 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 05:55:20,772 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0a5ee5-2912-4d0b-86d1-079a9fce3d5e/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:55:20,773 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0a5ee5-2912-4d0b-86d1-079a9fce3d5e/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 05:55:20,774 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0a5ee5-2912-4d0b-86d1-079a9fce3d5e/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 05:55:20,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:55:20,856 INFO L262 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 05:55:20,858 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:55:20,867 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 05:55:20,875 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 05:55:20,875 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:55:20,876 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:55:20,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [392199100] [2023-11-29 05:55:20,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [392199100] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:55:20,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:55:20,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:55:20,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976215443] [2023-11-29 05:55:20,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:55:20,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:55:20,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:55:20,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:55:20,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:55:20,916 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 67 [2023-11-29 05:55:20,916 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 55 transitions, 122 flow. Second operand has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 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 05:55:20,916 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:55:20,917 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 67 [2023-11-29 05:55:20,917 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:55:21,255 INFO L124 PetriNetUnfolderBase]: 1323/2331 cut-off events. [2023-11-29 05:55:21,255 INFO L125 PetriNetUnfolderBase]: For 62/62 co-relation queries the response was YES. [2023-11-29 05:55:21,260 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4336 conditions, 2331 events. 1323/2331 cut-off events. For 62/62 co-relation queries the response was YES. Maximal size of possible extension queue 203. Compared 17982 event pairs, 1024 based on Foata normal form. 4/2151 useless extension candidates. Maximal degree in co-relation 4326. Up to 1472 conditions per place. [2023-11-29 05:55:21,270 INFO L140 encePairwiseOnDemand]: 64/67 looper letters, 30 selfloop transitions, 2 changer transitions 0/62 dead transitions. [2023-11-29 05:55:21,270 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 62 transitions, 200 flow [2023-11-29 05:55:21,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:55:21,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:55:21,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 150 transitions. [2023-11-29 05:55:21,272 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.746268656716418 [2023-11-29 05:55:21,272 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 150 transitions. [2023-11-29 05:55:21,272 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 150 transitions. [2023-11-29 05:55:21,272 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:55:21,272 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 150 transitions. [2023-11-29 05:55:21,273 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 50.0) internal successors, (150), 3 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 05:55:21,274 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 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 05:55:21,275 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 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 05:55:21,275 INFO L175 Difference]: Start difference. First operand has 66 places, 55 transitions, 122 flow. Second operand 3 states and 150 transitions. [2023-11-29 05:55:21,275 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 62 transitions, 200 flow [2023-11-29 05:55:21,278 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 62 transitions, 196 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 05:55:21,280 INFO L231 Difference]: Finished difference. Result has 65 places, 54 transitions, 120 flow [2023-11-29 05:55:21,280 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, 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 05:55:21,281 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -9 predicate places. [2023-11-29 05:55:21,281 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 54 transitions, 120 flow [2023-11-29 05:55:21,281 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 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 05:55:21,282 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:55:21,282 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:55:21,285 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0a5ee5-2912-4d0b-86d1-079a9fce3d5e/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 05:55:21,484 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0a5ee5-2912-4d0b-86d1-079a9fce3d5e/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 05:55:21,485 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 05:55:21,485 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:55:21,485 INFO L85 PathProgramCache]: Analyzing trace with hash -2026710919, now seen corresponding path program 1 times [2023-11-29 05:55:21,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:55:21,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1342237632] [2023-11-29 05:55:21,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:55:21,486 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 05:55:21,486 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0a5ee5-2912-4d0b-86d1-079a9fce3d5e/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:55:21,487 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0a5ee5-2912-4d0b-86d1-079a9fce3d5e/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 05:55:21,487 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0a5ee5-2912-4d0b-86d1-079a9fce3d5e/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 05:55:21,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:55:21,583 INFO L262 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 05:55:21,585 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:55:21,592 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 05:55:21,598 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 05:55:21,598 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:55:21,598 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:55:21,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1342237632] [2023-11-29 05:55:21,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1342237632] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:55:21,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:55:21,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:55:21,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72799474] [2023-11-29 05:55:21,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:55:21,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:55:21,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:55:21,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:55:21,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:55:21,631 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 67 [2023-11-29 05:55:21,631 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.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 05:55:21,631 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:55:21,631 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 67 [2023-11-29 05:55:21,632 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:55:21,936 INFO L124 PetriNetUnfolderBase]: 1343/2342 cut-off events. [2023-11-29 05:55:21,936 INFO L125 PetriNetUnfolderBase]: For 62/62 co-relation queries the response was YES. [2023-11-29 05:55:21,942 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4379 conditions, 2342 events. 1343/2342 cut-off events. For 62/62 co-relation queries the response was YES. Maximal size of possible extension queue 203. Compared 17680 event pairs, 507 based on Foata normal form. 0/2183 useless extension candidates. Maximal degree in co-relation 4369. Up to 1472 conditions per place. [2023-11-29 05:55:21,954 INFO L140 encePairwiseOnDemand]: 64/67 looper letters, 31 selfloop transitions, 2 changer transitions 0/61 dead transitions. [2023-11-29 05:55:21,955 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 61 transitions, 200 flow [2023-11-29 05:55:21,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:55:21,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:55:21,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 148 transitions. [2023-11-29 05:55:21,956 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.736318407960199 [2023-11-29 05:55:21,956 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 148 transitions. [2023-11-29 05:55:21,956 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 148 transitions. [2023-11-29 05:55:21,956 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:55:21,956 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 148 transitions. [2023-11-29 05:55:21,957 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 05:55:21,958 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 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 05:55:21,958 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 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 05:55:21,959 INFO L175 Difference]: Start difference. First operand has 65 places, 54 transitions, 120 flow. Second operand 3 states and 148 transitions. [2023-11-29 05:55:21,959 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 61 transitions, 200 flow [2023-11-29 05:55:21,961 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 61 transitions, 196 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 05:55:21,962 INFO L231 Difference]: Finished difference. Result has 64 places, 53 transitions, 118 flow [2023-11-29 05:55:21,963 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, 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 05:55:21,963 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -10 predicate places. [2023-11-29 05:55:21,964 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 53 transitions, 118 flow [2023-11-29 05:55:21,964 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 05:55:21,964 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:55:21,964 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:55:21,967 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0a5ee5-2912-4d0b-86d1-079a9fce3d5e/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)] Ended with exit code 0 [2023-11-29 05:55:22,164 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0a5ee5-2912-4d0b-86d1-079a9fce3d5e/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 05:55:22,165 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 05:55:22,165 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:55:22,165 INFO L85 PathProgramCache]: Analyzing trace with hash -2026710918, now seen corresponding path program 1 times [2023-11-29 05:55:22,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:55:22,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [582492244] [2023-11-29 05:55:22,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:55:22,166 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 05:55:22,166 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0a5ee5-2912-4d0b-86d1-079a9fce3d5e/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:55:22,167 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0a5ee5-2912-4d0b-86d1-079a9fce3d5e/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 05:55:22,168 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0a5ee5-2912-4d0b-86d1-079a9fce3d5e/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 05:55:22,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:55:22,267 INFO L262 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 05:55:22,268 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:55:22,276 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 05:55:22,288 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 05:55:22,288 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:55:22,288 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:55:22,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [582492244] [2023-11-29 05:55:22,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [582492244] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:55:22,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:55:22,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:55:22,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370655007] [2023-11-29 05:55:22,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:55:22,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:55:22,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:55:22,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:55:22,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:55:22,339 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 67 [2023-11-29 05:55:22,339 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.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:55:22,339 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:55:22,339 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 67 [2023-11-29 05:55:22,339 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:55:22,699 INFO L124 PetriNetUnfolderBase]: 1323/2310 cut-off events. [2023-11-29 05:55:22,699 INFO L125 PetriNetUnfolderBase]: For 68/68 co-relation queries the response was YES. [2023-11-29 05:55:22,707 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4323 conditions, 2310 events. 1323/2310 cut-off events. For 68/68 co-relation queries the response was YES. Maximal size of possible extension queue 201. Compared 17201 event pairs, 507 based on Foata normal form. 12/2171 useless extension candidates. Maximal degree in co-relation 4313. Up to 1440 conditions per place. [2023-11-29 05:55:22,717 INFO L140 encePairwiseOnDemand]: 64/67 looper letters, 30 selfloop transitions, 2 changer transitions 0/60 dead transitions. [2023-11-29 05:55:22,717 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 60 transitions, 196 flow [2023-11-29 05:55:22,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:55:22,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:55:22,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 150 transitions. [2023-11-29 05:55:22,719 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.746268656716418 [2023-11-29 05:55:22,719 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 150 transitions. [2023-11-29 05:55:22,719 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 150 transitions. [2023-11-29 05:55:22,719 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:55:22,719 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 150 transitions. [2023-11-29 05:55:22,720 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 50.0) internal successors, (150), 3 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 05:55:22,721 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 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 05:55:22,721 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 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 05:55:22,721 INFO L175 Difference]: Start difference. First operand has 64 places, 53 transitions, 118 flow. Second operand 3 states and 150 transitions. [2023-11-29 05:55:22,721 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 60 transitions, 196 flow [2023-11-29 05:55:22,722 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 60 transitions, 192 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 05:55:22,723 INFO L231 Difference]: Finished difference. Result has 63 places, 52 transitions, 116 flow [2023-11-29 05:55:22,723 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, 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=116, PETRI_PLACES=63, PETRI_TRANSITIONS=52} [2023-11-29 05:55:22,724 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -11 predicate places. [2023-11-29 05:55:22,724 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 52 transitions, 116 flow [2023-11-29 05:55:22,724 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:55:22,724 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:55:22,724 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:55:22,730 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0a5ee5-2912-4d0b-86d1-079a9fce3d5e/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)] Forceful destruction successful, exit code 0 [2023-11-29 05:55:22,930 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0a5ee5-2912-4d0b-86d1-079a9fce3d5e/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 05:55:22,930 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting P3Err0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 05:55:22,930 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:55:22,930 INFO L85 PathProgramCache]: Analyzing trace with hash 905688824, now seen corresponding path program 1 times [2023-11-29 05:55:22,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:55:22,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1037665203] [2023-11-29 05:55:22,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:55:22,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 05:55:22,931 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0a5ee5-2912-4d0b-86d1-079a9fce3d5e/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:55:22,932 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0a5ee5-2912-4d0b-86d1-079a9fce3d5e/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 05:55:22,934 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0a5ee5-2912-4d0b-86d1-079a9fce3d5e/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 05:55:23,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:55:23,040 INFO L262 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 05:55:23,042 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:55:23,066 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 05:55:23,066 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:55:23,066 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:55:23,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1037665203] [2023-11-29 05:55:23,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1037665203] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:55:23,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:55:23,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 05:55:23,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347409524] [2023-11-29 05:55:23,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:55:23,067 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:55:23,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:55:23,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:55:23,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:55:23,068 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 67 [2023-11-29 05:55:23,069 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 52 transitions, 116 flow. Second operand has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:55:23,069 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:55:23,069 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 67 [2023-11-29 05:55:23,069 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:55:23,314 INFO L124 PetriNetUnfolderBase]: 1047/2070 cut-off events. [2023-11-29 05:55:23,314 INFO L125 PetriNetUnfolderBase]: For 56/56 co-relation queries the response was YES. [2023-11-29 05:55:23,318 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3687 conditions, 2070 events. 1047/2070 cut-off events. For 56/56 co-relation queries the response was YES. Maximal size of possible extension queue 170. Compared 15843 event pairs, 219 based on Foata normal form. 0/2053 useless extension candidates. Maximal degree in co-relation 3677. Up to 1153 conditions per place. [2023-11-29 05:55:23,324 INFO L140 encePairwiseOnDemand]: 64/67 looper letters, 31 selfloop transitions, 2 changer transitions 2/63 dead transitions. [2023-11-29 05:55:23,324 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 63 transitions, 210 flow [2023-11-29 05:55:23,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:55:23,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:55:23,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 156 transitions. [2023-11-29 05:55:23,325 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7761194029850746 [2023-11-29 05:55:23,326 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 156 transitions. [2023-11-29 05:55:23,326 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 156 transitions. [2023-11-29 05:55:23,326 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:55:23,326 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 156 transitions. [2023-11-29 05:55:23,326 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 0 states have call successors, (0), 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 05:55:23,327 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 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 05:55:23,327 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 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 05:55:23,327 INFO L175 Difference]: Start difference. First operand has 63 places, 52 transitions, 116 flow. Second operand 3 states and 156 transitions. [2023-11-29 05:55:23,327 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 63 transitions, 210 flow [2023-11-29 05:55:23,328 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 63 transitions, 204 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 05:55:23,329 INFO L231 Difference]: Finished difference. Result has 62 places, 50 transitions, 112 flow [2023-11-29 05:55:23,329 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=112, PETRI_PLACES=62, PETRI_TRANSITIONS=50} [2023-11-29 05:55:23,330 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -12 predicate places. [2023-11-29 05:55:23,330 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 50 transitions, 112 flow [2023-11-29 05:55:23,331 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:55:23,331 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:55:23,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] [2023-11-29 05:55:23,334 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0a5ee5-2912-4d0b-86d1-079a9fce3d5e/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 05:55:23,534 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0a5ee5-2912-4d0b-86d1-079a9fce3d5e/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 05:55:23,534 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 05:55:23,534 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:55:23,534 INFO L85 PathProgramCache]: Analyzing trace with hash -943344485, now seen corresponding path program 1 times [2023-11-29 05:55:23,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:55:23,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [231351658] [2023-11-29 05:55:23,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:55:23,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 05:55:23,535 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0a5ee5-2912-4d0b-86d1-079a9fce3d5e/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:55:23,536 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0a5ee5-2912-4d0b-86d1-079a9fce3d5e/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 05:55:23,537 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0a5ee5-2912-4d0b-86d1-079a9fce3d5e/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 05:55:23,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:55:23,675 INFO L262 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 05:55:23,677 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:55:23,716 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 05:55:23,717 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:55:23,717 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:55:23,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [231351658] [2023-11-29 05:55:23,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [231351658] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:55:23,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:55:23,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 05:55:23,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040690859] [2023-11-29 05:55:23,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:55:23,718 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 05:55:23,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:55:23,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 05:55:23,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 05:55:23,734 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 67 [2023-11-29 05:55:23,734 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 50 transitions, 112 flow. Second operand has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 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 05:55:23,734 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:55:23,735 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 67 [2023-11-29 05:55:23,735 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:55:24,433 INFO L124 PetriNetUnfolderBase]: 4847/7422 cut-off events. [2023-11-29 05:55:24,433 INFO L125 PetriNetUnfolderBase]: For 346/346 co-relation queries the response was YES. [2023-11-29 05:55:24,444 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14572 conditions, 7422 events. 4847/7422 cut-off events. For 346/346 co-relation queries the response was YES. Maximal size of possible extension queue 488. Compared 51203 event pairs, 536 based on Foata normal form. 180/7588 useless extension candidates. Maximal degree in co-relation 14561. Up to 4684 conditions per place. [2023-11-29 05:55:24,465 INFO L140 encePairwiseOnDemand]: 60/67 looper letters, 46 selfloop transitions, 6 changer transitions 1/76 dead transitions. [2023-11-29 05:55:24,465 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 76 transitions, 280 flow [2023-11-29 05:55:24,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 05:55:24,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-29 05:55:24,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 195 transitions. [2023-11-29 05:55:24,467 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7276119402985075 [2023-11-29 05:55:24,467 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 195 transitions. [2023-11-29 05:55:24,467 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 195 transitions. [2023-11-29 05:55:24,468 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:55:24,468 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 195 transitions. [2023-11-29 05:55:24,469 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 48.75) internal successors, (195), 4 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:55:24,470 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 67.0) internal successors, (335), 5 states have internal predecessors, (335), 0 states have call successors, (0), 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 05:55:24,470 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 67.0) internal successors, (335), 5 states have internal predecessors, (335), 0 states have call successors, (0), 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 05:55:24,470 INFO L175 Difference]: Start difference. First operand has 62 places, 50 transitions, 112 flow. Second operand 4 states and 195 transitions. [2023-11-29 05:55:24,470 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 76 transitions, 280 flow [2023-11-29 05:55:24,472 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 76 transitions, 272 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 05:55:24,473 INFO L231 Difference]: Finished difference. Result has 64 places, 54 transitions, 150 flow [2023-11-29 05:55:24,473 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, 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=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=150, PETRI_PLACES=64, PETRI_TRANSITIONS=54} [2023-11-29 05:55:24,474 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -10 predicate places. [2023-11-29 05:55:24,474 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 54 transitions, 150 flow [2023-11-29 05:55:24,475 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 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 05:55:24,475 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:55:24,475 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 05:55:24,478 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0a5ee5-2912-4d0b-86d1-079a9fce3d5e/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 05:55:24,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0a5ee5-2912-4d0b-86d1-079a9fce3d5e/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 05:55:24,675 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 05:55:24,676 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:55:24,676 INFO L85 PathProgramCache]: Analyzing trace with hash 1823685188, now seen corresponding path program 1 times [2023-11-29 05:55:24,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:55:24,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2135045139] [2023-11-29 05:55:24,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:55:24,676 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 05:55:24,677 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0a5ee5-2912-4d0b-86d1-079a9fce3d5e/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:55:24,677 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0a5ee5-2912-4d0b-86d1-079a9fce3d5e/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 05:55:24,678 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0a5ee5-2912-4d0b-86d1-079a9fce3d5e/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 05:55:24,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:55:24,783 INFO L262 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 05:55:24,784 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:55:24,834 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 05:55:24,834 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:55:24,835 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:55:24,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2135045139] [2023-11-29 05:55:24,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2135045139] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:55:24,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:55:24,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 05:55:24,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093971734] [2023-11-29 05:55:24,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:55:24,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 05:55:24,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:55:24,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 05:55:24,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 05:55:24,851 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 67 [2023-11-29 05:55:24,852 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 54 transitions, 150 flow. Second operand has 5 states, 5 states have (on average 38.2) internal successors, (191), 5 states have internal predecessors, (191), 0 states have call successors, (0), 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 05:55:24,852 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:55:24,852 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 67 [2023-11-29 05:55:24,852 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:55:25,531 INFO L124 PetriNetUnfolderBase]: 4024/6219 cut-off events. [2023-11-29 05:55:25,531 INFO L125 PetriNetUnfolderBase]: For 1625/1625 co-relation queries the response was YES. [2023-11-29 05:55:25,543 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14114 conditions, 6219 events. 4024/6219 cut-off events. For 1625/1625 co-relation queries the response was YES. Maximal size of possible extension queue 436. Compared 41622 event pairs, 192 based on Foata normal form. 174/6381 useless extension candidates. Maximal degree in co-relation 14101. Up to 3613 conditions per place. [2023-11-29 05:55:25,567 INFO L140 encePairwiseOnDemand]: 60/67 looper letters, 58 selfloop transitions, 10 changer transitions 1/92 dead transitions. [2023-11-29 05:55:25,567 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 92 transitions, 393 flow [2023-11-29 05:55:25,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 05:55:25,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-29 05:55:25,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 246 transitions. [2023-11-29 05:55:25,569 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7343283582089553 [2023-11-29 05:55:25,569 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 246 transitions. [2023-11-29 05:55:25,570 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 246 transitions. [2023-11-29 05:55:25,570 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:55:25,570 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 246 transitions. [2023-11-29 05:55:25,571 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 49.2) internal successors, (246), 5 states have internal predecessors, (246), 0 states have call successors, (0), 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 05:55:25,572 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 67.0) internal successors, (402), 6 states have internal predecessors, (402), 0 states have call successors, (0), 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 05:55:25,572 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 67.0) internal successors, (402), 6 states have internal predecessors, (402), 0 states have call successors, (0), 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 05:55:25,573 INFO L175 Difference]: Start difference. First operand has 64 places, 54 transitions, 150 flow. Second operand 5 states and 246 transitions. [2023-11-29 05:55:25,573 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 92 transitions, 393 flow [2023-11-29 05:55:25,575 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 92 transitions, 382 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-11-29 05:55:25,577 INFO L231 Difference]: Finished difference. Result has 68 places, 58 transitions, 202 flow [2023-11-29 05:55:25,577 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=141, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=202, PETRI_PLACES=68, PETRI_TRANSITIONS=58} [2023-11-29 05:55:25,577 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -6 predicate places. [2023-11-29 05:55:25,578 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 58 transitions, 202 flow [2023-11-29 05:55:25,578 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 38.2) internal successors, (191), 5 states have internal predecessors, (191), 0 states have call successors, (0), 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 05:55:25,578 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:55:25,578 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 05:55:25,582 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0a5ee5-2912-4d0b-86d1-079a9fce3d5e/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 05:55:25,778 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0a5ee5-2912-4d0b-86d1-079a9fce3d5e/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 05:55:25,779 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 05:55:25,779 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:55:25,779 INFO L85 PathProgramCache]: Analyzing trace with hash 1045449477, now seen corresponding path program 1 times [2023-11-29 05:55:25,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:55:25,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [661703936] [2023-11-29 05:55:25,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:55:25,780 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 05:55:25,780 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0a5ee5-2912-4d0b-86d1-079a9fce3d5e/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:55:25,781 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0a5ee5-2912-4d0b-86d1-079a9fce3d5e/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 05:55:25,782 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0a5ee5-2912-4d0b-86d1-079a9fce3d5e/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 05:55:25,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:55:25,897 INFO L262 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 05:55:25,899 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:55:25,959 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 05:55:25,959 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:55:25,959 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:55:25,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [661703936] [2023-11-29 05:55:25,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [661703936] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:55:25,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:55:25,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 05:55:25,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936075875] [2023-11-29 05:55:25,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:55:25,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 05:55:25,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:55:25,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 05:55:25,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 05:55:25,971 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 67 [2023-11-29 05:55:25,972 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 58 transitions, 202 flow. Second operand has 6 states, 6 states have (on average 37.833333333333336) internal successors, (227), 6 states have internal predecessors, (227), 0 states have call successors, (0), 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 05:55:25,972 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:55:25,972 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 67 [2023-11-29 05:55:25,972 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:55:26,545 INFO L124 PetriNetUnfolderBase]: 2545/3958 cut-off events. [2023-11-29 05:55:26,545 INFO L125 PetriNetUnfolderBase]: For 2961/2961 co-relation queries the response was YES. [2023-11-29 05:55:26,553 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10076 conditions, 3958 events. 2545/3958 cut-off events. For 2961/2961 co-relation queries the response was YES. Maximal size of possible extension queue 215. Compared 23396 event pairs, 69 based on Foata normal form. 140/4087 useless extension candidates. Maximal degree in co-relation 10061. Up to 1709 conditions per place. [2023-11-29 05:55:26,569 INFO L140 encePairwiseOnDemand]: 60/67 looper letters, 68 selfloop transitions, 14 changer transitions 1/106 dead transitions. [2023-11-29 05:55:26,569 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 106 transitions, 512 flow [2023-11-29 05:55:26,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 05:55:26,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 05:55:26,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 295 transitions. [2023-11-29 05:55:26,571 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7338308457711443 [2023-11-29 05:55:26,571 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 295 transitions. [2023-11-29 05:55:26,571 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 295 transitions. [2023-11-29 05:55:26,572 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:55:26,572 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 295 transitions. [2023-11-29 05:55:26,572 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 49.166666666666664) internal successors, (295), 6 states have internal predecessors, (295), 0 states have call successors, (0), 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 05:55:26,573 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 67.0) internal successors, (469), 7 states have internal predecessors, (469), 0 states have call successors, (0), 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 05:55:26,574 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 67.0) internal successors, (469), 7 states have internal predecessors, (469), 0 states have call successors, (0), 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 05:55:26,574 INFO L175 Difference]: Start difference. First operand has 68 places, 58 transitions, 202 flow. Second operand 6 states and 295 transitions. [2023-11-29 05:55:26,574 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 106 transitions, 512 flow [2023-11-29 05:55:26,579 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 106 transitions, 482 flow, removed 5 selfloop flow, removed 4 redundant places. [2023-11-29 05:55:26,581 INFO L231 Difference]: Finished difference. Result has 71 places, 62 transitions, 252 flow [2023-11-29 05:55:26,582 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=175, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=252, PETRI_PLACES=71, PETRI_TRANSITIONS=62} [2023-11-29 05:55:26,582 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -3 predicate places. [2023-11-29 05:55:26,583 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 62 transitions, 252 flow [2023-11-29 05:55:26,583 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 37.833333333333336) internal successors, (227), 6 states have internal predecessors, (227), 0 states have call successors, (0), 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 05:55:26,583 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:55:26,583 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 05:55:26,586 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0a5ee5-2912-4d0b-86d1-079a9fce3d5e/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 05:55:26,786 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0a5ee5-2912-4d0b-86d1-079a9fce3d5e/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 05:55:26,787 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 05:55:26,787 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:55:26,787 INFO L85 PathProgramCache]: Analyzing trace with hash -1466747414, now seen corresponding path program 1 times [2023-11-29 05:55:26,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:55:26,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [257430233] [2023-11-29 05:55:26,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:55:26,788 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 05:55:26,788 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0a5ee5-2912-4d0b-86d1-079a9fce3d5e/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:55:26,789 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0a5ee5-2912-4d0b-86d1-079a9fce3d5e/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 05:55:26,790 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0a5ee5-2912-4d0b-86d1-079a9fce3d5e/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 05:55:26,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:55:26,950 INFO L262 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 05:55:26,952 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:55:27,027 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 05:55:27,027 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:55:27,027 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:55:27,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [257430233] [2023-11-29 05:55:27,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [257430233] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:55:27,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:55:27,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 05:55:27,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108261395] [2023-11-29 05:55:27,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:55:27,028 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 05:55:27,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:55:27,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 05:55:27,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 05:55:27,037 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 67 [2023-11-29 05:55:27,038 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 62 transitions, 252 flow. Second operand has 7 states, 7 states have (on average 37.714285714285715) internal successors, (264), 7 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 05:55:27,038 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:55:27,038 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 67 [2023-11-29 05:55:27,038 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:55:27,527 INFO L124 PetriNetUnfolderBase]: 1417/2146 cut-off events. [2023-11-29 05:55:27,527 INFO L125 PetriNetUnfolderBase]: For 3115/3115 co-relation queries the response was YES. [2023-11-29 05:55:27,531 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6253 conditions, 2146 events. 1417/2146 cut-off events. For 3115/3115 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 10498 event pairs, 39 based on Foata normal form. 72/2207 useless extension candidates. Maximal degree in co-relation 6237. Up to 668 conditions per place. [2023-11-29 05:55:27,539 INFO L140 encePairwiseOnDemand]: 60/67 looper letters, 62 selfloop transitions, 18 changer transitions 1/104 dead transitions. [2023-11-29 05:55:27,539 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 104 transitions, 514 flow [2023-11-29 05:55:27,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 05:55:27,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-29 05:55:27,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 328 transitions. [2023-11-29 05:55:27,541 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6993603411513859 [2023-11-29 05:55:27,541 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 328 transitions. [2023-11-29 05:55:27,541 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 328 transitions. [2023-11-29 05:55:27,542 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:55:27,542 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 328 transitions. [2023-11-29 05:55:27,543 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 46.857142857142854) internal successors, (328), 7 states have internal predecessors, (328), 0 states have call successors, (0), 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 05:55:27,544 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 67.0) internal successors, (536), 8 states have internal predecessors, (536), 0 states have call successors, (0), 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 05:55:27,544 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 67.0) internal successors, (536), 8 states have internal predecessors, (536), 0 states have call successors, (0), 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 05:55:27,545 INFO L175 Difference]: Start difference. First operand has 71 places, 62 transitions, 252 flow. Second operand 7 states and 328 transitions. [2023-11-29 05:55:27,545 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 104 transitions, 514 flow [2023-11-29 05:55:27,556 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 104 transitions, 468 flow, removed 9 selfloop flow, removed 5 redundant places. [2023-11-29 05:55:27,557 INFO L231 Difference]: Finished difference. Result has 74 places, 62 transitions, 262 flow [2023-11-29 05:55:27,557 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=209, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=262, PETRI_PLACES=74, PETRI_TRANSITIONS=62} [2023-11-29 05:55:27,558 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 0 predicate places. [2023-11-29 05:55:27,558 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 62 transitions, 262 flow [2023-11-29 05:55:27,558 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 37.714285714285715) internal successors, (264), 7 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 05:55:27,558 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:55:27,558 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, 1] [2023-11-29 05:55:27,561 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0a5ee5-2912-4d0b-86d1-079a9fce3d5e/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 05:55:27,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0a5ee5-2912-4d0b-86d1-079a9fce3d5e/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 05:55:27,759 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 05:55:27,759 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:55:27,759 INFO L85 PathProgramCache]: Analyzing trace with hash 1624175748, now seen corresponding path program 1 times [2023-11-29 05:55:27,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:55:27,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [51693437] [2023-11-29 05:55:27,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:55:27,760 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 05:55:27,760 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0a5ee5-2912-4d0b-86d1-079a9fce3d5e/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:55:27,761 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0a5ee5-2912-4d0b-86d1-079a9fce3d5e/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 05:55:27,762 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0a5ee5-2912-4d0b-86d1-079a9fce3d5e/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 05:55:27,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:55:27,952 INFO L262 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 18 conjunts are in the unsatisfiable core [2023-11-29 05:55:27,956 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:55:29,014 WARN L876 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~#t1134~0#1.base_49| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#t1136~0#1.base_41| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#t1133~0#1.base_53| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#t1135~0#1.base_39| (_ BitVec 32))) (let ((.cse1 (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t1133~0#1.base_53| (_ bv1 1)))) (let ((.cse0 (store .cse1 |v_ULTIMATE.start_main_~#t1134~0#1.base_49| (_ bv1 1)))) (and (= (select (store .cse0 |v_ULTIMATE.start_main_~#t1135~0#1.base_39| (_ bv1 1)) |v_ULTIMATE.start_main_~#t1136~0#1.base_41|) (_ bv0 1)) (= |c_#valid| (store (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t1133~0#1.base_53| (_ bv0 1)) |v_ULTIMATE.start_main_~#t1134~0#1.base_49| (_ bv0 1)) |v_ULTIMATE.start_main_~#t1135~0#1.base_39| (_ bv0 1)) |v_ULTIMATE.start_main_~#t1136~0#1.base_41| (_ bv0 1))) (= (_ bv0 1) (select .cse0 |v_ULTIMATE.start_main_~#t1135~0#1.base_39|)) (= (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t1133~0#1.base_53|) (_ bv0 1)) (= (_ bv0 1) (select .cse1 |v_ULTIMATE.start_main_~#t1134~0#1.base_49|)))))) is different from true [2023-11-29 05:55:29,015 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 05:55:29,015 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:55:29,016 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:55:29,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [51693437] [2023-11-29 05:55:29,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [51693437] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:55:29,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:55:29,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 05:55:29,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57604230] [2023-11-29 05:55:29,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:55:29,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 05:55:29,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:55:29,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 05:55:29,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=22, Unknown=1, NotChecked=8, Total=42 [2023-11-29 05:55:29,153 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 67 [2023-11-29 05:55:29,153 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 62 transitions, 262 flow. Second operand has 7 states, 7 states have (on average 30.142857142857142) internal successors, (211), 7 states have internal predecessors, (211), 0 states have call successors, (0), 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 05:55:29,153 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:55:29,153 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 67 [2023-11-29 05:55:29,154 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:55:29,591 INFO L124 PetriNetUnfolderBase]: 699/1279 cut-off events. [2023-11-29 05:55:29,591 INFO L125 PetriNetUnfolderBase]: For 422/449 co-relation queries the response was YES. [2023-11-29 05:55:29,597 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2781 conditions, 1279 events. 699/1279 cut-off events. For 422/449 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 6924 event pairs, 421 based on Foata normal form. 16/1163 useless extension candidates. Maximal degree in co-relation 2763. Up to 862 conditions per place. [2023-11-29 05:55:29,602 INFO L140 encePairwiseOnDemand]: 57/67 looper letters, 33 selfloop transitions, 9 changer transitions 0/77 dead transitions. [2023-11-29 05:55:29,602 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 77 transitions, 376 flow [2023-11-29 05:55:29,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 05:55:29,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-29 05:55:29,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 232 transitions. [2023-11-29 05:55:29,604 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4946695095948827 [2023-11-29 05:55:29,604 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 232 transitions. [2023-11-29 05:55:29,604 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 232 transitions. [2023-11-29 05:55:29,605 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:55:29,605 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 232 transitions. [2023-11-29 05:55:29,606 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 33.142857142857146) internal successors, (232), 7 states have internal predecessors, (232), 0 states have call successors, (0), 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 05:55:29,607 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 67.0) internal successors, (536), 8 states have internal predecessors, (536), 0 states have call successors, (0), 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 05:55:29,607 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 67.0) internal successors, (536), 8 states have internal predecessors, (536), 0 states have call successors, (0), 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 05:55:29,607 INFO L175 Difference]: Start difference. First operand has 74 places, 62 transitions, 262 flow. Second operand 7 states and 232 transitions. [2023-11-29 05:55:29,607 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 77 transitions, 376 flow [2023-11-29 05:55:29,609 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 77 transitions, 280 flow, removed 17 selfloop flow, removed 10 redundant places. [2023-11-29 05:55:29,610 INFO L231 Difference]: Finished difference. Result has 71 places, 66 transitions, 207 flow [2023-11-29 05:55:29,610 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=207, PETRI_PLACES=71, PETRI_TRANSITIONS=66} [2023-11-29 05:55:29,611 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -3 predicate places. [2023-11-29 05:55:29,611 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 66 transitions, 207 flow [2023-11-29 05:55:29,611 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 30.142857142857142) internal successors, (211), 7 states have internal predecessors, (211), 0 states have call successors, (0), 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 05:55:29,611 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:55:29,611 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, 1] [2023-11-29 05:55:29,614 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0a5ee5-2912-4d0b-86d1-079a9fce3d5e/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 05:55:29,812 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0a5ee5-2912-4d0b-86d1-079a9fce3d5e/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 05:55:29,812 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 05:55:29,812 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:55:29,812 INFO L85 PathProgramCache]: Analyzing trace with hash 1466051971, now seen corresponding path program 1 times [2023-11-29 05:55:29,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:55:29,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [445756768] [2023-11-29 05:55:29,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:55:29,813 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 05:55:29,813 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0a5ee5-2912-4d0b-86d1-079a9fce3d5e/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:55:29,814 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0a5ee5-2912-4d0b-86d1-079a9fce3d5e/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 05:55:29,814 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0a5ee5-2912-4d0b-86d1-079a9fce3d5e/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 05:55:29,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:55:29,944 INFO L262 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 05:55:29,946 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:55:30,045 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 05:55:30,045 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:55:30,046 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:55:30,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [445756768] [2023-11-29 05:55:30,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [445756768] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:55:30,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:55:30,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 05:55:30,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648456930] [2023-11-29 05:55:30,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:55:30,047 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 05:55:30,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:55:30,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 05:55:30,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 05:55:30,058 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 67 [2023-11-29 05:55:30,059 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 66 transitions, 207 flow. Second operand has 6 states, 6 states have (on average 41.166666666666664) internal successors, (247), 6 states have internal predecessors, (247), 0 states have call successors, (0), 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 05:55:30,059 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:55:30,059 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 67 [2023-11-29 05:55:30,059 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:55:30,548 INFO L124 PetriNetUnfolderBase]: 1846/3241 cut-off events. [2023-11-29 05:55:30,548 INFO L125 PetriNetUnfolderBase]: For 1060/1170 co-relation queries the response was YES. [2023-11-29 05:55:30,555 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7815 conditions, 3241 events. 1846/3241 cut-off events. For 1060/1170 co-relation queries the response was YES. Maximal size of possible extension queue 179. Compared 20389 event pairs, 342 based on Foata normal form. 16/3076 useless extension candidates. Maximal degree in co-relation 7802. Up to 1371 conditions per place. [2023-11-29 05:55:30,563 INFO L140 encePairwiseOnDemand]: 61/67 looper letters, 59 selfloop transitions, 5 changer transitions 0/102 dead transitions. [2023-11-29 05:55:30,563 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 102 transitions, 460 flow [2023-11-29 05:55:30,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 05:55:30,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 05:55:30,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 285 transitions. [2023-11-29 05:55:30,565 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7089552238805971 [2023-11-29 05:55:30,565 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 285 transitions. [2023-11-29 05:55:30,565 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 285 transitions. [2023-11-29 05:55:30,566 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:55:30,566 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 285 transitions. [2023-11-29 05:55:30,567 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 47.5) internal successors, (285), 6 states have internal predecessors, (285), 0 states have call successors, (0), 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 05:55:30,568 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 67.0) internal successors, (469), 7 states have internal predecessors, (469), 0 states have call successors, (0), 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 05:55:30,568 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 67.0) internal successors, (469), 7 states have internal predecessors, (469), 0 states have call successors, (0), 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 05:55:30,568 INFO L175 Difference]: Start difference. First operand has 71 places, 66 transitions, 207 flow. Second operand 6 states and 285 transitions. [2023-11-29 05:55:30,568 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 102 transitions, 460 flow [2023-11-29 05:55:30,570 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 102 transitions, 438 flow, removed 0 selfloop flow, removed 5 redundant places. [2023-11-29 05:55:30,572 INFO L231 Difference]: Finished difference. Result has 75 places, 70 transitions, 233 flow [2023-11-29 05:55:30,572 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=194, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=233, PETRI_PLACES=75, PETRI_TRANSITIONS=70} [2023-11-29 05:55:30,573 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 1 predicate places. [2023-11-29 05:55:30,573 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 70 transitions, 233 flow [2023-11-29 05:55:30,573 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 41.166666666666664) internal successors, (247), 6 states have internal predecessors, (247), 0 states have call successors, (0), 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 05:55:30,573 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:55:30,574 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, 1] [2023-11-29 05:55:30,577 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0a5ee5-2912-4d0b-86d1-079a9fce3d5e/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 05:55:30,775 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0a5ee5-2912-4d0b-86d1-079a9fce3d5e/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 05:55:30,775 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 05:55:30,776 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:55:30,776 INFO L85 PathProgramCache]: Analyzing trace with hash -485586703, now seen corresponding path program 2 times [2023-11-29 05:55:30,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:55:30,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1380980303] [2023-11-29 05:55:30,776 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 05:55:30,776 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 05:55:30,776 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0a5ee5-2912-4d0b-86d1-079a9fce3d5e/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:55:30,777 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0a5ee5-2912-4d0b-86d1-079a9fce3d5e/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 05:55:30,778 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0a5ee5-2912-4d0b-86d1-079a9fce3d5e/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 05:55:30,893 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-29 05:55:30,893 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 05:55:30,898 INFO L262 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 05:55:30,900 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:55:31,135 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 05:55:31,135 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:55:31,135 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:55:31,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1380980303] [2023-11-29 05:55:31,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1380980303] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:55:31,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:55:31,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 05:55:31,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488636546] [2023-11-29 05:55:31,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:55:31,137 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 05:55:31,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:55:31,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 05:55:31,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 05:55:31,148 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 67 [2023-11-29 05:55:31,148 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 70 transitions, 233 flow. Second operand has 6 states, 6 states have (on average 41.166666666666664) internal successors, (247), 6 states have internal predecessors, (247), 0 states have call successors, (0), 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 05:55:31,148 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:55:31,148 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 67 [2023-11-29 05:55:31,149 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:55:31,846 INFO L124 PetriNetUnfolderBase]: 3551/6251 cut-off events. [2023-11-29 05:55:31,846 INFO L125 PetriNetUnfolderBase]: For 2097/2695 co-relation queries the response was YES. [2023-11-29 05:55:31,865 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15338 conditions, 6251 events. 3551/6251 cut-off events. For 2097/2695 co-relation queries the response was YES. Maximal size of possible extension queue 313. Compared 44175 event pairs, 991 based on Foata normal form. 16/5816 useless extension candidates. Maximal degree in co-relation 15322. Up to 2627 conditions per place. [2023-11-29 05:55:31,884 INFO L140 encePairwiseOnDemand]: 61/67 looper letters, 67 selfloop transitions, 8 changer transitions 0/114 dead transitions. [2023-11-29 05:55:31,884 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 114 transitions, 539 flow [2023-11-29 05:55:31,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 05:55:31,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 05:55:31,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 290 transitions. [2023-11-29 05:55:31,886 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7213930348258707 [2023-11-29 05:55:31,886 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 290 transitions. [2023-11-29 05:55:31,886 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 290 transitions. [2023-11-29 05:55:31,886 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:55:31,886 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 290 transitions. [2023-11-29 05:55:31,887 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 48.333333333333336) internal successors, (290), 6 states have internal predecessors, (290), 0 states have call successors, (0), 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 05:55:31,888 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 67.0) internal successors, (469), 7 states have internal predecessors, (469), 0 states have call successors, (0), 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 05:55:31,888 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 67.0) internal successors, (469), 7 states have internal predecessors, (469), 0 states have call successors, (0), 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 05:55:31,888 INFO L175 Difference]: Start difference. First operand has 75 places, 70 transitions, 233 flow. Second operand 6 states and 290 transitions. [2023-11-29 05:55:31,888 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 114 transitions, 539 flow [2023-11-29 05:55:31,899 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 114 transitions, 538 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-29 05:55:31,900 INFO L231 Difference]: Finished difference. Result has 83 places, 77 transitions, 315 flow [2023-11-29 05:55:31,900 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=232, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=315, PETRI_PLACES=83, PETRI_TRANSITIONS=77} [2023-11-29 05:55:31,901 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 9 predicate places. [2023-11-29 05:55:31,901 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 77 transitions, 315 flow [2023-11-29 05:55:31,901 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 41.166666666666664) internal successors, (247), 6 states have internal predecessors, (247), 0 states have call successors, (0), 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 05:55:31,901 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:55:31,902 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, 1] [2023-11-29 05:55:31,905 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0a5ee5-2912-4d0b-86d1-079a9fce3d5e/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 05:55:32,102 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0a5ee5-2912-4d0b-86d1-079a9fce3d5e/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 05:55:32,102 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 05:55:32,102 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:55:32,103 INFO L85 PathProgramCache]: Analyzing trace with hash -211625279, now seen corresponding path program 3 times [2023-11-29 05:55:32,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:55:32,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1083836845] [2023-11-29 05:55:32,103 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-29 05:55:32,103 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 05:55:32,103 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0a5ee5-2912-4d0b-86d1-079a9fce3d5e/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:55:32,104 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0a5ee5-2912-4d0b-86d1-079a9fce3d5e/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 05:55:32,105 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0a5ee5-2912-4d0b-86d1-079a9fce3d5e/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 05:55:32,217 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-11-29 05:55:32,217 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 05:55:32,222 INFO L262 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 05:55:32,223 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:55:32,378 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 05:55:32,379 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:55:32,379 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:55:32,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1083836845] [2023-11-29 05:55:32,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1083836845] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:55:32,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:55:32,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 05:55:32,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634421840] [2023-11-29 05:55:32,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:55:32,380 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 05:55:32,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:55:32,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 05:55:32,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 05:55:32,388 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 67 [2023-11-29 05:55:32,389 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 77 transitions, 315 flow. Second operand has 6 states, 6 states have (on average 41.166666666666664) internal successors, (247), 6 states have internal predecessors, (247), 0 states have call successors, (0), 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 05:55:32,389 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:55:32,389 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 67 [2023-11-29 05:55:32,389 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:55:33,408 INFO L124 PetriNetUnfolderBase]: 5556/9415 cut-off events. [2023-11-29 05:55:33,408 INFO L125 PetriNetUnfolderBase]: For 4901/5361 co-relation queries the response was YES. [2023-11-29 05:55:33,439 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24432 conditions, 9415 events. 5556/9415 cut-off events. For 4901/5361 co-relation queries the response was YES. Maximal size of possible extension queue 553. Compared 67420 event pairs, 1790 based on Foata normal form. 16/8659 useless extension candidates. Maximal degree in co-relation 24412. Up to 4509 conditions per place. [2023-11-29 05:55:33,468 INFO L140 encePairwiseOnDemand]: 61/67 looper letters, 70 selfloop transitions, 14 changer transitions 0/124 dead transitions. [2023-11-29 05:55:33,469 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 124 transitions, 701 flow [2023-11-29 05:55:33,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 05:55:33,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 05:55:33,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 287 transitions. [2023-11-29 05:55:33,470 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7139303482587065 [2023-11-29 05:55:33,470 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 287 transitions. [2023-11-29 05:55:33,471 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 287 transitions. [2023-11-29 05:55:33,471 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:55:33,471 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 287 transitions. [2023-11-29 05:55:33,472 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 05:55:33,473 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 67.0) internal successors, (469), 7 states have internal predecessors, (469), 0 states have call successors, (0), 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 05:55:33,473 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 67.0) internal successors, (469), 7 states have internal predecessors, (469), 0 states have call successors, (0), 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 05:55:33,473 INFO L175 Difference]: Start difference. First operand has 83 places, 77 transitions, 315 flow. Second operand 6 states and 287 transitions. [2023-11-29 05:55:33,473 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 124 transitions, 701 flow [2023-11-29 05:55:33,492 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 124 transitions, 700 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-29 05:55:33,494 INFO L231 Difference]: Finished difference. Result has 91 places, 90 transitions, 503 flow [2023-11-29 05:55:33,494 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=314, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=503, PETRI_PLACES=91, PETRI_TRANSITIONS=90} [2023-11-29 05:55:33,494 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 17 predicate places. [2023-11-29 05:55:33,494 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 90 transitions, 503 flow [2023-11-29 05:55:33,495 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 41.166666666666664) internal successors, (247), 6 states have internal predecessors, (247), 0 states have call successors, (0), 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 05:55:33,495 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:55:33,495 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, 1] [2023-11-29 05:55:33,499 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0a5ee5-2912-4d0b-86d1-079a9fce3d5e/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 05:55:33,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0a5ee5-2912-4d0b-86d1-079a9fce3d5e/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 05:55:33,695 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 05:55:33,696 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:55:33,696 INFO L85 PathProgramCache]: Analyzing trace with hash 1137670695, now seen corresponding path program 4 times [2023-11-29 05:55:33,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:55:33,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1798528709] [2023-11-29 05:55:33,696 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-29 05:55:33,696 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 05:55:33,696 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0a5ee5-2912-4d0b-86d1-079a9fce3d5e/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:55:33,697 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0a5ee5-2912-4d0b-86d1-079a9fce3d5e/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 05:55:33,698 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0a5ee5-2912-4d0b-86d1-079a9fce3d5e/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 05:55:33,809 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-29 05:55:33,809 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 05:55:33,814 INFO L262 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 22 conjunts are in the unsatisfiable core [2023-11-29 05:55:33,817 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:55:34,486 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 05:55:34,486 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:55:34,486 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:55:34,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1798528709] [2023-11-29 05:55:34,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1798528709] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:55:34,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:55:34,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-29 05:55:34,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055924360] [2023-11-29 05:55:34,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:55:34,490 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 05:55:34,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:55:34,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 05:55:34,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2023-11-29 05:55:34,510 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 67 [2023-11-29 05:55:34,511 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 90 transitions, 503 flow. Second operand has 10 states, 10 states have (on average 40.8) internal successors, (408), 10 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 05:55:34,511 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:55:34,511 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 67 [2023-11-29 05:55:34,511 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:55:36,283 INFO L124 PetriNetUnfolderBase]: 8980/15706 cut-off events. [2023-11-29 05:55:36,283 INFO L125 PetriNetUnfolderBase]: For 13056/13313 co-relation queries the response was YES. [2023-11-29 05:55:36,349 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42433 conditions, 15706 events. 8980/15706 cut-off events. For 13056/13313 co-relation queries the response was YES. Maximal size of possible extension queue 922. Compared 125687 event pairs, 792 based on Foata normal form. 16/14770 useless extension candidates. Maximal degree in co-relation 42409. Up to 7911 conditions per place. [2023-11-29 05:55:36,397 INFO L140 encePairwiseOnDemand]: 59/67 looper letters, 82 selfloop transitions, 32 changer transitions 0/156 dead transitions. [2023-11-29 05:55:36,397 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 156 transitions, 1149 flow [2023-11-29 05:55:36,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 05:55:36,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-29 05:55:36,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 455 transitions. [2023-11-29 05:55:36,400 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6791044776119403 [2023-11-29 05:55:36,400 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 455 transitions. [2023-11-29 05:55:36,400 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 455 transitions. [2023-11-29 05:55:36,400 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:55:36,400 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 455 transitions. [2023-11-29 05:55:36,402 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 45.5) internal successors, (455), 10 states have internal predecessors, (455), 0 states have call successors, (0), 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 05:55:36,403 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 67.0) internal successors, (737), 11 states have internal predecessors, (737), 0 states have call successors, (0), 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 05:55:36,403 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 67.0) internal successors, (737), 11 states have internal predecessors, (737), 0 states have call successors, (0), 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 05:55:36,403 INFO L175 Difference]: Start difference. First operand has 91 places, 90 transitions, 503 flow. Second operand 10 states and 455 transitions. [2023-11-29 05:55:36,403 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 156 transitions, 1149 flow [2023-11-29 05:55:36,571 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 156 transitions, 1148 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-29 05:55:36,574 INFO L231 Difference]: Finished difference. Result has 102 places, 118 transitions, 953 flow [2023-11-29 05:55:36,574 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=502, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=953, PETRI_PLACES=102, PETRI_TRANSITIONS=118} [2023-11-29 05:55:36,574 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 28 predicate places. [2023-11-29 05:55:36,574 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 118 transitions, 953 flow [2023-11-29 05:55:36,575 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 40.8) internal successors, (408), 10 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 05:55:36,575 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:55:36,575 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, 1] [2023-11-29 05:55:36,578 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0a5ee5-2912-4d0b-86d1-079a9fce3d5e/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)] Forceful destruction successful, exit code 0 [2023-11-29 05:55:36,775 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0a5ee5-2912-4d0b-86d1-079a9fce3d5e/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 05:55:36,776 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 05:55:36,776 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:55:36,776 INFO L85 PathProgramCache]: Analyzing trace with hash -1861171919, now seen corresponding path program 5 times [2023-11-29 05:55:36,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:55:36,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1205344999] [2023-11-29 05:55:36,776 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-29 05:55:36,777 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 05:55:36,777 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0a5ee5-2912-4d0b-86d1-079a9fce3d5e/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:55:36,777 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0a5ee5-2912-4d0b-86d1-079a9fce3d5e/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 05:55:36,779 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0a5ee5-2912-4d0b-86d1-079a9fce3d5e/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 05:55:36,910 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-29 05:55:36,910 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-11-29 05:55:36,910 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 05:55:37,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:55:37,075 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-11-29 05:55:37,075 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-29 05:55:37,076 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2023-11-29 05:55:37,077 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2023-11-29 05:55:37,077 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2023-11-29 05:55:37,078 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2023-11-29 05:55:37,078 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2023-11-29 05:55:37,078 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2023-11-29 05:55:37,078 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2023-11-29 05:55:37,078 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2023-11-29 05:55:37,078 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2023-11-29 05:55:37,078 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2023-11-29 05:55:37,078 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2023-11-29 05:55:37,079 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2023-11-29 05:55:37,079 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2023-11-29 05:55:37,079 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2023-11-29 05:55:37,079 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2023-11-29 05:55:37,079 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2023-11-29 05:55:37,083 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0a5ee5-2912-4d0b-86d1-079a9fce3d5e/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 05:55:37,279 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0a5ee5-2912-4d0b-86d1-079a9fce3d5e/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 05:55:37,280 INFO L445 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:55:37,284 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-29 05:55:37,284 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 05:55:37,354 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre3 could not be translated [2023-11-29 05:55:37,357 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-29 05:55:37,358 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-29 05:55:37,359 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-29 05:55:37,378 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-29 05:55:37,379 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-29 05:55:37,393 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 05:55:37 BasicIcfg [2023-11-29 05:55:37,393 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 05:55:37,394 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 05:55:37,394 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 05:55:37,394 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 05:55:37,394 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 05:55:15" (3/4) ... [2023-11-29 05:55:37,396 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-29 05:55:37,397 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 05:55:37,398 INFO L158 Benchmark]: Toolchain (without parser) took 23025.65ms. Allocated memory was 83.9MB in the beginning and 583.0MB in the end (delta: 499.1MB). Free memory was 51.7MB in the beginning and 315.9MB in the end (delta: -264.3MB). Peak memory consumption was 235.6MB. Max. memory is 16.1GB. [2023-11-29 05:55:37,398 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 54.5MB. Free memory was 31.2MB in the beginning and 31.1MB in the end (delta: 52.6kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 05:55:37,398 INFO L158 Benchmark]: CACSL2BoogieTranslator took 567.22ms. Allocated memory is still 83.9MB. Free memory was 51.4MB in the beginning and 48.5MB in the end (delta: 3.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-29 05:55:37,398 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.71ms. Allocated memory is still 83.9MB. Free memory was 48.5MB in the beginning and 45.6MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 05:55:37,399 INFO L158 Benchmark]: Boogie Preprocessor took 61.45ms. Allocated memory is still 83.9MB. Free memory was 45.6MB in the beginning and 41.9MB in the end (delta: 3.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 05:55:37,399 INFO L158 Benchmark]: RCFGBuilder took 865.68ms. Allocated memory is still 83.9MB. Free memory was 41.9MB in the beginning and 29.1MB in the end (delta: 12.7MB). Peak memory consumption was 16.5MB. Max. memory is 16.1GB. [2023-11-29 05:55:37,399 INFO L158 Benchmark]: TraceAbstraction took 21451.70ms. Allocated memory was 100.7MB in the beginning and 583.0MB in the end (delta: 482.3MB). Free memory was 75.7MB in the beginning and 315.9MB in the end (delta: -240.2MB). Peak memory consumption was 241.7MB. Max. memory is 16.1GB. [2023-11-29 05:55:37,400 INFO L158 Benchmark]: Witness Printer took 3.43ms. Allocated memory is still 583.0MB. Free memory is still 315.9MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 05:55:37,402 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.30ms. Allocated memory is still 54.5MB. Free memory was 31.2MB in the beginning and 31.1MB in the end (delta: 52.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 567.22ms. Allocated memory is still 83.9MB. Free memory was 51.4MB in the beginning and 48.5MB in the end (delta: 3.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.71ms. Allocated memory is still 83.9MB. Free memory was 48.5MB in the beginning and 45.6MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 61.45ms. Allocated memory is still 83.9MB. Free memory was 45.6MB in the beginning and 41.9MB in the end (delta: 3.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 865.68ms. Allocated memory is still 83.9MB. Free memory was 41.9MB in the beginning and 29.1MB in the end (delta: 12.7MB). Peak memory consumption was 16.5MB. Max. memory is 16.1GB. * TraceAbstraction took 21451.70ms. Allocated memory was 100.7MB in the beginning and 583.0MB in the end (delta: 482.3MB). Free memory was 75.7MB in the beginning and 315.9MB in the end (delta: -240.2MB). Peak memory consumption was 241.7MB. Max. memory is 16.1GB. * Witness Printer took 3.43ms. Allocated memory is still 583.0MB. Free memory is still 315.9MB. 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~pre3 could not be translated - 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: 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; [L722] 0 int b = 0; [L723] 0 _Bool main$tmp_guard0; [L724] 0 _Bool main$tmp_guard1; [L726] 0 int x = 0; [L728] 0 int y = 0; [L730] 0 int z = 0; [L731] 0 _Bool z$flush_delayed; [L732] 0 int z$mem_tmp; [L733] 0 _Bool z$r_buff0_thd0; [L734] 0 _Bool z$r_buff0_thd1; [L735] 0 _Bool z$r_buff0_thd2; [L736] 0 _Bool z$r_buff0_thd3; [L737] 0 _Bool z$r_buff0_thd4; [L738] 0 _Bool z$r_buff1_thd0; [L739] 0 _Bool z$r_buff1_thd1; [L740] 0 _Bool z$r_buff1_thd2; [L741] 0 _Bool z$r_buff1_thd3; [L742] 0 _Bool z$r_buff1_thd4; [L743] 0 _Bool z$read_delayed; [L744] 0 int *z$read_delayed_var; [L745] 0 int z$w_buff0; [L746] 0 _Bool z$w_buff0_used; [L747] 0 int z$w_buff1; [L748] 0 _Bool z$w_buff1_used; [L749] 0 _Bool weak$$choice0; [L750] 0 _Bool weak$$choice2; [L848] 0 pthread_t t1133; [L849] FCALL, FORK 0 pthread_create(&t1133, ((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}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1133={-2147483645:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L850] 0 pthread_t t1134; [L851] FCALL, FORK 0 pthread_create(&t1134, ((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}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1133={-2147483645:0}, t1134={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L852] 0 pthread_t t1135; [L853] FCALL, FORK 0 pthread_create(&t1135, ((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}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1133={-2147483645:0}, t1134={3:0}, t1135={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L854] 0 pthread_t t1136; [L855] FCALL, FORK 0 pthread_create(&t1136, ((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}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1133={-2147483645:0}, t1134={3:0}, t1135={7:0}, t1136={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L804] 4 z$w_buff1 = z$w_buff0 [L805] 4 z$w_buff0 = 2 [L806] 4 z$w_buff1_used = z$w_buff0_used [L807] 4 z$w_buff0_used = (_Bool)1 [L808] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L808] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L809] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L810] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L811] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L812] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L813] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L814] 4 z$r_buff0_thd4 = (_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}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L817] 4 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __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}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L820] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __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}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L823] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __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}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L754] 1 b = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L757] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L769] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L772] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L784] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L787] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=1] [L790] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L791] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L792] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L793] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L794] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=1] [L826] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L827] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L828] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L829] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L830] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __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}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L762] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L777] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L797] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L833] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __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}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L857] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1133={-2147483645:0}, t1134={3:0}, t1135={7:0}, t1136={6:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L859] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L859] RET 0 assume_abort_if_not(main$tmp_guard0) [L861] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L862] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L863] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L864] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L865] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1133={-2147483645:0}, t1134={3:0}, t1135={7:0}, t1136={6:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L868] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L869] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L870] 0 z$flush_delayed = weak$$choice2 [L871] 0 z$mem_tmp = z [L872] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L873] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L874] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L875] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L876] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L877] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L878] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L879] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L880] 0 z = z$flush_delayed ? z$mem_tmp : z [L881] 0 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1133={-2147483645:0}, t1134={3:0}, t1135={7:0}, t1136={6:0}, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L883] 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=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L17] 0 __assert_fail ("0", "mix043.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, 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: 846]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 853]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 849]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 855]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 851]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 101 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: 21.2s, OverallIterations: 19, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 12.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 870 SdHoareTripleChecker+Valid, 3.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 719 mSDsluCounter, 122 SdHoareTripleChecker+Invalid, 2.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 70 IncrementalHoareTripleChecker+Unchecked, 95 mSDsCounter, 58 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2296 IncrementalHoareTripleChecker+Invalid, 2424 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 58 mSolverCounterUnsat, 27 mSDtfsCounter, 2296 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 401 GetRequests, 329 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=953occurred in iteration=18, InterpolantAutomatonStates: 84, 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, 0.9s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 438 NumberOfCodeBlocks, 438 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 377 ConstructedInterpolants, 1 QuantifiedInterpolants, 3348 SizeOfPredicates, 18 NumberOfNonLiveVariables, 2569 ConjunctsInSsa, 109 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 05:55:37,425 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0a5ee5-2912-4d0b-86d1-079a9fce3d5e/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