./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/mix031.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df81859e-06c0-4f6b-b526-1769f8b43837/bin/uautomizer-verify-NlZe1sFDwI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df81859e-06c0-4f6b-b526-1769f8b43837/bin/uautomizer-verify-NlZe1sFDwI/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df81859e-06c0-4f6b-b526-1769f8b43837/bin/uautomizer-verify-NlZe1sFDwI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df81859e-06c0-4f6b-b526-1769f8b43837/bin/uautomizer-verify-NlZe1sFDwI/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix031.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df81859e-06c0-4f6b-b526-1769f8b43837/bin/uautomizer-verify-NlZe1sFDwI/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df81859e-06c0-4f6b-b526-1769f8b43837/bin/uautomizer-verify-NlZe1sFDwI --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 526111e98fa506d5405af18114114ae6aa9ce1a2e8442e7719052c05a249c119 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-24 21:49:04,440 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-24 21:49:04,537 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df81859e-06c0-4f6b-b526-1769f8b43837/bin/uautomizer-verify-NlZe1sFDwI/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-24 21:49:04,544 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-24 21:49:04,545 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-24 21:49:04,577 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-24 21:49:04,578 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-24 21:49:04,578 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-24 21:49:04,579 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-24 21:49:04,580 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-24 21:49:04,580 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-24 21:49:04,581 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-24 21:49:04,582 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-24 21:49:04,583 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-24 21:49:04,583 INFO L153 SettingsManager]: * Use SBE=true [2023-11-24 21:49:04,584 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-24 21:49:04,585 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-24 21:49:04,585 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-24 21:49:04,586 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-24 21:49:04,586 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-24 21:49:04,587 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-24 21:49:04,588 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-24 21:49:04,588 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-24 21:49:04,589 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-24 21:49:04,590 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-24 21:49:04,590 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-24 21:49:04,591 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-24 21:49:04,591 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-24 21:49:04,592 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-24 21:49:04,593 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-24 21:49:04,593 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-24 21:49:04,594 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-24 21:49:04,594 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-24 21:49:04,595 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-24 21:49:04,596 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-24 21:49:04,596 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-24 21:49:04,597 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-24 21:49:04,597 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-24 21:49:04,598 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-24 21:49:04,598 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-24 21:49:04,598 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-24 21:49:04,599 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_df81859e-06c0-4f6b-b526-1769f8b43837/bin/uautomizer-verify-NlZe1sFDwI/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_df81859e-06c0-4f6b-b526-1769f8b43837/bin/uautomizer-verify-NlZe1sFDwI 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 -> 526111e98fa506d5405af18114114ae6aa9ce1a2e8442e7719052c05a249c119 [2023-11-24 21:49:04,879 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-24 21:49:04,928 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-24 21:49:04,933 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-24 21:49:04,934 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-24 21:49:04,935 INFO L274 PluginConnector]: CDTParser initialized [2023-11-24 21:49:04,937 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df81859e-06c0-4f6b-b526-1769f8b43837/bin/uautomizer-verify-NlZe1sFDwI/../../sv-benchmarks/c/pthread-wmm/mix031.opt.i [2023-11-24 21:49:08,341 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-24 21:49:08,856 INFO L384 CDTParser]: Found 1 translation units. [2023-11-24 21:49:08,858 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df81859e-06c0-4f6b-b526-1769f8b43837/sv-benchmarks/c/pthread-wmm/mix031.opt.i [2023-11-24 21:49:08,885 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df81859e-06c0-4f6b-b526-1769f8b43837/bin/uautomizer-verify-NlZe1sFDwI/data/7cd7b5423/f08141ace2994d99876f48f41f51e4a8/FLAG3f01d3775 [2023-11-24 21:49:08,906 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df81859e-06c0-4f6b-b526-1769f8b43837/bin/uautomizer-verify-NlZe1sFDwI/data/7cd7b5423/f08141ace2994d99876f48f41f51e4a8 [2023-11-24 21:49:08,912 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-24 21:49:08,917 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-24 21:49:08,921 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-24 21:49:08,922 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-24 21:49:08,929 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-24 21:49:08,932 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 09:49:08" (1/1) ... [2023-11-24 21:49:08,933 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43326867 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:49:08, skipping insertion in model container [2023-11-24 21:49:08,934 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 09:49:08" (1/1) ... [2023-11-24 21:49:09,006 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-24 21:49:09,541 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-24 21:49:09,557 INFO L202 MainTranslator]: Completed pre-run [2023-11-24 21:49:09,637 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-24 21:49:09,681 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-24 21:49:09,681 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-24 21:49:09,689 INFO L206 MainTranslator]: Completed translation [2023-11-24 21:49:09,690 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:49:09 WrapperNode [2023-11-24 21:49:09,690 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-24 21:49:09,692 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-24 21:49:09,692 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-24 21:49:09,692 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-24 21:49:09,702 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:49:09" (1/1) ... [2023-11-24 21:49:09,736 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:49:09" (1/1) ... [2023-11-24 21:49:09,777 INFO L138 Inliner]: procedures = 175, calls = 50, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 128 [2023-11-24 21:49:09,778 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-24 21:49:09,779 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-24 21:49:09,779 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-24 21:49:09,779 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-24 21:49:09,794 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:49:09" (1/1) ... [2023-11-24 21:49:09,795 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:49:09" (1/1) ... [2023-11-24 21:49:09,820 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:49:09" (1/1) ... [2023-11-24 21:49:09,840 INFO L175 MemorySlicer]: Split 4 memory accesses to 3 slices as follows [2, 1, 1]. 50 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 2 writes are split as follows [0, 1, 1]. [2023-11-24 21:49:09,841 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:49:09" (1/1) ... [2023-11-24 21:49:09,841 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:49:09" (1/1) ... [2023-11-24 21:49:09,852 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:49:09" (1/1) ... [2023-11-24 21:49:09,854 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:49:09" (1/1) ... [2023-11-24 21:49:09,857 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:49:09" (1/1) ... [2023-11-24 21:49:09,860 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:49:09" (1/1) ... [2023-11-24 21:49:09,865 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-24 21:49:09,866 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-24 21:49:09,866 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-24 21:49:09,867 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-24 21:49:09,868 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:49:09" (1/1) ... [2023-11-24 21:49:09,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-24 21:49:09,904 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df81859e-06c0-4f6b-b526-1769f8b43837/bin/uautomizer-verify-NlZe1sFDwI/z3 [2023-11-24 21:49:09,931 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df81859e-06c0-4f6b-b526-1769f8b43837/bin/uautomizer-verify-NlZe1sFDwI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-24 21:49:09,933 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df81859e-06c0-4f6b-b526-1769f8b43837/bin/uautomizer-verify-NlZe1sFDwI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-24 21:49:09,967 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-24 21:49:09,967 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-24 21:49:09,967 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-24 21:49:09,968 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-24 21:49:09,968 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-24 21:49:09,968 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-24 21:49:09,968 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-24 21:49:09,968 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-24 21:49:09,969 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-24 21:49:09,969 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-24 21:49:09,969 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-24 21:49:09,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-24 21:49:09,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-24 21:49:09,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-24 21:49:09,970 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-24 21:49:09,970 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-24 21:49:09,971 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-24 21:49:09,973 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-24 21:49:10,183 INFO L241 CfgBuilder]: Building ICFG [2023-11-24 21:49:10,186 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-24 21:49:10,586 INFO L282 CfgBuilder]: Performing block encoding [2023-11-24 21:49:10,895 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-24 21:49:10,895 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-24 21:49:10,896 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 09:49:10 BoogieIcfgContainer [2023-11-24 21:49:10,897 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-24 21:49:10,902 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-24 21:49:10,903 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-24 21:49:10,907 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-24 21:49:10,907 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 09:49:08" (1/3) ... [2023-11-24 21:49:10,908 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59191bb8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 09:49:10, skipping insertion in model container [2023-11-24 21:49:10,911 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:49:09" (2/3) ... [2023-11-24 21:49:10,913 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59191bb8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 09:49:10, skipping insertion in model container [2023-11-24 21:49:10,914 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 09:49:10" (3/3) ... [2023-11-24 21:49:10,916 INFO L112 eAbstractionObserver]: Analyzing ICFG mix031.opt.i [2023-11-24 21:49:10,939 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-24 21:49:10,939 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2023-11-24 21:49:10,940 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-24 21:49:10,995 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-24 21:49:11,036 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 45 transitions, 98 flow [2023-11-24 21:49:11,071 INFO L124 PetriNetUnfolderBase]: 2/43 cut-off events. [2023-11-24 21:49:11,071 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-24 21:49:11,075 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50 conditions, 43 events. 2/43 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 74 event pairs, 0 based on Foata normal form. 0/34 useless extension candidates. Maximal degree in co-relation 40. Up to 2 conditions per place. [2023-11-24 21:49:11,075 INFO L82 GeneralOperation]: Start removeDead. Operand has 50 places, 45 transitions, 98 flow [2023-11-24 21:49:11,079 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 48 places, 43 transitions, 92 flow [2023-11-24 21:49:11,092 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-24 21:49:11,100 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;@7a0eae0c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-24 21:49:11,100 INFO L358 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2023-11-24 21:49:11,104 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-24 21:49:11,105 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-11-24 21:49:11,105 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-24 21:49:11,105 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:49:11,106 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-24 21:49:11,107 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-24 21:49:11,113 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:49:11,113 INFO L85 PathProgramCache]: Analyzing trace with hash 11729, now seen corresponding path program 1 times [2023-11-24 21:49:11,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:49:11,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472826368] [2023-11-24 21:49:11,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:49:11,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:49:11,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:49:11,477 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-24 21:49:11,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:49:11,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472826368] [2023-11-24 21:49:11,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472826368] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:49:11,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:49:11,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-24 21:49:11,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375362859] [2023-11-24 21:49:11,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:49:11,493 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:49:11,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:49:11,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:49:11,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:49:11,553 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 45 [2023-11-24 21:49:11,557 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 43 transitions, 92 flow. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:49:11,557 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:49:11,558 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 45 [2023-11-24 21:49:11,559 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:49:12,001 INFO L124 PetriNetUnfolderBase]: 166/415 cut-off events. [2023-11-24 21:49:12,002 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-11-24 21:49:12,009 INFO L83 FinitePrefix]: Finished finitePrefix Result has 721 conditions, 415 events. 166/415 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 2596 event pairs, 122 based on Foata normal form. 30/403 useless extension candidates. Maximal degree in co-relation 708. Up to 220 conditions per place. [2023-11-24 21:49:12,017 INFO L140 encePairwiseOnDemand]: 40/45 looper letters, 22 selfloop transitions, 2 changer transitions 0/45 dead transitions. [2023-11-24 21:49:12,017 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 45 transitions, 144 flow [2023-11-24 21:49:12,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:49:12,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 21:49:12,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 96 transitions. [2023-11-24 21:49:12,037 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7111111111111111 [2023-11-24 21:49:12,038 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 96 transitions. [2023-11-24 21:49:12,040 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 96 transitions. [2023-11-24 21:49:12,042 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:49:12,045 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 96 transitions. [2023-11-24 21:49:12,050 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:49:12,058 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 45.0) internal successors, (180), 4 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:49:12,059 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 45.0) internal successors, (180), 4 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:49:12,061 INFO L175 Difference]: Start difference. First operand has 48 places, 43 transitions, 92 flow. Second operand 3 states and 96 transitions. [2023-11-24 21:49:12,063 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 45 transitions, 144 flow [2023-11-24 21:49:12,066 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 45 transitions, 142 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 21:49:12,074 INFO L231 Difference]: Finished difference. Result has 46 places, 39 transitions, 86 flow [2023-11-24 21:49:12,077 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=86, PETRI_PLACES=46, PETRI_TRANSITIONS=39} [2023-11-24 21:49:12,084 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, -2 predicate places. [2023-11-24 21:49:12,085 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 39 transitions, 86 flow [2023-11-24 21:49:12,086 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:49:12,086 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:49:12,086 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-24 21:49:12,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-24 21:49:12,087 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-24 21:49:12,088 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:49:12,088 INFO L85 PathProgramCache]: Analyzing trace with hash 11730, now seen corresponding path program 1 times [2023-11-24 21:49:12,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:49:12,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073676725] [2023-11-24 21:49:12,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:49:12,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:49:12,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:49:12,312 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-24 21:49:12,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:49:12,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073676725] [2023-11-24 21:49:12,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073676725] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:49:12,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:49:12,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-24 21:49:12,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962567522] [2023-11-24 21:49:12,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:49:12,316 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:49:12,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:49:12,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:49:12,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:49:12,331 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 45 [2023-11-24 21:49:12,332 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 39 transitions, 86 flow. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:49:12,332 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:49:12,332 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 45 [2023-11-24 21:49:12,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:49:12,490 INFO L124 PetriNetUnfolderBase]: 166/410 cut-off events. [2023-11-24 21:49:12,490 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2023-11-24 21:49:12,493 INFO L83 FinitePrefix]: Finished finitePrefix Result has 731 conditions, 410 events. 166/410 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 2568 event pairs, 164 based on Foata normal form. 0/373 useless extension candidates. Maximal degree in co-relation 719. Up to 290 conditions per place. [2023-11-24 21:49:12,497 INFO L140 encePairwiseOnDemand]: 42/45 looper letters, 18 selfloop transitions, 2 changer transitions 0/40 dead transitions. [2023-11-24 21:49:12,497 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 40 transitions, 128 flow [2023-11-24 21:49:12,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:49:12,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 21:49:12,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 90 transitions. [2023-11-24 21:49:12,500 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2023-11-24 21:49:12,500 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 90 transitions. [2023-11-24 21:49:12,501 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 90 transitions. [2023-11-24 21:49:12,501 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:49:12,502 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 90 transitions. [2023-11-24 21:49:12,503 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:49:12,504 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 45.0) internal successors, (180), 4 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:49:12,505 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 45.0) internal successors, (180), 4 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:49:12,505 INFO L175 Difference]: Start difference. First operand has 46 places, 39 transitions, 86 flow. Second operand 3 states and 90 transitions. [2023-11-24 21:49:12,505 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 40 transitions, 128 flow [2023-11-24 21:49:12,507 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 40 transitions, 124 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 21:49:12,509 INFO L231 Difference]: Finished difference. Result has 45 places, 38 transitions, 84 flow [2023-11-24 21:49:12,509 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=84, PETRI_PLACES=45, PETRI_TRANSITIONS=38} [2023-11-24 21:49:12,511 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, -3 predicate places. [2023-11-24 21:49:12,511 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 38 transitions, 84 flow [2023-11-24 21:49:12,511 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:49:12,512 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:49:12,512 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-24 21:49:12,512 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-24 21:49:12,513 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-24 21:49:12,513 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:49:12,514 INFO L85 PathProgramCache]: Analyzing trace with hash 349744050, now seen corresponding path program 1 times [2023-11-24 21:49:12,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:49:12,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592310562] [2023-11-24 21:49:12,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:49:12,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:49:12,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:49:12,588 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-24 21:49:12,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:49:12,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592310562] [2023-11-24 21:49:12,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592310562] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:49:12,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:49:12,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-24 21:49:12,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061423798] [2023-11-24 21:49:12,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:49:12,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:49:12,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:49:12,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:49:12,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:49:12,606 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 45 [2023-11-24 21:49:12,613 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 38 transitions, 84 flow. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:49:12,613 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:49:12,613 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 45 [2023-11-24 21:49:12,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:49:12,787 INFO L124 PetriNetUnfolderBase]: 168/413 cut-off events. [2023-11-24 21:49:12,788 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-24 21:49:12,791 INFO L83 FinitePrefix]: Finished finitePrefix Result has 726 conditions, 413 events. 168/413 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 2566 event pairs, 80 based on Foata normal form. 0/377 useless extension candidates. Maximal degree in co-relation 715. Up to 220 conditions per place. [2023-11-24 21:49:12,794 INFO L140 encePairwiseOnDemand]: 42/45 looper letters, 22 selfloop transitions, 2 changer transitions 0/43 dead transitions. [2023-11-24 21:49:12,795 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 43 transitions, 142 flow [2023-11-24 21:49:12,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:49:12,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 21:49:12,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 94 transitions. [2023-11-24 21:49:12,802 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6962962962962963 [2023-11-24 21:49:12,803 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 94 transitions. [2023-11-24 21:49:12,803 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 94 transitions. [2023-11-24 21:49:12,805 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:49:12,806 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 94 transitions. [2023-11-24 21:49:12,808 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:49:12,809 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 45.0) internal successors, (180), 4 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:49:12,810 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 45.0) internal successors, (180), 4 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:49:12,811 INFO L175 Difference]: Start difference. First operand has 45 places, 38 transitions, 84 flow. Second operand 3 states and 94 transitions. [2023-11-24 21:49:12,811 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 43 transitions, 142 flow [2023-11-24 21:49:12,812 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 43 transitions, 138 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 21:49:12,814 INFO L231 Difference]: Finished difference. Result has 44 places, 37 transitions, 82 flow [2023-11-24 21:49:12,814 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=82, PETRI_PLACES=44, PETRI_TRANSITIONS=37} [2023-11-24 21:49:12,816 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, -4 predicate places. [2023-11-24 21:49:12,816 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 37 transitions, 82 flow [2023-11-24 21:49:12,817 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:49:12,817 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:49:12,817 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-24 21:49:12,817 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-24 21:49:12,818 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-24 21:49:12,819 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:49:12,819 INFO L85 PathProgramCache]: Analyzing trace with hash 349744051, now seen corresponding path program 1 times [2023-11-24 21:49:12,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:49:12,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111636395] [2023-11-24 21:49:12,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:49:12,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:49:12,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:49:12,988 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-24 21:49:13,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:49:13,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111636395] [2023-11-24 21:49:13,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111636395] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:49:13,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:49:13,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-24 21:49:13,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771949968] [2023-11-24 21:49:13,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:49:13,014 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:49:13,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:49:13,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:49:13,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:49:13,037 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 45 [2023-11-24 21:49:13,037 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 37 transitions, 82 flow. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:49:13,037 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:49:13,038 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 45 [2023-11-24 21:49:13,038 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:49:13,193 INFO L124 PetriNetUnfolderBase]: 166/408 cut-off events. [2023-11-24 21:49:13,193 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2023-11-24 21:49:13,194 INFO L83 FinitePrefix]: Finished finitePrefix Result has 730 conditions, 408 events. 166/408 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 2541 event pairs, 80 based on Foata normal form. 3/377 useless extension candidates. Maximal degree in co-relation 720. Up to 215 conditions per place. [2023-11-24 21:49:13,198 INFO L140 encePairwiseOnDemand]: 42/45 looper letters, 21 selfloop transitions, 2 changer transitions 0/42 dead transitions. [2023-11-24 21:49:13,198 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 42 transitions, 138 flow [2023-11-24 21:49:13,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:49:13,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 21:49:13,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 96 transitions. [2023-11-24 21:49:13,200 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7111111111111111 [2023-11-24 21:49:13,200 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 96 transitions. [2023-11-24 21:49:13,201 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 96 transitions. [2023-11-24 21:49:13,201 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:49:13,201 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 96 transitions. [2023-11-24 21:49:13,202 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:49:13,204 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 45.0) internal successors, (180), 4 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:49:13,205 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 45.0) internal successors, (180), 4 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:49:13,205 INFO L175 Difference]: Start difference. First operand has 44 places, 37 transitions, 82 flow. Second operand 3 states and 96 transitions. [2023-11-24 21:49:13,205 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 42 transitions, 138 flow [2023-11-24 21:49:13,208 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 42 transitions, 134 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 21:49:13,210 INFO L231 Difference]: Finished difference. Result has 43 places, 36 transitions, 80 flow [2023-11-24 21:49:13,210 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=80, PETRI_PLACES=43, PETRI_TRANSITIONS=36} [2023-11-24 21:49:13,213 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, -5 predicate places. [2023-11-24 21:49:13,213 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 36 transitions, 80 flow [2023-11-24 21:49:13,213 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:49:13,213 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:49:13,214 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:49:13,214 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-24 21:49:13,215 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-24 21:49:13,216 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:49:13,216 INFO L85 PathProgramCache]: Analyzing trace with hash -365338247, now seen corresponding path program 1 times [2023-11-24 21:49:13,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:49:13,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133109490] [2023-11-24 21:49:13,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:49:13,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:49:13,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:49:13,436 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-24 21:49:13,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:49:13,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133109490] [2023-11-24 21:49:13,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133109490] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:49:13,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:49:13,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-24 21:49:13,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092769516] [2023-11-24 21:49:13,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:49:13,438 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:49:13,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:49:13,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:49:13,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:49:13,445 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 45 [2023-11-24 21:49:13,445 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 36 transitions, 80 flow. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:49:13,445 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:49:13,446 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 45 [2023-11-24 21:49:13,446 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:49:13,577 INFO L124 PetriNetUnfolderBase]: 129/359 cut-off events. [2023-11-24 21:49:13,584 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2023-11-24 21:49:13,587 INFO L83 FinitePrefix]: Finished finitePrefix Result has 617 conditions, 359 events. 129/359 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 2064 event pairs, 18 based on Foata normal form. 0/356 useless extension candidates. Maximal degree in co-relation 607. Up to 184 conditions per place. [2023-11-24 21:49:13,590 INFO L140 encePairwiseOnDemand]: 42/45 looper letters, 21 selfloop transitions, 2 changer transitions 2/44 dead transitions. [2023-11-24 21:49:13,590 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 44 transitions, 148 flow [2023-11-24 21:49:13,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:49:13,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 21:49:13,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 101 transitions. [2023-11-24 21:49:13,593 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7481481481481481 [2023-11-24 21:49:13,593 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 101 transitions. [2023-11-24 21:49:13,593 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 101 transitions. [2023-11-24 21:49:13,594 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:49:13,594 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 101 transitions. [2023-11-24 21:49:13,595 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:49:13,595 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 45.0) internal successors, (180), 4 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:49:13,596 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 45.0) internal successors, (180), 4 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:49:13,596 INFO L175 Difference]: Start difference. First operand has 43 places, 36 transitions, 80 flow. Second operand 3 states and 101 transitions. [2023-11-24 21:49:13,596 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 44 transitions, 148 flow [2023-11-24 21:49:13,597 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 44 transitions, 142 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 21:49:13,598 INFO L231 Difference]: Finished difference. Result has 42 places, 34 transitions, 76 flow [2023-11-24 21:49:13,598 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=76, PETRI_PLACES=42, PETRI_TRANSITIONS=34} [2023-11-24 21:49:13,602 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, -6 predicate places. [2023-11-24 21:49:13,602 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 34 transitions, 76 flow [2023-11-24 21:49:13,603 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:49:13,603 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:49:13,603 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:49:13,603 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-24 21:49:13,604 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-24 21:49:13,609 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:49:13,609 INFO L85 PathProgramCache]: Analyzing trace with hash 356945886, now seen corresponding path program 1 times [2023-11-24 21:49:13,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:49:13,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157925968] [2023-11-24 21:49:13,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:49:13,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:49:13,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:49:14,124 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-24 21:49:14,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:49:14,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157925968] [2023-11-24 21:49:14,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157925968] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:49:14,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:49:14,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-24 21:49:14,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981540671] [2023-11-24 21:49:14,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:49:14,127 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-24 21:49:14,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:49:14,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-24 21:49:14,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-24 21:49:14,225 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 45 [2023-11-24 21:49:14,226 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 34 transitions, 76 flow. Second operand has 6 states, 6 states have (on average 23.833333333333332) internal successors, (143), 6 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-24 21:49:14,226 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:49:14,226 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 45 [2023-11-24 21:49:14,226 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:49:14,461 INFO L124 PetriNetUnfolderBase]: 144/353 cut-off events. [2023-11-24 21:49:14,461 INFO L125 PetriNetUnfolderBase]: For 21/21 co-relation queries the response was YES. [2023-11-24 21:49:14,463 INFO L83 FinitePrefix]: Finished finitePrefix Result has 643 conditions, 353 events. 144/353 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 2053 event pairs, 120 based on Foata normal form. 15/357 useless extension candidates. Maximal degree in co-relation 631. Up to 215 conditions per place. [2023-11-24 21:49:14,467 INFO L140 encePairwiseOnDemand]: 41/45 looper letters, 16 selfloop transitions, 2 changer transitions 7/41 dead transitions. [2023-11-24 21:49:14,467 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 41 transitions, 142 flow [2023-11-24 21:49:14,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-24 21:49:14,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-24 21:49:14,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 136 transitions. [2023-11-24 21:49:14,469 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6044444444444445 [2023-11-24 21:49:14,469 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 136 transitions. [2023-11-24 21:49:14,469 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 136 transitions. [2023-11-24 21:49:14,470 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:49:14,470 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 136 transitions. [2023-11-24 21:49:14,471 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 27.2) internal successors, (136), 5 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:49:14,473 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 45.0) internal successors, (270), 6 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:49:14,474 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 45.0) internal successors, (270), 6 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:49:14,474 INFO L175 Difference]: Start difference. First operand has 42 places, 34 transitions, 76 flow. Second operand 5 states and 136 transitions. [2023-11-24 21:49:14,474 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 41 transitions, 142 flow [2023-11-24 21:49:14,477 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 41 transitions, 136 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 21:49:14,478 INFO L231 Difference]: Finished difference. Result has 42 places, 32 transitions, 72 flow [2023-11-24 21:49:14,479 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=72, PETRI_PLACES=42, PETRI_TRANSITIONS=32} [2023-11-24 21:49:14,482 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, -6 predicate places. [2023-11-24 21:49:14,483 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 32 transitions, 72 flow [2023-11-24 21:49:14,483 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.833333333333332) internal successors, (143), 6 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-24 21:49:14,483 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:49:14,484 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:49:14,484 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-24 21:49:14,484 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-24 21:49:14,485 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:49:14,485 INFO L85 PathProgramCache]: Analyzing trace with hash 356945738, now seen corresponding path program 1 times [2023-11-24 21:49:14,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:49:14,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016462163] [2023-11-24 21:49:14,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:49:14,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:49:14,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:49:14,765 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-24 21:49:14,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:49:14,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016462163] [2023-11-24 21:49:14,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016462163] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:49:14,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:49:14,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-24 21:49:14,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037172052] [2023-11-24 21:49:14,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:49:14,774 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-24 21:49:14,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:49:14,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-24 21:49:14,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-24 21:49:14,783 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 45 [2023-11-24 21:49:14,784 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 32 transitions, 72 flow. Second operand has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:49:14,784 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:49:14,784 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 45 [2023-11-24 21:49:14,784 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:49:14,972 INFO L124 PetriNetUnfolderBase]: 161/372 cut-off events. [2023-11-24 21:49:14,972 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-11-24 21:49:14,974 INFO L83 FinitePrefix]: Finished finitePrefix Result has 690 conditions, 372 events. 161/372 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1880 event pairs, 24 based on Foata normal form. 20/383 useless extension candidates. Maximal degree in co-relation 679. Up to 166 conditions per place. [2023-11-24 21:49:14,976 INFO L140 encePairwiseOnDemand]: 40/45 looper letters, 28 selfloop transitions, 4 changer transitions 1/48 dead transitions. [2023-11-24 21:49:14,977 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 48 transitions, 174 flow [2023-11-24 21:49:14,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-24 21:49:14,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-24 21:49:14,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 123 transitions. [2023-11-24 21:49:14,979 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6833333333333333 [2023-11-24 21:49:14,979 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 123 transitions. [2023-11-24 21:49:14,979 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 123 transitions. [2023-11-24 21:49:14,980 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:49:14,980 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 123 transitions. [2023-11-24 21:49:14,981 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 30.75) internal successors, (123), 4 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:49:14,982 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 45.0) internal successors, (225), 5 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:49:14,986 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 45.0) internal successors, (225), 5 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:49:14,986 INFO L175 Difference]: Start difference. First operand has 42 places, 32 transitions, 72 flow. Second operand 4 states and 123 transitions. [2023-11-24 21:49:14,986 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 48 transitions, 174 flow [2023-11-24 21:49:14,987 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 48 transitions, 170 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 21:49:14,989 INFO L231 Difference]: Finished difference. Result has 43 places, 34 transitions, 95 flow [2023-11-24 21:49:14,989 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=69, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=95, PETRI_PLACES=43, PETRI_TRANSITIONS=34} [2023-11-24 21:49:14,990 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, -5 predicate places. [2023-11-24 21:49:14,991 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 34 transitions, 95 flow [2023-11-24 21:49:14,991 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:49:14,993 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:49:14,993 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] [2023-11-24 21:49:14,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-24 21:49:14,994 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-24 21:49:14,995 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:49:14,995 INFO L85 PathProgramCache]: Analyzing trace with hash -1057061812, now seen corresponding path program 1 times [2023-11-24 21:49:14,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:49:14,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746685002] [2023-11-24 21:49:14,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:49:14,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:49:15,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:49:15,323 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-24 21:49:15,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:49:15,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746685002] [2023-11-24 21:49:15,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746685002] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:49:15,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:49:15,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-24 21:49:15,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37965236] [2023-11-24 21:49:15,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:49:15,325 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-24 21:49:15,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:49:15,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-24 21:49:15,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-24 21:49:15,335 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 45 [2023-11-24 21:49:15,336 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 34 transitions, 95 flow. Second operand has 5 states, 5 states have (on average 24.4) internal successors, (122), 5 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:49:15,336 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:49:15,336 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 45 [2023-11-24 21:49:15,336 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:49:15,511 INFO L124 PetriNetUnfolderBase]: 84/199 cut-off events. [2023-11-24 21:49:15,511 INFO L125 PetriNetUnfolderBase]: For 57/57 co-relation queries the response was YES. [2023-11-24 21:49:15,512 INFO L83 FinitePrefix]: Finished finitePrefix Result has 458 conditions, 199 events. 84/199 cut-off events. For 57/57 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 689 event pairs, 16 based on Foata normal form. 14/206 useless extension candidates. Maximal degree in co-relation 445. Up to 71 conditions per place. [2023-11-24 21:49:15,514 INFO L140 encePairwiseOnDemand]: 40/45 looper letters, 24 selfloop transitions, 6 changer transitions 1/46 dead transitions. [2023-11-24 21:49:15,514 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 46 transitions, 187 flow [2023-11-24 21:49:15,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-24 21:49:15,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-24 21:49:15,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 143 transitions. [2023-11-24 21:49:15,516 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6355555555555555 [2023-11-24 21:49:15,516 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 143 transitions. [2023-11-24 21:49:15,516 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 143 transitions. [2023-11-24 21:49:15,516 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:49:15,516 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 143 transitions. [2023-11-24 21:49:15,517 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 28.6) internal successors, (143), 5 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-24 21:49:15,518 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 45.0) internal successors, (270), 6 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:49:15,519 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 45.0) internal successors, (270), 6 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:49:15,519 INFO L175 Difference]: Start difference. First operand has 43 places, 34 transitions, 95 flow. Second operand 5 states and 143 transitions. [2023-11-24 21:49:15,519 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 46 transitions, 187 flow [2023-11-24 21:49:15,521 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 46 transitions, 178 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-11-24 21:49:15,523 INFO L231 Difference]: Finished difference. Result has 47 places, 34 transitions, 111 flow [2023-11-24 21:49:15,524 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=111, PETRI_PLACES=47, PETRI_TRANSITIONS=34} [2023-11-24 21:49:15,526 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, -1 predicate places. [2023-11-24 21:49:15,527 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 34 transitions, 111 flow [2023-11-24 21:49:15,527 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.4) internal successors, (122), 5 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:49:15,527 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:49:15,527 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] [2023-11-24 21:49:15,527 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-24 21:49:15,528 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-24 21:49:15,528 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:49:15,528 INFO L85 PathProgramCache]: Analyzing trace with hash -1491193102, now seen corresponding path program 1 times [2023-11-24 21:49:15,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:49:15,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812700416] [2023-11-24 21:49:15,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:49:15,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:49:15,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:49:15,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-24 21:49:15,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:49:15,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812700416] [2023-11-24 21:49:15,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812700416] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:49:15,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:49:15,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-24 21:49:15,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099067016] [2023-11-24 21:49:15,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:49:15,964 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-24 21:49:15,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:49:15,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-24 21:49:15,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-24 21:49:15,977 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 45 [2023-11-24 21:49:15,978 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 34 transitions, 111 flow. Second operand has 6 states, 6 states have (on average 22.833333333333332) internal successors, (137), 6 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:49:15,978 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:49:15,978 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 45 [2023-11-24 21:49:15,978 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:49:16,250 INFO L124 PetriNetUnfolderBase]: 141/346 cut-off events. [2023-11-24 21:49:16,250 INFO L125 PetriNetUnfolderBase]: For 106/106 co-relation queries the response was YES. [2023-11-24 21:49:16,252 INFO L83 FinitePrefix]: Finished finitePrefix Result has 757 conditions, 346 events. 141/346 cut-off events. For 106/106 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1407 event pairs, 33 based on Foata normal form. 4/343 useless extension candidates. Maximal degree in co-relation 742. Up to 163 conditions per place. [2023-11-24 21:49:16,254 INFO L140 encePairwiseOnDemand]: 36/45 looper letters, 30 selfloop transitions, 8 changer transitions 9/62 dead transitions. [2023-11-24 21:49:16,254 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 62 transitions, 273 flow [2023-11-24 21:49:16,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-24 21:49:16,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-24 21:49:16,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 188 transitions. [2023-11-24 21:49:16,256 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5968253968253968 [2023-11-24 21:49:16,256 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 188 transitions. [2023-11-24 21:49:16,256 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 188 transitions. [2023-11-24 21:49:16,257 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:49:16,257 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 188 transitions. [2023-11-24 21:49:16,258 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 26.857142857142858) internal successors, (188), 7 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:49:16,259 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 45.0) internal successors, (360), 8 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:49:16,259 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 45.0) internal successors, (360), 8 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:49:16,259 INFO L175 Difference]: Start difference. First operand has 47 places, 34 transitions, 111 flow. Second operand 7 states and 188 transitions. [2023-11-24 21:49:16,260 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 62 transitions, 273 flow [2023-11-24 21:49:16,262 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 62 transitions, 239 flow, removed 8 selfloop flow, removed 6 redundant places. [2023-11-24 21:49:16,264 INFO L231 Difference]: Finished difference. Result has 51 places, 40 transitions, 135 flow [2023-11-24 21:49:16,264 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=83, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=135, PETRI_PLACES=51, PETRI_TRANSITIONS=40} [2023-11-24 21:49:16,265 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 3 predicate places. [2023-11-24 21:49:16,265 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 40 transitions, 135 flow [2023-11-24 21:49:16,265 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.833333333333332) internal successors, (137), 6 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:49:16,266 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:49:16,266 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] [2023-11-24 21:49:16,266 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-24 21:49:16,266 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-24 21:49:16,267 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:49:16,267 INFO L85 PathProgramCache]: Analyzing trace with hash -2118546638, now seen corresponding path program 2 times [2023-11-24 21:49:16,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:49:16,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24253871] [2023-11-24 21:49:16,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:49:16,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:49:16,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:49:16,627 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-24 21:49:16,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:49:16,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24253871] [2023-11-24 21:49:16,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24253871] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:49:16,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:49:16,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-24 21:49:16,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945069719] [2023-11-24 21:49:16,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:49:16,629 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-24 21:49:16,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:49:16,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-24 21:49:16,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-24 21:49:16,655 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 45 [2023-11-24 21:49:16,655 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 40 transitions, 135 flow. Second operand has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 7 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:49:16,655 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:49:16,656 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 45 [2023-11-24 21:49:16,656 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:49:16,955 INFO L124 PetriNetUnfolderBase]: 171/419 cut-off events. [2023-11-24 21:49:16,956 INFO L125 PetriNetUnfolderBase]: For 92/92 co-relation queries the response was YES. [2023-11-24 21:49:16,957 INFO L83 FinitePrefix]: Finished finitePrefix Result has 937 conditions, 419 events. 171/419 cut-off events. For 92/92 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1864 event pairs, 51 based on Foata normal form. 4/412 useless extension candidates. Maximal degree in co-relation 921. Up to 151 conditions per place. [2023-11-24 21:49:16,959 INFO L140 encePairwiseOnDemand]: 37/45 looper letters, 20 selfloop transitions, 3 changer transitions 27/65 dead transitions. [2023-11-24 21:49:16,959 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 65 transitions, 301 flow [2023-11-24 21:49:16,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-24 21:49:16,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-24 21:49:16,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 210 transitions. [2023-11-24 21:49:16,961 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5833333333333334 [2023-11-24 21:49:16,962 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 210 transitions. [2023-11-24 21:49:16,962 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 210 transitions. [2023-11-24 21:49:16,962 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:49:16,962 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 210 transitions. [2023-11-24 21:49:16,963 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 26.25) internal successors, (210), 8 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:49:16,965 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 45.0) internal successors, (405), 9 states have internal predecessors, (405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:49:16,965 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 45.0) internal successors, (405), 9 states have internal predecessors, (405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:49:16,965 INFO L175 Difference]: Start difference. First operand has 51 places, 40 transitions, 135 flow. Second operand 8 states and 210 transitions. [2023-11-24 21:49:16,965 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 65 transitions, 301 flow [2023-11-24 21:49:16,968 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 65 transitions, 295 flow, removed 3 selfloop flow, removed 2 redundant places. [2023-11-24 21:49:16,969 INFO L231 Difference]: Finished difference. Result has 57 places, 34 transitions, 110 flow [2023-11-24 21:49:16,970 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=131, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=110, PETRI_PLACES=57, PETRI_TRANSITIONS=34} [2023-11-24 21:49:16,970 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 9 predicate places. [2023-11-24 21:49:16,970 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 34 transitions, 110 flow [2023-11-24 21:49:16,971 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 7 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:49:16,971 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:49:16,971 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] [2023-11-24 21:49:16,971 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-24 21:49:16,972 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-24 21:49:16,972 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:49:16,972 INFO L85 PathProgramCache]: Analyzing trace with hash 1478614836, now seen corresponding path program 3 times [2023-11-24 21:49:16,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:49:16,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455321213] [2023-11-24 21:49:16,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:49:16,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:49:17,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:49:17,676 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-24 21:49:17,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:49:17,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455321213] [2023-11-24 21:49:17,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455321213] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:49:17,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:49:17,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-24 21:49:17,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111816737] [2023-11-24 21:49:17,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:49:17,679 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-24 21:49:17,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:49:17,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-24 21:49:17,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-24 21:49:17,689 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 45 [2023-11-24 21:49:17,690 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 34 transitions, 110 flow. Second operand has 8 states, 8 states have (on average 25.625) internal successors, (205), 8 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-24 21:49:17,690 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:49:17,690 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 45 [2023-11-24 21:49:17,691 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:49:17,933 INFO L124 PetriNetUnfolderBase]: 67/207 cut-off events. [2023-11-24 21:49:17,933 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2023-11-24 21:49:17,934 INFO L83 FinitePrefix]: Finished finitePrefix Result has 436 conditions, 207 events. 67/207 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 746 event pairs, 8 based on Foata normal form. 4/203 useless extension candidates. Maximal degree in co-relation 417. Up to 37 conditions per place. [2023-11-24 21:49:17,936 INFO L140 encePairwiseOnDemand]: 37/45 looper letters, 16 selfloop transitions, 4 changer transitions 14/53 dead transitions. [2023-11-24 21:49:17,936 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 53 transitions, 224 flow [2023-11-24 21:49:17,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-24 21:49:17,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-24 21:49:17,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 251 transitions. [2023-11-24 21:49:17,939 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6197530864197531 [2023-11-24 21:49:17,939 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 251 transitions. [2023-11-24 21:49:17,939 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 251 transitions. [2023-11-24 21:49:17,940 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:49:17,940 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 251 transitions. [2023-11-24 21:49:17,943 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 27.88888888888889) internal successors, (251), 9 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:49:17,945 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 45.0) internal successors, (450), 10 states have internal predecessors, (450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:49:17,945 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 45.0) internal successors, (450), 10 states have internal predecessors, (450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:49:17,946 INFO L175 Difference]: Start difference. First operand has 57 places, 34 transitions, 110 flow. Second operand 9 states and 251 transitions. [2023-11-24 21:49:17,946 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 53 transitions, 224 flow [2023-11-24 21:49:17,947 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 53 transitions, 197 flow, removed 10 selfloop flow, removed 7 redundant places. [2023-11-24 21:49:17,949 INFO L231 Difference]: Finished difference. Result has 57 places, 34 transitions, 109 flow [2023-11-24 21:49:17,949 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=91, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=109, PETRI_PLACES=57, PETRI_TRANSITIONS=34} [2023-11-24 21:49:17,950 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 9 predicate places. [2023-11-24 21:49:17,950 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 34 transitions, 109 flow [2023-11-24 21:49:17,950 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 25.625) internal successors, (205), 8 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-24 21:49:17,950 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:49:17,951 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] [2023-11-24 21:49:17,951 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-24 21:49:17,951 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-24 21:49:17,952 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:49:17,952 INFO L85 PathProgramCache]: Analyzing trace with hash -1043985168, now seen corresponding path program 4 times [2023-11-24 21:49:17,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:49:17,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060556183] [2023-11-24 21:49:17,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:49:17,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:49:18,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-24 21:49:18,014 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-24 21:49:18,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-24 21:49:18,109 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-24 21:49:18,109 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-24 21:49:18,110 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK (9 of 10 remaining) [2023-11-24 21:49:18,112 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (8 of 10 remaining) [2023-11-24 21:49:18,113 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 10 remaining) [2023-11-24 21:49:18,113 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 10 remaining) [2023-11-24 21:49:18,114 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 10 remaining) [2023-11-24 21:49:18,114 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 10 remaining) [2023-11-24 21:49:18,114 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK (3 of 10 remaining) [2023-11-24 21:49:18,114 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 10 remaining) [2023-11-24 21:49:18,114 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 10 remaining) [2023-11-24 21:49:18,115 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 10 remaining) [2023-11-24 21:49:18,115 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-24 21:49:18,115 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:49:18,123 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-24 21:49:18,123 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-24 21:49:18,196 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-24 21:49:18,198 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-24 21:49:18,222 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-24 21:49:18,223 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-24 21:49:18,235 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.11 09:49:18 BasicIcfg [2023-11-24 21:49:18,235 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-24 21:49:18,235 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-24 21:49:18,235 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-24 21:49:18,236 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-24 21:49:18,236 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 09:49:10" (3/4) ... [2023-11-24 21:49:18,238 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-24 21:49:18,239 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-24 21:49:18,240 INFO L158 Benchmark]: Toolchain (without parser) took 9323.01ms. Allocated memory was 142.6MB in the beginning and 251.7MB in the end (delta: 109.1MB). Free memory was 108.2MB in the beginning and 129.2MB in the end (delta: -21.0MB). Peak memory consumption was 89.5MB. Max. memory is 16.1GB. [2023-11-24 21:49:18,240 INFO L158 Benchmark]: CDTParser took 0.34ms. Allocated memory is still 142.6MB. Free memory is still 88.7MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-24 21:49:18,240 INFO L158 Benchmark]: CACSL2BoogieTranslator took 769.69ms. Allocated memory is still 142.6MB. Free memory was 108.2MB in the beginning and 85.5MB in the end (delta: 22.7MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2023-11-24 21:49:18,241 INFO L158 Benchmark]: Boogie Procedure Inliner took 86.11ms. Allocated memory is still 142.6MB. Free memory was 85.5MB in the beginning and 83.1MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-24 21:49:18,241 INFO L158 Benchmark]: Boogie Preprocessor took 86.60ms. Allocated memory is still 142.6MB. Free memory was 83.1MB in the beginning and 79.8MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-24 21:49:18,242 INFO L158 Benchmark]: RCFGBuilder took 1030.74ms. Allocated memory was 142.6MB in the beginning and 209.7MB in the end (delta: 67.1MB). Free memory was 79.8MB in the beginning and 152.6MB in the end (delta: -72.8MB). Peak memory consumption was 25.3MB. Max. memory is 16.1GB. [2023-11-24 21:49:18,242 INFO L158 Benchmark]: TraceAbstraction took 7333.09ms. Allocated memory was 209.7MB in the beginning and 251.7MB in the end (delta: 41.9MB). Free memory was 151.5MB in the beginning and 129.2MB in the end (delta: 22.3MB). Peak memory consumption was 64.2MB. Max. memory is 16.1GB. [2023-11-24 21:49:18,243 INFO L158 Benchmark]: Witness Printer took 3.70ms. Allocated memory is still 251.7MB. Free memory is still 129.2MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-24 21:49:18,246 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.34ms. Allocated memory is still 142.6MB. Free memory is still 88.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 769.69ms. Allocated memory is still 142.6MB. Free memory was 108.2MB in the beginning and 85.5MB in the end (delta: 22.7MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 86.11ms. Allocated memory is still 142.6MB. Free memory was 85.5MB in the beginning and 83.1MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 86.60ms. Allocated memory is still 142.6MB. Free memory was 83.1MB in the beginning and 79.8MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1030.74ms. Allocated memory was 142.6MB in the beginning and 209.7MB in the end (delta: 67.1MB). Free memory was 79.8MB in the beginning and 152.6MB in the end (delta: -72.8MB). Peak memory consumption was 25.3MB. Max. memory is 16.1GB. * TraceAbstraction took 7333.09ms. Allocated memory was 209.7MB in the beginning and 251.7MB in the end (delta: 41.9MB). Free memory was 151.5MB in the beginning and 129.2MB in the end (delta: 22.3MB). Peak memory consumption was 64.2MB. Max. memory is 16.1GB. * Witness Printer took 3.70ms. Allocated memory is still 251.7MB. Free memory is still 129.2MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: 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: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p0_EBX = 0; [L715] 0 int __unbuffered_p1_EAX = 0; [L717] 0 int __unbuffered_p1_EBX = 0; [L719] 0 int a = 0; [L720] 0 _Bool main$tmp_guard0; [L721] 0 _Bool main$tmp_guard1; [L723] 0 int x = 0; [L725] 0 int y = 0; [L726] 0 _Bool y$flush_delayed; [L727] 0 int y$mem_tmp; [L728] 0 _Bool y$r_buff0_thd0; [L729] 0 _Bool y$r_buff0_thd1; [L730] 0 _Bool y$r_buff0_thd2; [L731] 0 _Bool y$r_buff1_thd0; [L732] 0 _Bool y$r_buff1_thd1; [L733] 0 _Bool y$r_buff1_thd2; [L734] 0 _Bool y$read_delayed; [L735] 0 int *y$read_delayed_var; [L736] 0 int y$w_buff0; [L737] 0 _Bool y$w_buff0_used; [L738] 0 int y$w_buff1; [L739] 0 _Bool y$w_buff1_used; [L741] 0 int z = 0; [L742] 0 _Bool weak$$choice0; [L743] 0 _Bool weak$$choice2; [L823] 0 pthread_t t835; [L824] FCALL, FORK 0 pthread_create(&t835, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t835={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L825] 0 pthread_t t836; [L826] FCALL, FORK 0 pthread_create(&t836, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t835={5:0}, t836={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L781] 2 y$w_buff1 = y$w_buff0 [L782] 2 y$w_buff0 = 1 [L783] 2 y$w_buff1_used = y$w_buff0_used [L784] 2 y$w_buff0_used = (_Bool)1 [L785] CALL 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L785] RET 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L786] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L787] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L788] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L789] 2 y$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L792] 2 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L795] 2 __unbuffered_p1_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L798] 2 __unbuffered_p1_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L747] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L750] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L753] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L756] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L757] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L758] 1 y$flush_delayed = weak$$choice2 [L759] 1 y$mem_tmp = y [L760] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L761] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L762] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L763] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L764] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L765] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L766] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L767] 1 __unbuffered_p0_EBX = y [L768] 1 y = y$flush_delayed ? y$mem_tmp : y [L769] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L801] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L802] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L803] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L804] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L805] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L808] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L774] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L828] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t835={5:0}, t836={3:0}, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L830] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L830] RET 0 assume_abort_if_not(main$tmp_guard0) [L832] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L833] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L834] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L835] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L836] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t835={5:0}, t836={3:0}, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L839] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t835={5:0}, t836={3:0}, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L841] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] CALL 0 reach_error() [L18] COND FALSE 0 !(0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L18] 0 __assert_fail ("0", "mix031.opt.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] - UnprovableResult [Line: 18]: 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: 821]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 826]: 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: 824]: 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 5 procedures, 65 locations, 10 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: 7.1s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 3.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 339 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 276 mSDsluCounter, 107 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 86 mSDsCounter, 17 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 873 IncrementalHoareTripleChecker+Invalid, 890 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 17 mSolverCounterUnsat, 21 mSDtfsCounter, 873 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 55 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=135occurred in iteration=9, InterpolantAutomatonStates: 53, 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, 2.9s InterpolantComputationTime, 190 NumberOfCodeBlocks, 190 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 150 ConstructedInterpolants, 0 QuantifiedInterpolants, 917 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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-24 21:49:18,272 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df81859e-06c0-4f6b-b526-1769f8b43837/bin/uautomizer-verify-NlZe1sFDwI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df81859e-06c0-4f6b-b526-1769f8b43837/bin/uautomizer-verify-NlZe1sFDwI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df81859e-06c0-4f6b-b526-1769f8b43837/bin/uautomizer-verify-NlZe1sFDwI/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df81859e-06c0-4f6b-b526-1769f8b43837/bin/uautomizer-verify-NlZe1sFDwI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df81859e-06c0-4f6b-b526-1769f8b43837/bin/uautomizer-verify-NlZe1sFDwI/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix031.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df81859e-06c0-4f6b-b526-1769f8b43837/bin/uautomizer-verify-NlZe1sFDwI/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df81859e-06c0-4f6b-b526-1769f8b43837/bin/uautomizer-verify-NlZe1sFDwI --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 526111e98fa506d5405af18114114ae6aa9ce1a2e8442e7719052c05a249c119 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-24 21:49:21,533 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-24 21:49:21,689 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df81859e-06c0-4f6b-b526-1769f8b43837/bin/uautomizer-verify-NlZe1sFDwI/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-11-24 21:49:21,699 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-24 21:49:21,701 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-24 21:49:21,778 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-24 21:49:21,779 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-24 21:49:21,780 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-24 21:49:21,782 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-24 21:49:21,789 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-24 21:49:21,790 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-24 21:49:21,791 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-24 21:49:21,792 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-24 21:49:21,794 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-24 21:49:21,795 INFO L153 SettingsManager]: * Use SBE=true [2023-11-24 21:49:21,796 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-24 21:49:21,797 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-24 21:49:21,797 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-24 21:49:21,798 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-24 21:49:21,799 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-24 21:49:21,800 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-24 21:49:21,801 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-24 21:49:21,802 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-24 21:49:21,802 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-24 21:49:21,803 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-24 21:49:21,803 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-24 21:49:21,804 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-24 21:49:21,805 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-24 21:49:21,805 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-24 21:49:21,806 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-24 21:49:21,808 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-24 21:49:21,809 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-24 21:49:21,809 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-24 21:49:21,810 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-24 21:49:21,810 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-24 21:49:21,811 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-24 21:49:21,812 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-24 21:49:21,813 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-24 21:49:21,813 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-24 21:49:21,813 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-24 21:49:21,814 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-24 21:49:21,814 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-24 21:49:21,815 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-24 21:49:21,815 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-24 21:49:21,816 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_df81859e-06c0-4f6b-b526-1769f8b43837/bin/uautomizer-verify-NlZe1sFDwI/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_df81859e-06c0-4f6b-b526-1769f8b43837/bin/uautomizer-verify-NlZe1sFDwI 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 -> 526111e98fa506d5405af18114114ae6aa9ce1a2e8442e7719052c05a249c119 [2023-11-24 21:49:22,344 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-24 21:49:22,382 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-24 21:49:22,387 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-24 21:49:22,388 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-24 21:49:22,389 INFO L274 PluginConnector]: CDTParser initialized [2023-11-24 21:49:22,391 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df81859e-06c0-4f6b-b526-1769f8b43837/bin/uautomizer-verify-NlZe1sFDwI/../../sv-benchmarks/c/pthread-wmm/mix031.opt.i [2023-11-24 21:49:26,227 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-24 21:49:26,661 INFO L384 CDTParser]: Found 1 translation units. [2023-11-24 21:49:26,662 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df81859e-06c0-4f6b-b526-1769f8b43837/sv-benchmarks/c/pthread-wmm/mix031.opt.i [2023-11-24 21:49:26,686 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df81859e-06c0-4f6b-b526-1769f8b43837/bin/uautomizer-verify-NlZe1sFDwI/data/864ab8de5/e3b37a4028c94c198d875aa27a83e82e/FLAG1854150dd [2023-11-24 21:49:26,708 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df81859e-06c0-4f6b-b526-1769f8b43837/bin/uautomizer-verify-NlZe1sFDwI/data/864ab8de5/e3b37a4028c94c198d875aa27a83e82e [2023-11-24 21:49:26,711 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-24 21:49:26,712 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-24 21:49:26,713 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-24 21:49:26,714 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-24 21:49:26,719 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-24 21:49:26,719 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 09:49:26" (1/1) ... [2023-11-24 21:49:26,720 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20cbdf09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:49:26, skipping insertion in model container [2023-11-24 21:49:26,721 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 09:49:26" (1/1) ... [2023-11-24 21:49:26,778 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-24 21:49:27,284 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-24 21:49:27,303 INFO L202 MainTranslator]: Completed pre-run [2023-11-24 21:49:27,423 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-24 21:49:27,471 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-24 21:49:27,472 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-24 21:49:27,479 INFO L206 MainTranslator]: Completed translation [2023-11-24 21:49:27,480 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:49:27 WrapperNode [2023-11-24 21:49:27,480 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-24 21:49:27,481 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-24 21:49:27,481 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-24 21:49:27,482 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-24 21:49:27,490 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:49:27" (1/1) ... [2023-11-24 21:49:27,512 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:49:27" (1/1) ... [2023-11-24 21:49:27,541 INFO L138 Inliner]: procedures = 178, calls = 50, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 129 [2023-11-24 21:49:27,542 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-24 21:49:27,542 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-24 21:49:27,543 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-24 21:49:27,543 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-24 21:49:27,555 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:49:27" (1/1) ... [2023-11-24 21:49:27,555 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:49:27" (1/1) ... [2023-11-24 21:49:27,560 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:49:27" (1/1) ... [2023-11-24 21:49:27,579 INFO L175 MemorySlicer]: Split 4 memory accesses to 3 slices as follows [2, 1, 1]. 50 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 2 writes are split as follows [0, 1, 1]. [2023-11-24 21:49:27,580 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:49:27" (1/1) ... [2023-11-24 21:49:27,580 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:49:27" (1/1) ... [2023-11-24 21:49:27,596 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:49:27" (1/1) ... [2023-11-24 21:49:27,599 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:49:27" (1/1) ... [2023-11-24 21:49:27,603 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:49:27" (1/1) ... [2023-11-24 21:49:27,605 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:49:27" (1/1) ... [2023-11-24 21:49:27,610 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-24 21:49:27,611 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-24 21:49:27,612 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-24 21:49:27,612 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-24 21:49:27,613 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:49:27" (1/1) ... [2023-11-24 21:49:27,621 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-24 21:49:27,647 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df81859e-06c0-4f6b-b526-1769f8b43837/bin/uautomizer-verify-NlZe1sFDwI/z3 [2023-11-24 21:49:27,668 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df81859e-06c0-4f6b-b526-1769f8b43837/bin/uautomizer-verify-NlZe1sFDwI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-24 21:49:27,677 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df81859e-06c0-4f6b-b526-1769f8b43837/bin/uautomizer-verify-NlZe1sFDwI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-24 21:49:27,706 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-24 21:49:27,706 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-24 21:49:27,706 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-24 21:49:27,707 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-24 21:49:27,707 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-11-24 21:49:27,707 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-11-24 21:49:27,707 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2023-11-24 21:49:27,707 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-24 21:49:27,707 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-11-24 21:49:27,708 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-11-24 21:49:27,708 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-24 21:49:27,708 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-24 21:49:27,708 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-24 21:49:27,708 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-24 21:49:27,709 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-24 21:49:27,709 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-24 21:49:27,709 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-24 21:49:27,711 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-24 21:49:27,920 INFO L241 CfgBuilder]: Building ICFG [2023-11-24 21:49:27,923 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-24 21:49:28,572 INFO L282 CfgBuilder]: Performing block encoding [2023-11-24 21:49:28,933 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-24 21:49:28,933 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-24 21:49:28,934 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 09:49:28 BoogieIcfgContainer [2023-11-24 21:49:28,934 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-24 21:49:28,937 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-24 21:49:28,937 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-24 21:49:28,945 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-24 21:49:28,945 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 09:49:26" (1/3) ... [2023-11-24 21:49:28,946 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@274542d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 09:49:28, skipping insertion in model container [2023-11-24 21:49:28,946 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:49:27" (2/3) ... [2023-11-24 21:49:28,949 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@274542d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 09:49:28, skipping insertion in model container [2023-11-24 21:49:28,949 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 09:49:28" (3/3) ... [2023-11-24 21:49:28,952 INFO L112 eAbstractionObserver]: Analyzing ICFG mix031.opt.i [2023-11-24 21:49:28,977 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-24 21:49:28,977 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2023-11-24 21:49:28,978 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-24 21:49:29,052 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-24 21:49:29,107 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 45 transitions, 98 flow [2023-11-24 21:49:29,157 INFO L124 PetriNetUnfolderBase]: 2/43 cut-off events. [2023-11-24 21:49:29,157 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-24 21:49:29,170 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50 conditions, 43 events. 2/43 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 74 event pairs, 0 based on Foata normal form. 0/34 useless extension candidates. Maximal degree in co-relation 40. Up to 2 conditions per place. [2023-11-24 21:49:29,172 INFO L82 GeneralOperation]: Start removeDead. Operand has 50 places, 45 transitions, 98 flow [2023-11-24 21:49:29,183 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 48 places, 43 transitions, 92 flow [2023-11-24 21:49:29,202 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-24 21:49:29,209 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;@6dc31fd0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-24 21:49:29,216 INFO L358 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2023-11-24 21:49:29,220 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-24 21:49:29,221 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-11-24 21:49:29,221 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-24 21:49:29,221 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:49:29,222 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-24 21:49:29,223 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-24 21:49:29,229 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:49:29,230 INFO L85 PathProgramCache]: Analyzing trace with hash 11793, now seen corresponding path program 1 times [2023-11-24 21:49:29,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-24 21:49:29,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1903460383] [2023-11-24 21:49:29,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:49:29,249 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-24 21:49:29,250 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df81859e-06c0-4f6b-b526-1769f8b43837/bin/uautomizer-verify-NlZe1sFDwI/mathsat [2023-11-24 21:49:29,253 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df81859e-06c0-4f6b-b526-1769f8b43837/bin/uautomizer-verify-NlZe1sFDwI/mathsat -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-24 21:49:29,263 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df81859e-06c0-4f6b-b526-1769f8b43837/bin/uautomizer-verify-NlZe1sFDwI/mathsat -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-24 21:49:29,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:49:29,375 INFO L262 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-24 21:49:29,380 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 21:49:29,459 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-24 21:49:29,502 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-24 21:49:29,503 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-24 21:49:29,504 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-24 21:49:29,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1903460383] [2023-11-24 21:49:29,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1903460383] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:49:29,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:49:29,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-24 21:49:29,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673994721] [2023-11-24 21:49:29,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:49:29,518 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:49:29,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-24 21:49:29,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:49:29,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:49:29,583 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 45 [2023-11-24 21:49:29,587 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 43 transitions, 92 flow. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:49:29,587 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:49:29,587 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 45 [2023-11-24 21:49:29,589 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:49:29,807 INFO L124 PetriNetUnfolderBase]: 166/415 cut-off events. [2023-11-24 21:49:29,808 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-11-24 21:49:29,811 INFO L83 FinitePrefix]: Finished finitePrefix Result has 721 conditions, 415 events. 166/415 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 2596 event pairs, 122 based on Foata normal form. 30/403 useless extension candidates. Maximal degree in co-relation 708. Up to 220 conditions per place. [2023-11-24 21:49:29,816 INFO L140 encePairwiseOnDemand]: 40/45 looper letters, 22 selfloop transitions, 2 changer transitions 0/45 dead transitions. [2023-11-24 21:49:29,817 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 45 transitions, 144 flow [2023-11-24 21:49:29,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:49:29,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 21:49:29,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 96 transitions. [2023-11-24 21:49:29,832 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7111111111111111 [2023-11-24 21:49:29,833 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 96 transitions. [2023-11-24 21:49:29,834 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 96 transitions. [2023-11-24 21:49:29,835 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:49:29,838 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 96 transitions. [2023-11-24 21:49:29,841 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:49:29,845 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 45.0) internal successors, (180), 4 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:49:29,846 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 45.0) internal successors, (180), 4 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:49:29,848 INFO L175 Difference]: Start difference. First operand has 48 places, 43 transitions, 92 flow. Second operand 3 states and 96 transitions. [2023-11-24 21:49:29,849 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 45 transitions, 144 flow [2023-11-24 21:49:29,853 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 45 transitions, 142 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 21:49:29,876 INFO L231 Difference]: Finished difference. Result has 46 places, 39 transitions, 86 flow [2023-11-24 21:49:29,881 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=86, PETRI_PLACES=46, PETRI_TRANSITIONS=39} [2023-11-24 21:49:29,889 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, -2 predicate places. [2023-11-24 21:49:29,890 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 39 transitions, 86 flow [2023-11-24 21:49:29,890 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:49:29,890 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:49:29,891 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-24 21:49:29,902 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df81859e-06c0-4f6b-b526-1769f8b43837/bin/uautomizer-verify-NlZe1sFDwI/mathsat -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)] Ended with exit code 0 [2023-11-24 21:49:30,093 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df81859e-06c0-4f6b-b526-1769f8b43837/bin/uautomizer-verify-NlZe1sFDwI/mathsat -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-24 21:49:30,095 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-24 21:49:30,095 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:49:30,096 INFO L85 PathProgramCache]: Analyzing trace with hash 11794, now seen corresponding path program 1 times [2023-11-24 21:49:30,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-24 21:49:30,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1931914819] [2023-11-24 21:49:30,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:49:30,098 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-24 21:49:30,098 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df81859e-06c0-4f6b-b526-1769f8b43837/bin/uautomizer-verify-NlZe1sFDwI/mathsat [2023-11-24 21:49:30,100 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df81859e-06c0-4f6b-b526-1769f8b43837/bin/uautomizer-verify-NlZe1sFDwI/mathsat -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-24 21:49:30,102 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df81859e-06c0-4f6b-b526-1769f8b43837/bin/uautomizer-verify-NlZe1sFDwI/mathsat -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-24 21:49:30,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:49:30,193 INFO L262 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-24 21:49:30,195 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 21:49:30,208 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-24 21:49:30,222 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-24 21:49:30,222 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-24 21:49:30,223 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-24 21:49:30,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1931914819] [2023-11-24 21:49:30,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1931914819] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:49:30,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:49:30,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-24 21:49:30,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103349836] [2023-11-24 21:49:30,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:49:30,226 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:49:30,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-24 21:49:30,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:49:30,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:49:30,261 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 45 [2023-11-24 21:49:30,263 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 39 transitions, 86 flow. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:49:30,263 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:49:30,264 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 45 [2023-11-24 21:49:30,264 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:49:30,500 INFO L124 PetriNetUnfolderBase]: 166/414 cut-off events. [2023-11-24 21:49:30,501 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2023-11-24 21:49:30,503 INFO L83 FinitePrefix]: Finished finitePrefix Result has 734 conditions, 414 events. 166/414 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 2580 event pairs, 122 based on Foata normal form. 1/373 useless extension candidates. Maximal degree in co-relation 723. Up to 219 conditions per place. [2023-11-24 21:49:30,508 INFO L140 encePairwiseOnDemand]: 42/45 looper letters, 21 selfloop transitions, 2 changer transitions 0/44 dead transitions. [2023-11-24 21:49:30,508 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 44 transitions, 142 flow [2023-11-24 21:49:30,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:49:30,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 21:49:30,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 96 transitions. [2023-11-24 21:49:30,511 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7111111111111111 [2023-11-24 21:49:30,511 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 96 transitions. [2023-11-24 21:49:30,511 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 96 transitions. [2023-11-24 21:49:30,512 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:49:30,512 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 96 transitions. [2023-11-24 21:49:30,513 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:49:30,515 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 45.0) internal successors, (180), 4 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:49:30,515 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 45.0) internal successors, (180), 4 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:49:30,515 INFO L175 Difference]: Start difference. First operand has 46 places, 39 transitions, 86 flow. Second operand 3 states and 96 transitions. [2023-11-24 21:49:30,516 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 44 transitions, 142 flow [2023-11-24 21:49:30,517 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 44 transitions, 138 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 21:49:30,519 INFO L231 Difference]: Finished difference. Result has 45 places, 38 transitions, 84 flow [2023-11-24 21:49:30,520 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=84, PETRI_PLACES=45, PETRI_TRANSITIONS=38} [2023-11-24 21:49:30,520 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, -3 predicate places. [2023-11-24 21:49:30,521 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 38 transitions, 84 flow [2023-11-24 21:49:30,521 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:49:30,521 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:49:30,522 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-24 21:49:30,525 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df81859e-06c0-4f6b-b526-1769f8b43837/bin/uautomizer-verify-NlZe1sFDwI/mathsat -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-24 21:49:30,724 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df81859e-06c0-4f6b-b526-1769f8b43837/bin/uautomizer-verify-NlZe1sFDwI/mathsat -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-24 21:49:30,725 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-24 21:49:30,725 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:49:30,726 INFO L85 PathProgramCache]: Analyzing trace with hash 351652660, now seen corresponding path program 1 times [2023-11-24 21:49:30,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-24 21:49:30,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [870874044] [2023-11-24 21:49:30,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:49:30,727 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-24 21:49:30,727 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df81859e-06c0-4f6b-b526-1769f8b43837/bin/uautomizer-verify-NlZe1sFDwI/mathsat [2023-11-24 21:49:30,729 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df81859e-06c0-4f6b-b526-1769f8b43837/bin/uautomizer-verify-NlZe1sFDwI/mathsat -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-24 21:49:30,769 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df81859e-06c0-4f6b-b526-1769f8b43837/bin/uautomizer-verify-NlZe1sFDwI/mathsat -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-24 21:49:30,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:49:30,873 INFO L262 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-24 21:49:30,875 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 21:49:30,885 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-24 21:49:30,894 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-24 21:49:30,894 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-24 21:49:30,895 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-24 21:49:30,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [870874044] [2023-11-24 21:49:30,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [870874044] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:49:30,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:49:30,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-24 21:49:30,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249238189] [2023-11-24 21:49:30,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:49:30,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:49:30,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-24 21:49:30,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:49:30,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:49:30,925 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 45 [2023-11-24 21:49:30,925 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 38 transitions, 84 flow. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:49:30,926 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:49:30,926 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 45 [2023-11-24 21:49:30,926 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:49:31,087 INFO L124 PetriNetUnfolderBase]: 168/413 cut-off events. [2023-11-24 21:49:31,088 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2023-11-24 21:49:31,090 INFO L83 FinitePrefix]: Finished finitePrefix Result has 738 conditions, 413 events. 168/413 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 2563 event pairs, 80 based on Foata normal form. 0/377 useless extension candidates. Maximal degree in co-relation 727. Up to 220 conditions per place. [2023-11-24 21:49:31,093 INFO L140 encePairwiseOnDemand]: 42/45 looper letters, 22 selfloop transitions, 2 changer transitions 0/43 dead transitions. [2023-11-24 21:49:31,094 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 43 transitions, 142 flow [2023-11-24 21:49:31,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:49:31,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 21:49:31,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 94 transitions. [2023-11-24 21:49:31,096 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6962962962962963 [2023-11-24 21:49:31,100 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 94 transitions. [2023-11-24 21:49:31,101 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 94 transitions. [2023-11-24 21:49:31,101 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:49:31,101 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 94 transitions. [2023-11-24 21:49:31,105 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:49:31,106 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 45.0) internal successors, (180), 4 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:49:31,107 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 45.0) internal successors, (180), 4 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:49:31,107 INFO L175 Difference]: Start difference. First operand has 45 places, 38 transitions, 84 flow. Second operand 3 states and 94 transitions. [2023-11-24 21:49:31,107 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 43 transitions, 142 flow [2023-11-24 21:49:31,111 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 43 transitions, 138 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 21:49:31,113 INFO L231 Difference]: Finished difference. Result has 44 places, 37 transitions, 82 flow [2023-11-24 21:49:31,113 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=82, PETRI_PLACES=44, PETRI_TRANSITIONS=37} [2023-11-24 21:49:31,115 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, -4 predicate places. [2023-11-24 21:49:31,115 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 37 transitions, 82 flow [2023-11-24 21:49:31,116 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:49:31,116 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:49:31,116 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-24 21:49:31,127 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df81859e-06c0-4f6b-b526-1769f8b43837/bin/uautomizer-verify-NlZe1sFDwI/mathsat -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)] Forceful destruction successful, exit code 0 [2023-11-24 21:49:31,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df81859e-06c0-4f6b-b526-1769f8b43837/bin/uautomizer-verify-NlZe1sFDwI/mathsat -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-24 21:49:31,319 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-24 21:49:31,320 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:49:31,320 INFO L85 PathProgramCache]: Analyzing trace with hash 351652661, now seen corresponding path program 1 times [2023-11-24 21:49:31,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-24 21:49:31,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [652920424] [2023-11-24 21:49:31,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:49:31,321 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-24 21:49:31,321 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df81859e-06c0-4f6b-b526-1769f8b43837/bin/uautomizer-verify-NlZe1sFDwI/mathsat [2023-11-24 21:49:31,323 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df81859e-06c0-4f6b-b526-1769f8b43837/bin/uautomizer-verify-NlZe1sFDwI/mathsat -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-24 21:49:31,341 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df81859e-06c0-4f6b-b526-1769f8b43837/bin/uautomizer-verify-NlZe1sFDwI/mathsat -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-24 21:49:31,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:49:31,433 INFO L262 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-24 21:49:31,435 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 21:49:31,455 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-24 21:49:31,473 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-24 21:49:31,473 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-24 21:49:31,474 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-24 21:49:31,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [652920424] [2023-11-24 21:49:31,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [652920424] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:49:31,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:49:31,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-24 21:49:31,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440629694] [2023-11-24 21:49:31,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:49:31,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:49:31,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-24 21:49:31,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:49:31,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:49:31,516 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 45 [2023-11-24 21:49:31,516 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 37 transitions, 82 flow. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:49:31,517 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:49:31,517 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 45 [2023-11-24 21:49:31,517 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:49:31,705 INFO L124 PetriNetUnfolderBase]: 166/408 cut-off events. [2023-11-24 21:49:31,705 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2023-11-24 21:49:31,707 INFO L83 FinitePrefix]: Finished finitePrefix Result has 730 conditions, 408 events. 166/408 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 2541 event pairs, 80 based on Foata normal form. 3/377 useless extension candidates. Maximal degree in co-relation 720. Up to 215 conditions per place. [2023-11-24 21:49:31,710 INFO L140 encePairwiseOnDemand]: 42/45 looper letters, 21 selfloop transitions, 2 changer transitions 0/42 dead transitions. [2023-11-24 21:49:31,711 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 42 transitions, 138 flow [2023-11-24 21:49:31,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:49:31,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 21:49:31,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 96 transitions. [2023-11-24 21:49:31,714 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7111111111111111 [2023-11-24 21:49:31,715 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 96 transitions. [2023-11-24 21:49:31,720 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 96 transitions. [2023-11-24 21:49:31,721 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:49:31,721 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 96 transitions. [2023-11-24 21:49:31,721 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:49:31,724 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 45.0) internal successors, (180), 4 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:49:31,725 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 45.0) internal successors, (180), 4 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:49:31,726 INFO L175 Difference]: Start difference. First operand has 44 places, 37 transitions, 82 flow. Second operand 3 states and 96 transitions. [2023-11-24 21:49:31,727 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 42 transitions, 138 flow [2023-11-24 21:49:31,729 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 42 transitions, 134 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 21:49:31,737 INFO L231 Difference]: Finished difference. Result has 43 places, 36 transitions, 80 flow [2023-11-24 21:49:31,738 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=80, PETRI_PLACES=43, PETRI_TRANSITIONS=36} [2023-11-24 21:49:31,739 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, -5 predicate places. [2023-11-24 21:49:31,740 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 36 transitions, 80 flow [2023-11-24 21:49:31,740 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:49:31,741 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:49:31,741 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:49:31,751 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df81859e-06c0-4f6b-b526-1769f8b43837/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-11-24 21:49:31,944 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df81859e-06c0-4f6b-b526-1769f8b43837/bin/uautomizer-verify-NlZe1sFDwI/mathsat -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-24 21:49:31,945 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-24 21:49:31,945 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:49:31,945 INFO L85 PathProgramCache]: Analyzing trace with hash 659489401, now seen corresponding path program 1 times [2023-11-24 21:49:31,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-24 21:49:31,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1946243975] [2023-11-24 21:49:31,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:49:31,946 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-24 21:49:31,946 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df81859e-06c0-4f6b-b526-1769f8b43837/bin/uautomizer-verify-NlZe1sFDwI/mathsat [2023-11-24 21:49:31,948 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df81859e-06c0-4f6b-b526-1769f8b43837/bin/uautomizer-verify-NlZe1sFDwI/mathsat -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-24 21:49:31,950 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df81859e-06c0-4f6b-b526-1769f8b43837/bin/uautomizer-verify-NlZe1sFDwI/mathsat -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-24 21:49:32,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:49:32,058 INFO L262 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-24 21:49:32,059 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 21:49:32,081 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-24 21:49:32,082 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-24 21:49:32,082 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-24 21:49:32,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1946243975] [2023-11-24 21:49:32,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1946243975] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:49:32,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:49:32,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-24 21:49:32,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732717839] [2023-11-24 21:49:32,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:49:32,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:49:32,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-24 21:49:32,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:49:32,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:49:32,086 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 45 [2023-11-24 21:49:32,086 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 36 transitions, 80 flow. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:49:32,086 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:49:32,087 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 45 [2023-11-24 21:49:32,087 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:49:32,222 INFO L124 PetriNetUnfolderBase]: 129/359 cut-off events. [2023-11-24 21:49:32,223 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2023-11-24 21:49:32,224 INFO L83 FinitePrefix]: Finished finitePrefix Result has 617 conditions, 359 events. 129/359 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 2092 event pairs, 18 based on Foata normal form. 0/356 useless extension candidates. Maximal degree in co-relation 607. Up to 184 conditions per place. [2023-11-24 21:49:32,227 INFO L140 encePairwiseOnDemand]: 42/45 looper letters, 21 selfloop transitions, 2 changer transitions 2/44 dead transitions. [2023-11-24 21:49:32,227 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 44 transitions, 148 flow [2023-11-24 21:49:32,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:49:32,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 21:49:32,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 101 transitions. [2023-11-24 21:49:32,230 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7481481481481481 [2023-11-24 21:49:32,230 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 101 transitions. [2023-11-24 21:49:32,230 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 101 transitions. [2023-11-24 21:49:32,231 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:49:32,231 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 101 transitions. [2023-11-24 21:49:32,232 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:49:32,233 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 45.0) internal successors, (180), 4 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:49:32,233 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 45.0) internal successors, (180), 4 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:49:32,233 INFO L175 Difference]: Start difference. First operand has 43 places, 36 transitions, 80 flow. Second operand 3 states and 101 transitions. [2023-11-24 21:49:32,233 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 44 transitions, 148 flow [2023-11-24 21:49:32,234 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 44 transitions, 142 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 21:49:32,236 INFO L231 Difference]: Finished difference. Result has 42 places, 34 transitions, 76 flow [2023-11-24 21:49:32,236 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=76, PETRI_PLACES=42, PETRI_TRANSITIONS=34} [2023-11-24 21:49:32,237 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, -6 predicate places. [2023-11-24 21:49:32,237 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 34 transitions, 76 flow [2023-11-24 21:49:32,238 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:49:32,238 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:49:32,238 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:49:32,252 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df81859e-06c0-4f6b-b526-1769f8b43837/bin/uautomizer-verify-NlZe1sFDwI/mathsat -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)] Forceful destruction successful, exit code 0 [2023-11-24 21:49:32,441 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df81859e-06c0-4f6b-b526-1769f8b43837/bin/uautomizer-verify-NlZe1sFDwI/mathsat -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-24 21:49:32,442 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-24 21:49:32,442 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:49:32,443 INFO L85 PathProgramCache]: Analyzing trace with hash -249752032, now seen corresponding path program 1 times [2023-11-24 21:49:32,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-24 21:49:32,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [916038927] [2023-11-24 21:49:32,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:49:32,443 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-24 21:49:32,444 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df81859e-06c0-4f6b-b526-1769f8b43837/bin/uautomizer-verify-NlZe1sFDwI/mathsat [2023-11-24 21:49:32,451 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df81859e-06c0-4f6b-b526-1769f8b43837/bin/uautomizer-verify-NlZe1sFDwI/mathsat -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-24 21:49:32,452 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df81859e-06c0-4f6b-b526-1769f8b43837/bin/uautomizer-verify-NlZe1sFDwI/mathsat -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-24 21:49:32,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:49:32,588 INFO L262 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-24 21:49:32,590 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 21:49:32,643 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-24 21:49:32,643 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-24 21:49:32,643 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-24 21:49:32,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [916038927] [2023-11-24 21:49:32,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [916038927] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:49:32,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:49:32,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-24 21:49:32,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857805323] [2023-11-24 21:49:32,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:49:32,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-24 21:49:32,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-24 21:49:32,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-24 21:49:32,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-24 21:49:32,660 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 45 [2023-11-24 21:49:32,661 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 34 transitions, 76 flow. Second operand has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:49:32,661 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:49:32,661 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 45 [2023-11-24 21:49:32,661 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:49:32,878 INFO L124 PetriNetUnfolderBase]: 180/419 cut-off events. [2023-11-24 21:49:32,879 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2023-11-24 21:49:32,880 INFO L83 FinitePrefix]: Finished finitePrefix Result has 790 conditions, 419 events. 180/419 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2239 event pairs, 24 based on Foata normal form. 20/430 useless extension candidates. Maximal degree in co-relation 779. Up to 199 conditions per place. [2023-11-24 21:49:32,883 INFO L140 encePairwiseOnDemand]: 40/45 looper letters, 29 selfloop transitions, 4 changer transitions 1/50 dead transitions. [2023-11-24 21:49:32,883 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 50 transitions, 182 flow [2023-11-24 21:49:32,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-24 21:49:32,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-24 21:49:32,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 124 transitions. [2023-11-24 21:49:32,885 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6888888888888889 [2023-11-24 21:49:32,886 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 124 transitions. [2023-11-24 21:49:32,886 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 124 transitions. [2023-11-24 21:49:32,886 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:49:32,886 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 124 transitions. [2023-11-24 21:49:32,887 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 31.0) internal successors, (124), 4 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:49:32,888 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 45.0) internal successors, (225), 5 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:49:32,888 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 45.0) internal successors, (225), 5 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:49:32,889 INFO L175 Difference]: Start difference. First operand has 42 places, 34 transitions, 76 flow. Second operand 4 states and 124 transitions. [2023-11-24 21:49:32,889 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 50 transitions, 182 flow [2023-11-24 21:49:32,890 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 50 transitions, 174 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 21:49:32,891 INFO L231 Difference]: Finished difference. Result has 44 places, 36 transitions, 98 flow [2023-11-24 21:49:32,892 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=98, PETRI_PLACES=44, PETRI_TRANSITIONS=36} [2023-11-24 21:49:32,893 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, -4 predicate places. [2023-11-24 21:49:32,893 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 36 transitions, 98 flow [2023-11-24 21:49:32,893 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:49:32,893 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:49:32,894 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] [2023-11-24 21:49:32,905 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df81859e-06c0-4f6b-b526-1769f8b43837/bin/uautomizer-verify-NlZe1sFDwI/mathsat -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)] Forceful destruction successful, exit code 0 [2023-11-24 21:49:33,096 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df81859e-06c0-4f6b-b526-1769f8b43837/bin/uautomizer-verify-NlZe1sFDwI/mathsat -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-24 21:49:33,097 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-24 21:49:33,097 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:49:33,098 INFO L85 PathProgramCache]: Analyzing trace with hash 457578400, now seen corresponding path program 1 times [2023-11-24 21:49:33,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-24 21:49:33,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [718205872] [2023-11-24 21:49:33,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:49:33,099 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-24 21:49:33,099 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df81859e-06c0-4f6b-b526-1769f8b43837/bin/uautomizer-verify-NlZe1sFDwI/mathsat [2023-11-24 21:49:33,100 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df81859e-06c0-4f6b-b526-1769f8b43837/bin/uautomizer-verify-NlZe1sFDwI/mathsat -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-24 21:49:33,114 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df81859e-06c0-4f6b-b526-1769f8b43837/bin/uautomizer-verify-NlZe1sFDwI/mathsat -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-24 21:49:33,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:49:33,235 INFO L262 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-24 21:49:33,237 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 21:49:33,317 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-24 21:49:33,317 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-24 21:49:33,318 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-24 21:49:33,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [718205872] [2023-11-24 21:49:33,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [718205872] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:49:33,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:49:33,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-24 21:49:33,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004763420] [2023-11-24 21:49:33,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:49:33,319 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-24 21:49:33,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-24 21:49:33,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-24 21:49:33,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-24 21:49:33,328 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 45 [2023-11-24 21:49:33,329 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 36 transitions, 98 flow. Second operand has 5 states, 5 states have (on average 24.4) internal successors, (122), 5 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:49:33,329 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:49:33,329 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 45 [2023-11-24 21:49:33,329 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:49:33,527 INFO L124 PetriNetUnfolderBase]: 88/211 cut-off events. [2023-11-24 21:49:33,528 INFO L125 PetriNetUnfolderBase]: For 57/57 co-relation queries the response was YES. [2023-11-24 21:49:33,529 INFO L83 FinitePrefix]: Finished finitePrefix Result has 474 conditions, 211 events. 88/211 cut-off events. For 57/57 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 752 event pairs, 16 based on Foata normal form. 14/218 useless extension candidates. Maximal degree in co-relation 461. Up to 71 conditions per place. [2023-11-24 21:49:33,530 INFO L140 encePairwiseOnDemand]: 40/45 looper letters, 25 selfloop transitions, 6 changer transitions 1/48 dead transitions. [2023-11-24 21:49:33,530 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 48 transitions, 191 flow [2023-11-24 21:49:33,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-24 21:49:33,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-24 21:49:33,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 144 transitions. [2023-11-24 21:49:33,534 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.64 [2023-11-24 21:49:33,534 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 144 transitions. [2023-11-24 21:49:33,534 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 144 transitions. [2023-11-24 21:49:33,535 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:49:33,535 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 144 transitions. [2023-11-24 21:49:33,536 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 28.8) internal successors, (144), 5 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:49:33,538 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 45.0) internal successors, (270), 6 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:49:33,538 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 45.0) internal successors, (270), 6 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:49:33,538 INFO L175 Difference]: Start difference. First operand has 44 places, 36 transitions, 98 flow. Second operand 5 states and 144 transitions. [2023-11-24 21:49:33,538 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 48 transitions, 191 flow [2023-11-24 21:49:33,541 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 48 transitions, 182 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-11-24 21:49:33,544 INFO L231 Difference]: Finished difference. Result has 48 places, 36 transitions, 114 flow [2023-11-24 21:49:33,544 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=91, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=114, PETRI_PLACES=48, PETRI_TRANSITIONS=36} [2023-11-24 21:49:33,545 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 0 predicate places. [2023-11-24 21:49:33,545 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 36 transitions, 114 flow [2023-11-24 21:49:33,545 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.4) internal successors, (122), 5 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:49:33,545 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:49:33,546 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] [2023-11-24 21:49:33,561 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df81859e-06c0-4f6b-b526-1769f8b43837/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-11-24 21:49:33,749 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df81859e-06c0-4f6b-b526-1769f8b43837/bin/uautomizer-verify-NlZe1sFDwI/mathsat -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-24 21:49:33,749 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-24 21:49:33,750 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:49:33,750 INFO L85 PathProgramCache]: Analyzing trace with hash 473596296, now seen corresponding path program 1 times [2023-11-24 21:49:33,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-24 21:49:33,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [120820348] [2023-11-24 21:49:33,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:49:33,751 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-24 21:49:33,751 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df81859e-06c0-4f6b-b526-1769f8b43837/bin/uautomizer-verify-NlZe1sFDwI/mathsat [2023-11-24 21:49:33,753 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df81859e-06c0-4f6b-b526-1769f8b43837/bin/uautomizer-verify-NlZe1sFDwI/mathsat -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-24 21:49:33,755 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df81859e-06c0-4f6b-b526-1769f8b43837/bin/uautomizer-verify-NlZe1sFDwI/mathsat -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-24 21:49:33,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:49:33,926 INFO L262 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-24 21:49:33,930 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 21:49:34,332 WARN L876 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~#t836~0#1.base_47| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#t835~0#1.base_51| (_ BitVec 32))) (and (= (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t835~0#1.base_51| (_ bv0 1)) |v_ULTIMATE.start_main_~#t836~0#1.base_47| (_ bv0 1)) |c_#valid|) (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t835~0#1.base_51|)) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t835~0#1.base_51| (_ bv1 1)) |v_ULTIMATE.start_main_~#t836~0#1.base_47|) (_ bv0 1)))) is different from true [2023-11-24 21:49:34,333 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-24 21:49:34,333 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-24 21:49:34,334 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-24 21:49:34,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [120820348] [2023-11-24 21:49:34,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [120820348] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:49:34,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:49:34,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-24 21:49:34,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466604720] [2023-11-24 21:49:34,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:49:34,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-24 21:49:34,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-24 21:49:34,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-24 21:49:34,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=8, Unknown=1, NotChecked=4, Total=20 [2023-11-24 21:49:34,337 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 45 [2023-11-24 21:49:34,337 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 36 transitions, 114 flow. Second operand has 5 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:49:34,338 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:49:34,338 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 45 [2023-11-24 21:49:34,338 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:49:34,476 INFO L124 PetriNetUnfolderBase]: 52/157 cut-off events. [2023-11-24 21:49:34,476 INFO L125 PetriNetUnfolderBase]: For 32/32 co-relation queries the response was YES. [2023-11-24 21:49:34,477 INFO L83 FinitePrefix]: Finished finitePrefix Result has 325 conditions, 157 events. 52/157 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 559 event pairs, 18 based on Foata normal form. 4/151 useless extension candidates. Maximal degree in co-relation 309. Up to 94 conditions per place. [2023-11-24 21:49:34,478 INFO L140 encePairwiseOnDemand]: 39/45 looper letters, 19 selfloop transitions, 5 changer transitions 0/42 dead transitions. [2023-11-24 21:49:34,478 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 42 transitions, 174 flow [2023-11-24 21:49:34,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-24 21:49:34,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-24 21:49:34,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 115 transitions. [2023-11-24 21:49:34,480 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5111111111111111 [2023-11-24 21:49:34,480 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 115 transitions. [2023-11-24 21:49:34,480 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 115 transitions. [2023-11-24 21:49:34,480 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:49:34,480 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 115 transitions. [2023-11-24 21:49:34,481 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 23.0) internal successors, (115), 5 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-24 21:49:34,482 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 45.0) internal successors, (270), 6 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:49:34,482 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 45.0) internal successors, (270), 6 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:49:34,483 INFO L175 Difference]: Start difference. First operand has 48 places, 36 transitions, 114 flow. Second operand 5 states and 115 transitions. [2023-11-24 21:49:34,483 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 42 transitions, 174 flow [2023-11-24 21:49:34,484 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 42 transitions, 146 flow, removed 5 selfloop flow, removed 6 redundant places. [2023-11-24 21:49:34,486 INFO L231 Difference]: Finished difference. Result has 47 places, 38 transitions, 109 flow [2023-11-24 21:49:34,486 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=109, PETRI_PLACES=47, PETRI_TRANSITIONS=38} [2023-11-24 21:49:34,487 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, -1 predicate places. [2023-11-24 21:49:34,487 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 38 transitions, 109 flow [2023-11-24 21:49:34,487 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:49:34,487 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:49:34,488 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] [2023-11-24 21:49:34,493 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df81859e-06c0-4f6b-b526-1769f8b43837/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2023-11-24 21:49:34,691 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df81859e-06c0-4f6b-b526-1769f8b43837/bin/uautomizer-verify-NlZe1sFDwI/mathsat -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-24 21:49:34,691 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-24 21:49:34,692 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:49:34,692 INFO L85 PathProgramCache]: Analyzing trace with hash -1526442924, now seen corresponding path program 1 times [2023-11-24 21:49:34,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-24 21:49:34,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1400575428] [2023-11-24 21:49:34,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:49:34,693 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-24 21:49:34,693 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df81859e-06c0-4f6b-b526-1769f8b43837/bin/uautomizer-verify-NlZe1sFDwI/mathsat [2023-11-24 21:49:34,695 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df81859e-06c0-4f6b-b526-1769f8b43837/bin/uautomizer-verify-NlZe1sFDwI/mathsat -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-24 21:49:34,730 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df81859e-06c0-4f6b-b526-1769f8b43837/bin/uautomizer-verify-NlZe1sFDwI/mathsat -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-24 21:49:34,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:49:34,847 INFO L262 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-24 21:49:34,849 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 21:49:34,925 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-24 21:49:34,925 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-24 21:49:34,926 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-24 21:49:34,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1400575428] [2023-11-24 21:49:34,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1400575428] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:49:34,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:49:34,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-24 21:49:34,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774434926] [2023-11-24 21:49:34,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:49:34,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-24 21:49:34,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-24 21:49:34,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-24 21:49:34,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-24 21:49:34,963 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 45 [2023-11-24 21:49:34,964 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 38 transitions, 109 flow. Second operand has 6 states, 6 states have (on average 24.5) internal successors, (147), 6 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-24 21:49:34,964 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:49:34,964 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 45 [2023-11-24 21:49:34,964 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:49:35,233 INFO L124 PetriNetUnfolderBase]: 118/328 cut-off events. [2023-11-24 21:49:35,233 INFO L125 PetriNetUnfolderBase]: For 96/100 co-relation queries the response was YES. [2023-11-24 21:49:35,234 INFO L83 FinitePrefix]: Finished finitePrefix Result has 719 conditions, 328 events. 118/328 cut-off events. For 96/100 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1392 event pairs, 32 based on Foata normal form. 4/325 useless extension candidates. Maximal degree in co-relation 706. Up to 130 conditions per place. [2023-11-24 21:49:35,236 INFO L140 encePairwiseOnDemand]: 39/45 looper letters, 38 selfloop transitions, 5 changer transitions 0/61 dead transitions. [2023-11-24 21:49:35,237 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 61 transitions, 268 flow [2023-11-24 21:49:35,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 21:49:35,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-24 21:49:35,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 172 transitions. [2023-11-24 21:49:35,239 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6370370370370371 [2023-11-24 21:49:35,239 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 172 transitions. [2023-11-24 21:49:35,239 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 172 transitions. [2023-11-24 21:49:35,240 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:49:35,240 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 172 transitions. [2023-11-24 21:49:35,241 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 28.666666666666668) internal successors, (172), 6 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:49:35,242 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 45.0) internal successors, (315), 7 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:49:35,242 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 45.0) internal successors, (315), 7 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:49:35,242 INFO L175 Difference]: Start difference. First operand has 47 places, 38 transitions, 109 flow. Second operand 6 states and 172 transitions. [2023-11-24 21:49:35,243 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 61 transitions, 268 flow [2023-11-24 21:49:35,245 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 61 transitions, 256 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-24 21:49:35,247 INFO L231 Difference]: Finished difference. Result has 53 places, 42 transitions, 141 flow [2023-11-24 21:49:35,247 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=141, PETRI_PLACES=53, PETRI_TRANSITIONS=42} [2023-11-24 21:49:35,248 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 5 predicate places. [2023-11-24 21:49:35,248 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 42 transitions, 141 flow [2023-11-24 21:49:35,249 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.5) internal successors, (147), 6 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-24 21:49:35,249 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:49:35,249 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] [2023-11-24 21:49:35,258 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df81859e-06c0-4f6b-b526-1769f8b43837/bin/uautomizer-verify-NlZe1sFDwI/mathsat -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)] Forceful destruction successful, exit code 0 [2023-11-24 21:49:35,458 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df81859e-06c0-4f6b-b526-1769f8b43837/bin/uautomizer-verify-NlZe1sFDwI/mathsat -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-24 21:49:35,459 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-24 21:49:35,459 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:49:35,459 INFO L85 PathProgramCache]: Analyzing trace with hash -1092158124, now seen corresponding path program 2 times [2023-11-24 21:49:35,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-24 21:49:35,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [350919708] [2023-11-24 21:49:35,460 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-24 21:49:35,460 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-24 21:49:35,460 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df81859e-06c0-4f6b-b526-1769f8b43837/bin/uautomizer-verify-NlZe1sFDwI/mathsat [2023-11-24 21:49:35,461 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df81859e-06c0-4f6b-b526-1769f8b43837/bin/uautomizer-verify-NlZe1sFDwI/mathsat -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-24 21:49:35,462 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df81859e-06c0-4f6b-b526-1769f8b43837/bin/uautomizer-verify-NlZe1sFDwI/mathsat -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-24 21:49:35,583 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-24 21:49:35,583 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-24 21:49:35,588 INFO L262 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 11 conjunts are in the unsatisfiable core [2023-11-24 21:49:35,590 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 21:49:35,891 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-24 21:49:35,892 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-24 21:49:35,892 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-24 21:49:35,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [350919708] [2023-11-24 21:49:35,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [350919708] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:49:35,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:49:35,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-24 21:49:35,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301114266] [2023-11-24 21:49:35,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:49:35,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-24 21:49:35,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-24 21:49:35,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-24 21:49:35,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-24 21:49:35,914 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 45 [2023-11-24 21:49:35,915 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 42 transitions, 141 flow. Second operand has 8 states, 8 states have (on average 25.625) internal successors, (205), 8 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-24 21:49:35,915 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:49:35,915 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 45 [2023-11-24 21:49:35,915 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:49:36,268 INFO L124 PetriNetUnfolderBase]: 155/439 cut-off events. [2023-11-24 21:49:36,268 INFO L125 PetriNetUnfolderBase]: For 200/200 co-relation queries the response was YES. [2023-11-24 21:49:36,270 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1078 conditions, 439 events. 155/439 cut-off events. For 200/200 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 2205 event pairs, 38 based on Foata normal form. 4/430 useless extension candidates. Maximal degree in co-relation 1062. Up to 165 conditions per place. [2023-11-24 21:49:36,274 INFO L140 encePairwiseOnDemand]: 36/45 looper letters, 35 selfloop transitions, 12 changer transitions 0/68 dead transitions. [2023-11-24 21:49:36,274 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 68 transitions, 335 flow [2023-11-24 21:49:36,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-24 21:49:36,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-24 21:49:36,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 254 transitions. [2023-11-24 21:49:36,277 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6271604938271605 [2023-11-24 21:49:36,277 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 254 transitions. [2023-11-24 21:49:36,277 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 254 transitions. [2023-11-24 21:49:36,277 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:49:36,278 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 254 transitions. [2023-11-24 21:49:36,279 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 28.22222222222222) internal successors, (254), 9 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:49:36,281 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 45.0) internal successors, (450), 10 states have internal predecessors, (450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:49:36,281 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 45.0) internal successors, (450), 10 states have internal predecessors, (450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:49:36,281 INFO L175 Difference]: Start difference. First operand has 53 places, 42 transitions, 141 flow. Second operand 9 states and 254 transitions. [2023-11-24 21:49:36,282 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 68 transitions, 335 flow [2023-11-24 21:49:36,284 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 68 transitions, 334 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-24 21:49:36,286 INFO L231 Difference]: Finished difference. Result has 64 places, 50 transitions, 234 flow [2023-11-24 21:49:36,287 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=234, PETRI_PLACES=64, PETRI_TRANSITIONS=50} [2023-11-24 21:49:36,288 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 16 predicate places. [2023-11-24 21:49:36,288 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 50 transitions, 234 flow [2023-11-24 21:49:36,289 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 25.625) internal successors, (205), 8 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-24 21:49:36,289 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:49:36,289 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] [2023-11-24 21:49:36,299 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df81859e-06c0-4f6b-b526-1769f8b43837/bin/uautomizer-verify-NlZe1sFDwI/mathsat -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)] Forceful destruction successful, exit code 0 [2023-11-24 21:49:36,492 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df81859e-06c0-4f6b-b526-1769f8b43837/bin/uautomizer-verify-NlZe1sFDwI/mathsat -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-24 21:49:36,493 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-24 21:49:36,493 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:49:36,493 INFO L85 PathProgramCache]: Analyzing trace with hash -412809764, now seen corresponding path program 3 times [2023-11-24 21:49:36,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-24 21:49:36,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1847208300] [2023-11-24 21:49:36,495 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-24 21:49:36,495 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-24 21:49:36,495 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df81859e-06c0-4f6b-b526-1769f8b43837/bin/uautomizer-verify-NlZe1sFDwI/mathsat [2023-11-24 21:49:36,496 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df81859e-06c0-4f6b-b526-1769f8b43837/bin/uautomizer-verify-NlZe1sFDwI/mathsat -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-24 21:49:36,500 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df81859e-06c0-4f6b-b526-1769f8b43837/bin/uautomizer-verify-NlZe1sFDwI/mathsat -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-24 21:49:36,645 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-11-24 21:49:36,645 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-11-24 21:49:36,645 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-24 21:49:36,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-24 21:49:36,819 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-11-24 21:49:36,819 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-24 21:49:36,821 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK (9 of 10 remaining) [2023-11-24 21:49:36,823 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (8 of 10 remaining) [2023-11-24 21:49:36,824 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 10 remaining) [2023-11-24 21:49:36,824 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 10 remaining) [2023-11-24 21:49:36,824 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 10 remaining) [2023-11-24 21:49:36,824 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 10 remaining) [2023-11-24 21:49:36,825 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK (3 of 10 remaining) [2023-11-24 21:49:36,825 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 10 remaining) [2023-11-24 21:49:36,825 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 10 remaining) [2023-11-24 21:49:36,825 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 10 remaining) [2023-11-24 21:49:36,846 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df81859e-06c0-4f6b-b526-1769f8b43837/bin/uautomizer-verify-NlZe1sFDwI/mathsat -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)] Forceful destruction successful, exit code 0 [2023-11-24 21:49:37,030 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df81859e-06c0-4f6b-b526-1769f8b43837/bin/uautomizer-verify-NlZe1sFDwI/mathsat -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-24 21:49:37,030 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:49:37,037 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-24 21:49:37,037 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-24 21:49:37,129 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-24 21:49:37,134 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-24 21:49:37,156 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-24 21:49:37,162 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-24 21:49:37,183 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.11 09:49:37 BasicIcfg [2023-11-24 21:49:37,183 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-24 21:49:37,184 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-24 21:49:37,184 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-24 21:49:37,184 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-24 21:49:37,185 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 09:49:28" (3/4) ... [2023-11-24 21:49:37,187 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-24 21:49:37,188 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-24 21:49:37,193 INFO L158 Benchmark]: Toolchain (without parser) took 10476.92ms. Allocated memory was 77.6MB in the beginning and 146.8MB in the end (delta: 69.2MB). Free memory was 52.7MB in the beginning and 114.1MB in the end (delta: -61.3MB). Peak memory consumption was 9.1MB. Max. memory is 16.1GB. [2023-11-24 21:49:37,194 INFO L158 Benchmark]: CDTParser took 1.74ms. Allocated memory is still 77.6MB. Free memory is still 53.5MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-24 21:49:37,194 INFO L158 Benchmark]: CACSL2BoogieTranslator took 766.98ms. Allocated memory was 77.6MB in the beginning and 98.6MB in the end (delta: 21.0MB). Free memory was 52.5MB in the beginning and 68.0MB in the end (delta: -15.5MB). Peak memory consumption was 19.3MB. Max. memory is 16.1GB. [2023-11-24 21:49:37,195 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.72ms. Allocated memory is still 98.6MB. Free memory was 68.0MB in the beginning and 65.9MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-24 21:49:37,195 INFO L158 Benchmark]: Boogie Preprocessor took 68.25ms. Allocated memory is still 98.6MB. Free memory was 65.9MB in the beginning and 62.5MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-24 21:49:37,198 INFO L158 Benchmark]: RCFGBuilder took 1322.95ms. Allocated memory is still 98.6MB. Free memory was 62.5MB in the beginning and 67.7MB in the end (delta: -5.1MB). Peak memory consumption was 22.0MB. Max. memory is 16.1GB. [2023-11-24 21:49:37,198 INFO L158 Benchmark]: TraceAbstraction took 8246.31ms. Allocated memory was 98.6MB in the beginning and 146.8MB in the end (delta: 48.2MB). Free memory was 67.1MB in the beginning and 115.1MB in the end (delta: -48.0MB). Peak memory consumption was 68.8MB. Max. memory is 16.1GB. [2023-11-24 21:49:37,199 INFO L158 Benchmark]: Witness Printer took 4.64ms. Allocated memory is still 146.8MB. Free memory was 115.1MB in the beginning and 114.1MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-24 21:49:37,203 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.74ms. Allocated memory is still 77.6MB. Free memory is still 53.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 766.98ms. Allocated memory was 77.6MB in the beginning and 98.6MB in the end (delta: 21.0MB). Free memory was 52.5MB in the beginning and 68.0MB in the end (delta: -15.5MB). Peak memory consumption was 19.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 60.72ms. Allocated memory is still 98.6MB. Free memory was 68.0MB in the beginning and 65.9MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 68.25ms. Allocated memory is still 98.6MB. Free memory was 65.9MB in the beginning and 62.5MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1322.95ms. Allocated memory is still 98.6MB. Free memory was 62.5MB in the beginning and 67.7MB in the end (delta: -5.1MB). Peak memory consumption was 22.0MB. Max. memory is 16.1GB. * TraceAbstraction took 8246.31ms. Allocated memory was 98.6MB in the beginning and 146.8MB in the end (delta: 48.2MB). Free memory was 67.1MB in the beginning and 115.1MB in the end (delta: -48.0MB). Peak memory consumption was 68.8MB. Max. memory is 16.1GB. * Witness Printer took 4.64ms. Allocated memory is still 146.8MB. Free memory was 115.1MB in the beginning and 114.1MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: 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: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p0_EBX = 0; [L715] 0 int __unbuffered_p1_EAX = 0; [L717] 0 int __unbuffered_p1_EBX = 0; [L719] 0 int a = 0; [L720] 0 _Bool main$tmp_guard0; [L721] 0 _Bool main$tmp_guard1; [L723] 0 int x = 0; [L725] 0 int y = 0; [L726] 0 _Bool y$flush_delayed; [L727] 0 int y$mem_tmp; [L728] 0 _Bool y$r_buff0_thd0; [L729] 0 _Bool y$r_buff0_thd1; [L730] 0 _Bool y$r_buff0_thd2; [L731] 0 _Bool y$r_buff1_thd0; [L732] 0 _Bool y$r_buff1_thd1; [L733] 0 _Bool y$r_buff1_thd2; [L734] 0 _Bool y$read_delayed; [L735] 0 int *y$read_delayed_var; [L736] 0 int y$w_buff0; [L737] 0 _Bool y$w_buff0_used; [L738] 0 int y$w_buff1; [L739] 0 _Bool y$w_buff1_used; [L741] 0 int z = 0; [L742] 0 _Bool weak$$choice0; [L743] 0 _Bool weak$$choice2; [L823] 0 pthread_t t835; [L824] FCALL, FORK 0 pthread_create(&t835, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t835={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L825] 0 pthread_t t836; [L826] FCALL, FORK 0 pthread_create(&t836, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t835={3:0}, t836={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L781] 2 y$w_buff1 = y$w_buff0 [L782] 2 y$w_buff0 = 1 [L783] 2 y$w_buff1_used = y$w_buff0_used [L784] 2 y$w_buff0_used = (_Bool)1 [L785] CALL 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L785] RET 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L786] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L787] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L788] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L789] 2 y$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L792] 2 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L795] 2 __unbuffered_p1_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L798] 2 __unbuffered_p1_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L747] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L750] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L753] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L756] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L757] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L758] 1 y$flush_delayed = weak$$choice2 [L759] 1 y$mem_tmp = y [L760] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L761] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L762] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L763] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L764] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L765] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L766] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L767] 1 __unbuffered_p0_EBX = y [L768] 1 y = y$flush_delayed ? y$mem_tmp : y [L769] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L801] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L802] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L803] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L804] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L805] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L774] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L808] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L828] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t835={3:0}, t836={7:0}, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L830] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L830] RET 0 assume_abort_if_not(main$tmp_guard0) [L832] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L833] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L834] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L835] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L836] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t835={3:0}, t836={7:0}, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L839] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t835={3:0}, t836={7:0}, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L841] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] CALL 0 reach_error() [L18] COND FALSE 0 !(0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L18] 0 __assert_fail ("0", "mix031.opt.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] - UnprovableResult [Line: 18]: 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: 821]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 826]: 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: 824]: 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 5 procedures, 65 locations, 10 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: 7.9s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 2.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 243 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 198 mSDsluCounter, 52 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 35 IncrementalHoareTripleChecker+Unchecked, 38 mSDsCounter, 12 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 659 IncrementalHoareTripleChecker+Invalid, 706 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 14 mSDtfsCounter, 659 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 146 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=234occurred in iteration=10, InterpolantAutomatonStates: 44, 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.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 175 NumberOfCodeBlocks, 175 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 136 ConstructedInterpolants, 1 QuantifiedInterpolants, 1002 SizeOfPredicates, 9 NumberOfNonLiveVariables, 966 ConjunctsInSsa, 53 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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-24 21:49:37,243 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df81859e-06c0-4f6b-b526-1769f8b43837/bin/uautomizer-verify-NlZe1sFDwI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample