./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/mix005_tso.oepc.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_6d1b734a-1438-43b0-9e46-bcedf1f105bb/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d1b734a-1438-43b0-9e46-bcedf1f105bb/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_6d1b734a-1438-43b0-9e46-bcedf1f105bb/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d1b734a-1438-43b0-9e46-bcedf1f105bb/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix005_tso.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d1b734a-1438-43b0-9e46-bcedf1f105bb/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_6d1b734a-1438-43b0-9e46-bcedf1f105bb/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 c22ca6d642b28badc1dc02a5cc527ddbb1f35b5d6d2e3ba3e8f314e81f0fd465 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 04:08:28,601 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 04:08:28,664 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d1b734a-1438-43b0-9e46-bcedf1f105bb/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-29 04:08:28,668 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 04:08:28,669 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 04:08:28,691 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 04:08:28,691 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 04:08:28,692 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 04:08:28,693 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 04:08:28,693 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 04:08:28,694 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 04:08:28,694 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 04:08:28,695 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 04:08:28,695 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 04:08:28,696 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 04:08:28,696 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 04:08:28,697 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 04:08:28,697 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 04:08:28,698 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 04:08:28,698 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 04:08:28,698 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-29 04:08:28,699 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-29 04:08:28,699 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-29 04:08:28,700 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 04:08:28,700 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 04:08:28,700 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 04:08:28,701 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 04:08:28,701 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 04:08:28,701 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 04:08:28,702 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 04:08:28,702 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 04:08:28,702 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 04:08:28,703 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 04:08:28,703 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 04:08:28,703 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 04:08:28,703 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 04:08:28,704 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 04:08:28,704 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 04:08:28,704 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 04:08:28,704 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 04:08:28,704 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 04:08:28,705 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_6d1b734a-1438-43b0-9e46-bcedf1f105bb/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_6d1b734a-1438-43b0-9e46-bcedf1f105bb/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 -> c22ca6d642b28badc1dc02a5cc527ddbb1f35b5d6d2e3ba3e8f314e81f0fd465 [2023-11-29 04:08:28,926 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 04:08:28,947 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 04:08:28,950 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 04:08:28,951 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 04:08:28,952 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 04:08:28,953 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d1b734a-1438-43b0-9e46-bcedf1f105bb/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/pthread-wmm/mix005_tso.oepc.i [2023-11-29 04:08:31,715 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 04:08:31,947 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 04:08:31,948 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d1b734a-1438-43b0-9e46-bcedf1f105bb/sv-benchmarks/c/pthread-wmm/mix005_tso.oepc.i [2023-11-29 04:08:31,964 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d1b734a-1438-43b0-9e46-bcedf1f105bb/bin/uautomizer-verify-BQ2R08f2Ya/data/85d39c456/a79f82e06d404995acc91ac0594e484d/FLAG5a98df1f5 [2023-11-29 04:08:31,977 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d1b734a-1438-43b0-9e46-bcedf1f105bb/bin/uautomizer-verify-BQ2R08f2Ya/data/85d39c456/a79f82e06d404995acc91ac0594e484d [2023-11-29 04:08:31,979 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 04:08:31,981 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 04:08:31,982 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 04:08:31,982 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 04:08:31,991 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 04:08:31,991 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 04:08:31" (1/1) ... [2023-11-29 04:08:31,992 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f6c3183 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:08:31, skipping insertion in model container [2023-11-29 04:08:31,992 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 04:08:31" (1/1) ... [2023-11-29 04:08:32,041 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 04:08:32,370 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 04:08:32,381 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 04:08:32,437 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 04:08:32,466 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 04:08:32,466 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 04:08:32,472 INFO L206 MainTranslator]: Completed translation [2023-11-29 04:08:32,473 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:08:32 WrapperNode [2023-11-29 04:08:32,473 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 04:08:32,474 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 04:08:32,474 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 04:08:32,474 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 04:08:32,480 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:08:32" (1/1) ... [2023-11-29 04:08:32,496 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:08:32" (1/1) ... [2023-11-29 04:08:32,524 INFO L138 Inliner]: procedures = 177, calls = 72, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 168 [2023-11-29 04:08:32,524 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 04:08:32,525 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 04:08:32,525 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 04:08:32,526 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 04:08:32,535 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:08:32" (1/1) ... [2023-11-29 04:08:32,536 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:08:32" (1/1) ... [2023-11-29 04:08:32,540 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:08:32" (1/1) ... [2023-11-29 04:08:32,559 INFO L175 MemorySlicer]: Split 6 memory accesses to 5 slices as follows [2, 1, 1, 1, 1]. 33 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0, 0]. The 4 writes are split as follows [0, 1, 1, 1, 1]. [2023-11-29 04:08:32,559 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:08:32" (1/1) ... [2023-11-29 04:08:32,559 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:08:32" (1/1) ... [2023-11-29 04:08:32,570 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:08:32" (1/1) ... [2023-11-29 04:08:32,572 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:08:32" (1/1) ... [2023-11-29 04:08:32,575 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:08:32" (1/1) ... [2023-11-29 04:08:32,577 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:08:32" (1/1) ... [2023-11-29 04:08:32,582 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 04:08:32,583 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 04:08:32,583 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 04:08:32,583 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 04:08:32,584 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:08:32" (1/1) ... [2023-11-29 04:08:32,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 04:08:32,600 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d1b734a-1438-43b0-9e46-bcedf1f105bb/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:08:32,612 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d1b734a-1438-43b0-9e46-bcedf1f105bb/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 04:08:32,614 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d1b734a-1438-43b0-9e46-bcedf1f105bb/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 04:08:32,644 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-29 04:08:32,644 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-29 04:08:32,644 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-29 04:08:32,645 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-11-29 04:08:32,645 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2023-11-29 04:08:32,645 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-29 04:08:32,645 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 04:08:32,645 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 04:08:32,646 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 04:08:32,646 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-29 04:08:32,646 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-29 04:08:32,646 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-29 04:08:32,646 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-29 04:08:32,647 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-29 04:08:32,647 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-29 04:08:32,647 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-11-29 04:08:32,647 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-11-29 04:08:32,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 04:08:32,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-29 04:08:32,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-29 04:08:32,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-11-29 04:08:32,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2023-11-29 04:08:32,649 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-29 04:08:32,649 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 04:08:32,649 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 04:08:32,651 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-29 04:08:32,800 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 04:08:32,802 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 04:08:33,151 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 04:08:33,338 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 04:08:33,338 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-29 04:08:33,339 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 04:08:33 BoogieIcfgContainer [2023-11-29 04:08:33,339 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 04:08:33,341 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 04:08:33,341 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 04:08:33,344 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 04:08:33,344 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 04:08:31" (1/3) ... [2023-11-29 04:08:33,344 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b93e840 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 04:08:33, skipping insertion in model container [2023-11-29 04:08:33,345 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:08:32" (2/3) ... [2023-11-29 04:08:33,345 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b93e840 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 04:08:33, skipping insertion in model container [2023-11-29 04:08:33,345 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 04:08:33" (3/3) ... [2023-11-29 04:08:33,346 INFO L112 eAbstractionObserver]: Analyzing ICFG mix005_tso.oepc.i [2023-11-29 04:08:33,360 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 04:08:33,360 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2023-11-29 04:08:33,360 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-29 04:08:33,409 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-29 04:08:33,436 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 78 places, 67 transitions, 150 flow [2023-11-29 04:08:33,468 INFO L124 PetriNetUnfolderBase]: 2/63 cut-off events. [2023-11-29 04:08:33,468 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 04:08:33,471 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 6. 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 04:08:33,471 INFO L82 GeneralOperation]: Start removeDead. Operand has 78 places, 67 transitions, 150 flow [2023-11-29 04:08:33,475 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 74 places, 63 transitions, 138 flow [2023-11-29 04:08:33,484 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 04:08:33,490 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;@3d5b8d5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 04:08:33,490 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-11-29 04:08:33,493 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-29 04:08:33,493 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-11-29 04:08:33,494 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 04:08:33,494 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:08:33,494 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-29 04:08:33,495 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 04:08:33,499 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:08:33,499 INFO L85 PathProgramCache]: Analyzing trace with hash 14643, now seen corresponding path program 1 times [2023-11-29 04:08:33,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:08:33,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369948634] [2023-11-29 04:08:33,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:08:33,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:08:33,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:08:33,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:08:33,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:08:33,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369948634] [2023-11-29 04:08:33,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369948634] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:08:33,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:08:33,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 04:08:33,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814409325] [2023-11-29 04:08:33,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:08:33,737 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:08:33,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:08:33,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:08:33,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:08:33,785 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 67 [2023-11-29 04:08:33,787 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 63 transitions, 138 flow. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:08:33,787 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:08:33,788 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 67 [2023-11-29 04:08:33,788 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:08:34,796 INFO L124 PetriNetUnfolderBase]: 3508/6029 cut-off events. [2023-11-29 04:08:34,797 INFO L125 PetriNetUnfolderBase]: For 63/63 co-relation queries the response was YES. [2023-11-29 04:08:34,813 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11014 conditions, 6029 events. 3508/6029 cut-off events. For 63/63 co-relation queries the response was YES. Maximal size of possible extension queue 367. Compared 45136 event pairs, 2752 based on Foata normal form. 270/5714 useless extension candidates. Maximal degree in co-relation 10999. Up to 3825 conditions per place. [2023-11-29 04:08:34,849 INFO L140 encePairwiseOnDemand]: 62/67 looper letters, 35 selfloop transitions, 2 changer transitions 0/69 dead transitions. [2023-11-29 04:08:34,849 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 69 transitions, 224 flow [2023-11-29 04:08:34,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:08:34,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 04:08:34,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 148 transitions. [2023-11-29 04:08:34,859 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.736318407960199 [2023-11-29 04:08:34,860 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 148 transitions. [2023-11-29 04:08:34,860 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 148 transitions. [2023-11-29 04:08:34,861 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:08:34,863 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 148 transitions. [2023-11-29 04:08:34,866 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:08:34,869 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 04:08:34,870 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 04:08:34,871 INFO L175 Difference]: Start difference. First operand has 74 places, 63 transitions, 138 flow. Second operand 3 states and 148 transitions. [2023-11-29 04:08:34,872 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 69 transitions, 224 flow [2023-11-29 04:08:34,877 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 69 transitions, 220 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-29 04:08:34,880 INFO L231 Difference]: Finished difference. Result has 70 places, 59 transitions, 130 flow [2023-11-29 04:08:34,882 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 04:08:34,885 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -4 predicate places. [2023-11-29 04:08:34,885 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 59 transitions, 130 flow [2023-11-29 04:08:34,885 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:08:34,885 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:08:34,885 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-29 04:08:34,886 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 04:08:34,886 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 04:08:34,886 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:08:34,887 INFO L85 PathProgramCache]: Analyzing trace with hash 14644, now seen corresponding path program 1 times [2023-11-29 04:08:34,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:08:34,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253309257] [2023-11-29 04:08:34,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:08:34,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:08:34,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:08:35,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 04:08:35,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:08:35,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253309257] [2023-11-29 04:08:35,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253309257] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:08:35,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:08:35,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 04:08:35,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427817635] [2023-11-29 04:08:35,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:08:35,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:08:35,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:08:35,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:08:35,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:08:35,038 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 67 [2023-11-29 04:08:35,039 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 59 transitions, 130 flow. Second operand has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:08:35,039 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:08:35,039 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 67 [2023-11-29 04:08:35,039 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:08:35,884 INFO L124 PetriNetUnfolderBase]: 3508/6028 cut-off events. [2023-11-29 04:08:35,884 INFO L125 PetriNetUnfolderBase]: For 135/135 co-relation queries the response was YES. [2023-11-29 04:08:35,900 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11145 conditions, 6028 events. 3508/6028 cut-off events. For 135/135 co-relation queries the response was YES. Maximal size of possible extension queue 367. Compared 45008 event pairs, 2752 based on Foata normal form. 1/5444 useless extension candidates. Maximal degree in co-relation 11134. Up to 3824 conditions per place. [2023-11-29 04:08:35,943 INFO L140 encePairwiseOnDemand]: 64/67 looper letters, 34 selfloop transitions, 2 changer transitions 0/68 dead transitions. [2023-11-29 04:08:35,944 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 68 transitions, 220 flow [2023-11-29 04:08:35,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:08:35,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 04:08:35,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 148 transitions. [2023-11-29 04:08:35,946 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.736318407960199 [2023-11-29 04:08:35,946 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 148 transitions. [2023-11-29 04:08:35,946 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 148 transitions. [2023-11-29 04:08:35,947 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:08:35,947 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 148 transitions. [2023-11-29 04:08:35,948 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:08:35,949 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 04:08:35,949 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 04:08:35,950 INFO L175 Difference]: Start difference. First operand has 70 places, 59 transitions, 130 flow. Second operand 3 states and 148 transitions. [2023-11-29 04:08:35,950 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 68 transitions, 220 flow [2023-11-29 04:08:35,961 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 68 transitions, 216 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 04:08:35,963 INFO L231 Difference]: Finished difference. Result has 69 places, 58 transitions, 128 flow [2023-11-29 04:08:35,963 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 04:08:35,964 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -5 predicate places. [2023-11-29 04:08:35,964 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 58 transitions, 128 flow [2023-11-29 04:08:35,965 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:08:35,965 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:08:35,965 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-29 04:08:35,965 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 04:08:35,965 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 04:08:35,966 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:08:35,966 INFO L85 PathProgramCache]: Analyzing trace with hash 436669227, now seen corresponding path program 1 times [2023-11-29 04:08:35,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:08:35,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843045778] [2023-11-29 04:08:35,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:08:35,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:08:35,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:08:36,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:08:36,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:08:36,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843045778] [2023-11-29 04:08:36,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843045778] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:08:36,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:08:36,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 04:08:36,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749989744] [2023-11-29 04:08:36,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:08:36,019 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:08:36,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:08:36,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:08:36,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:08:36,037 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 67 [2023-11-29 04:08:36,037 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 58 transitions, 128 flow. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:08:36,037 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:08:36,037 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 67 [2023-11-29 04:08:36,038 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:08:37,094 INFO L124 PetriNetUnfolderBase]: 3510/5981 cut-off events. [2023-11-29 04:08:37,095 INFO L125 PetriNetUnfolderBase]: For 135/135 co-relation queries the response was YES. [2023-11-29 04:08:37,111 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11103 conditions, 5981 events. 3510/5981 cut-off events. For 135/135 co-relation queries the response was YES. Maximal size of possible extension queue 366. Compared 44493 event pairs, 2797 based on Foata normal form. 0/5402 useless extension candidates. Maximal degree in co-relation 11092. Up to 3825 conditions per place. [2023-11-29 04:08:37,146 INFO L140 encePairwiseOnDemand]: 64/67 looper letters, 35 selfloop transitions, 2 changer transitions 0/67 dead transitions. [2023-11-29 04:08:37,146 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 67 transitions, 220 flow [2023-11-29 04:08:37,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:08:37,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 04:08:37,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 146 transitions. [2023-11-29 04:08:37,148 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7263681592039801 [2023-11-29 04:08:37,149 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 146 transitions. [2023-11-29 04:08:37,149 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 146 transitions. [2023-11-29 04:08:37,149 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:08:37,149 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 146 transitions. [2023-11-29 04:08:37,150 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:08:37,151 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 04:08:37,151 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 04:08:37,151 INFO L175 Difference]: Start difference. First operand has 69 places, 58 transitions, 128 flow. Second operand 3 states and 146 transitions. [2023-11-29 04:08:37,152 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 67 transitions, 220 flow [2023-11-29 04:08:37,161 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 67 transitions, 216 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 04:08:37,163 INFO L231 Difference]: Finished difference. Result has 68 places, 57 transitions, 126 flow [2023-11-29 04:08:37,163 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 04:08:37,164 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -6 predicate places. [2023-11-29 04:08:37,164 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 57 transitions, 126 flow [2023-11-29 04:08:37,164 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:08:37,164 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:08:37,165 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-29 04:08:37,165 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 04:08:37,165 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 04:08:37,166 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:08:37,166 INFO L85 PathProgramCache]: Analyzing trace with hash 436669228, now seen corresponding path program 1 times [2023-11-29 04:08:37,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:08:37,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950100848] [2023-11-29 04:08:37,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:08:37,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:08:37,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:08:37,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:08:37,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:08:37,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950100848] [2023-11-29 04:08:37,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950100848] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:08:37,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:08:37,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 04:08:37,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353363986] [2023-11-29 04:08:37,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:08:37,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:08:37,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:08:37,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:08:37,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:08:37,253 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 67 [2023-11-29 04:08:37,254 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 57 transitions, 126 flow. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:08:37,254 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:08:37,254 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 67 [2023-11-29 04:08:37,254 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:08:37,964 INFO L124 PetriNetUnfolderBase]: 3508/6022 cut-off events. [2023-11-29 04:08:37,964 INFO L125 PetriNetUnfolderBase]: For 137/137 co-relation queries the response was YES. [2023-11-29 04:08:37,976 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11141 conditions, 6022 events. 3508/6022 cut-off events. For 137/137 co-relation queries the response was YES. Maximal size of possible extension queue 367. Compared 45170 event pairs, 2220 based on Foata normal form. 3/5448 useless extension candidates. Maximal degree in co-relation 11131. Up to 3820 conditions per place. [2023-11-29 04:08:38,039 INFO L140 encePairwiseOnDemand]: 64/67 looper letters, 34 selfloop transitions, 2 changer transitions 0/66 dead transitions. [2023-11-29 04:08:38,039 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 66 transitions, 216 flow [2023-11-29 04:08:38,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:08:38,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 04:08:38,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 148 transitions. [2023-11-29 04:08:38,041 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.736318407960199 [2023-11-29 04:08:38,041 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 148 transitions. [2023-11-29 04:08:38,041 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 148 transitions. [2023-11-29 04:08:38,042 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:08:38,042 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 148 transitions. [2023-11-29 04:08:38,043 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:08:38,044 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 04:08:38,044 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 04:08:38,044 INFO L175 Difference]: Start difference. First operand has 68 places, 57 transitions, 126 flow. Second operand 3 states and 148 transitions. [2023-11-29 04:08:38,044 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 66 transitions, 216 flow [2023-11-29 04:08:38,047 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 66 transitions, 212 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 04:08:38,048 INFO L231 Difference]: Finished difference. Result has 67 places, 56 transitions, 124 flow [2023-11-29 04:08:38,049 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 04:08:38,049 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -7 predicate places. [2023-11-29 04:08:38,050 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 56 transitions, 124 flow [2023-11-29 04:08:38,050 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:08:38,050 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:08:38,050 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:08:38,050 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 04:08:38,050 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 04:08:38,051 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:08:38,051 INFO L85 PathProgramCache]: Analyzing trace with hash -642554093, now seen corresponding path program 1 times [2023-11-29 04:08:38,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:08:38,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231874665] [2023-11-29 04:08:38,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:08:38,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:08:38,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:08:38,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:08:38,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:08:38,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231874665] [2023-11-29 04:08:38,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231874665] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:08:38,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:08:38,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 04:08:38,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752352785] [2023-11-29 04:08:38,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:08:38,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:08:38,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:08:38,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:08:38,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:08:38,114 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 67 [2023-11-29 04:08:38,115 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 56 transitions, 124 flow. Second operand has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:08:38,115 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:08:38,115 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 67 [2023-11-29 04:08:38,115 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:08:39,021 INFO L124 PetriNetUnfolderBase]: 3530/6002 cut-off events. [2023-11-29 04:08:39,021 INFO L125 PetriNetUnfolderBase]: For 137/137 co-relation queries the response was YES. [2023-11-29 04:08:39,043 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11158 conditions, 6002 events. 3530/6002 cut-off events. For 137/137 co-relation queries the response was YES. Maximal size of possible extension queue 368. Compared 44837 event pairs, 2286 based on Foata normal form. 0/5453 useless extension candidates. Maximal degree in co-relation 11148. Up to 3827 conditions per place. [2023-11-29 04:08:39,077 INFO L140 encePairwiseOnDemand]: 64/67 looper letters, 35 selfloop transitions, 2 changer transitions 0/65 dead transitions. [2023-11-29 04:08:39,077 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 65 transitions, 216 flow [2023-11-29 04:08:39,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:08:39,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 04:08:39,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 146 transitions. [2023-11-29 04:08:39,079 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7263681592039801 [2023-11-29 04:08:39,079 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 146 transitions. [2023-11-29 04:08:39,079 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 146 transitions. [2023-11-29 04:08:39,080 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:08:39,080 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 146 transitions. [2023-11-29 04:08:39,081 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:08:39,082 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 04:08:39,082 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 04:08:39,082 INFO L175 Difference]: Start difference. First operand has 67 places, 56 transitions, 124 flow. Second operand 3 states and 146 transitions. [2023-11-29 04:08:39,082 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 65 transitions, 216 flow [2023-11-29 04:08:39,086 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 65 transitions, 212 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 04:08:39,088 INFO L231 Difference]: Finished difference. Result has 66 places, 55 transitions, 122 flow [2023-11-29 04:08:39,088 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 04:08:39,089 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -8 predicate places. [2023-11-29 04:08:39,089 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 55 transitions, 122 flow [2023-11-29 04:08:39,089 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:08:39,090 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:08:39,090 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:08:39,090 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-29 04:08:39,090 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 04:08:39,091 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:08:39,091 INFO L85 PathProgramCache]: Analyzing trace with hash -642554092, now seen corresponding path program 1 times [2023-11-29 04:08:39,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:08:39,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137042013] [2023-11-29 04:08:39,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:08:39,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:08:39,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:08:39,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:08:39,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:08:39,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137042013] [2023-11-29 04:08:39,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137042013] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:08:39,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:08:39,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 04:08:39,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768604359] [2023-11-29 04:08:39,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:08:39,170 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:08:39,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:08:39,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:08:39,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:08:39,189 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 67 [2023-11-29 04:08:39,190 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 55 transitions, 122 flow. Second operand has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:08:39,190 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:08:39,190 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 67 [2023-11-29 04:08:39,190 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:08:40,172 INFO L124 PetriNetUnfolderBase]: 3508/5992 cut-off events. [2023-11-29 04:08:40,172 INFO L125 PetriNetUnfolderBase]: For 147/147 co-relation queries the response was YES. [2023-11-29 04:08:40,194 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11123 conditions, 5992 events. 3508/5992 cut-off events. For 147/147 co-relation queries the response was YES. Maximal size of possible extension queue 369. Compared 45248 event pairs, 1608 based on Foata normal form. 15/5467 useless extension candidates. Maximal degree in co-relation 11113. Up to 3790 conditions per place. [2023-11-29 04:08:40,224 INFO L140 encePairwiseOnDemand]: 64/67 looper letters, 34 selfloop transitions, 2 changer transitions 0/64 dead transitions. [2023-11-29 04:08:40,225 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 64 transitions, 212 flow [2023-11-29 04:08:40,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:08:40,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 04:08:40,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 148 transitions. [2023-11-29 04:08:40,226 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.736318407960199 [2023-11-29 04:08:40,226 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 148 transitions. [2023-11-29 04:08:40,226 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 148 transitions. [2023-11-29 04:08:40,226 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:08:40,227 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 148 transitions. [2023-11-29 04:08:40,227 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:08:40,228 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 04:08:40,228 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 04:08:40,229 INFO L175 Difference]: Start difference. First operand has 66 places, 55 transitions, 122 flow. Second operand 3 states and 148 transitions. [2023-11-29 04:08:40,229 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 64 transitions, 212 flow [2023-11-29 04:08:40,231 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 64 transitions, 208 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 04:08:40,232 INFO L231 Difference]: Finished difference. Result has 65 places, 54 transitions, 120 flow [2023-11-29 04:08:40,232 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 04:08:40,233 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -9 predicate places. [2023-11-29 04:08:40,233 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 54 transitions, 120 flow [2023-11-29 04:08:40,233 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:08:40,233 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:08:40,234 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:08:40,234 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-29 04:08:40,234 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 04:08:40,234 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:08:40,234 INFO L85 PathProgramCache]: Analyzing trace with hash -642553002, now seen corresponding path program 1 times [2023-11-29 04:08:40,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:08:40,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988717640] [2023-11-29 04:08:40,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:08:40,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:08:40,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:08:40,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:08:40,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:08:40,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988717640] [2023-11-29 04:08:40,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988717640] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:08:40,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:08:40,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 04:08:40,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811960708] [2023-11-29 04:08:40,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:08:40,331 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:08:40,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:08:40,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:08:40,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:08:40,332 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 67 [2023-11-29 04:08:40,332 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 54 transitions, 120 flow. Second operand has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:08:40,333 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:08:40,333 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 67 [2023-11-29 04:08:40,333 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:08:40,858 INFO L124 PetriNetUnfolderBase]: 2754/4599 cut-off events. [2023-11-29 04:08:40,858 INFO L125 PetriNetUnfolderBase]: For 117/117 co-relation queries the response was YES. [2023-11-29 04:08:40,867 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8655 conditions, 4599 events. 2754/4599 cut-off events. For 117/117 co-relation queries the response was YES. Maximal size of possible extension queue 296. Compared 32642 event pairs, 492 based on Foata normal form. 0/4506 useless extension candidates. Maximal degree in co-relation 8645. Up to 3064 conditions per place. [2023-11-29 04:08:40,880 INFO L140 encePairwiseOnDemand]: 64/67 looper letters, 39 selfloop transitions, 2 changer transitions 2/71 dead transitions. [2023-11-29 04:08:40,880 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 71 transitions, 248 flow [2023-11-29 04:08:40,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:08:40,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 04:08:40,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 158 transitions. [2023-11-29 04:08:40,881 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7860696517412935 [2023-11-29 04:08:40,881 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 158 transitions. [2023-11-29 04:08:40,881 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 158 transitions. [2023-11-29 04:08:40,882 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:08:40,882 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 158 transitions. [2023-11-29 04:08:40,882 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:08:40,883 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 04:08:40,883 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 04:08:40,883 INFO L175 Difference]: Start difference. First operand has 65 places, 54 transitions, 120 flow. Second operand 3 states and 158 transitions. [2023-11-29 04:08:40,883 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 71 transitions, 248 flow [2023-11-29 04:08:40,884 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 71 transitions, 240 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 04:08:40,886 INFO L231 Difference]: Finished difference. Result has 64 places, 52 transitions, 116 flow [2023-11-29 04:08:40,886 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=116, PETRI_PLACES=64, PETRI_TRANSITIONS=52} [2023-11-29 04:08:40,887 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -10 predicate places. [2023-11-29 04:08:40,887 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 52 transitions, 116 flow [2023-11-29 04:08:40,887 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:08:40,888 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:08:40,888 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:08:40,888 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-29 04:08:40,888 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 04:08:40,888 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:08:40,889 INFO L85 PathProgramCache]: Analyzing trace with hash 340695609, now seen corresponding path program 1 times [2023-11-29 04:08:40,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:08:40,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243558015] [2023-11-29 04:08:40,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:08:40,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:08:40,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:08:40,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:08:40,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:08:40,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243558015] [2023-11-29 04:08:40,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243558015] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:08:40,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:08:40,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 04:08:40,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480845174] [2023-11-29 04:08:40,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:08:40,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:08:40,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:08:40,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:08:40,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:08:40,958 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 67 [2023-11-29 04:08:40,958 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 52 transitions, 116 flow. Second operand has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:08:40,958 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:08:40,958 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 67 [2023-11-29 04:08:40,958 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:08:41,446 INFO L124 PetriNetUnfolderBase]: 2532/4332 cut-off events. [2023-11-29 04:08:41,446 INFO L125 PetriNetUnfolderBase]: For 249/249 co-relation queries the response was YES. [2023-11-29 04:08:41,454 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8224 conditions, 4332 events. 2532/4332 cut-off events. For 249/249 co-relation queries the response was YES. Maximal size of possible extension queue 270. Compared 30777 event pairs, 1191 based on Foata normal form. 0/4140 useless extension candidates. Maximal degree in co-relation 8213. Up to 2985 conditions per place. [2023-11-29 04:08:41,468 INFO L140 encePairwiseOnDemand]: 64/67 looper letters, 32 selfloop transitions, 2 changer transitions 0/60 dead transitions. [2023-11-29 04:08:41,468 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 60 transitions, 202 flow [2023-11-29 04:08:41,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:08:41,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 04:08:41,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 143 transitions. [2023-11-29 04:08:41,469 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7114427860696517 [2023-11-29 04:08:41,469 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 143 transitions. [2023-11-29 04:08:41,469 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 143 transitions. [2023-11-29 04:08:41,470 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:08:41,470 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 143 transitions. [2023-11-29 04:08:41,470 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:08:41,471 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 04:08:41,471 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 04:08:41,471 INFO L175 Difference]: Start difference. First operand has 64 places, 52 transitions, 116 flow. Second operand 3 states and 143 transitions. [2023-11-29 04:08:41,472 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 60 transitions, 202 flow [2023-11-29 04:08:41,472 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 60 transitions, 196 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 04:08:41,473 INFO L231 Difference]: Finished difference. Result has 62 places, 51 transitions, 114 flow [2023-11-29 04:08:41,473 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=114, PETRI_PLACES=62, PETRI_TRANSITIONS=51} [2023-11-29 04:08:41,474 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -12 predicate places. [2023-11-29 04:08:41,474 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 51 transitions, 114 flow [2023-11-29 04:08:41,474 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:08:41,474 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:08:41,475 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:08:41,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-29 04:08:41,475 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 04:08:41,475 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:08:41,475 INFO L85 PathProgramCache]: Analyzing trace with hash 340695610, now seen corresponding path program 1 times [2023-11-29 04:08:41,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:08:41,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808210300] [2023-11-29 04:08:41,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:08:41,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:08:41,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:08:41,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:08:41,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:08:41,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808210300] [2023-11-29 04:08:41,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808210300] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:08:41,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:08:41,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 04:08:41,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243524163] [2023-11-29 04:08:41,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:08:41,553 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:08:41,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:08:41,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:08:41,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:08:41,570 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 67 [2023-11-29 04:08:41,570 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 51 transitions, 114 flow. Second operand has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:08:41,570 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:08:41,570 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 67 [2023-11-29 04:08:41,570 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:08:42,037 INFO L124 PetriNetUnfolderBase]: 2457/4269 cut-off events. [2023-11-29 04:08:42,038 INFO L125 PetriNetUnfolderBase]: For 132/132 co-relation queries the response was YES. [2023-11-29 04:08:42,051 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7944 conditions, 4269 events. 2457/4269 cut-off events. For 132/132 co-relation queries the response was YES. Maximal size of possible extension queue 271. Compared 30667 event pairs, 735 based on Foata normal form. 36/4137 useless extension candidates. Maximal degree in co-relation 7934. Up to 2874 conditions per place. [2023-11-29 04:08:42,068 INFO L140 encePairwiseOnDemand]: 64/67 looper letters, 31 selfloop transitions, 2 changer transitions 0/59 dead transitions. [2023-11-29 04:08:42,069 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 59 transitions, 196 flow [2023-11-29 04:08:42,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:08:42,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 04:08:42,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 145 transitions. [2023-11-29 04:08:42,070 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7213930348258707 [2023-11-29 04:08:42,070 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 145 transitions. [2023-11-29 04:08:42,070 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 145 transitions. [2023-11-29 04:08:42,071 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:08:42,071 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 145 transitions. [2023-11-29 04:08:42,071 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:08:42,072 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 04:08:42,072 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 04:08:42,073 INFO L175 Difference]: Start difference. First operand has 62 places, 51 transitions, 114 flow. Second operand 3 states and 145 transitions. [2023-11-29 04:08:42,073 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 59 transitions, 196 flow [2023-11-29 04:08:42,074 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 59 transitions, 192 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 04:08:42,075 INFO L231 Difference]: Finished difference. Result has 61 places, 50 transitions, 112 flow [2023-11-29 04:08:42,075 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=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=112, PETRI_PLACES=61, PETRI_TRANSITIONS=50} [2023-11-29 04:08:42,076 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -13 predicate places. [2023-11-29 04:08:42,076 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 50 transitions, 112 flow [2023-11-29 04:08:42,077 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:08:42,077 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:08:42,077 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:08:42,077 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-29 04:08:42,078 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 04:08:42,078 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:08:42,078 INFO L85 PathProgramCache]: Analyzing trace with hash 578759073, now seen corresponding path program 1 times [2023-11-29 04:08:42,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:08:42,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588052033] [2023-11-29 04:08:42,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:08:42,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:08:42,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:08:42,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:08:42,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:08:42,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588052033] [2023-11-29 04:08:42,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588052033] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:08:42,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:08:42,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 04:08:42,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409484115] [2023-11-29 04:08:42,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:08:42,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 04:08:42,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:08:42,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 04:08:42,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2023-11-29 04:08:43,188 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 67 [2023-11-29 04:08:43,189 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 50 transitions, 112 flow. Second operand has 10 states, 10 states have (on average 35.7) internal successors, (357), 10 states have internal predecessors, (357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:08:43,189 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:08:43,189 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 67 [2023-11-29 04:08:43,189 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:08:44,123 INFO L124 PetriNetUnfolderBase]: 3326/5426 cut-off events. [2023-11-29 04:08:44,123 INFO L125 PetriNetUnfolderBase]: For 168/168 co-relation queries the response was YES. [2023-11-29 04:08:44,133 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10307 conditions, 5426 events. 3326/5426 cut-off events. For 168/168 co-relation queries the response was YES. Maximal size of possible extension queue 338. Compared 37073 event pairs, 204 based on Foata normal form. 144/5515 useless extension candidates. Maximal degree in co-relation 10296. Up to 2979 conditions per place. [2023-11-29 04:08:44,146 INFO L140 encePairwiseOnDemand]: 60/67 looper letters, 48 selfloop transitions, 5 changer transitions 12/87 dead transitions. [2023-11-29 04:08:44,146 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 87 transitions, 318 flow [2023-11-29 04:08:44,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 04:08:44,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-29 04:08:44,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 338 transitions. [2023-11-29 04:08:44,148 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6305970149253731 [2023-11-29 04:08:44,148 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 338 transitions. [2023-11-29 04:08:44,148 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 338 transitions. [2023-11-29 04:08:44,148 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:08:44,149 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 338 transitions. [2023-11-29 04:08:44,150 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 42.25) internal successors, (338), 8 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:08:44,151 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 04:08:44,152 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 04:08:44,152 INFO L175 Difference]: Start difference. First operand has 61 places, 50 transitions, 112 flow. Second operand 8 states and 338 transitions. [2023-11-29 04:08:44,152 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 87 transitions, 318 flow [2023-11-29 04:08:44,154 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 87 transitions, 312 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 04:08:44,155 INFO L231 Difference]: Finished difference. Result has 65 places, 48 transitions, 114 flow [2023-11-29 04:08:44,155 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 04:08:44,156 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -9 predicate places. [2023-11-29 04:08:44,156 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 48 transitions, 114 flow [2023-11-29 04:08:44,157 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 35.7) internal successors, (357), 10 states have internal predecessors, (357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:08:44,157 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:08:44,157 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:08:44,157 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-29 04:08:44,157 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 04:08:44,158 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:08:44,158 INFO L85 PathProgramCache]: Analyzing trace with hash 578760426, now seen corresponding path program 1 times [2023-11-29 04:08:44,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:08:44,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128140168] [2023-11-29 04:08:44,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:08:44,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:08:44,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:08:44,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:08:44,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:08:44,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128140168] [2023-11-29 04:08:44,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128140168] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:08:44,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:08:44,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 04:08:44,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164069889] [2023-11-29 04:08:44,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:08:44,355 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 04:08:44,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:08:44,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 04:08:44,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 04:08:44,365 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 67 [2023-11-29 04:08:44,365 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 48 transitions, 114 flow. Second operand has 4 states, 4 states have (on average 36.75) internal successors, (147), 4 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:08:44,366 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:08:44,366 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 67 [2023-11-29 04:08:44,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:08:45,568 INFO L124 PetriNetUnfolderBase]: 8029/11962 cut-off events. [2023-11-29 04:08:45,568 INFO L125 PetriNetUnfolderBase]: For 95/95 co-relation queries the response was YES. [2023-11-29 04:08:45,590 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23266 conditions, 11962 events. 8029/11962 cut-off events. For 95/95 co-relation queries the response was YES. Maximal size of possible extension queue 740. Compared 81308 event pairs, 869 based on Foata normal form. 320/12023 useless extension candidates. Maximal degree in co-relation 23255. Up to 7057 conditions per place. [2023-11-29 04:08:45,624 INFO L140 encePairwiseOnDemand]: 60/67 looper letters, 51 selfloop transitions, 6 changer transitions 1/78 dead transitions. [2023-11-29 04:08:45,624 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 78 transitions, 302 flow [2023-11-29 04:08:45,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 04:08:45,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-29 04:08:45,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 192 transitions. [2023-11-29 04:08:45,626 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7164179104477612 [2023-11-29 04:08:45,626 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 192 transitions. [2023-11-29 04:08:45,626 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 192 transitions. [2023-11-29 04:08:45,627 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:08:45,627 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 192 transitions. [2023-11-29 04:08:45,628 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 48.0) internal successors, (192), 4 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:08:45,629 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 04:08:45,629 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 04:08:45,629 INFO L175 Difference]: Start difference. First operand has 65 places, 48 transitions, 114 flow. Second operand 4 states and 192 transitions. [2023-11-29 04:08:45,629 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 78 transitions, 302 flow [2023-11-29 04:08:45,630 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 78 transitions, 287 flow, removed 0 selfloop flow, removed 5 redundant places. [2023-11-29 04:08:45,632 INFO L231 Difference]: Finished difference. Result has 63 places, 52 transitions, 147 flow [2023-11-29 04:08:45,632 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 04:08:45,633 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -11 predicate places. [2023-11-29 04:08:45,633 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 52 transitions, 147 flow [2023-11-29 04:08:45,633 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.75) internal successors, (147), 4 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:08:45,633 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:08:45,633 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:08:45,634 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-29 04:08:45,634 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 04:08:45,634 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:08:45,634 INFO L85 PathProgramCache]: Analyzing trace with hash -1564534999, now seen corresponding path program 1 times [2023-11-29 04:08:45,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:08:45,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719119355] [2023-11-29 04:08:45,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:08:45,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:08:45,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:08:45,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:08:45,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:08:45,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719119355] [2023-11-29 04:08:45,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719119355] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:08:45,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:08:45,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 04:08:45,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889266449] [2023-11-29 04:08:45,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:08:45,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 04:08:45,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:08:45,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 04:08:45,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-29 04:08:45,911 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 67 [2023-11-29 04:08:45,911 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 52 transitions, 147 flow. Second operand has 5 states, 5 states have (on average 36.4) internal successors, (182), 5 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:08:45,912 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:08:45,912 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 67 [2023-11-29 04:08:45,912 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:08:47,116 INFO L124 PetriNetUnfolderBase]: 6173/9290 cut-off events. [2023-11-29 04:08:47,116 INFO L125 PetriNetUnfolderBase]: For 2252/2252 co-relation queries the response was YES. [2023-11-29 04:08:47,136 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21064 conditions, 9290 events. 6173/9290 cut-off events. For 2252/2252 co-relation queries the response was YES. Maximal size of possible extension queue 570. Compared 60227 event pairs, 369 based on Foata normal form. 296/9387 useless extension candidates. Maximal degree in co-relation 21051. Up to 4681 conditions per place. [2023-11-29 04:08:47,164 INFO L140 encePairwiseOnDemand]: 60/67 looper letters, 65 selfloop transitions, 10 changer transitions 1/96 dead transitions. [2023-11-29 04:08:47,164 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 96 transitions, 416 flow [2023-11-29 04:08:47,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 04:08:47,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-29 04:08:47,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 243 transitions. [2023-11-29 04:08:47,165 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7253731343283583 [2023-11-29 04:08:47,165 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 243 transitions. [2023-11-29 04:08:47,165 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 243 transitions. [2023-11-29 04:08:47,166 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:08:47,166 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 243 transitions. [2023-11-29 04:08:47,167 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 48.6) internal successors, (243), 5 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:08:47,168 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 04:08:47,168 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 04:08:47,168 INFO L175 Difference]: Start difference. First operand has 63 places, 52 transitions, 147 flow. Second operand 5 states and 243 transitions. [2023-11-29 04:08:47,168 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 96 transitions, 416 flow [2023-11-29 04:08:47,170 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 96 transitions, 405 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-11-29 04:08:47,172 INFO L231 Difference]: Finished difference. Result has 67 places, 56 transitions, 199 flow [2023-11-29 04:08:47,172 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 04:08:47,172 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -7 predicate places. [2023-11-29 04:08:47,173 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 56 transitions, 199 flow [2023-11-29 04:08:47,173 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 36.4) internal successors, (182), 5 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:08:47,173 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:08:47,173 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:08:47,173 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-29 04:08:47,173 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 04:08:47,174 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:08:47,174 INFO L85 PathProgramCache]: Analyzing trace with hash 391951632, now seen corresponding path program 1 times [2023-11-29 04:08:47,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:08:47,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207848120] [2023-11-29 04:08:47,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:08:47,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:08:47,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:08:47,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:08:47,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:08:47,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207848120] [2023-11-29 04:08:47,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207848120] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:08:47,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:08:47,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 04:08:47,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833809572] [2023-11-29 04:08:47,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:08:47,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 04:08:47,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:08:47,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 04:08:47,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-29 04:08:47,393 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 67 [2023-11-29 04:08:47,394 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 56 transitions, 199 flow. Second operand has 6 states, 6 states have (on average 36.333333333333336) internal successors, (218), 6 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:08:47,394 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:08:47,394 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 67 [2023-11-29 04:08:47,394 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:08:48,055 INFO L124 PetriNetUnfolderBase]: 3825/5774 cut-off events. [2023-11-29 04:08:48,055 INFO L125 PetriNetUnfolderBase]: For 4281/4281 co-relation queries the response was YES. [2023-11-29 04:08:48,063 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14674 conditions, 5774 events. 3825/5774 cut-off events. For 4281/4281 co-relation queries the response was YES. Maximal size of possible extension queue 245. Compared 33453 event pairs, 221 based on Foata normal form. 208/5818 useless extension candidates. Maximal degree in co-relation 14659. Up to 1801 conditions per place. [2023-11-29 04:08:48,075 INFO L140 encePairwiseOnDemand]: 60/67 looper letters, 77 selfloop transitions, 14 changer transitions 1/112 dead transitions. [2023-11-29 04:08:48,075 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 112 transitions, 543 flow [2023-11-29 04:08:48,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 04:08:48,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 04:08:48,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 292 transitions. [2023-11-29 04:08:48,077 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7263681592039801 [2023-11-29 04:08:48,077 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 292 transitions. [2023-11-29 04:08:48,077 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 292 transitions. [2023-11-29 04:08:48,077 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:08:48,077 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 292 transitions. [2023-11-29 04:08:48,078 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 48.666666666666664) internal successors, (292), 6 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:08:48,079 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 04:08:48,079 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 04:08:48,079 INFO L175 Difference]: Start difference. First operand has 67 places, 56 transitions, 199 flow. Second operand 6 states and 292 transitions. [2023-11-29 04:08:48,079 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 112 transitions, 543 flow [2023-11-29 04:08:48,096 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 112 transitions, 513 flow, removed 5 selfloop flow, removed 4 redundant places. [2023-11-29 04:08:48,098 INFO L231 Difference]: Finished difference. Result has 70 places, 60 transitions, 249 flow [2023-11-29 04:08:48,098 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 04:08:48,099 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -4 predicate places. [2023-11-29 04:08:48,099 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 60 transitions, 249 flow [2023-11-29 04:08:48,099 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 36.333333333333336) internal successors, (218), 6 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:08:48,099 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:08:48,100 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:08:48,100 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-29 04:08:48,100 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 04:08:48,100 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:08:48,100 INFO L85 PathProgramCache]: Analyzing trace with hash 867935833, now seen corresponding path program 1 times [2023-11-29 04:08:48,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:08:48,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79242275] [2023-11-29 04:08:48,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:08:48,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:08:48,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:08:48,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:08:48,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:08:48,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79242275] [2023-11-29 04:08:48,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79242275] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:08:48,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:08:48,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 04:08:48,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752915657] [2023-11-29 04:08:48,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:08:48,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 04:08:48,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:08:48,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 04:08:48,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-29 04:08:48,326 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 67 [2023-11-29 04:08:48,327 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 60 transitions, 249 flow. Second operand has 7 states, 7 states have (on average 36.142857142857146) internal successors, (253), 7 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:08:48,327 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:08:48,327 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 67 [2023-11-29 04:08:48,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:08:48,901 INFO L124 PetriNetUnfolderBase]: 2457/3638 cut-off events. [2023-11-29 04:08:48,901 INFO L125 PetriNetUnfolderBase]: For 4281/4281 co-relation queries the response was YES. [2023-11-29 04:08:48,910 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10155 conditions, 3638 events. 2457/3638 cut-off events. For 4281/4281 co-relation queries the response was YES. Maximal size of possible extension queue 180. Compared 18995 event pairs, 173 based on Foata normal form. 88/3569 useless extension candidates. Maximal degree in co-relation 10139. Up to 1088 conditions per place. [2023-11-29 04:08:48,922 INFO L140 encePairwiseOnDemand]: 60/67 looper letters, 69 selfloop transitions, 18 changer transitions 1/108 dead transitions. [2023-11-29 04:08:48,922 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 108 transitions, 537 flow [2023-11-29 04:08:48,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 04:08:48,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-29 04:08:48,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 321 transitions. [2023-11-29 04:08:48,924 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6844349680170576 [2023-11-29 04:08:48,925 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 321 transitions. [2023-11-29 04:08:48,925 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 321 transitions. [2023-11-29 04:08:48,925 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:08:48,925 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 321 transitions. [2023-11-29 04:08:48,926 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 45.857142857142854) internal successors, (321), 7 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:08:48,927 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 04:08:48,928 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 04:08:48,928 INFO L175 Difference]: Start difference. First operand has 70 places, 60 transitions, 249 flow. Second operand 7 states and 321 transitions. [2023-11-29 04:08:48,928 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 108 transitions, 537 flow [2023-11-29 04:08:48,958 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 108 transitions, 491 flow, removed 9 selfloop flow, removed 5 redundant places. [2023-11-29 04:08:48,960 INFO L231 Difference]: Finished difference. Result has 73 places, 60 transitions, 259 flow [2023-11-29 04:08:48,960 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 04:08:48,961 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -1 predicate places. [2023-11-29 04:08:48,961 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 60 transitions, 259 flow [2023-11-29 04:08:48,961 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 36.142857142857146) internal successors, (253), 7 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:08:48,961 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:08:48,961 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 04:08:48,962 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-29 04:08:48,962 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 04:08:48,962 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:08:48,962 INFO L85 PathProgramCache]: Analyzing trace with hash -1752490468, now seen corresponding path program 1 times [2023-11-29 04:08:48,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:08:48,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567387087] [2023-11-29 04:08:48,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:08:48,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:08:49,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:08:49,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:08:49,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:08:49,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567387087] [2023-11-29 04:08:49,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567387087] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:08:49,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:08:49,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 04:08:49,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159926060] [2023-11-29 04:08:49,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:08:49,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 04:08:49,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:08:49,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 04:08:49,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-29 04:08:49,569 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 67 [2023-11-29 04:08:49,570 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 60 transitions, 259 flow. Second operand has 7 states, 7 states have (on average 35.57142857142857) internal successors, (249), 7 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:08:49,570 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:08:49,570 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 67 [2023-11-29 04:08:49,570 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:08:50,653 INFO L124 PetriNetUnfolderBase]: 6026/9358 cut-off events. [2023-11-29 04:08:50,653 INFO L125 PetriNetUnfolderBase]: For 3656/3878 co-relation queries the response was YES. [2023-11-29 04:08:50,682 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21662 conditions, 9358 events. 6026/9358 cut-off events. For 3656/3878 co-relation queries the response was YES. Maximal size of possible extension queue 456. Compared 59907 event pairs, 1316 based on Foata normal form. 16/9066 useless extension candidates. Maximal degree in co-relation 21645. Up to 4503 conditions per place. [2023-11-29 04:08:50,697 INFO L140 encePairwiseOnDemand]: 57/67 looper letters, 43 selfloop transitions, 5 changer transitions 45/124 dead transitions. [2023-11-29 04:08:50,697 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 124 transitions, 602 flow [2023-11-29 04:08:50,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 04:08:50,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-29 04:08:50,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 350 transitions. [2023-11-29 04:08:50,699 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6529850746268657 [2023-11-29 04:08:50,699 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 350 transitions. [2023-11-29 04:08:50,699 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 350 transitions. [2023-11-29 04:08:50,700 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:08:50,700 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 350 transitions. [2023-11-29 04:08:50,701 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 43.75) internal successors, (350), 8 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:08:50,703 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 04:08:50,703 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 04:08:50,703 INFO L175 Difference]: Start difference. First operand has 73 places, 60 transitions, 259 flow. Second operand 8 states and 350 transitions. [2023-11-29 04:08:50,703 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 124 transitions, 602 flow [2023-11-29 04:08:50,791 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 124 transitions, 496 flow, removed 22 selfloop flow, removed 10 redundant places. [2023-11-29 04:08:50,792 INFO L231 Difference]: Finished difference. Result has 76 places, 63 transitions, 207 flow [2023-11-29 04:08:50,792 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=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=207, PETRI_PLACES=76, PETRI_TRANSITIONS=63} [2023-11-29 04:08:50,793 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 2 predicate places. [2023-11-29 04:08:50,793 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 63 transitions, 207 flow [2023-11-29 04:08:50,793 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 35.57142857142857) internal successors, (249), 7 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:08:50,793 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:08:50,793 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 04:08:50,793 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-29 04:08:50,794 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 04:08:50,794 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:08:50,794 INFO L85 PathProgramCache]: Analyzing trace with hash 1754123270, now seen corresponding path program 2 times [2023-11-29 04:08:50,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:08:50,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033049267] [2023-11-29 04:08:50,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:08:50,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:08:50,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:08:51,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:08:51,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:08:51,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033049267] [2023-11-29 04:08:51,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033049267] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:08:51,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:08:51,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 04:08:51,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774151421] [2023-11-29 04:08:51,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:08:51,359 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 04:08:51,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:08:51,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 04:08:51,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-29 04:08:51,405 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 67 [2023-11-29 04:08:51,406 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 63 transitions, 207 flow. Second operand has 7 states, 7 states have (on average 35.57142857142857) internal successors, (249), 7 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:08:51,406 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:08:51,406 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 67 [2023-11-29 04:08:51,406 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:08:52,457 INFO L124 PetriNetUnfolderBase]: 5199/8264 cut-off events. [2023-11-29 04:08:52,457 INFO L125 PetriNetUnfolderBase]: For 2541/2544 co-relation queries the response was YES. [2023-11-29 04:08:52,484 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19310 conditions, 8264 events. 5199/8264 cut-off events. For 2541/2544 co-relation queries the response was YES. Maximal size of possible extension queue 471. Compared 55154 event pairs, 856 based on Foata normal form. 18/7931 useless extension candidates. Maximal degree in co-relation 19292. Up to 3467 conditions per place. [2023-11-29 04:08:52,494 INFO L140 encePairwiseOnDemand]: 58/67 looper letters, 41 selfloop transitions, 4 changer transitions 32/108 dead transitions. [2023-11-29 04:08:52,495 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 108 transitions, 488 flow [2023-11-29 04:08:52,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 04:08:52,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-29 04:08:52,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 334 transitions. [2023-11-29 04:08:52,496 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6231343283582089 [2023-11-29 04:08:52,496 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 334 transitions. [2023-11-29 04:08:52,496 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 334 transitions. [2023-11-29 04:08:52,497 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:08:52,497 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 334 transitions. [2023-11-29 04:08:52,498 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 41.75) internal successors, (334), 8 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:08:52,498 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 04:08:52,499 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 04:08:52,499 INFO L175 Difference]: Start difference. First operand has 76 places, 63 transitions, 207 flow. Second operand 8 states and 334 transitions. [2023-11-29 04:08:52,499 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 108 transitions, 488 flow [2023-11-29 04:08:52,502 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 108 transitions, 478 flow, removed 5 selfloop flow, removed 3 redundant places. [2023-11-29 04:08:52,503 INFO L231 Difference]: Finished difference. Result has 80 places, 62 transitions, 212 flow [2023-11-29 04:08:52,503 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=201, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=212, PETRI_PLACES=80, PETRI_TRANSITIONS=62} [2023-11-29 04:08:52,504 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 6 predicate places. [2023-11-29 04:08:52,504 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 62 transitions, 212 flow [2023-11-29 04:08:52,504 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 35.57142857142857) internal successors, (249), 7 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:08:52,504 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:08:52,504 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 04:08:52,504 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-29 04:08:52,504 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 04:08:52,504 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:08:52,505 INFO L85 PathProgramCache]: Analyzing trace with hash 2096969698, now seen corresponding path program 3 times [2023-11-29 04:08:52,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:08:52,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511306491] [2023-11-29 04:08:52,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:08:52,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:08:52,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:08:54,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:08:54,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:08:54,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511306491] [2023-11-29 04:08:54,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511306491] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:08:54,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:08:54,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-29 04:08:54,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468716378] [2023-11-29 04:08:54,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:08:54,010 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-29 04:08:54,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:08:54,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-29 04:08:54,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2023-11-29 04:08:54,026 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 67 [2023-11-29 04:08:54,027 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 62 transitions, 212 flow. Second operand has 12 states, 12 states have (on average 38.666666666666664) internal successors, (464), 12 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:08:54,027 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:08:54,027 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 67 [2023-11-29 04:08:54,027 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:08:54,998 INFO L124 PetriNetUnfolderBase]: 3468/5819 cut-off events. [2023-11-29 04:08:54,998 INFO L125 PetriNetUnfolderBase]: For 883/997 co-relation queries the response was YES. [2023-11-29 04:08:55,016 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12927 conditions, 5819 events. 3468/5819 cut-off events. For 883/997 co-relation queries the response was YES. Maximal size of possible extension queue 352. Compared 39545 event pairs, 984 based on Foata normal form. 39/5276 useless extension candidates. Maximal degree in co-relation 12906. Up to 2913 conditions per place. [2023-11-29 04:08:55,026 INFO L140 encePairwiseOnDemand]: 57/67 looper letters, 60 selfloop transitions, 13 changer transitions 14/124 dead transitions. [2023-11-29 04:08:55,026 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 124 transitions, 544 flow [2023-11-29 04:08:55,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 04:08:55,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-29 04:08:55,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 420 transitions. [2023-11-29 04:08:55,028 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6965174129353234 [2023-11-29 04:08:55,028 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 420 transitions. [2023-11-29 04:08:55,028 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 420 transitions. [2023-11-29 04:08:55,029 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:08:55,029 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 420 transitions. [2023-11-29 04:08:55,030 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 46.666666666666664) internal successors, (420), 9 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:08:55,032 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 67.0) internal successors, (670), 10 states have internal predecessors, (670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:08:55,032 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 67.0) internal successors, (670), 10 states have internal predecessors, (670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:08:55,032 INFO L175 Difference]: Start difference. First operand has 80 places, 62 transitions, 212 flow. Second operand 9 states and 420 transitions. [2023-11-29 04:08:55,032 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 124 transitions, 544 flow [2023-11-29 04:08:55,036 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 124 transitions, 531 flow, removed 5 selfloop flow, removed 4 redundant places. [2023-11-29 04:08:55,038 INFO L231 Difference]: Finished difference. Result has 86 places, 73 transitions, 299 flow [2023-11-29 04:08:55,038 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=203, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=299, PETRI_PLACES=86, PETRI_TRANSITIONS=73} [2023-11-29 04:08:55,038 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 12 predicate places. [2023-11-29 04:08:55,038 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 73 transitions, 299 flow [2023-11-29 04:08:55,039 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 38.666666666666664) internal successors, (464), 12 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:08:55,039 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:08:55,039 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 04:08:55,039 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-29 04:08:55,039 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 04:08:55,040 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:08:55,040 INFO L85 PathProgramCache]: Analyzing trace with hash 2011070890, now seen corresponding path program 4 times [2023-11-29 04:08:55,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:08:55,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707224564] [2023-11-29 04:08:55,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:08:55,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:08:55,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:08:55,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:08:55,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:08:55,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707224564] [2023-11-29 04:08:55,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707224564] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:08:55,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:08:55,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 04:08:55,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072644088] [2023-11-29 04:08:55,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:08:55,553 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 04:08:55,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:08:55,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 04:08:55,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-29 04:08:55,599 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 67 [2023-11-29 04:08:55,599 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 73 transitions, 299 flow. Second operand has 7 states, 7 states have (on average 35.57142857142857) internal successors, (249), 7 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:08:55,599 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:08:55,599 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 67 [2023-11-29 04:08:55,599 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:08:57,280 INFO L124 PetriNetUnfolderBase]: 8683/13956 cut-off events. [2023-11-29 04:08:57,280 INFO L125 PetriNetUnfolderBase]: For 9660/9812 co-relation queries the response was YES. [2023-11-29 04:08:57,327 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37214 conditions, 13956 events. 8683/13956 cut-off events. For 9660/9812 co-relation queries the response was YES. Maximal size of possible extension queue 792. Compared 104441 event pairs, 2032 based on Foata normal form. 32/13212 useless extension candidates. Maximal degree in co-relation 37189. Up to 5776 conditions per place. [2023-11-29 04:08:57,336 INFO L140 encePairwiseOnDemand]: 59/67 looper letters, 35 selfloop transitions, 3 changer transitions 55/124 dead transitions. [2023-11-29 04:08:57,336 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 124 transitions, 653 flow [2023-11-29 04:08:57,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 04:08:57,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-29 04:08:57,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 337 transitions. [2023-11-29 04:08:57,338 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.628731343283582 [2023-11-29 04:08:57,338 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 337 transitions. [2023-11-29 04:08:57,339 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 337 transitions. [2023-11-29 04:08:57,339 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:08:57,339 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 337 transitions. [2023-11-29 04:08:57,340 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 42.125) internal successors, (337), 8 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 04:08:57,341 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 04:08:57,341 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 04:08:57,341 INFO L175 Difference]: Start difference. First operand has 86 places, 73 transitions, 299 flow. Second operand 8 states and 337 transitions. [2023-11-29 04:08:57,341 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 124 transitions, 653 flow [2023-11-29 04:08:57,346 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 124 transitions, 647 flow, removed 3 selfloop flow, removed 2 redundant places. [2023-11-29 04:08:57,347 INFO L231 Difference]: Finished difference. Result has 93 places, 61 transitions, 235 flow [2023-11-29 04:08:57,348 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=295, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=235, PETRI_PLACES=93, PETRI_TRANSITIONS=61} [2023-11-29 04:08:57,348 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 19 predicate places. [2023-11-29 04:08:57,348 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 61 transitions, 235 flow [2023-11-29 04:08:57,348 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 35.57142857142857) internal successors, (249), 7 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:08:57,348 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:08:57,348 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 04:08:57,348 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-29 04:08:57,348 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 04:08:57,349 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:08:57,349 INFO L85 PathProgramCache]: Analyzing trace with hash -484826988, now seen corresponding path program 5 times [2023-11-29 04:08:57,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:08:57,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725851337] [2023-11-29 04:08:57,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:08:57,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:08:57,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 04:08:57,412 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 04:08:57,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 04:08:57,506 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 04:08:57,507 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-29 04:08:57,508 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2023-11-29 04:08:57,509 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2023-11-29 04:08:57,509 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2023-11-29 04:08:57,510 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2023-11-29 04:08:57,510 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2023-11-29 04:08:57,510 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2023-11-29 04:08:57,510 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2023-11-29 04:08:57,510 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2023-11-29 04:08:57,510 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2023-11-29 04:08:57,511 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2023-11-29 04:08:57,511 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2023-11-29 04:08:57,511 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2023-11-29 04:08:57,511 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2023-11-29 04:08:57,511 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2023-11-29 04:08:57,511 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2023-11-29 04:08:57,511 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2023-11-29 04:08:57,512 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-29 04:08:57,512 INFO L445 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:08:57,518 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-29 04:08:57,518 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 04:08:57,578 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre3 could not be translated [2023-11-29 04:08:57,580 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-29 04:08:57,581 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-29 04:08:57,582 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-29 04:08:57,596 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-29 04:08:57,597 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-29 04:08:57,611 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 04:08:57 BasicIcfg [2023-11-29 04:08:57,611 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 04:08:57,611 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 04:08:57,611 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 04:08:57,612 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 04:08:57,612 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 04:08:33" (3/4) ... [2023-11-29 04:08:57,614 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-29 04:08:57,615 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 04:08:57,616 INFO L158 Benchmark]: Toolchain (without parser) took 25635.00ms. Allocated memory was 142.6MB in the beginning and 2.0GB in the end (delta: 1.8GB). Free memory was 103.4MB in the beginning and 1.6GB in the end (delta: -1.5GB). Peak memory consumption was 305.2MB. Max. memory is 16.1GB. [2023-11-29 04:08:57,616 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 142.6MB. Free memory is still 115.9MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 04:08:57,616 INFO L158 Benchmark]: CACSL2BoogieTranslator took 491.16ms. Allocated memory is still 142.6MB. Free memory was 103.4MB in the beginning and 78.9MB in the end (delta: 24.5MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-11-29 04:08:57,616 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.87ms. Allocated memory is still 142.6MB. Free memory was 78.9MB in the beginning and 76.2MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-29 04:08:57,617 INFO L158 Benchmark]: Boogie Preprocessor took 56.68ms. Allocated memory is still 142.6MB. Free memory was 76.2MB in the beginning and 72.4MB in the end (delta: 3.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 04:08:57,617 INFO L158 Benchmark]: RCFGBuilder took 756.56ms. Allocated memory was 142.6MB in the beginning and 172.0MB in the end (delta: 29.4MB). Free memory was 72.4MB in the beginning and 103.1MB in the end (delta: -30.7MB). Peak memory consumption was 31.3MB. Max. memory is 16.1GB. [2023-11-29 04:08:57,617 INFO L158 Benchmark]: TraceAbstraction took 24269.81ms. Allocated memory was 172.0MB in the beginning and 2.0GB in the end (delta: 1.8GB). Free memory was 102.2MB in the beginning and 1.6GB in the end (delta: -1.5GB). Peak memory consumption was 273.9MB. Max. memory is 16.1GB. [2023-11-29 04:08:57,618 INFO L158 Benchmark]: Witness Printer took 3.60ms. Allocated memory is still 2.0GB. Free memory is still 1.6GB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 04:08:57,619 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.19ms. Allocated memory is still 142.6MB. Free memory is still 115.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 491.16ms. Allocated memory is still 142.6MB. Free memory was 103.4MB in the beginning and 78.9MB in the end (delta: 24.5MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.87ms. Allocated memory is still 142.6MB. Free memory was 78.9MB in the beginning and 76.2MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 56.68ms. Allocated memory is still 142.6MB. Free memory was 76.2MB in the beginning and 72.4MB in the end (delta: 3.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 756.56ms. Allocated memory was 142.6MB in the beginning and 172.0MB in the end (delta: 29.4MB). Free memory was 72.4MB in the beginning and 103.1MB in the end (delta: -30.7MB). Peak memory consumption was 31.3MB. Max. memory is 16.1GB. * TraceAbstraction took 24269.81ms. Allocated memory was 172.0MB in the beginning and 2.0GB in the end (delta: 1.8GB). Free memory was 102.2MB in the beginning and 1.6GB in the end (delta: -1.5GB). Peak memory consumption was 273.9MB. Max. memory is 16.1GB. * Witness Printer took 3.60ms. Allocated memory is still 2.0GB. Free memory is still 1.6GB. 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_p1_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p2_EBX = 0; [L718] 0 int __unbuffered_p3_EAX = 0; [L720] 0 int __unbuffered_p3_EBX = 0; [L722] 0 int a = 0; [L723] 0 _Bool main$tmp_guard0; [L724] 0 _Bool main$tmp_guard1; [L726] 0 int x = 0; [L727] 0 _Bool x$flush_delayed; [L728] 0 int x$mem_tmp; [L729] 0 _Bool x$r_buff0_thd0; [L730] 0 _Bool x$r_buff0_thd1; [L731] 0 _Bool x$r_buff0_thd2; [L732] 0 _Bool x$r_buff0_thd3; [L733] 0 _Bool x$r_buff0_thd4; [L734] 0 _Bool x$r_buff1_thd0; [L735] 0 _Bool x$r_buff1_thd1; [L736] 0 _Bool x$r_buff1_thd2; [L737] 0 _Bool x$r_buff1_thd3; [L738] 0 _Bool x$r_buff1_thd4; [L739] 0 _Bool x$read_delayed; [L740] 0 int *x$read_delayed_var; [L741] 0 int x$w_buff0; [L742] 0 _Bool x$w_buff0_used; [L743] 0 int x$w_buff1; [L744] 0 _Bool x$w_buff1_used; [L746] 0 int y = 0; [L748] 0 int z = 0; [L749] 0 _Bool weak$$choice0; [L750] 0 _Bool weak$$choice2; [L858] 0 pthread_t t145; [L859] FCALL, FORK 0 pthread_create(&t145, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t145={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L860] 0 pthread_t t146; [L861] FCALL, FORK 0 pthread_create(&t146, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t145={5:0}, t146={6:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L862] 0 pthread_t t147; [L863] FCALL, FORK 0 pthread_create(&t147, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t145={5:0}, t146={6:0}, t147={7:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L864] 0 pthread_t t148; [L865] FCALL, FORK 0 pthread_create(&t148, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t145={5:0}, t146={6:0}, t147={7:0}, t148={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L774] 2 x$w_buff1 = x$w_buff0 [L775] 2 x$w_buff0 = 2 [L776] 2 x$w_buff1_used = x$w_buff0_used [L777] 2 x$w_buff0_used = (_Bool)1 [L778] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L778] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L779] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L780] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L781] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L782] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L783] 2 x$r_buff1_thd4 = x$r_buff0_thd4 [L784] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L787] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L804] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L807] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L810] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L827] 4 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L830] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L813] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L814] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L815] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L816] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L817] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L833] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L754] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L757] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L760] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L761] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L762] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L763] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L764] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L790] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L791] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L792] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L793] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L794] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L836] 4 x = x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L837] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L838] 4 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L839] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L840] 4 x$r_buff1_thd4 = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L797] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L767] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L820] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L843] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L867] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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}, main$tmp_guard0=1, main$tmp_guard1=0, t145={5:0}, t146={6:0}, t147={7:0}, t148={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L869] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L869] RET 0 assume_abort_if_not(main$tmp_guard0) [L871] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L872] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L873] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L874] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L875] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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}, main$tmp_guard0=1, main$tmp_guard1=0, t145={5:0}, t146={6:0}, t147={7:0}, t148={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L878] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L879] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L880] 0 x$flush_delayed = weak$$choice2 [L881] 0 x$mem_tmp = x [L882] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L883] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L884] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L885] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L886] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L887] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L888] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L889] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L890] 0 x = x$flush_delayed ? x$mem_tmp : x [L891] 0 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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}, main$tmp_guard0=1, main$tmp_guard1=0, t145={5:0}, t146={6:0}, t147={7:0}, t148={3:0}, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L893] 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_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L17] 0 __assert_fail ("0", "mix005_tso.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] - 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: 856]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 863]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 865]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 861]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 859]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - 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: 24.1s, OverallIterations: 19, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 18.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1270 SdHoareTripleChecker+Valid, 3.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1076 mSDsluCounter, 344 SdHoareTripleChecker+Invalid, 2.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 295 mSDsCounter, 79 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2978 IncrementalHoareTripleChecker+Invalid, 3057 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 79 mSolverCounterUnsat, 49 mSDtfsCounter, 2978 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 104 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=299occurred in iteration=17, InterpolantAutomatonStates: 90, 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.5s SatisfiabilityAnalysisTime, 4.9s InterpolantComputationTime, 411 NumberOfCodeBlocks, 411 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 350 ConstructedInterpolants, 0 QuantifiedInterpolants, 2726 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 04:08:57,642 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d1b734a-1438-43b0-9e46-bcedf1f105bb/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 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_6d1b734a-1438-43b0-9e46-bcedf1f105bb/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d1b734a-1438-43b0-9e46-bcedf1f105bb/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_6d1b734a-1438-43b0-9e46-bcedf1f105bb/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d1b734a-1438-43b0-9e46-bcedf1f105bb/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix005_tso.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d1b734a-1438-43b0-9e46-bcedf1f105bb/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_6d1b734a-1438-43b0-9e46-bcedf1f105bb/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 c22ca6d642b28badc1dc02a5cc527ddbb1f35b5d6d2e3ba3e8f314e81f0fd465 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 04:08:59,607 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 04:08:59,682 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d1b734a-1438-43b0-9e46-bcedf1f105bb/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-11-29 04:08:59,698 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 04:08:59,699 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 04:08:59,727 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 04:08:59,728 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 04:08:59,728 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 04:08:59,729 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 04:08:59,730 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 04:08:59,730 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 04:08:59,731 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 04:08:59,732 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 04:08:59,732 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 04:08:59,733 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 04:08:59,734 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 04:08:59,734 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 04:08:59,735 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 04:08:59,735 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 04:08:59,736 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 04:08:59,736 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-29 04:08:59,737 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-29 04:08:59,738 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-29 04:08:59,738 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 04:08:59,738 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 04:08:59,739 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-29 04:08:59,739 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-29 04:08:59,740 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 04:08:59,740 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 04:08:59,740 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 04:08:59,741 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 04:08:59,741 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 04:08:59,742 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 04:08:59,742 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 04:08:59,742 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 04:08:59,742 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 04:08:59,743 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 04:08:59,743 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-29 04:08:59,743 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-29 04:08:59,744 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 04:08:59,744 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 04:08:59,744 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 04:08:59,744 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 04:08:59,744 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-29 04:08:59,745 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_6d1b734a-1438-43b0-9e46-bcedf1f105bb/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_6d1b734a-1438-43b0-9e46-bcedf1f105bb/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 -> c22ca6d642b28badc1dc02a5cc527ddbb1f35b5d6d2e3ba3e8f314e81f0fd465 [2023-11-29 04:09:00,029 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 04:09:00,049 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 04:09:00,051 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 04:09:00,053 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 04:09:00,053 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 04:09:00,054 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d1b734a-1438-43b0-9e46-bcedf1f105bb/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/pthread-wmm/mix005_tso.oepc.i [2023-11-29 04:09:02,856 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 04:09:03,130 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 04:09:03,131 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d1b734a-1438-43b0-9e46-bcedf1f105bb/sv-benchmarks/c/pthread-wmm/mix005_tso.oepc.i [2023-11-29 04:09:03,148 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d1b734a-1438-43b0-9e46-bcedf1f105bb/bin/uautomizer-verify-BQ2R08f2Ya/data/ba860c0f6/0c75576fc4674582ac0b232b8f02a135/FLAGbde18f396 [2023-11-29 04:09:03,163 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d1b734a-1438-43b0-9e46-bcedf1f105bb/bin/uautomizer-verify-BQ2R08f2Ya/data/ba860c0f6/0c75576fc4674582ac0b232b8f02a135 [2023-11-29 04:09:03,166 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 04:09:03,168 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 04:09:03,169 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 04:09:03,169 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 04:09:03,174 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 04:09:03,175 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 04:09:03" (1/1) ... [2023-11-29 04:09:03,176 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ce24db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:09:03, skipping insertion in model container [2023-11-29 04:09:03,176 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 04:09:03" (1/1) ... [2023-11-29 04:09:03,230 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 04:09:03,643 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 04:09:03,659 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 04:09:03,726 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 04:09:03,764 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 04:09:03,764 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 04:09:03,772 INFO L206 MainTranslator]: Completed translation [2023-11-29 04:09:03,772 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:09:03 WrapperNode [2023-11-29 04:09:03,773 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 04:09:03,774 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 04:09:03,774 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 04:09:03,774 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 04:09:03,781 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:09:03" (1/1) ... [2023-11-29 04:09:03,801 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:09:03" (1/1) ... [2023-11-29 04:09:03,830 INFO L138 Inliner]: procedures = 180, calls = 72, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 169 [2023-11-29 04:09:03,831 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 04:09:03,832 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 04:09:03,832 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 04:09:03,832 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 04:09:03,844 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:09:03" (1/1) ... [2023-11-29 04:09:03,844 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:09:03" (1/1) ... [2023-11-29 04:09:03,848 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:09:03" (1/1) ... [2023-11-29 04:09:03,867 INFO L175 MemorySlicer]: Split 6 memory accesses to 5 slices as follows [2, 1, 1, 1, 1]. 33 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0, 0]. The 4 writes are split as follows [0, 1, 1, 1, 1]. [2023-11-29 04:09:03,867 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:09:03" (1/1) ... [2023-11-29 04:09:03,868 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:09:03" (1/1) ... [2023-11-29 04:09:03,879 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:09:03" (1/1) ... [2023-11-29 04:09:03,882 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:09:03" (1/1) ... [2023-11-29 04:09:03,885 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:09:03" (1/1) ... [2023-11-29 04:09:03,888 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:09:03" (1/1) ... [2023-11-29 04:09:03,893 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 04:09:03,894 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 04:09:03,894 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 04:09:03,895 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 04:09:03,896 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:09:03" (1/1) ... [2023-11-29 04:09:03,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 04:09:03,914 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d1b734a-1438-43b0-9e46-bcedf1f105bb/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:09:03,930 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d1b734a-1438-43b0-9e46-bcedf1f105bb/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 04:09:03,937 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d1b734a-1438-43b0-9e46-bcedf1f105bb/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 04:09:03,973 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-29 04:09:03,974 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 04:09:03,974 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 04:09:03,974 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 04:09:03,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-11-29 04:09:03,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-11-29 04:09:03,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2023-11-29 04:09:03,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2023-11-29 04:09:03,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2023-11-29 04:09:03,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-29 04:09:03,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-11-29 04:09:03,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-11-29 04:09:03,976 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2023-11-29 04:09:03,976 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2023-11-29 04:09:03,976 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-29 04:09:03,976 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-29 04:09:03,977 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-29 04:09:03,977 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-29 04:09:03,977 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-29 04:09:03,977 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-29 04:09:03,977 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-11-29 04:09:03,978 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-11-29 04:09:03,978 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-29 04:09:03,978 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 04:09:03,978 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 04:09:03,980 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-29 04:09:04,144 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 04:09:04,146 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 04:09:04,537 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 04:09:04,775 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 04:09:04,775 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-29 04:09:04,776 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 04:09:04 BoogieIcfgContainer [2023-11-29 04:09:04,776 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 04:09:04,778 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 04:09:04,778 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 04:09:04,782 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 04:09:04,782 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 04:09:03" (1/3) ... [2023-11-29 04:09:04,783 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1731358e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 04:09:04, skipping insertion in model container [2023-11-29 04:09:04,783 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:09:03" (2/3) ... [2023-11-29 04:09:04,783 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1731358e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 04:09:04, skipping insertion in model container [2023-11-29 04:09:04,783 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 04:09:04" (3/3) ... [2023-11-29 04:09:04,785 INFO L112 eAbstractionObserver]: Analyzing ICFG mix005_tso.oepc.i [2023-11-29 04:09:04,804 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 04:09:04,805 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2023-11-29 04:09:04,805 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-29 04:09:04,868 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-29 04:09:04,896 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 78 places, 67 transitions, 150 flow [2023-11-29 04:09:04,926 INFO L124 PetriNetUnfolderBase]: 2/63 cut-off events. [2023-11-29 04:09:04,927 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 04:09:04,931 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 6. 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 04:09:04,931 INFO L82 GeneralOperation]: Start removeDead. Operand has 78 places, 67 transitions, 150 flow [2023-11-29 04:09:04,935 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 74 places, 63 transitions, 138 flow [2023-11-29 04:09:04,945 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 04:09:04,951 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;@7a619ec7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 04:09:04,951 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-11-29 04:09:04,954 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-29 04:09:04,955 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-11-29 04:09:04,955 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 04:09:04,955 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:09:04,956 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-29 04:09:04,956 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 04:09:04,961 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:09:04,961 INFO L85 PathProgramCache]: Analyzing trace with hash 14707, now seen corresponding path program 1 times [2023-11-29 04:09:04,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:09:04,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [198604689] [2023-11-29 04:09:04,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:09:04,972 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:09:04,972 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d1b734a-1438-43b0-9e46-bcedf1f105bb/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:09:04,992 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d1b734a-1438-43b0-9e46-bcedf1f105bb/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:09:04,993 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d1b734a-1438-43b0-9e46-bcedf1f105bb/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-11-29 04:09:05,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:09:05,102 INFO L262 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 04:09:05,106 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:09:05,157 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 04:09:05,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:09:05,168 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:09:05,169 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:09:05,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [198604689] [2023-11-29 04:09:05,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [198604689] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:09:05,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:09:05,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 04:09:05,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500953234] [2023-11-29 04:09:05,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:09:05,178 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:09:05,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:09:05,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:09:05,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:09:05,240 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 67 [2023-11-29 04:09:05,243 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 63 transitions, 138 flow. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:09:05,243 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:09:05,244 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 67 [2023-11-29 04:09:05,245 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:09:06,458 INFO L124 PetriNetUnfolderBase]: 3508/6029 cut-off events. [2023-11-29 04:09:06,459 INFO L125 PetriNetUnfolderBase]: For 63/63 co-relation queries the response was YES. [2023-11-29 04:09:06,480 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11014 conditions, 6029 events. 3508/6029 cut-off events. For 63/63 co-relation queries the response was YES. Maximal size of possible extension queue 367. Compared 45136 event pairs, 2752 based on Foata normal form. 270/5714 useless extension candidates. Maximal degree in co-relation 10999. Up to 3825 conditions per place. [2023-11-29 04:09:06,540 INFO L140 encePairwiseOnDemand]: 62/67 looper letters, 35 selfloop transitions, 2 changer transitions 0/69 dead transitions. [2023-11-29 04:09:06,540 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 69 transitions, 224 flow [2023-11-29 04:09:06,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:09:06,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 04:09:06,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 148 transitions. [2023-11-29 04:09:06,552 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.736318407960199 [2023-11-29 04:09:06,553 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 148 transitions. [2023-11-29 04:09:06,553 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 148 transitions. [2023-11-29 04:09:06,554 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:09:06,556 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 148 transitions. [2023-11-29 04:09:06,558 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:09:06,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 04:09:06,562 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 04:09:06,564 INFO L175 Difference]: Start difference. First operand has 74 places, 63 transitions, 138 flow. Second operand 3 states and 148 transitions. [2023-11-29 04:09:06,564 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 69 transitions, 224 flow [2023-11-29 04:09:06,570 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 69 transitions, 220 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-29 04:09:06,573 INFO L231 Difference]: Finished difference. Result has 70 places, 59 transitions, 130 flow [2023-11-29 04:09:06,575 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 04:09:06,578 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -4 predicate places. [2023-11-29 04:09:06,578 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 59 transitions, 130 flow [2023-11-29 04:09:06,578 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:09:06,578 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:09:06,579 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-29 04:09:06,584 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d1b734a-1438-43b0-9e46-bcedf1f105bb/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-11-29 04:09:06,779 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d1b734a-1438-43b0-9e46-bcedf1f105bb/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:09:06,780 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 04:09:06,780 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:09:06,780 INFO L85 PathProgramCache]: Analyzing trace with hash 14708, now seen corresponding path program 1 times [2023-11-29 04:09:06,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:09:06,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2005785743] [2023-11-29 04:09:06,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:09:06,782 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:09:06,782 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d1b734a-1438-43b0-9e46-bcedf1f105bb/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:09:06,783 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d1b734a-1438-43b0-9e46-bcedf1f105bb/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:09:06,784 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d1b734a-1438-43b0-9e46-bcedf1f105bb/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-11-29 04:09:06,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:09:06,864 INFO L262 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 04:09:06,865 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:09:06,874 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 04:09:06,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:09:06,884 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:09:06,884 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:09:06,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2005785743] [2023-11-29 04:09:06,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2005785743] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:09:06,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:09:06,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 04:09:06,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23976635] [2023-11-29 04:09:06,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:09:06,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:09:06,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:09:06,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:09:06,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:09:06,935 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 67 [2023-11-29 04:09:06,936 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 59 transitions, 130 flow. Second operand has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:09:06,936 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:09:06,936 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 67 [2023-11-29 04:09:06,937 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:09:07,881 INFO L124 PetriNetUnfolderBase]: 3508/6028 cut-off events. [2023-11-29 04:09:07,882 INFO L125 PetriNetUnfolderBase]: For 135/135 co-relation queries the response was YES. [2023-11-29 04:09:07,889 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11145 conditions, 6028 events. 3508/6028 cut-off events. For 135/135 co-relation queries the response was YES. Maximal size of possible extension queue 367. Compared 45008 event pairs, 2752 based on Foata normal form. 1/5444 useless extension candidates. Maximal degree in co-relation 11134. Up to 3824 conditions per place. [2023-11-29 04:09:07,922 INFO L140 encePairwiseOnDemand]: 64/67 looper letters, 34 selfloop transitions, 2 changer transitions 0/68 dead transitions. [2023-11-29 04:09:07,923 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 68 transitions, 220 flow [2023-11-29 04:09:07,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:09:07,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 04:09:07,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 148 transitions. [2023-11-29 04:09:07,925 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.736318407960199 [2023-11-29 04:09:07,925 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 148 transitions. [2023-11-29 04:09:07,926 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 148 transitions. [2023-11-29 04:09:07,926 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:09:07,926 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 148 transitions. [2023-11-29 04:09:07,928 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:09:07,929 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 04:09:07,929 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 04:09:07,929 INFO L175 Difference]: Start difference. First operand has 70 places, 59 transitions, 130 flow. Second operand 3 states and 148 transitions. [2023-11-29 04:09:07,930 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 68 transitions, 220 flow [2023-11-29 04:09:07,939 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 68 transitions, 216 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 04:09:07,940 INFO L231 Difference]: Finished difference. Result has 69 places, 58 transitions, 128 flow [2023-11-29 04:09:07,941 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 04:09:07,941 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -5 predicate places. [2023-11-29 04:09:07,941 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 58 transitions, 128 flow [2023-11-29 04:09:07,942 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:09:07,942 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:09:07,942 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-29 04:09:07,944 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d1b734a-1438-43b0-9e46-bcedf1f105bb/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2023-11-29 04:09:08,142 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d1b734a-1438-43b0-9e46-bcedf1f105bb/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:09:08,143 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 04:09:08,143 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:09:08,143 INFO L85 PathProgramCache]: Analyzing trace with hash 438577837, now seen corresponding path program 1 times [2023-11-29 04:09:08,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:09:08,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1989794058] [2023-11-29 04:09:08,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:09:08,144 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:09:08,145 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d1b734a-1438-43b0-9e46-bcedf1f105bb/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:09:08,145 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d1b734a-1438-43b0-9e46-bcedf1f105bb/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:09:08,146 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d1b734a-1438-43b0-9e46-bcedf1f105bb/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-11-29 04:09:08,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:09:08,225 INFO L262 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 04:09:08,226 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:09:08,232 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 04:09:08,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:09:08,238 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:09:08,238 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:09:08,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1989794058] [2023-11-29 04:09:08,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1989794058] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:09:08,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:09:08,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 04:09:08,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32276534] [2023-11-29 04:09:08,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:09:08,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:09:08,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:09:08,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:09:08,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:09:08,273 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 67 [2023-11-29 04:09:08,274 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 58 transitions, 128 flow. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:09:08,274 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:09:08,274 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 67 [2023-11-29 04:09:08,274 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:09:09,089 INFO L124 PetriNetUnfolderBase]: 3510/5981 cut-off events. [2023-11-29 04:09:09,089 INFO L125 PetriNetUnfolderBase]: For 135/135 co-relation queries the response was YES. [2023-11-29 04:09:09,103 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11103 conditions, 5981 events. 3510/5981 cut-off events. For 135/135 co-relation queries the response was YES. Maximal size of possible extension queue 366. Compared 44493 event pairs, 2797 based on Foata normal form. 0/5402 useless extension candidates. Maximal degree in co-relation 11092. Up to 3825 conditions per place. [2023-11-29 04:09:09,137 INFO L140 encePairwiseOnDemand]: 64/67 looper letters, 35 selfloop transitions, 2 changer transitions 0/67 dead transitions. [2023-11-29 04:09:09,137 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 67 transitions, 220 flow [2023-11-29 04:09:09,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:09:09,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 04:09:09,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 146 transitions. [2023-11-29 04:09:09,184 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7263681592039801 [2023-11-29 04:09:09,184 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 146 transitions. [2023-11-29 04:09:09,184 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 146 transitions. [2023-11-29 04:09:09,184 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:09:09,184 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 146 transitions. [2023-11-29 04:09:09,186 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:09:09,187 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 04:09:09,187 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 04:09:09,187 INFO L175 Difference]: Start difference. First operand has 69 places, 58 transitions, 128 flow. Second operand 3 states and 146 transitions. [2023-11-29 04:09:09,188 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 67 transitions, 220 flow [2023-11-29 04:09:09,195 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 67 transitions, 216 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 04:09:09,197 INFO L231 Difference]: Finished difference. Result has 68 places, 57 transitions, 126 flow [2023-11-29 04:09:09,198 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 04:09:09,198 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -6 predicate places. [2023-11-29 04:09:09,199 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 57 transitions, 126 flow [2023-11-29 04:09:09,199 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:09:09,199 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:09:09,199 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-29 04:09:09,202 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d1b734a-1438-43b0-9e46-bcedf1f105bb/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2023-11-29 04:09:09,400 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d1b734a-1438-43b0-9e46-bcedf1f105bb/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:09:09,400 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 04:09:09,401 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:09:09,401 INFO L85 PathProgramCache]: Analyzing trace with hash 438577838, now seen corresponding path program 1 times [2023-11-29 04:09:09,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:09:09,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1749978073] [2023-11-29 04:09:09,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:09:09,403 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:09:09,403 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d1b734a-1438-43b0-9e46-bcedf1f105bb/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:09:09,404 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d1b734a-1438-43b0-9e46-bcedf1f105bb/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:09:09,406 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d1b734a-1438-43b0-9e46-bcedf1f105bb/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-11-29 04:09:09,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:09:09,491 INFO L262 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 04:09:09,492 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:09:09,502 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 04:09:09,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:09:09,511 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:09:09,512 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:09:09,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1749978073] [2023-11-29 04:09:09,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1749978073] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:09:09,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:09:09,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 04:09:09,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620429336] [2023-11-29 04:09:09,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:09:09,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:09:09,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:09:09,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:09:09,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:09:09,560 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 67 [2023-11-29 04:09:09,561 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 57 transitions, 126 flow. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:09:09,561 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:09:09,561 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 67 [2023-11-29 04:09:09,561 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:09:10,360 INFO L124 PetriNetUnfolderBase]: 3508/6022 cut-off events. [2023-11-29 04:09:10,360 INFO L125 PetriNetUnfolderBase]: For 137/137 co-relation queries the response was YES. [2023-11-29 04:09:10,372 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11141 conditions, 6022 events. 3508/6022 cut-off events. For 137/137 co-relation queries the response was YES. Maximal size of possible extension queue 367. Compared 45169 event pairs, 2220 based on Foata normal form. 3/5448 useless extension candidates. Maximal degree in co-relation 11131. Up to 3820 conditions per place. [2023-11-29 04:09:10,395 INFO L140 encePairwiseOnDemand]: 64/67 looper letters, 34 selfloop transitions, 2 changer transitions 0/66 dead transitions. [2023-11-29 04:09:10,396 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 66 transitions, 216 flow [2023-11-29 04:09:10,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:09:10,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 04:09:10,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 148 transitions. [2023-11-29 04:09:10,397 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.736318407960199 [2023-11-29 04:09:10,398 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 148 transitions. [2023-11-29 04:09:10,398 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 148 transitions. [2023-11-29 04:09:10,398 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:09:10,398 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 148 transitions. [2023-11-29 04:09:10,399 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:09:10,400 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 04:09:10,400 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 04:09:10,400 INFO L175 Difference]: Start difference. First operand has 68 places, 57 transitions, 126 flow. Second operand 3 states and 148 transitions. [2023-11-29 04:09:10,400 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 66 transitions, 216 flow [2023-11-29 04:09:10,403 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 66 transitions, 212 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 04:09:10,405 INFO L231 Difference]: Finished difference. Result has 67 places, 56 transitions, 124 flow [2023-11-29 04:09:10,405 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 04:09:10,406 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -7 predicate places. [2023-11-29 04:09:10,406 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 56 transitions, 124 flow [2023-11-29 04:09:10,406 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:09:10,407 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:09:10,407 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:09:10,412 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d1b734a-1438-43b0-9e46-bcedf1f105bb/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 04:09:10,607 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d1b734a-1438-43b0-9e46-bcedf1f105bb/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:09:10,608 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 04:09:10,608 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:09:10,608 INFO L85 PathProgramCache]: Analyzing trace with hash 382273555, now seen corresponding path program 1 times [2023-11-29 04:09:10,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:09:10,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [368867379] [2023-11-29 04:09:10,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:09:10,609 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:09:10,609 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d1b734a-1438-43b0-9e46-bcedf1f105bb/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:09:10,610 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d1b734a-1438-43b0-9e46-bcedf1f105bb/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:09:10,611 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d1b734a-1438-43b0-9e46-bcedf1f105bb/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-11-29 04:09:10,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:09:10,709 INFO L262 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 04:09:10,711 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:09:10,717 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 04:09:10,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:09:10,722 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:09:10,722 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:09:10,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [368867379] [2023-11-29 04:09:10,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [368867379] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:09:10,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:09:10,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 04:09:10,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845003455] [2023-11-29 04:09:10,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:09:10,724 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:09:10,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:09:10,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:09:10,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:09:10,755 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 67 [2023-11-29 04:09:10,755 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 56 transitions, 124 flow. Second operand has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:09:10,755 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:09:10,755 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 67 [2023-11-29 04:09:10,756 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:09:11,419 INFO L124 PetriNetUnfolderBase]: 3530/6029 cut-off events. [2023-11-29 04:09:11,419 INFO L125 PetriNetUnfolderBase]: For 137/137 co-relation queries the response was YES. [2023-11-29 04:09:11,428 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11185 conditions, 6029 events. 3530/6029 cut-off events. For 137/137 co-relation queries the response was YES. Maximal size of possible extension queue 370. Compared 45594 event pairs, 1608 based on Foata normal form. 0/5487 useless extension candidates. Maximal degree in co-relation 11175. Up to 3827 conditions per place. [2023-11-29 04:09:11,450 INFO L140 encePairwiseOnDemand]: 64/67 looper letters, 35 selfloop transitions, 2 changer transitions 0/65 dead transitions. [2023-11-29 04:09:11,450 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 65 transitions, 216 flow [2023-11-29 04:09:11,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:09:11,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 04:09:11,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 146 transitions. [2023-11-29 04:09:11,452 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7263681592039801 [2023-11-29 04:09:11,452 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 146 transitions. [2023-11-29 04:09:11,452 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 146 transitions. [2023-11-29 04:09:11,452 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:09:11,452 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 146 transitions. [2023-11-29 04:09:11,453 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:09:11,454 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 04:09:11,454 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 04:09:11,455 INFO L175 Difference]: Start difference. First operand has 67 places, 56 transitions, 124 flow. Second operand 3 states and 146 transitions. [2023-11-29 04:09:11,455 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 65 transitions, 216 flow [2023-11-29 04:09:11,457 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 65 transitions, 212 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 04:09:11,459 INFO L231 Difference]: Finished difference. Result has 66 places, 55 transitions, 122 flow [2023-11-29 04:09:11,459 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 04:09:11,460 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -8 predicate places. [2023-11-29 04:09:11,460 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 55 transitions, 122 flow [2023-11-29 04:09:11,461 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:09:11,461 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:09:11,461 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:09:11,464 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d1b734a-1438-43b0-9e46-bcedf1f105bb/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2023-11-29 04:09:11,662 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d1b734a-1438-43b0-9e46-bcedf1f105bb/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:09:11,663 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 04:09:11,663 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:09:11,663 INFO L85 PathProgramCache]: Analyzing trace with hash 382273556, now seen corresponding path program 1 times [2023-11-29 04:09:11,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:09:11,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [728443263] [2023-11-29 04:09:11,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:09:11,664 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:09:11,665 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d1b734a-1438-43b0-9e46-bcedf1f105bb/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:09:11,666 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d1b734a-1438-43b0-9e46-bcedf1f105bb/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:09:11,674 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d1b734a-1438-43b0-9e46-bcedf1f105bb/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-11-29 04:09:11,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:09:11,760 INFO L262 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 04:09:11,761 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:09:11,770 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 04:09:11,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:09:11,780 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:09:11,780 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:09:11,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [728443263] [2023-11-29 04:09:11,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [728443263] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:09:11,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:09:11,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 04:09:11,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597862315] [2023-11-29 04:09:11,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:09:11,781 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:09:11,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:09:11,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:09:11,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:09:11,823 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 67 [2023-11-29 04:09:11,823 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 55 transitions, 122 flow. Second operand has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:09:11,823 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:09:11,824 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 67 [2023-11-29 04:09:11,824 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:09:12,450 INFO L124 PetriNetUnfolderBase]: 3508/5917 cut-off events. [2023-11-29 04:09:12,451 INFO L125 PetriNetUnfolderBase]: For 147/147 co-relation queries the response was YES. [2023-11-29 04:09:12,460 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11048 conditions, 5917 events. 3508/5917 cut-off events. For 147/147 co-relation queries the response was YES. Maximal size of possible extension queue 366. Compared 44694 event pairs, 2274 based on Foata normal form. 15/5404 useless extension candidates. Maximal degree in co-relation 11038. Up to 3790 conditions per place. [2023-11-29 04:09:12,485 INFO L140 encePairwiseOnDemand]: 64/67 looper letters, 34 selfloop transitions, 2 changer transitions 0/64 dead transitions. [2023-11-29 04:09:12,485 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 64 transitions, 212 flow [2023-11-29 04:09:12,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:09:12,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 04:09:12,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 148 transitions. [2023-11-29 04:09:12,487 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.736318407960199 [2023-11-29 04:09:12,487 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 148 transitions. [2023-11-29 04:09:12,487 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 148 transitions. [2023-11-29 04:09:12,487 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:09:12,487 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 148 transitions. [2023-11-29 04:09:12,488 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:09:12,489 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 04:09:12,489 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 04:09:12,489 INFO L175 Difference]: Start difference. First operand has 66 places, 55 transitions, 122 flow. Second operand 3 states and 148 transitions. [2023-11-29 04:09:12,490 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 64 transitions, 212 flow [2023-11-29 04:09:12,492 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 64 transitions, 208 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 04:09:12,494 INFO L231 Difference]: Finished difference. Result has 65 places, 54 transitions, 120 flow [2023-11-29 04:09:12,494 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 04:09:12,495 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -9 predicate places. [2023-11-29 04:09:12,495 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 54 transitions, 120 flow [2023-11-29 04:09:12,496 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:09:12,496 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:09:12,496 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:09:12,499 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d1b734a-1438-43b0-9e46-bcedf1f105bb/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2023-11-29 04:09:12,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d1b734a-1438-43b0-9e46-bcedf1f105bb/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:09:12,699 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 04:09:12,699 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:09:12,700 INFO L85 PathProgramCache]: Analyzing trace with hash 382274646, now seen corresponding path program 1 times [2023-11-29 04:09:12,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:09:12,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1790451058] [2023-11-29 04:09:12,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:09:12,700 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:09:12,701 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d1b734a-1438-43b0-9e46-bcedf1f105bb/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:09:12,702 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d1b734a-1438-43b0-9e46-bcedf1f105bb/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:09:12,703 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d1b734a-1438-43b0-9e46-bcedf1f105bb/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-11-29 04:09:12,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:09:12,789 INFO L262 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 04:09:12,790 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:09:12,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:09:12,809 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:09:12,809 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:09:12,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1790451058] [2023-11-29 04:09:12,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1790451058] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:09:12,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:09:12,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 04:09:12,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272697400] [2023-11-29 04:09:12,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:09:12,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:09:12,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:09:12,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:09:12,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:09:12,812 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 67 [2023-11-29 04:09:12,812 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 54 transitions, 120 flow. Second operand has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:09:12,812 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:09:12,812 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 67 [2023-11-29 04:09:12,812 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:09:13,333 INFO L124 PetriNetUnfolderBase]: 2754/4518 cut-off events. [2023-11-29 04:09:13,333 INFO L125 PetriNetUnfolderBase]: For 117/117 co-relation queries the response was YES. [2023-11-29 04:09:13,340 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8574 conditions, 4518 events. 2754/4518 cut-off events. For 117/117 co-relation queries the response was YES. Maximal size of possible extension queue 290. Compared 30906 event pairs, 816 based on Foata normal form. 0/4425 useless extension candidates. Maximal degree in co-relation 8564. Up to 3064 conditions per place. [2023-11-29 04:09:13,351 INFO L140 encePairwiseOnDemand]: 64/67 looper letters, 39 selfloop transitions, 2 changer transitions 2/71 dead transitions. [2023-11-29 04:09:13,351 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 71 transitions, 248 flow [2023-11-29 04:09:13,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:09:13,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 04:09:13,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 158 transitions. [2023-11-29 04:09:13,352 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7860696517412935 [2023-11-29 04:09:13,353 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 158 transitions. [2023-11-29 04:09:13,353 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 158 transitions. [2023-11-29 04:09:13,353 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:09:13,353 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 158 transitions. [2023-11-29 04:09:13,353 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:09:13,354 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 04:09:13,355 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 04:09:13,355 INFO L175 Difference]: Start difference. First operand has 65 places, 54 transitions, 120 flow. Second operand 3 states and 158 transitions. [2023-11-29 04:09:13,355 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 71 transitions, 248 flow [2023-11-29 04:09:13,356 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 71 transitions, 240 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 04:09:13,357 INFO L231 Difference]: Finished difference. Result has 64 places, 52 transitions, 116 flow [2023-11-29 04:09:13,357 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=116, PETRI_PLACES=64, PETRI_TRANSITIONS=52} [2023-11-29 04:09:13,358 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -10 predicate places. [2023-11-29 04:09:13,358 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 52 transitions, 116 flow [2023-11-29 04:09:13,358 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:09:13,358 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:09:13,358 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:09:13,361 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d1b734a-1438-43b0-9e46-bcedf1f105bb/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 04:09:13,558 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d1b734a-1438-43b0-9e46-bcedf1f105bb/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:09:13,559 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 04:09:13,559 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:09:13,559 INFO L85 PathProgramCache]: Analyzing trace with hash -1941348101, now seen corresponding path program 1 times [2023-11-29 04:09:13,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:09:13,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [975936756] [2023-11-29 04:09:13,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:09:13,560 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:09:13,560 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d1b734a-1438-43b0-9e46-bcedf1f105bb/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:09:13,561 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d1b734a-1438-43b0-9e46-bcedf1f105bb/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:09:13,562 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d1b734a-1438-43b0-9e46-bcedf1f105bb/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-11-29 04:09:13,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:09:13,664 INFO L262 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 04:09:13,668 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:09:13,674 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 04:09:13,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:09:13,680 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:09:13,681 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:09:13,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [975936756] [2023-11-29 04:09:13,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [975936756] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:09:13,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:09:13,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 04:09:13,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193229493] [2023-11-29 04:09:13,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:09:13,682 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:09:13,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:09:13,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:09:13,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:09:13,713 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 67 [2023-11-29 04:09:13,713 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 52 transitions, 116 flow. Second operand has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:09:13,714 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:09:13,714 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 67 [2023-11-29 04:09:13,714 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:09:14,316 INFO L124 PetriNetUnfolderBase]: 2532/4332 cut-off events. [2023-11-29 04:09:14,316 INFO L125 PetriNetUnfolderBase]: For 249/249 co-relation queries the response was YES. [2023-11-29 04:09:14,324 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8224 conditions, 4332 events. 2532/4332 cut-off events. For 249/249 co-relation queries the response was YES. Maximal size of possible extension queue 270. Compared 30764 event pairs, 1191 based on Foata normal form. 0/4140 useless extension candidates. Maximal degree in co-relation 8213. Up to 2985 conditions per place. [2023-11-29 04:09:14,339 INFO L140 encePairwiseOnDemand]: 64/67 looper letters, 32 selfloop transitions, 2 changer transitions 0/60 dead transitions. [2023-11-29 04:09:14,339 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 60 transitions, 202 flow [2023-11-29 04:09:14,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:09:14,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 04:09:14,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 143 transitions. [2023-11-29 04:09:14,340 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7114427860696517 [2023-11-29 04:09:14,340 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 143 transitions. [2023-11-29 04:09:14,340 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 143 transitions. [2023-11-29 04:09:14,341 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:09:14,341 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 143 transitions. [2023-11-29 04:09:14,341 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:09:14,342 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 04:09:14,342 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 04:09:14,342 INFO L175 Difference]: Start difference. First operand has 64 places, 52 transitions, 116 flow. Second operand 3 states and 143 transitions. [2023-11-29 04:09:14,342 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 60 transitions, 202 flow [2023-11-29 04:09:14,343 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 60 transitions, 196 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 04:09:14,344 INFO L231 Difference]: Finished difference. Result has 62 places, 51 transitions, 114 flow [2023-11-29 04:09:14,345 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=114, PETRI_PLACES=62, PETRI_TRANSITIONS=51} [2023-11-29 04:09:14,345 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -12 predicate places. [2023-11-29 04:09:14,346 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 51 transitions, 114 flow [2023-11-29 04:09:14,346 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:09:14,346 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:09:14,346 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:09:14,349 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d1b734a-1438-43b0-9e46-bcedf1f105bb/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 04:09:14,546 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d1b734a-1438-43b0-9e46-bcedf1f105bb/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:09:14,547 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 04:09:14,547 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:09:14,547 INFO L85 PathProgramCache]: Analyzing trace with hash -1941348100, now seen corresponding path program 1 times [2023-11-29 04:09:14,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:09:14,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [851703222] [2023-11-29 04:09:14,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:09:14,548 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:09:14,548 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d1b734a-1438-43b0-9e46-bcedf1f105bb/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:09:14,549 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d1b734a-1438-43b0-9e46-bcedf1f105bb/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:09:14,550 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d1b734a-1438-43b0-9e46-bcedf1f105bb/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-11-29 04:09:14,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:09:14,646 INFO L262 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 04:09:14,647 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:09:14,656 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 04:09:14,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:09:14,669 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:09:14,669 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:09:14,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [851703222] [2023-11-29 04:09:14,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [851703222] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:09:14,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:09:14,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 04:09:14,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138978373] [2023-11-29 04:09:14,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:09:14,670 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:09:14,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:09:14,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:09:14,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:09:14,711 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 67 [2023-11-29 04:09:14,711 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 51 transitions, 114 flow. Second operand has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:09:14,711 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:09:14,711 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 67 [2023-11-29 04:09:14,712 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:09:15,282 INFO L124 PetriNetUnfolderBase]: 2457/4221 cut-off events. [2023-11-29 04:09:15,282 INFO L125 PetriNetUnfolderBase]: For 132/132 co-relation queries the response was YES. [2023-11-29 04:09:15,289 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7896 conditions, 4221 events. 2457/4221 cut-off events. For 132/132 co-relation queries the response was YES. Maximal size of possible extension queue 270. Compared 30046 event pairs, 1167 based on Foata normal form. 36/4089 useless extension candidates. Maximal degree in co-relation 7886. Up to 2874 conditions per place. [2023-11-29 04:09:15,303 INFO L140 encePairwiseOnDemand]: 64/67 looper letters, 31 selfloop transitions, 2 changer transitions 0/59 dead transitions. [2023-11-29 04:09:15,303 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 59 transitions, 196 flow [2023-11-29 04:09:15,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:09:15,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 04:09:15,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 145 transitions. [2023-11-29 04:09:15,305 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7213930348258707 [2023-11-29 04:09:15,305 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 145 transitions. [2023-11-29 04:09:15,305 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 145 transitions. [2023-11-29 04:09:15,306 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:09:15,306 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 145 transitions. [2023-11-29 04:09:15,306 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:09:15,307 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 04:09:15,308 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 04:09:15,308 INFO L175 Difference]: Start difference. First operand has 62 places, 51 transitions, 114 flow. Second operand 3 states and 145 transitions. [2023-11-29 04:09:15,308 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 59 transitions, 196 flow [2023-11-29 04:09:15,309 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 59 transitions, 192 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 04:09:15,310 INFO L231 Difference]: Finished difference. Result has 61 places, 50 transitions, 112 flow [2023-11-29 04:09:15,310 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=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=112, PETRI_PLACES=61, PETRI_TRANSITIONS=50} [2023-11-29 04:09:15,311 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -13 predicate places. [2023-11-29 04:09:15,311 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 50 transitions, 112 flow [2023-11-29 04:09:15,312 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:09:15,312 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:09:15,312 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:09:15,315 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d1b734a-1438-43b0-9e46-bcedf1f105bb/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2023-11-29 04:09:15,512 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d1b734a-1438-43b0-9e46-bcedf1f105bb/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:09:15,513 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 04:09:15,513 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:09:15,513 INFO L85 PathProgramCache]: Analyzing trace with hash 1874544419, now seen corresponding path program 1 times [2023-11-29 04:09:15,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:09:15,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [139566813] [2023-11-29 04:09:15,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:09:15,514 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:09:15,514 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d1b734a-1438-43b0-9e46-bcedf1f105bb/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:09:15,515 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d1b734a-1438-43b0-9e46-bcedf1f105bb/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:09:15,516 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d1b734a-1438-43b0-9e46-bcedf1f105bb/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-11-29 04:09:15,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:09:15,629 INFO L262 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 04:09:15,630 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:09:15,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:09:15,664 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:09:15,664 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:09:15,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [139566813] [2023-11-29 04:09:15,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [139566813] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:09:15,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:09:15,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 04:09:15,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715750394] [2023-11-29 04:09:15,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:09:15,665 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 04:09:15,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:09:15,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 04:09:15,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 04:09:15,678 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 67 [2023-11-29 04:09:15,679 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 50 transitions, 112 flow. Second operand has 4 states, 4 states have (on average 36.75) internal successors, (147), 4 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:09:15,679 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:09:15,679 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 67 [2023-11-29 04:09:15,679 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:09:16,868 INFO L124 PetriNetUnfolderBase]: 8909/13434 cut-off events. [2023-11-29 04:09:16,868 INFO L125 PetriNetUnfolderBase]: For 370/370 co-relation queries the response was YES. [2023-11-29 04:09:16,888 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26173 conditions, 13434 events. 8909/13434 cut-off events. For 370/370 co-relation queries the response was YES. Maximal size of possible extension queue 812. Compared 94026 event pairs, 869 based on Foata normal form. 320/13494 useless extension candidates. Maximal degree in co-relation 26163. Up to 8233 conditions per place. [2023-11-29 04:09:16,925 INFO L140 encePairwiseOnDemand]: 60/67 looper letters, 52 selfloop transitions, 6 changer transitions 1/80 dead transitions. [2023-11-29 04:09:16,925 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 80 transitions, 298 flow [2023-11-29 04:09:16,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 04:09:16,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-29 04:09:16,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 193 transitions. [2023-11-29 04:09:16,927 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7201492537313433 [2023-11-29 04:09:16,927 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 193 transitions. [2023-11-29 04:09:16,927 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 193 transitions. [2023-11-29 04:09:16,927 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:09:16,927 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 193 transitions. [2023-11-29 04:09:16,928 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 48.25) internal successors, (193), 4 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:09:16,928 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 04:09:16,928 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 04:09:16,929 INFO L175 Difference]: Start difference. First operand has 61 places, 50 transitions, 112 flow. Second operand 4 states and 193 transitions. [2023-11-29 04:09:16,929 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 80 transitions, 298 flow [2023-11-29 04:09:16,934 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 80 transitions, 292 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 04:09:16,935 INFO L231 Difference]: Finished difference. Result has 64 places, 54 transitions, 150 flow [2023-11-29 04:09:16,936 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 04:09:16,936 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -10 predicate places. [2023-11-29 04:09:16,936 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 54 transitions, 150 flow [2023-11-29 04:09:16,936 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.75) internal successors, (147), 4 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:09:16,937 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:09:16,937 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:09:16,939 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d1b734a-1438-43b0-9e46-bcedf1f105bb/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2023-11-29 04:09:17,137 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d1b734a-1438-43b0-9e46-bcedf1f105bb/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:09:17,137 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 04:09:17,137 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:09:17,138 INFO L85 PathProgramCache]: Analyzing trace with hash -1786759904, now seen corresponding path program 1 times [2023-11-29 04:09:17,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:09:17,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1520722498] [2023-11-29 04:09:17,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:09:17,138 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:09:17,138 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d1b734a-1438-43b0-9e46-bcedf1f105bb/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:09:17,139 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d1b734a-1438-43b0-9e46-bcedf1f105bb/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:09:17,140 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d1b734a-1438-43b0-9e46-bcedf1f105bb/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-11-29 04:09:17,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:09:17,253 INFO L262 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 04:09:17,254 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:09:17,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:09:17,319 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:09:17,320 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:09:17,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1520722498] [2023-11-29 04:09:17,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1520722498] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:09:17,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:09:17,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 04:09:17,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122239232] [2023-11-29 04:09:17,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:09:17,321 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 04:09:17,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:09:17,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 04:09:17,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 04:09:17,329 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 67 [2023-11-29 04:09:17,329 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 54 transitions, 150 flow. Second operand has 5 states, 5 states have (on average 36.4) internal successors, (182), 5 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:09:17,329 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:09:17,329 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 67 [2023-11-29 04:09:17,329 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:09:18,312 INFO L124 PetriNetUnfolderBase]: 6745/10278 cut-off events. [2023-11-29 04:09:18,312 INFO L125 PetriNetUnfolderBase]: For 2392/2392 co-relation queries the response was YES. [2023-11-29 04:09:18,323 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22960 conditions, 10278 events. 6745/10278 cut-off events. For 2392/2392 co-relation queries the response was YES. Maximal size of possible extension queue 613. Compared 68931 event pairs, 369 based on Foata normal form. 296/10375 useless extension candidates. Maximal degree in co-relation 22947. Up to 5461 conditions per place. [2023-11-29 04:09:18,346 INFO L140 encePairwiseOnDemand]: 60/67 looper letters, 66 selfloop transitions, 10 changer transitions 1/98 dead transitions. [2023-11-29 04:09:18,346 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 98 transitions, 421 flow [2023-11-29 04:09:18,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 04:09:18,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-29 04:09:18,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 244 transitions. [2023-11-29 04:09:18,347 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7283582089552239 [2023-11-29 04:09:18,348 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 244 transitions. [2023-11-29 04:09:18,348 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 244 transitions. [2023-11-29 04:09:18,348 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:09:18,348 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 244 transitions. [2023-11-29 04:09:18,349 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 48.8) internal successors, (244), 5 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:09:18,349 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 04:09:18,350 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 04:09:18,350 INFO L175 Difference]: Start difference. First operand has 64 places, 54 transitions, 150 flow. Second operand 5 states and 244 transitions. [2023-11-29 04:09:18,350 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 98 transitions, 421 flow [2023-11-29 04:09:18,352 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 98 transitions, 410 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-11-29 04:09:18,354 INFO L231 Difference]: Finished difference. Result has 68 places, 58 transitions, 202 flow [2023-11-29 04:09:18,354 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 04:09:18,355 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -6 predicate places. [2023-11-29 04:09:18,355 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 58 transitions, 202 flow [2023-11-29 04:09:18,355 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 36.4) internal successors, (182), 5 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:09:18,356 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:09:18,356 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:09:18,358 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d1b734a-1438-43b0-9e46-bcedf1f105bb/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2023-11-29 04:09:18,556 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d1b734a-1438-43b0-9e46-bcedf1f105bb/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:09:18,556 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 04:09:18,556 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:09:18,557 INFO L85 PathProgramCache]: Analyzing trace with hash -601050103, now seen corresponding path program 1 times [2023-11-29 04:09:18,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:09:18,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1674965406] [2023-11-29 04:09:18,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:09:18,557 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:09:18,557 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d1b734a-1438-43b0-9e46-bcedf1f105bb/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:09:18,558 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d1b734a-1438-43b0-9e46-bcedf1f105bb/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:09:18,559 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d1b734a-1438-43b0-9e46-bcedf1f105bb/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2023-11-29 04:09:18,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:09:18,676 INFO L262 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 04:09:18,678 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:09:18,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:09:18,741 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:09:18,741 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:09:18,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1674965406] [2023-11-29 04:09:18,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1674965406] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:09:18,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:09:18,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 04:09:18,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068401110] [2023-11-29 04:09:18,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:09:18,742 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 04:09:18,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:09:18,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 04:09:18,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 04:09:18,760 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 67 [2023-11-29 04:09:18,761 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 58 transitions, 202 flow. Second operand has 6 states, 6 states have (on average 36.333333333333336) internal successors, (218), 6 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:09:18,761 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:09:18,761 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 67 [2023-11-29 04:09:18,761 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:09:19,526 INFO L124 PetriNetUnfolderBase]: 4037/6162 cut-off events. [2023-11-29 04:09:19,526 INFO L125 PetriNetUnfolderBase]: For 4377/4377 co-relation queries the response was YES. [2023-11-29 04:09:19,535 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15414 conditions, 6162 events. 4037/6162 cut-off events. For 4377/4377 co-relation queries the response was YES. Maximal size of possible extension queue 245. Compared 36402 event pairs, 221 based on Foata normal form. 208/6206 useless extension candidates. Maximal degree in co-relation 15399. Up to 2101 conditions per place. [2023-11-29 04:09:19,550 INFO L140 encePairwiseOnDemand]: 60/67 looper letters, 78 selfloop transitions, 14 changer transitions 1/114 dead transitions. [2023-11-29 04:09:19,550 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 114 transitions, 548 flow [2023-11-29 04:09:19,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 04:09:19,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 04:09:19,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 293 transitions. [2023-11-29 04:09:19,552 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7288557213930348 [2023-11-29 04:09:19,552 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 293 transitions. [2023-11-29 04:09:19,552 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 293 transitions. [2023-11-29 04:09:19,552 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:09:19,552 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 293 transitions. [2023-11-29 04:09:19,553 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 48.833333333333336) internal successors, (293), 6 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:09:19,555 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 04:09:19,555 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 04:09:19,555 INFO L175 Difference]: Start difference. First operand has 68 places, 58 transitions, 202 flow. Second operand 6 states and 293 transitions. [2023-11-29 04:09:19,555 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 114 transitions, 548 flow [2023-11-29 04:09:19,571 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 114 transitions, 518 flow, removed 5 selfloop flow, removed 4 redundant places. [2023-11-29 04:09:19,572 INFO L231 Difference]: Finished difference. Result has 71 places, 62 transitions, 252 flow [2023-11-29 04:09:19,573 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 04:09:19,573 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -3 predicate places. [2023-11-29 04:09:19,573 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 62 transitions, 252 flow [2023-11-29 04:09:19,574 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 36.333333333333336) internal successors, (218), 6 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:09:19,574 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:09:19,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] [2023-11-29 04:09:19,577 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d1b734a-1438-43b0-9e46-bcedf1f105bb/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2023-11-29 04:09:19,774 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d1b734a-1438-43b0-9e46-bcedf1f105bb/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:09:19,775 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 04:09:19,775 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:09:19,775 INFO L85 PathProgramCache]: Analyzing trace with hash 1549450386, now seen corresponding path program 1 times [2023-11-29 04:09:19,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:09:19,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [305227178] [2023-11-29 04:09:19,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:09:19,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 04:09:19,776 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d1b734a-1438-43b0-9e46-bcedf1f105bb/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:09:19,776 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d1b734a-1438-43b0-9e46-bcedf1f105bb/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:09:19,777 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d1b734a-1438-43b0-9e46-bcedf1f105bb/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2023-11-29 04:09:19,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:09:19,905 INFO L262 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 04:09:19,907 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:09:19,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:09:19,969 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:09:19,970 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:09:19,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [305227178] [2023-11-29 04:09:19,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [305227178] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:09:19,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:09:19,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 04:09:19,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736568824] [2023-11-29 04:09:19,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:09:19,971 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 04:09:19,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:09:19,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 04:09:19,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 04:09:19,981 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 67 [2023-11-29 04:09:19,982 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 62 transitions, 252 flow. Second operand has 7 states, 7 states have (on average 36.142857142857146) internal successors, (253), 7 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:09:19,982 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:09:19,982 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 67 [2023-11-29 04:09:19,982 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:09:20,586 INFO L124 PetriNetUnfolderBase]: 2489/3702 cut-off events. [2023-11-29 04:09:20,586 INFO L125 PetriNetUnfolderBase]: For 4281/4281 co-relation queries the response was YES. [2023-11-29 04:09:20,592 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10255 conditions, 3702 events. 2489/3702 cut-off events. For 4281/4281 co-relation queries the response was YES. Maximal size of possible extension queue 180. Compared 19239 event pairs, 173 based on Foata normal form. 88/3633 useless extension candidates. Maximal degree in co-relation 10239. Up to 1088 conditions per place. [2023-11-29 04:09:20,602 INFO L140 encePairwiseOnDemand]: 60/67 looper letters, 70 selfloop transitions, 18 changer transitions 1/110 dead transitions. [2023-11-29 04:09:20,602 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 110 transitions, 542 flow [2023-11-29 04:09:20,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 04:09:20,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-29 04:09:20,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 322 transitions. [2023-11-29 04:09:20,604 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6865671641791045 [2023-11-29 04:09:20,604 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 322 transitions. [2023-11-29 04:09:20,604 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 322 transitions. [2023-11-29 04:09:20,604 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:09:20,605 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 322 transitions. [2023-11-29 04:09:20,605 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 46.0) internal successors, (322), 7 states have internal predecessors, (322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:09:20,606 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 04:09:20,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 04:09:20,607 INFO L175 Difference]: Start difference. First operand has 71 places, 62 transitions, 252 flow. Second operand 7 states and 322 transitions. [2023-11-29 04:09:20,607 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 110 transitions, 542 flow [2023-11-29 04:09:20,626 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 110 transitions, 496 flow, removed 9 selfloop flow, removed 5 redundant places. [2023-11-29 04:09:20,627 INFO L231 Difference]: Finished difference. Result has 74 places, 62 transitions, 262 flow [2023-11-29 04:09:20,628 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 04:09:20,628 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 0 predicate places. [2023-11-29 04:09:20,628 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 62 transitions, 262 flow [2023-11-29 04:09:20,628 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 36.142857142857146) internal successors, (253), 7 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:09:20,628 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:09:20,629 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 04:09:20,632 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d1b734a-1438-43b0-9e46-bcedf1f105bb/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2023-11-29 04:09:20,829 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d1b734a-1438-43b0-9e46-bcedf1f105bb/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:09:20,829 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 04:09:20,829 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:09:20,829 INFO L85 PathProgramCache]: Analyzing trace with hash -1248142443, now seen corresponding path program 1 times [2023-11-29 04:09:20,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:09:20,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [118271633] [2023-11-29 04:09:20,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:09:20,830 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:09:20,830 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d1b734a-1438-43b0-9e46-bcedf1f105bb/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:09:20,831 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d1b734a-1438-43b0-9e46-bcedf1f105bb/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:09:20,832 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d1b734a-1438-43b0-9e46-bcedf1f105bb/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2023-11-29 04:09:21,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:09:21,052 INFO L262 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 17 conjunts are in the unsatisfiable core [2023-11-29 04:09:21,056 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:09:27,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:09:27,962 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:09:27,963 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:09:27,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [118271633] [2023-11-29 04:09:27,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [118271633] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:09:27,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:09:27,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 04:09:27,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511703083] [2023-11-29 04:09:27,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:09:27,964 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 04:09:27,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:09:27,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 04:09:27,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=30, Unknown=1, NotChecked=0, Total=42 [2023-11-29 04:09:32,619 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 04:09:37,351 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 04:09:41,443 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 04:09:43,282 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 04:09:46,214 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.92s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 04:09:50,358 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 04:09:54,415 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 04:09:58,521 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 04:10:03,998 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 04:10:05,574 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 04:10:09,601 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 04:10:12,107 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.83s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 04:10:16,131 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 04:10:16,131 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 67 [2023-11-29 04:10:16,132 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 62 transitions, 262 flow. Second operand has 7 states, 7 states have (on average 29.285714285714285) internal successors, (205), 7 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:10:16,132 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:10:16,132 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 67 [2023-11-29 04:10:16,132 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:10:20,176 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec, FloatRoundingMode], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 04:10:23,799 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.34s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 04:10:28,036 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 04:10:32,559 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 04:10:34,293 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.69s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 04:10:38,320 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 04:10:42,368 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 04:10:46,421 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 04:10:50,490 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 04:10:54,524 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 04:10:58,599 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 04:11:02,629 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 04:11:06,673 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 04:11:11,565 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 04:11:13,879 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.28s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 04:11:18,011 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 04:11:22,050 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 04:11:26,092 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 04:11:30,255 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 04:11:34,301 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 04:11:38,342 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 04:11:42,393 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 04:11:46,424 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 04:11:46,756 INFO L124 PetriNetUnfolderBase]: 1201/2243 cut-off events. [2023-11-29 04:11:46,756 INFO L125 PetriNetUnfolderBase]: For 681/725 co-relation queries the response was YES. [2023-11-29 04:11:46,761 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4761 conditions, 2243 events. 1201/2243 cut-off events. For 681/725 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 14051 event pairs, 166 based on Foata normal form. 16/2067 useless extension candidates. Maximal degree in co-relation 4743. Up to 1467 conditions per place. [2023-11-29 04:11:46,766 INFO L140 encePairwiseOnDemand]: 61/67 looper letters, 36 selfloop transitions, 4 changer transitions 5/79 dead transitions. [2023-11-29 04:11:46,766 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 79 transitions, 386 flow [2023-11-29 04:11:46,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 04:11:46,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-29 04:11:46,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 228 transitions. [2023-11-29 04:11:46,769 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4861407249466951 [2023-11-29 04:11:46,769 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 228 transitions. [2023-11-29 04:11:46,769 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 228 transitions. [2023-11-29 04:11:46,769 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:11:46,769 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 228 transitions. [2023-11-29 04:11:46,770 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 32.57142857142857) internal successors, (228), 7 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:11:46,770 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 04:11:46,771 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 04:11:46,771 INFO L175 Difference]: Start difference. First operand has 74 places, 62 transitions, 262 flow. Second operand 7 states and 228 transitions. [2023-11-29 04:11:46,771 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 79 transitions, 386 flow [2023-11-29 04:11:46,774 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 79 transitions, 290 flow, removed 17 selfloop flow, removed 10 redundant places. [2023-11-29 04:11:46,775 INFO L231 Difference]: Finished difference. Result has 69 places, 60 transitions, 170 flow [2023-11-29 04:11:46,775 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=170, PETRI_PLACES=69, PETRI_TRANSITIONS=60} [2023-11-29 04:11:46,775 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -5 predicate places. [2023-11-29 04:11:46,776 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 60 transitions, 170 flow [2023-11-29 04:11:46,776 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 29.285714285714285) internal successors, (205), 7 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:11:46,776 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:11:46,776 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 04:11:46,779 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d1b734a-1438-43b0-9e46-bcedf1f105bb/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2023-11-29 04:11:46,976 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d1b734a-1438-43b0-9e46-bcedf1f105bb/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:11:46,976 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 04:11:46,977 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:11:46,977 INFO L85 PathProgramCache]: Analyzing trace with hash -893503362, now seen corresponding path program 1 times [2023-11-29 04:11:46,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:11:46,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [671776545] [2023-11-29 04:11:46,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:11:46,977 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:11:46,978 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d1b734a-1438-43b0-9e46-bcedf1f105bb/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:11:46,978 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d1b734a-1438-43b0-9e46-bcedf1f105bb/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:11:46,979 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d1b734a-1438-43b0-9e46-bcedf1f105bb/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2023-11-29 04:11:47,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:11:47,102 INFO L262 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 04:11:47,104 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:11:47,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:11:47,250 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:11:47,250 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:11:47,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [671776545] [2023-11-29 04:11:47,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [671776545] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:11:47,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:11:47,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 04:11:47,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772627394] [2023-11-29 04:11:47,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:11:47,252 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 04:11:47,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:11:47,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 04:11:47,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 04:11:47,262 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 67 [2023-11-29 04:11:47,263 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 60 transitions, 170 flow. Second operand has 6 states, 6 states have (on average 39.5) internal successors, (237), 6 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:11:47,263 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:11:47,263 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 67 [2023-11-29 04:11:47,263 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:11:47,911 INFO L124 PetriNetUnfolderBase]: 2885/4745 cut-off events. [2023-11-29 04:11:47,911 INFO L125 PetriNetUnfolderBase]: For 75/75 co-relation queries the response was YES. [2023-11-29 04:11:47,920 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9535 conditions, 4745 events. 2885/4745 cut-off events. For 75/75 co-relation queries the response was YES. Maximal size of possible extension queue 279. Compared 29701 event pairs, 738 based on Foata normal form. 16/4521 useless extension candidates. Maximal degree in co-relation 9523. Up to 2030 conditions per place. [2023-11-29 04:11:47,928 INFO L140 encePairwiseOnDemand]: 62/67 looper letters, 38 selfloop transitions, 1 changer transitions 23/97 dead transitions. [2023-11-29 04:11:47,928 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 97 transitions, 380 flow [2023-11-29 04:11:47,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 04:11:47,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 04:11:47,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 279 transitions. [2023-11-29 04:11:47,930 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6940298507462687 [2023-11-29 04:11:47,930 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 279 transitions. [2023-11-29 04:11:47,930 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 279 transitions. [2023-11-29 04:11:47,931 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:11:47,931 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 279 transitions. [2023-11-29 04:11:47,932 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 46.5) internal successors, (279), 6 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:11:47,933 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 04:11:47,933 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 04:11:47,933 INFO L175 Difference]: Start difference. First operand has 69 places, 60 transitions, 170 flow. Second operand 6 states and 279 transitions. [2023-11-29 04:11:47,933 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 97 transitions, 380 flow [2023-11-29 04:11:47,935 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 97 transitions, 368 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-29 04:11:47,936 INFO L231 Difference]: Finished difference. Result has 72 places, 60 transitions, 174 flow [2023-11-29 04:11:47,936 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=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=174, PETRI_PLACES=72, PETRI_TRANSITIONS=60} [2023-11-29 04:11:47,936 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -2 predicate places. [2023-11-29 04:11:47,937 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 60 transitions, 174 flow [2023-11-29 04:11:47,937 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 39.5) internal successors, (237), 6 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:11:47,937 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:11:47,937 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 04:11:47,942 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d1b734a-1438-43b0-9e46-bcedf1f105bb/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2023-11-29 04:11:48,137 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d1b734a-1438-43b0-9e46-bcedf1f105bb/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:11:48,138 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 04:11:48,138 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:11:48,138 INFO L85 PathProgramCache]: Analyzing trace with hash 51776266, now seen corresponding path program 2 times [2023-11-29 04:11:48,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:11:48,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1704167704] [2023-11-29 04:11:48,138 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 04:11:48,139 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:11:48,139 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d1b734a-1438-43b0-9e46-bcedf1f105bb/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:11:48,139 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d1b734a-1438-43b0-9e46-bcedf1f105bb/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:11:48,140 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d1b734a-1438-43b0-9e46-bcedf1f105bb/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2023-11-29 04:11:48,260 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-29 04:11:48,260 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 04:11:48,265 INFO L262 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 04:11:48,267 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:11:48,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:11:48,356 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:11:48,356 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:11:48,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1704167704] [2023-11-29 04:11:48,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1704167704] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:11:48,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:11:48,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 04:11:48,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38602985] [2023-11-29 04:11:48,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:11:48,357 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 04:11:48,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:11:48,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 04:11:48,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 04:11:48,379 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 67 [2023-11-29 04:11:48,379 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 60 transitions, 174 flow. Second operand has 6 states, 6 states have (on average 39.5) internal successors, (237), 6 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:11:48,380 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:11:48,380 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 67 [2023-11-29 04:11:48,380 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:11:49,090 INFO L124 PetriNetUnfolderBase]: 3121/5338 cut-off events. [2023-11-29 04:11:49,090 INFO L125 PetriNetUnfolderBase]: For 35/35 co-relation queries the response was YES. [2023-11-29 04:11:49,125 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10629 conditions, 5338 events. 3121/5338 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 317. Compared 36097 event pairs, 944 based on Foata normal form. 16/5034 useless extension candidates. Maximal degree in co-relation 10614. Up to 1873 conditions per place. [2023-11-29 04:11:49,130 INFO L140 encePairwiseOnDemand]: 62/67 looper letters, 31 selfloop transitions, 1 changer transitions 24/91 dead transitions. [2023-11-29 04:11:49,130 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 91 transitions, 352 flow [2023-11-29 04:11:49,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 04:11:49,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 04:11:49,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 273 transitions. [2023-11-29 04:11:49,132 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6791044776119403 [2023-11-29 04:11:49,132 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 273 transitions. [2023-11-29 04:11:49,133 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 273 transitions. [2023-11-29 04:11:49,133 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:11:49,133 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 273 transitions. [2023-11-29 04:11:49,134 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 45.5) internal successors, (273), 6 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:11:49,135 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 04:11:49,135 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 04:11:49,136 INFO L175 Difference]: Start difference. First operand has 72 places, 60 transitions, 174 flow. Second operand 6 states and 273 transitions. [2023-11-29 04:11:49,136 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 91 transitions, 352 flow [2023-11-29 04:11:49,137 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 91 transitions, 341 flow, removed 5 selfloop flow, removed 4 redundant places. [2023-11-29 04:11:49,138 INFO L231 Difference]: Finished difference. Result has 74 places, 60 transitions, 178 flow [2023-11-29 04:11:49,138 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=167, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=178, PETRI_PLACES=74, PETRI_TRANSITIONS=60} [2023-11-29 04:11:49,139 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 0 predicate places. [2023-11-29 04:11:49,139 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 60 transitions, 178 flow [2023-11-29 04:11:49,139 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 39.5) internal successors, (237), 6 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:11:49,139 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:11:49,139 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 04:11:49,142 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d1b734a-1438-43b0-9e46-bcedf1f105bb/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Ended with exit code 0 [2023-11-29 04:11:49,339 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d1b734a-1438-43b0-9e46-bcedf1f105bb/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:11:49,340 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 04:11:49,340 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:11:49,340 INFO L85 PathProgramCache]: Analyzing trace with hash -995089816, now seen corresponding path program 3 times [2023-11-29 04:11:49,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:11:49,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [774498645] [2023-11-29 04:11:49,341 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-29 04:11:49,341 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:11:49,341 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d1b734a-1438-43b0-9e46-bcedf1f105bb/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:11:49,342 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d1b734a-1438-43b0-9e46-bcedf1f105bb/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:11:49,342 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d1b734a-1438-43b0-9e46-bcedf1f105bb/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2023-11-29 04:11:49,475 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-11-29 04:11:49,475 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 04:11:49,480 INFO L262 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 22 conjunts are in the unsatisfiable core [2023-11-29 04:11:49,482 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:11:50,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:11:50,392 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:11:50,392 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:11:50,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [774498645] [2023-11-29 04:11:50,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [774498645] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:11:50,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:11:50,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-29 04:11:50,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899458217] [2023-11-29 04:11:50,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:11:50,393 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-29 04:11:50,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:11:50,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-29 04:11:50,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2023-11-29 04:11:50,417 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 67 [2023-11-29 04:11:50,418 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 60 transitions, 178 flow. Second operand has 12 states, 12 states have (on average 38.666666666666664) internal successors, (464), 12 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:11:50,418 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:11:50,418 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 67 [2023-11-29 04:11:50,418 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:11:51,263 INFO L124 PetriNetUnfolderBase]: 3032/5309 cut-off events. [2023-11-29 04:11:51,264 INFO L125 PetriNetUnfolderBase]: For 50/50 co-relation queries the response was YES. [2023-11-29 04:11:51,275 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10633 conditions, 5309 events. 3032/5309 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 259. Compared 35581 event pairs, 1052 based on Foata normal form. 16/4914 useless extension candidates. Maximal degree in co-relation 10617. Up to 1915 conditions per place. [2023-11-29 04:11:51,282 INFO L140 encePairwiseOnDemand]: 59/67 looper letters, 39 selfloop transitions, 6 changer transitions 18/99 dead transitions. [2023-11-29 04:11:51,282 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 99 transitions, 398 flow [2023-11-29 04:11:51,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 04:11:51,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-29 04:11:51,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 323 transitions. [2023-11-29 04:11:51,284 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6886993603411514 [2023-11-29 04:11:51,284 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 323 transitions. [2023-11-29 04:11:51,284 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 323 transitions. [2023-11-29 04:11:51,285 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:11:51,285 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 323 transitions. [2023-11-29 04:11:51,285 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 46.142857142857146) internal successors, (323), 7 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:11:51,286 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 04:11:51,286 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 04:11:51,286 INFO L175 Difference]: Start difference. First operand has 74 places, 60 transitions, 178 flow. Second operand 7 states and 323 transitions. [2023-11-29 04:11:51,287 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 99 transitions, 398 flow [2023-11-29 04:11:51,289 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 99 transitions, 387 flow, removed 5 selfloop flow, removed 4 redundant places. [2023-11-29 04:11:51,290 INFO L231 Difference]: Finished difference. Result has 77 places, 63 transitions, 207 flow [2023-11-29 04:11:51,290 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=171, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=207, PETRI_PLACES=77, PETRI_TRANSITIONS=63} [2023-11-29 04:11:51,290 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 3 predicate places. [2023-11-29 04:11:51,290 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 63 transitions, 207 flow [2023-11-29 04:11:51,291 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 38.666666666666664) internal successors, (464), 12 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:11:51,291 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:11:51,291 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 04:11:51,294 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d1b734a-1438-43b0-9e46-bcedf1f105bb/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Ended with exit code 0 [2023-11-29 04:11:51,491 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d1b734a-1438-43b0-9e46-bcedf1f105bb/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:11:51,491 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 04:11:51,492 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:11:51,492 INFO L85 PathProgramCache]: Analyzing trace with hash 237671208, now seen corresponding path program 4 times [2023-11-29 04:11:51,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:11:51,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1504966369] [2023-11-29 04:11:51,492 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-29 04:11:51,492 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:11:51,492 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d1b734a-1438-43b0-9e46-bcedf1f105bb/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:11:51,493 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d1b734a-1438-43b0-9e46-bcedf1f105bb/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:11:51,494 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d1b734a-1438-43b0-9e46-bcedf1f105bb/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2023-11-29 04:11:51,627 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-29 04:11:51,627 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 04:11:51,632 INFO L262 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 24 conjunts are in the unsatisfiable core [2023-11-29 04:11:51,634 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:11:52,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:11:52,655 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:11:52,656 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:11:52,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1504966369] [2023-11-29 04:11:52,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1504966369] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:11:52,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:11:52,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-29 04:11:52,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954392068] [2023-11-29 04:11:52,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:11:52,656 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-29 04:11:52,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:11:52,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-29 04:11:52,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2023-11-29 04:11:52,678 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 67 [2023-11-29 04:11:52,678 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 63 transitions, 207 flow. Second operand has 12 states, 12 states have (on average 38.666666666666664) internal successors, (464), 12 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:11:52,679 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:11:52,679 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 67 [2023-11-29 04:11:52,679 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:11:53,554 INFO L124 PetriNetUnfolderBase]: 3558/6163 cut-off events. [2023-11-29 04:11:53,554 INFO L125 PetriNetUnfolderBase]: For 1512/1619 co-relation queries the response was YES. [2023-11-29 04:11:53,568 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13806 conditions, 6163 events. 3558/6163 cut-off events. For 1512/1619 co-relation queries the response was YES. Maximal size of possible extension queue 306. Compared 42127 event pairs, 1294 based on Foata normal form. 31/5714 useless extension candidates. Maximal degree in co-relation 13788. Up to 2419 conditions per place. [2023-11-29 04:11:53,576 INFO L140 encePairwiseOnDemand]: 60/67 looper letters, 39 selfloop transitions, 6 changer transitions 19/100 dead transitions. [2023-11-29 04:11:53,576 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 100 transitions, 430 flow [2023-11-29 04:11:53,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 04:11:53,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-29 04:11:53,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 323 transitions. [2023-11-29 04:11:53,578 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6886993603411514 [2023-11-29 04:11:53,578 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 323 transitions. [2023-11-29 04:11:53,578 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 323 transitions. [2023-11-29 04:11:53,578 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:11:53,578 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 323 transitions. [2023-11-29 04:11:53,579 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 46.142857142857146) internal successors, (323), 7 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:11:53,580 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 04:11:53,580 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 04:11:53,580 INFO L175 Difference]: Start difference. First operand has 77 places, 63 transitions, 207 flow. Second operand 7 states and 323 transitions. [2023-11-29 04:11:53,580 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 100 transitions, 430 flow [2023-11-29 04:11:53,582 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 100 transitions, 419 flow, removed 3 selfloop flow, removed 4 redundant places. [2023-11-29 04:11:53,584 INFO L231 Difference]: Finished difference. Result has 80 places, 64 transitions, 224 flow [2023-11-29 04:11:53,584 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=199, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=224, PETRI_PLACES=80, PETRI_TRANSITIONS=64} [2023-11-29 04:11:53,584 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 6 predicate places. [2023-11-29 04:11:53,584 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 64 transitions, 224 flow [2023-11-29 04:11:53,584 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 38.666666666666664) internal successors, (464), 12 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:11:53,585 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:11:53,585 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 04:11:53,587 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d1b734a-1438-43b0-9e46-bcedf1f105bb/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Ended with exit code 0 [2023-11-29 04:11:53,785 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d1b734a-1438-43b0-9e46-bcedf1f105bb/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:11:53,785 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 04:11:53,786 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:11:53,786 INFO L85 PathProgramCache]: Analyzing trace with hash -971617276, now seen corresponding path program 5 times [2023-11-29 04:11:53,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:11:53,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1658872033] [2023-11-29 04:11:53,786 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-29 04:11:53,786 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:11:53,787 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d1b734a-1438-43b0-9e46-bcedf1f105bb/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:11:53,787 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d1b734a-1438-43b0-9e46-bcedf1f105bb/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:11:53,789 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d1b734a-1438-43b0-9e46-bcedf1f105bb/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2023-11-29 04:11:53,924 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-29 04:11:53,924 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 04:11:53,929 INFO L262 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 04:11:53,930 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:11:54,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:11:54,076 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:11:54,076 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:11:54,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1658872033] [2023-11-29 04:11:54,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1658872033] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:11:54,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:11:54,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 04:11:54,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892430202] [2023-11-29 04:11:54,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:11:54,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 04:11:54,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:11:54,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 04:11:54,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 04:11:54,098 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 67 [2023-11-29 04:11:54,099 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 64 transitions, 224 flow. Second operand has 6 states, 6 states have (on average 39.5) internal successors, (237), 6 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:11:54,099 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:11:54,099 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 67 [2023-11-29 04:11:54,099 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:11:55,324 INFO L124 PetriNetUnfolderBase]: 6831/11831 cut-off events. [2023-11-29 04:11:55,325 INFO L125 PetriNetUnfolderBase]: For 2869/2911 co-relation queries the response was YES. [2023-11-29 04:11:55,350 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26507 conditions, 11831 events. 6831/11831 cut-off events. For 2869/2911 co-relation queries the response was YES. Maximal size of possible extension queue 606. Compared 90838 event pairs, 2529 based on Foata normal form. 37/11021 useless extension candidates. Maximal degree in co-relation 26487. Up to 4676 conditions per place. [2023-11-29 04:11:55,358 INFO L140 encePairwiseOnDemand]: 62/67 looper letters, 27 selfloop transitions, 1 changer transitions 37/100 dead transitions. [2023-11-29 04:11:55,358 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 100 transitions, 459 flow [2023-11-29 04:11:55,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 04:11:55,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 04:11:55,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 276 transitions. [2023-11-29 04:11:55,359 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6865671641791045 [2023-11-29 04:11:55,360 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 276 transitions. [2023-11-29 04:11:55,360 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 276 transitions. [2023-11-29 04:11:55,360 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:11:55,360 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 276 transitions. [2023-11-29 04:11:55,361 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 46.0) internal successors, (276), 6 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:11:55,361 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 04:11:55,361 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 04:11:55,362 INFO L175 Difference]: Start difference. First operand has 80 places, 64 transitions, 224 flow. Second operand 6 states and 276 transitions. [2023-11-29 04:11:55,362 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 100 transitions, 459 flow [2023-11-29 04:11:55,366 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 100 transitions, 444 flow, removed 3 selfloop flow, removed 4 redundant places. [2023-11-29 04:11:55,367 INFO L231 Difference]: Finished difference. Result has 83 places, 60 transitions, 199 flow [2023-11-29 04:11:55,367 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=215, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=199, PETRI_PLACES=83, PETRI_TRANSITIONS=60} [2023-11-29 04:11:55,368 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 9 predicate places. [2023-11-29 04:11:55,368 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 60 transitions, 199 flow [2023-11-29 04:11:55,368 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 39.5) internal successors, (237), 6 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:11:55,368 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:11:55,368 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 04:11:55,372 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d1b734a-1438-43b0-9e46-bcedf1f105bb/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Ended with exit code 0 [2023-11-29 04:11:55,569 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d1b734a-1438-43b0-9e46-bcedf1f105bb/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:11:55,569 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 04:11:55,569 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:11:55,569 INFO L85 PathProgramCache]: Analyzing trace with hash -842336124, now seen corresponding path program 6 times [2023-11-29 04:11:55,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:11:55,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [428302962] [2023-11-29 04:11:55,570 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-11-29 04:11:55,570 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:11:55,570 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d1b734a-1438-43b0-9e46-bcedf1f105bb/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:11:55,571 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d1b734a-1438-43b0-9e46-bcedf1f105bb/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:11:55,572 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d1b734a-1438-43b0-9e46-bcedf1f105bb/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 (21)] Waiting until timeout for monitored process [2023-11-29 04:11:55,732 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2023-11-29 04:11:55,733 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-11-29 04:11:55,733 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 04:11:55,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 04:11:55,919 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-11-29 04:11:55,919 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-29 04:11:55,920 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2023-11-29 04:11:55,921 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2023-11-29 04:11:55,921 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2023-11-29 04:11:55,922 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2023-11-29 04:11:55,922 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2023-11-29 04:11:55,922 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2023-11-29 04:11:55,922 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2023-11-29 04:11:55,922 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2023-11-29 04:11:55,922 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2023-11-29 04:11:55,922 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2023-11-29 04:11:55,922 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2023-11-29 04:11:55,923 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2023-11-29 04:11:55,923 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2023-11-29 04:11:55,923 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2023-11-29 04:11:55,923 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2023-11-29 04:11:55,923 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2023-11-29 04:11:55,927 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d1b734a-1438-43b0-9e46-bcedf1f105bb/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 (21)] Ended with exit code 0 [2023-11-29 04:11:56,124 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d1b734a-1438-43b0-9e46-bcedf1f105bb/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:11:56,124 INFO L445 BasicCegarLoop]: Path program histogram: [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:11:56,129 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-29 04:11:56,129 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 04:11:56,204 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre3 could not be translated [2023-11-29 04:11:56,206 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-29 04:11:56,209 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-29 04:11:56,211 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-29 04:11:56,228 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-29 04:11:56,229 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-29 04:11:56,244 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 04:11:56 BasicIcfg [2023-11-29 04:11:56,244 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 04:11:56,245 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 04:11:56,245 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 04:11:56,245 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 04:11:56,245 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 04:09:04" (3/4) ... [2023-11-29 04:11:56,247 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-29 04:11:56,248 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 04:11:56,248 INFO L158 Benchmark]: Toolchain (without parser) took 173080.74ms. Allocated memory was 88.1MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 64.0MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 340.6MB. Max. memory is 16.1GB. [2023-11-29 04:11:56,248 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 60.8MB. Free memory is still 37.8MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 04:11:56,249 INFO L158 Benchmark]: CACSL2BoogieTranslator took 603.73ms. Allocated memory is still 88.1MB. Free memory was 63.8MB in the beginning and 60.2MB in the end (delta: 3.6MB). Peak memory consumption was 26.7MB. Max. memory is 16.1GB. [2023-11-29 04:11:56,249 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.26ms. Allocated memory is still 88.1MB. Free memory was 60.2MB in the beginning and 57.4MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-29 04:11:56,249 INFO L158 Benchmark]: Boogie Preprocessor took 61.83ms. Allocated memory is still 88.1MB. Free memory was 57.4MB in the beginning and 53.2MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-29 04:11:56,250 INFO L158 Benchmark]: RCFGBuilder took 881.73ms. Allocated memory was 88.1MB in the beginning and 107.0MB in the end (delta: 18.9MB). Free memory was 53.2MB in the beginning and 55.3MB in the end (delta: -2.1MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2023-11-29 04:11:56,250 INFO L158 Benchmark]: TraceAbstraction took 171466.04ms. Allocated memory was 107.0MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 54.6MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 309.6MB. Max. memory is 16.1GB. [2023-11-29 04:11:56,250 INFO L158 Benchmark]: Witness Printer took 2.88ms. Allocated memory is still 1.5GB. Free memory is still 1.2GB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 04:11:56,252 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.26ms. Allocated memory is still 60.8MB. Free memory is still 37.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 603.73ms. Allocated memory is still 88.1MB. Free memory was 63.8MB in the beginning and 60.2MB in the end (delta: 3.6MB). Peak memory consumption was 26.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.26ms. Allocated memory is still 88.1MB. Free memory was 60.2MB in the beginning and 57.4MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 61.83ms. Allocated memory is still 88.1MB. Free memory was 57.4MB in the beginning and 53.2MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 881.73ms. Allocated memory was 88.1MB in the beginning and 107.0MB in the end (delta: 18.9MB). Free memory was 53.2MB in the beginning and 55.3MB in the end (delta: -2.1MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 171466.04ms. Allocated memory was 107.0MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 54.6MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 309.6MB. Max. memory is 16.1GB. * Witness Printer took 2.88ms. Allocated memory is still 1.5GB. Free memory is still 1.2GB. 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_p1_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p2_EBX = 0; [L718] 0 int __unbuffered_p3_EAX = 0; [L720] 0 int __unbuffered_p3_EBX = 0; [L722] 0 int a = 0; [L723] 0 _Bool main$tmp_guard0; [L724] 0 _Bool main$tmp_guard1; [L726] 0 int x = 0; [L727] 0 _Bool x$flush_delayed; [L728] 0 int x$mem_tmp; [L729] 0 _Bool x$r_buff0_thd0; [L730] 0 _Bool x$r_buff0_thd1; [L731] 0 _Bool x$r_buff0_thd2; [L732] 0 _Bool x$r_buff0_thd3; [L733] 0 _Bool x$r_buff0_thd4; [L734] 0 _Bool x$r_buff1_thd0; [L735] 0 _Bool x$r_buff1_thd1; [L736] 0 _Bool x$r_buff1_thd2; [L737] 0 _Bool x$r_buff1_thd3; [L738] 0 _Bool x$r_buff1_thd4; [L739] 0 _Bool x$read_delayed; [L740] 0 int *x$read_delayed_var; [L741] 0 int x$w_buff0; [L742] 0 _Bool x$w_buff0_used; [L743] 0 int x$w_buff1; [L744] 0 _Bool x$w_buff1_used; [L746] 0 int y = 0; [L748] 0 int z = 0; [L749] 0 _Bool weak$$choice0; [L750] 0 _Bool weak$$choice2; [L858] 0 pthread_t t145; [L859] FCALL, FORK 0 pthread_create(&t145, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t145={6:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L860] 0 pthread_t t146; [L861] FCALL, FORK 0 pthread_create(&t146, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t145={6:0}, t146={10:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L774] 2 x$w_buff1 = x$w_buff0 [L775] 2 x$w_buff0 = 2 [L776] 2 x$w_buff1_used = x$w_buff0_used [L777] 2 x$w_buff0_used = (_Bool)1 [L778] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L778] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L779] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L780] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L781] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L782] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L783] 2 x$r_buff1_thd4 = x$r_buff0_thd4 [L784] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L862] 0 pthread_t t147; [L863] FCALL, FORK 0 pthread_create(&t147, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t145={6:0}, t146={10:0}, t147={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L787] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L864] 0 pthread_t t148; [L865] FCALL, FORK 0 pthread_create(&t148, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t145={6:0}, t146={10:0}, t147={3:0}, t148={7:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L804] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L807] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L810] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L827] 4 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L830] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L833] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L754] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L757] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L760] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L761] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L762] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L763] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L764] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L767] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L813] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L814] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L815] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L816] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L817] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L790] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L791] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L792] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L793] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L794] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L797] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L820] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L836] 4 x = x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L837] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L838] 4 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L839] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L840] 4 x$r_buff1_thd4 = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L843] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L867] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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}, main$tmp_guard0=1, main$tmp_guard1=0, t145={6:0}, t146={10:0}, t147={3:0}, t148={7:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L869] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L869] RET 0 assume_abort_if_not(main$tmp_guard0) [L871] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L872] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L873] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L874] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L875] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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}, main$tmp_guard0=1, main$tmp_guard1=0, t145={6:0}, t146={10:0}, t147={3:0}, t148={7:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L878] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L879] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L880] 0 x$flush_delayed = weak$$choice2 [L881] 0 x$mem_tmp = x [L882] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L883] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L884] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L885] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L886] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L887] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L888] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L889] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L890] 0 x = x$flush_delayed ? x$mem_tmp : x [L891] 0 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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}, main$tmp_guard0=1, main$tmp_guard1=0, t145={6:0}, t146={10:0}, t147={3:0}, t148={7:0}, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L893] 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_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L17] 0 __assert_fail ("0", "mix005_tso.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] - 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: 856]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 863]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 865]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 861]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 859]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - 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: 171.2s, OverallIterations: 20, TraceHistogramMax: 1, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 154.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 29 mSolverCounterUnknown, 1063 SdHoareTripleChecker+Valid, 141.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 889 mSDsluCounter, 236 SdHoareTripleChecker+Invalid, 141.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 186 mSDsCounter, 96 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2930 IncrementalHoareTripleChecker+Invalid, 3055 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 96 mSolverCounterUnsat, 50 mSDtfsCounter, 2930 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 439 GetRequests, 355 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 6.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=262occurred in iteration=13, InterpolantAutomatonStates: 88, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 9.7s InterpolantComputationTime, 476 NumberOfCodeBlocks, 476 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 414 ConstructedInterpolants, 20 QuantifiedInterpolants, 4806 SizeOfPredicates, 20 NumberOfNonLiveVariables, 2819 ConjunctsInSsa, 132 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-11-29 04:11:56,284 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d1b734a-1438-43b0-9e46-bcedf1f105bb/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