./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/termination-memory-alloca/HarrisLalNoriRajamani-2010SAS-Fig1-alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68ee4f1d-be20-47f3-9acb-8353a0337b3f/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68ee4f1d-be20-47f3-9acb-8353a0337b3f/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68ee4f1d-be20-47f3-9acb-8353a0337b3f/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68ee4f1d-be20-47f3-9acb-8353a0337b3f/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/termination-memory-alloca/HarrisLalNoriRajamani-2010SAS-Fig1-alloca.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68ee4f1d-be20-47f3-9acb-8353a0337b3f/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68ee4f1d-be20-47f3-9acb-8353a0337b3f/bin/uautomizer-verify-BQ2R08f2Ya --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 7d44dc9ee297680f321b2cf4dcd79f3ba6ced2470ed6439fc6dd5eb0285efc9c --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-28 23:55:51,647 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-28 23:55:51,720 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68ee4f1d-be20-47f3-9acb-8353a0337b3f/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2023-11-28 23:55:51,727 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-28 23:55:51,728 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-28 23:55:51,759 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-28 23:55:51,760 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-28 23:55:51,761 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-28 23:55:51,762 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-28 23:55:51,762 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-28 23:55:51,763 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-28 23:55:51,764 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-28 23:55:51,765 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-28 23:55:51,765 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-28 23:55:51,766 INFO L153 SettingsManager]: * Use SBE=true [2023-11-28 23:55:51,767 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-28 23:55:51,767 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-28 23:55:51,768 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-28 23:55:51,769 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-28 23:55:51,769 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-28 23:55:51,770 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-28 23:55:51,771 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-28 23:55:51,771 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-28 23:55:51,772 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-28 23:55:51,773 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-28 23:55:51,773 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-28 23:55:51,774 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-28 23:55:51,774 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-28 23:55:51,775 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-28 23:55:51,775 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-28 23:55:51,776 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-28 23:55:51,776 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-28 23:55:51,777 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-28 23:55:51,777 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-28 23:55:51,777 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-28 23:55:51,778 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-28 23:55:51,778 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-28 23:55:51,778 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-28 23:55:51,778 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_68ee4f1d-be20-47f3-9acb-8353a0337b3f/bin/uautomizer-verify-BQ2R08f2Ya/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68ee4f1d-be20-47f3-9acb-8353a0337b3f/bin/uautomizer-verify-BQ2R08f2Ya Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7d44dc9ee297680f321b2cf4dcd79f3ba6ced2470ed6439fc6dd5eb0285efc9c [2023-11-28 23:55:52,054 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-28 23:55:52,077 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-28 23:55:52,080 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-28 23:55:52,082 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-28 23:55:52,082 INFO L274 PluginConnector]: CDTParser initialized [2023-11-28 23:55:52,083 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68ee4f1d-be20-47f3-9acb-8353a0337b3f/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/termination-memory-alloca/HarrisLalNoriRajamani-2010SAS-Fig1-alloca.i [2023-11-28 23:55:55,483 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-28 23:55:55,750 INFO L384 CDTParser]: Found 1 translation units. [2023-11-28 23:55:55,750 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68ee4f1d-be20-47f3-9acb-8353a0337b3f/sv-benchmarks/c/termination-memory-alloca/HarrisLalNoriRajamani-2010SAS-Fig1-alloca.i [2023-11-28 23:55:55,766 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68ee4f1d-be20-47f3-9acb-8353a0337b3f/bin/uautomizer-verify-BQ2R08f2Ya/data/81c2eeac9/f4e5d5039a7543bbb186f8f861544c34/FLAGef5165438 [2023-11-28 23:55:55,784 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68ee4f1d-be20-47f3-9acb-8353a0337b3f/bin/uautomizer-verify-BQ2R08f2Ya/data/81c2eeac9/f4e5d5039a7543bbb186f8f861544c34 [2023-11-28 23:55:55,788 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-28 23:55:55,790 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-28 23:55:55,791 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-28 23:55:55,791 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-28 23:55:55,797 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-28 23:55:55,798 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:55:55" (1/1) ... [2023-11-28 23:55:55,799 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5aa4e9ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:55:55, skipping insertion in model container [2023-11-28 23:55:55,799 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:55:55" (1/1) ... [2023-11-28 23:55:55,854 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-28 23:55:56,152 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-28 23:55:56,166 INFO L202 MainTranslator]: Completed pre-run [2023-11-28 23:55:56,208 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-28 23:55:56,240 INFO L206 MainTranslator]: Completed translation [2023-11-28 23:55:56,240 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:55:56 WrapperNode [2023-11-28 23:55:56,241 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-28 23:55:56,242 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-28 23:55:56,242 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-28 23:55:56,242 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-28 23:55:56,251 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:55:56" (1/1) ... [2023-11-28 23:55:56,266 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:55:56" (1/1) ... [2023-11-28 23:55:56,287 INFO L138 Inliner]: procedures = 111, calls = 40, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 11 [2023-11-28 23:55:56,288 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-28 23:55:56,288 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-28 23:55:56,289 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-28 23:55:56,289 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-28 23:55:56,302 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:55:56" (1/1) ... [2023-11-28 23:55:56,302 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:55:56" (1/1) ... [2023-11-28 23:55:56,306 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:55:56" (1/1) ... [2023-11-28 23:55:56,324 INFO L175 MemorySlicer]: Split 21 memory accesses to 5 slices as follows [4, 5, 3, 3, 6]. 29 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0, 0, 0, 0]. The 10 writes are split as follows [2, 3, 1, 1, 3]. [2023-11-28 23:55:56,324 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:55:56" (1/1) ... [2023-11-28 23:55:56,324 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:55:56" (1/1) ... [2023-11-28 23:55:56,334 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:55:56" (1/1) ... [2023-11-28 23:55:56,338 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:55:56" (1/1) ... [2023-11-28 23:55:56,341 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:55:56" (1/1) ... [2023-11-28 23:55:56,342 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:55:56" (1/1) ... [2023-11-28 23:55:56,346 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-28 23:55:56,347 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-28 23:55:56,347 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-28 23:55:56,347 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-28 23:55:56,348 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:55:56" (1/1) ... [2023-11-28 23:55:56,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-28 23:55:56,369 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68ee4f1d-be20-47f3-9acb-8353a0337b3f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 23:55:56,386 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68ee4f1d-be20-47f3-9acb-8353a0337b3f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-28 23:55:56,395 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68ee4f1d-be20-47f3-9acb-8353a0337b3f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-28 23:55:56,434 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-28 23:55:56,434 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-11-28 23:55:56,434 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-11-28 23:55:56,434 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2023-11-28 23:55:56,435 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2023-11-28 23:55:56,435 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-28 23:55:56,435 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-28 23:55:56,435 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-28 23:55:56,436 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-11-28 23:55:56,436 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2023-11-28 23:55:56,436 INFO L130 BoogieDeclarations]: Found specification of procedure f [2023-11-28 23:55:56,436 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2023-11-28 23:55:56,436 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-28 23:55:56,436 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-28 23:55:56,436 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-28 23:55:56,437 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-28 23:55:56,565 INFO L241 CfgBuilder]: Building ICFG [2023-11-28 23:55:56,567 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-28 23:55:56,908 INFO L282 CfgBuilder]: Performing block encoding [2023-11-28 23:55:56,946 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-28 23:55:56,946 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-28 23:55:56,947 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:55:56 BoogieIcfgContainer [2023-11-28 23:55:56,947 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-28 23:55:56,951 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-28 23:55:56,951 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-28 23:55:56,955 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-28 23:55:56,956 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 11:55:55" (1/3) ... [2023-11-28 23:55:56,957 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2546a86f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 11:55:56, skipping insertion in model container [2023-11-28 23:55:56,957 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:55:56" (2/3) ... [2023-11-28 23:55:56,957 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2546a86f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 11:55:56, skipping insertion in model container [2023-11-28 23:55:56,957 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:55:56" (3/3) ... [2023-11-28 23:55:56,959 INFO L112 eAbstractionObserver]: Analyzing ICFG HarrisLalNoriRajamani-2010SAS-Fig1-alloca.i [2023-11-28 23:55:56,984 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-28 23:55:56,984 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 43 error locations. [2023-11-28 23:55:57,045 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-28 23:55:57,053 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;@40ce33d3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-28 23:55:57,054 INFO L358 AbstractCegarLoop]: Starting to check reachability of 43 error locations. [2023-11-28 23:55:57,059 INFO L276 IsEmpty]: Start isEmpty. Operand has 79 states, 32 states have (on average 2.59375) internal successors, (83), 76 states have internal predecessors, (83), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-28 23:55:57,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-11-28 23:55:57,066 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 23:55:57,066 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-11-28 23:55:57,067 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting fErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2023-11-28 23:55:57,072 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:55:57,072 INFO L85 PathProgramCache]: Analyzing trace with hash 159712436, now seen corresponding path program 1 times [2023-11-28 23:55:57,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:55:57,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583898100] [2023-11-28 23:55:57,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:55:57,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:55:57,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:55:57,648 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-28 23:55:57,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 23:55:57,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583898100] [2023-11-28 23:55:57,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583898100] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:55:57,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:55:57,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-28 23:55:57,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270288292] [2023-11-28 23:55:57,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:55:57,657 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 23:55:57,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 23:55:57,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 23:55:57,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 23:55:57,694 INFO L87 Difference]: Start difference. First operand has 79 states, 32 states have (on average 2.59375) internal successors, (83), 76 states have internal predecessors, (83), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:55:57,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 23:55:57,818 INFO L93 Difference]: Finished difference Result 76 states and 82 transitions. [2023-11-28 23:55:57,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 23:55:57,822 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2023-11-28 23:55:57,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 23:55:57,834 INFO L225 Difference]: With dead ends: 76 [2023-11-28 23:55:57,835 INFO L226 Difference]: Without dead ends: 75 [2023-11-28 23:55:57,837 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 23:55:57,841 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 69 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-28 23:55:57,842 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 43 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-28 23:55:57,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2023-11-28 23:55:57,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2023-11-28 23:55:57,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 32 states have (on average 2.40625) internal successors, (77), 72 states have internal predecessors, (77), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-28 23:55:57,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 81 transitions. [2023-11-28 23:55:57,891 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 81 transitions. Word has length 5 [2023-11-28 23:55:57,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 23:55:57,892 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 81 transitions. [2023-11-28 23:55:57,892 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:55:57,892 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 81 transitions. [2023-11-28 23:55:57,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-11-28 23:55:57,893 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 23:55:57,893 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-11-28 23:55:57,893 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-28 23:55:57,894 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting fErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2023-11-28 23:55:57,895 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:55:57,895 INFO L85 PathProgramCache]: Analyzing trace with hash 159712437, now seen corresponding path program 1 times [2023-11-28 23:55:57,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:55:57,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502978984] [2023-11-28 23:55:57,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:55:57,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:55:57,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:55:58,202 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-28 23:55:58,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 23:55:58,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502978984] [2023-11-28 23:55:58,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502978984] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:55:58,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:55:58,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-28 23:55:58,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380298405] [2023-11-28 23:55:58,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:55:58,205 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 23:55:58,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 23:55:58,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 23:55:58,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 23:55:58,207 INFO L87 Difference]: Start difference. First operand 75 states and 81 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:55:58,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 23:55:58,303 INFO L93 Difference]: Finished difference Result 72 states and 78 transitions. [2023-11-28 23:55:58,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 23:55:58,304 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2023-11-28 23:55:58,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 23:55:58,305 INFO L225 Difference]: With dead ends: 72 [2023-11-28 23:55:58,305 INFO L226 Difference]: Without dead ends: 72 [2023-11-28 23:55:58,306 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 23:55:58,308 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 69 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-28 23:55:58,308 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 43 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-28 23:55:58,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2023-11-28 23:55:58,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2023-11-28 23:55:58,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 32 states have (on average 2.3125) internal successors, (74), 69 states have internal predecessors, (74), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-28 23:55:58,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 78 transitions. [2023-11-28 23:55:58,320 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 78 transitions. Word has length 5 [2023-11-28 23:55:58,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 23:55:58,321 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 78 transitions. [2023-11-28 23:55:58,321 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:55:58,321 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 78 transitions. [2023-11-28 23:55:58,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-11-28 23:55:58,322 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 23:55:58,322 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-28 23:55:58,322 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-28 23:55:58,323 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting fErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2023-11-28 23:55:58,324 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:55:58,324 INFO L85 PathProgramCache]: Analyzing trace with hash 656118194, now seen corresponding path program 1 times [2023-11-28 23:55:58,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:55:58,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852237963] [2023-11-28 23:55:58,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:55:58,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:55:58,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:55:58,480 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-28 23:55:58,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 23:55:58,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852237963] [2023-11-28 23:55:58,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852237963] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:55:58,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:55:58,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-28 23:55:58,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527289634] [2023-11-28 23:55:58,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:55:58,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 23:55:58,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 23:55:58,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 23:55:58,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 23:55:58,485 INFO L87 Difference]: Start difference. First operand 72 states and 78 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:55:58,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 23:55:58,568 INFO L93 Difference]: Finished difference Result 68 states and 74 transitions. [2023-11-28 23:55:58,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 23:55:58,570 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2023-11-28 23:55:58,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 23:55:58,571 INFO L225 Difference]: With dead ends: 68 [2023-11-28 23:55:58,571 INFO L226 Difference]: Without dead ends: 68 [2023-11-28 23:55:58,572 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 23:55:58,574 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 61 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-28 23:55:58,574 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 39 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-28 23:55:58,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2023-11-28 23:55:58,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2023-11-28 23:55:58,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 32 states have (on average 2.1875) internal successors, (70), 65 states have internal predecessors, (70), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-28 23:55:58,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 74 transitions. [2023-11-28 23:55:58,583 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 74 transitions. Word has length 6 [2023-11-28 23:55:58,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 23:55:58,584 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 74 transitions. [2023-11-28 23:55:58,584 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:55:58,584 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 74 transitions. [2023-11-28 23:55:58,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-11-28 23:55:58,585 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 23:55:58,585 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-28 23:55:58,585 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-28 23:55:58,586 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting fErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2023-11-28 23:55:58,586 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:55:58,587 INFO L85 PathProgramCache]: Analyzing trace with hash 656118195, now seen corresponding path program 1 times [2023-11-28 23:55:58,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:55:58,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615207550] [2023-11-28 23:55:58,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:55:58,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:55:58,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:55:58,747 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-28 23:55:58,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 23:55:58,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615207550] [2023-11-28 23:55:58,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615207550] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:55:58,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:55:58,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-28 23:55:58,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798315235] [2023-11-28 23:55:58,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:55:58,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 23:55:58,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 23:55:58,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 23:55:58,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 23:55:58,750 INFO L87 Difference]: Start difference. First operand 68 states and 74 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:55:58,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 23:55:58,834 INFO L93 Difference]: Finished difference Result 64 states and 70 transitions. [2023-11-28 23:55:58,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 23:55:58,835 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2023-11-28 23:55:58,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 23:55:58,836 INFO L225 Difference]: With dead ends: 64 [2023-11-28 23:55:58,836 INFO L226 Difference]: Without dead ends: 64 [2023-11-28 23:55:58,837 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 23:55:58,839 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 60 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-28 23:55:58,840 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 39 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-28 23:55:58,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2023-11-28 23:55:58,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2023-11-28 23:55:58,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 32 states have (on average 2.0625) internal successors, (66), 61 states have internal predecessors, (66), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-28 23:55:58,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 70 transitions. [2023-11-28 23:55:58,849 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 70 transitions. Word has length 6 [2023-11-28 23:55:58,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 23:55:58,849 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 70 transitions. [2023-11-28 23:55:58,850 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:55:58,850 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 70 transitions. [2023-11-28 23:55:58,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-11-28 23:55:58,851 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 23:55:58,851 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-28 23:55:58,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-28 23:55:58,851 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting fErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2023-11-28 23:55:58,852 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:55:58,852 INFO L85 PathProgramCache]: Analyzing trace with hash -1135172489, now seen corresponding path program 1 times [2023-11-28 23:55:58,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:55:58,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886467552] [2023-11-28 23:55:58,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:55:58,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:55:58,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:55:58,927 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-28 23:55:58,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 23:55:58,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886467552] [2023-11-28 23:55:58,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886467552] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:55:58,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:55:58,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-28 23:55:58,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81902595] [2023-11-28 23:55:58,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:55:58,930 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 23:55:58,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 23:55:58,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 23:55:58,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 23:55:58,932 INFO L87 Difference]: Start difference. First operand 64 states and 70 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:55:59,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 23:55:59,005 INFO L93 Difference]: Finished difference Result 59 states and 65 transitions. [2023-11-28 23:55:59,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 23:55:59,006 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2023-11-28 23:55:59,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 23:55:59,007 INFO L225 Difference]: With dead ends: 59 [2023-11-28 23:55:59,007 INFO L226 Difference]: Without dead ends: 59 [2023-11-28 23:55:59,007 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 23:55:59,009 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 51 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-28 23:55:59,010 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 34 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-28 23:55:59,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2023-11-28 23:55:59,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2023-11-28 23:55:59,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 32 states have (on average 1.90625) internal successors, (61), 56 states have internal predecessors, (61), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-28 23:55:59,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 65 transitions. [2023-11-28 23:55:59,017 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 65 transitions. Word has length 7 [2023-11-28 23:55:59,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 23:55:59,018 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 65 transitions. [2023-11-28 23:55:59,018 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:55:59,018 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 65 transitions. [2023-11-28 23:55:59,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-11-28 23:55:59,019 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 23:55:59,019 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-28 23:55:59,019 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-28 23:55:59,020 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting fErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2023-11-28 23:55:59,020 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:55:59,020 INFO L85 PathProgramCache]: Analyzing trace with hash -1135172488, now seen corresponding path program 1 times [2023-11-28 23:55:59,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:55:59,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126595668] [2023-11-28 23:55:59,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:55:59,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:55:59,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:55:59,133 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-28 23:55:59,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 23:55:59,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126595668] [2023-11-28 23:55:59,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126595668] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:55:59,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:55:59,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-28 23:55:59,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020634813] [2023-11-28 23:55:59,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:55:59,136 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 23:55:59,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 23:55:59,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 23:55:59,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 23:55:59,137 INFO L87 Difference]: Start difference. First operand 59 states and 65 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:55:59,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 23:55:59,203 INFO L93 Difference]: Finished difference Result 54 states and 60 transitions. [2023-11-28 23:55:59,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 23:55:59,204 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2023-11-28 23:55:59,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 23:55:59,205 INFO L225 Difference]: With dead ends: 54 [2023-11-28 23:55:59,205 INFO L226 Difference]: Without dead ends: 54 [2023-11-28 23:55:59,206 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 23:55:59,207 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 49 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-28 23:55:59,208 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 34 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-28 23:55:59,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2023-11-28 23:55:59,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2023-11-28 23:55:59,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 32 states have (on average 1.75) internal successors, (56), 51 states have internal predecessors, (56), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-28 23:55:59,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 60 transitions. [2023-11-28 23:55:59,215 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 60 transitions. Word has length 7 [2023-11-28 23:55:59,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 23:55:59,216 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 60 transitions. [2023-11-28 23:55:59,216 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:55:59,216 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 60 transitions. [2023-11-28 23:55:59,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-11-28 23:55:59,217 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 23:55:59,217 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 23:55:59,217 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-28 23:55:59,217 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting fErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2023-11-28 23:55:59,218 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:55:59,218 INFO L85 PathProgramCache]: Analyzing trace with hash -830608811, now seen corresponding path program 1 times [2023-11-28 23:55:59,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:55:59,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099647619] [2023-11-28 23:55:59,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:55:59,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:55:59,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:55:59,277 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-28 23:55:59,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 23:55:59,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099647619] [2023-11-28 23:55:59,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099647619] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:55:59,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:55:59,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-28 23:55:59,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228344108] [2023-11-28 23:55:59,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:55:59,278 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 23:55:59,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 23:55:59,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 23:55:59,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 23:55:59,279 INFO L87 Difference]: Start difference. First operand 54 states and 60 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:55:59,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 23:55:59,335 INFO L93 Difference]: Finished difference Result 51 states and 57 transitions. [2023-11-28 23:55:59,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 23:55:59,336 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2023-11-28 23:55:59,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 23:55:59,337 INFO L225 Difference]: With dead ends: 51 [2023-11-28 23:55:59,337 INFO L226 Difference]: Without dead ends: 51 [2023-11-28 23:55:59,337 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 23:55:59,338 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 42 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-28 23:55:59,339 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 31 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-28 23:55:59,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2023-11-28 23:55:59,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2023-11-28 23:55:59,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 32 states have (on average 1.65625) internal successors, (53), 48 states have internal predecessors, (53), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-28 23:55:59,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 57 transitions. [2023-11-28 23:55:59,345 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 57 transitions. Word has length 8 [2023-11-28 23:55:59,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 23:55:59,345 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 57 transitions. [2023-11-28 23:55:59,346 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:55:59,346 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 57 transitions. [2023-11-28 23:55:59,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-11-28 23:55:59,347 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 23:55:59,347 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 23:55:59,347 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-28 23:55:59,347 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting fErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2023-11-28 23:55:59,348 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:55:59,348 INFO L85 PathProgramCache]: Analyzing trace with hash -830608810, now seen corresponding path program 1 times [2023-11-28 23:55:59,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:55:59,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645397690] [2023-11-28 23:55:59,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:55:59,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:55:59,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:55:59,538 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-28 23:55:59,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 23:55:59,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645397690] [2023-11-28 23:55:59,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645397690] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:55:59,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:55:59,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-28 23:55:59,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198921277] [2023-11-28 23:55:59,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:55:59,541 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 23:55:59,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 23:55:59,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 23:55:59,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 23:55:59,542 INFO L87 Difference]: Start difference. First operand 51 states and 57 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:55:59,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 23:55:59,602 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2023-11-28 23:55:59,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 23:55:59,603 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2023-11-28 23:55:59,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 23:55:59,603 INFO L225 Difference]: With dead ends: 48 [2023-11-28 23:55:59,604 INFO L226 Difference]: Without dead ends: 48 [2023-11-28 23:55:59,604 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 23:55:59,605 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 42 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-28 23:55:59,605 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 31 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-28 23:55:59,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2023-11-28 23:55:59,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2023-11-28 23:55:59,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 32 states have (on average 1.5625) internal successors, (50), 45 states have internal predecessors, (50), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-28 23:55:59,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 54 transitions. [2023-11-28 23:55:59,610 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 54 transitions. Word has length 8 [2023-11-28 23:55:59,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 23:55:59,611 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 54 transitions. [2023-11-28 23:55:59,611 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:55:59,611 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2023-11-28 23:55:59,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-11-28 23:55:59,612 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 23:55:59,612 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 23:55:59,612 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-28 23:55:59,612 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting fErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2023-11-28 23:55:59,613 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:55:59,613 INFO L85 PathProgramCache]: Analyzing trace with hash 20930618, now seen corresponding path program 1 times [2023-11-28 23:55:59,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:55:59,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890628910] [2023-11-28 23:55:59,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:55:59,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:55:59,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:55:59,666 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-28 23:55:59,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 23:55:59,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890628910] [2023-11-28 23:55:59,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890628910] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:55:59,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:55:59,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-28 23:55:59,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392600915] [2023-11-28 23:55:59,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:55:59,668 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 23:55:59,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 23:55:59,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 23:55:59,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 23:55:59,669 INFO L87 Difference]: Start difference. First operand 48 states and 54 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:55:59,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 23:55:59,727 INFO L93 Difference]: Finished difference Result 42 states and 48 transitions. [2023-11-28 23:55:59,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 23:55:59,728 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-11-28 23:55:59,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 23:55:59,729 INFO L225 Difference]: With dead ends: 42 [2023-11-28 23:55:59,729 INFO L226 Difference]: Without dead ends: 42 [2023-11-28 23:55:59,729 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 23:55:59,730 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 32 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-28 23:55:59,731 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 25 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-28 23:55:59,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2023-11-28 23:55:59,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2023-11-28 23:55:59,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 32 states have (on average 1.375) internal successors, (44), 39 states have internal predecessors, (44), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-28 23:55:59,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 48 transitions. [2023-11-28 23:55:59,736 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 48 transitions. Word has length 9 [2023-11-28 23:55:59,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 23:55:59,736 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 48 transitions. [2023-11-28 23:55:59,736 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:55:59,736 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2023-11-28 23:55:59,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-11-28 23:55:59,737 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 23:55:59,737 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 23:55:59,737 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-28 23:55:59,738 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting fErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2023-11-28 23:55:59,738 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:55:59,738 INFO L85 PathProgramCache]: Analyzing trace with hash 20930619, now seen corresponding path program 1 times [2023-11-28 23:55:59,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:55:59,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420658638] [2023-11-28 23:55:59,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:55:59,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:55:59,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:55:59,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 23:55:59,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 23:55:59,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420658638] [2023-11-28 23:55:59,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420658638] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:55:59,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:55:59,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-28 23:55:59,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696973799] [2023-11-28 23:55:59,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:55:59,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 23:55:59,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 23:55:59,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 23:55:59,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 23:55:59,812 INFO L87 Difference]: Start difference. First operand 42 states and 48 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:55:59,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 23:55:59,862 INFO L93 Difference]: Finished difference Result 36 states and 42 transitions. [2023-11-28 23:55:59,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 23:55:59,863 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-11-28 23:55:59,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 23:55:59,863 INFO L225 Difference]: With dead ends: 36 [2023-11-28 23:55:59,864 INFO L226 Difference]: Without dead ends: 36 [2023-11-28 23:55:59,864 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 23:55:59,865 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 29 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-28 23:55:59,865 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 25 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-28 23:55:59,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2023-11-28 23:55:59,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2023-11-28 23:55:59,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 32 states have (on average 1.1875) internal successors, (38), 33 states have internal predecessors, (38), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-28 23:55:59,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 42 transitions. [2023-11-28 23:55:59,869 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 42 transitions. Word has length 9 [2023-11-28 23:55:59,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 23:55:59,869 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 42 transitions. [2023-11-28 23:55:59,869 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:55:59,870 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 42 transitions. [2023-11-28 23:55:59,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-11-28 23:55:59,870 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 23:55:59,870 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 23:55:59,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-28 23:55:59,871 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [fErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2023-11-28 23:55:59,871 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:55:59,871 INFO L85 PathProgramCache]: Analyzing trace with hash 562926510, now seen corresponding path program 1 times [2023-11-28 23:55:59,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:55:59,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988006696] [2023-11-28 23:55:59,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:55:59,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:55:59,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:55:59,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-28 23:55:59,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:56:00,070 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-28 23:56:00,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 23:56:00,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988006696] [2023-11-28 23:56:00,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988006696] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:56:00,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:56:00,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-28 23:56:00,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496371925] [2023-11-28 23:56:00,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:56:00,071 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-28 23:56:00,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 23:56:00,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-28 23:56:00,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-28 23:56:00,073 INFO L87 Difference]: Start difference. First operand 36 states and 42 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-28 23:56:00,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 23:56:00,170 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2023-11-28 23:56:00,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-28 23:56:00,171 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2023-11-28 23:56:00,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 23:56:00,172 INFO L225 Difference]: With dead ends: 36 [2023-11-28 23:56:00,172 INFO L226 Difference]: Without dead ends: 36 [2023-11-28 23:56:00,172 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-28 23:56:00,173 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 27 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-28 23:56:00,173 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 77 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-28 23:56:00,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2023-11-28 23:56:00,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2023-11-28 23:56:00,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 32 states have (on average 1.15625) internal successors, (37), 33 states have internal predecessors, (37), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-28 23:56:00,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2023-11-28 23:56:00,177 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 14 [2023-11-28 23:56:00,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 23:56:00,178 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2023-11-28 23:56:00,178 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-28 23:56:00,178 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2023-11-28 23:56:00,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-11-28 23:56:00,179 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 23:56:00,179 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 23:56:00,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-28 23:56:00,180 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [fErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2023-11-28 23:56:00,180 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:56:00,180 INFO L85 PathProgramCache]: Analyzing trace with hash -1396259548, now seen corresponding path program 1 times [2023-11-28 23:56:00,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:56:00,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028268246] [2023-11-28 23:56:00,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:56:00,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:56:00,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:56:00,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-28 23:56:00,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:56:00,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 23:56:00,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 23:56:00,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028268246] [2023-11-28 23:56:00,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028268246] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:56:00,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:56:00,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-28 23:56:00,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967667026] [2023-11-28 23:56:00,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:56:00,380 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-28 23:56:00,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 23:56:00,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-28 23:56:00,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-28 23:56:00,381 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-28 23:56:00,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 23:56:00,478 INFO L93 Difference]: Finished difference Result 50 states and 58 transitions. [2023-11-28 23:56:00,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-28 23:56:00,479 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2023-11-28 23:56:00,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 23:56:00,480 INFO L225 Difference]: With dead ends: 50 [2023-11-28 23:56:00,480 INFO L226 Difference]: Without dead ends: 50 [2023-11-28 23:56:00,481 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-28 23:56:00,481 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 18 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-28 23:56:00,482 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 86 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-28 23:56:00,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2023-11-28 23:56:00,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 44. [2023-11-28 23:56:00,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 40 states have (on average 1.175) internal successors, (47), 41 states have internal predecessors, (47), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-28 23:56:00,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 51 transitions. [2023-11-28 23:56:00,489 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 51 transitions. Word has length 21 [2023-11-28 23:56:00,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 23:56:00,490 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 51 transitions. [2023-11-28 23:56:00,490 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-28 23:56:00,490 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2023-11-28 23:56:00,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-11-28 23:56:00,491 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 23:56:00,492 INFO L195 NwaCegarLoop]: 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-28 23:56:00,492 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-28 23:56:00,492 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [fErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2023-11-28 23:56:00,493 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:56:00,493 INFO L85 PathProgramCache]: Analyzing trace with hash 484416305, now seen corresponding path program 1 times [2023-11-28 23:56:00,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:56:00,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648589811] [2023-11-28 23:56:00,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:56:00,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:56:00,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:56:00,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-28 23:56:00,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:56:00,728 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-28 23:56:00,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 23:56:00,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648589811] [2023-11-28 23:56:00,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648589811] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:56:00,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:56:00,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-28 23:56:00,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130237330] [2023-11-28 23:56:00,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:56:00,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-28 23:56:00,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 23:56:00,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-28 23:56:00,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-28 23:56:00,731 INFO L87 Difference]: Start difference. First operand 44 states and 51 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-28 23:56:00,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 23:56:00,839 INFO L93 Difference]: Finished difference Result 56 states and 64 transitions. [2023-11-28 23:56:00,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-28 23:56:00,840 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2023-11-28 23:56:00,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 23:56:00,841 INFO L225 Difference]: With dead ends: 56 [2023-11-28 23:56:00,841 INFO L226 Difference]: Without dead ends: 56 [2023-11-28 23:56:00,842 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-28 23:56:00,842 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 12 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-28 23:56:00,843 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 91 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-28 23:56:00,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2023-11-28 23:56:00,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 48. [2023-11-28 23:56:00,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 44 states have (on average 1.1590909090909092) internal successors, (51), 45 states have internal predecessors, (51), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-28 23:56:00,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 55 transitions. [2023-11-28 23:56:00,848 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 55 transitions. Word has length 22 [2023-11-28 23:56:00,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 23:56:00,848 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 55 transitions. [2023-11-28 23:56:00,848 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-28 23:56:00,848 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2023-11-28 23:56:00,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-11-28 23:56:00,850 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 23:56:00,850 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 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-28 23:56:00,850 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-28 23:56:00,850 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [fErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2023-11-28 23:56:00,851 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:56:00,851 INFO L85 PathProgramCache]: Analyzing trace with hash -495806874, now seen corresponding path program 1 times [2023-11-28 23:56:00,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:56:00,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399690907] [2023-11-28 23:56:00,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:56:00,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:56:00,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:56:01,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-28 23:56:01,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:56:02,016 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-28 23:56:02,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 23:56:02,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399690907] [2023-11-28 23:56:02,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399690907] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:56:02,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:56:02,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-28 23:56:02,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176869075] [2023-11-28 23:56:02,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:56:02,018 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-28 23:56:02,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 23:56:02,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-28 23:56:02,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-28 23:56:02,019 INFO L87 Difference]: Start difference. First operand 48 states and 55 transitions. Second operand has 6 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-28 23:56:02,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 23:56:02,160 INFO L93 Difference]: Finished difference Result 47 states and 54 transitions. [2023-11-28 23:56:02,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-28 23:56:02,160 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2023-11-28 23:56:02,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 23:56:02,161 INFO L225 Difference]: With dead ends: 47 [2023-11-28 23:56:02,161 INFO L226 Difference]: Without dead ends: 0 [2023-11-28 23:56:02,161 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-28 23:56:02,162 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 12 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-28 23:56:02,162 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 50 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-28 23:56:02,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-28 23:56:02,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-28 23:56:02,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:56:02,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-28 23:56:02,164 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 30 [2023-11-28 23:56:02,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 23:56:02,164 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-28 23:56:02,164 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-28 23:56:02,164 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-28 23:56:02,164 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-28 23:56:02,167 INFO L805 garLoopResultBuilder]: Registering result SAFE for location fErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 43 remaining) [2023-11-28 23:56:02,168 INFO L805 garLoopResultBuilder]: Registering result SAFE for location fErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 43 remaining) [2023-11-28 23:56:02,168 INFO L805 garLoopResultBuilder]: Registering result SAFE for location fErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 43 remaining) [2023-11-28 23:56:02,168 INFO L805 garLoopResultBuilder]: Registering result SAFE for location fErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 43 remaining) [2023-11-28 23:56:02,168 INFO L805 garLoopResultBuilder]: Registering result SAFE for location fErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 43 remaining) [2023-11-28 23:56:02,168 INFO L805 garLoopResultBuilder]: Registering result SAFE for location fErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 43 remaining) [2023-11-28 23:56:02,169 INFO L805 garLoopResultBuilder]: Registering result SAFE for location fErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 43 remaining) [2023-11-28 23:56:02,169 INFO L805 garLoopResultBuilder]: Registering result SAFE for location fErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 43 remaining) [2023-11-28 23:56:02,169 INFO L805 garLoopResultBuilder]: Registering result SAFE for location fErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 43 remaining) [2023-11-28 23:56:02,169 INFO L805 garLoopResultBuilder]: Registering result SAFE for location fErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 43 remaining) [2023-11-28 23:56:02,169 INFO L805 garLoopResultBuilder]: Registering result SAFE for location fErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 43 remaining) [2023-11-28 23:56:02,169 INFO L805 garLoopResultBuilder]: Registering result SAFE for location fErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 43 remaining) [2023-11-28 23:56:02,170 INFO L805 garLoopResultBuilder]: Registering result SAFE for location fErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 43 remaining) [2023-11-28 23:56:02,170 INFO L805 garLoopResultBuilder]: Registering result SAFE for location fErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 43 remaining) [2023-11-28 23:56:02,170 INFO L805 garLoopResultBuilder]: Registering result SAFE for location fErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 43 remaining) [2023-11-28 23:56:02,170 INFO L805 garLoopResultBuilder]: Registering result SAFE for location fErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 43 remaining) [2023-11-28 23:56:02,170 INFO L805 garLoopResultBuilder]: Registering result SAFE for location fErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 43 remaining) [2023-11-28 23:56:02,170 INFO L805 garLoopResultBuilder]: Registering result SAFE for location fErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 43 remaining) [2023-11-28 23:56:02,171 INFO L805 garLoopResultBuilder]: Registering result SAFE for location fErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 43 remaining) [2023-11-28 23:56:02,171 INFO L805 garLoopResultBuilder]: Registering result SAFE for location fErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 43 remaining) [2023-11-28 23:56:02,171 INFO L805 garLoopResultBuilder]: Registering result SAFE for location fErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 43 remaining) [2023-11-28 23:56:02,171 INFO L805 garLoopResultBuilder]: Registering result SAFE for location fErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 43 remaining) [2023-11-28 23:56:02,171 INFO L805 garLoopResultBuilder]: Registering result SAFE for location fErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 43 remaining) [2023-11-28 23:56:02,171 INFO L805 garLoopResultBuilder]: Registering result SAFE for location fErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 43 remaining) [2023-11-28 23:56:02,171 INFO L805 garLoopResultBuilder]: Registering result SAFE for location fErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 43 remaining) [2023-11-28 23:56:02,172 INFO L805 garLoopResultBuilder]: Registering result SAFE for location fErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 43 remaining) [2023-11-28 23:56:02,172 INFO L805 garLoopResultBuilder]: Registering result SAFE for location fErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 43 remaining) [2023-11-28 23:56:02,172 INFO L805 garLoopResultBuilder]: Registering result SAFE for location fErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 43 remaining) [2023-11-28 23:56:02,172 INFO L805 garLoopResultBuilder]: Registering result SAFE for location fErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 43 remaining) [2023-11-28 23:56:02,172 INFO L805 garLoopResultBuilder]: Registering result SAFE for location fErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 43 remaining) [2023-11-28 23:56:02,172 INFO L805 garLoopResultBuilder]: Registering result SAFE for location fErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 43 remaining) [2023-11-28 23:56:02,173 INFO L805 garLoopResultBuilder]: Registering result SAFE for location fErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 43 remaining) [2023-11-28 23:56:02,173 INFO L805 garLoopResultBuilder]: Registering result SAFE for location fErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 43 remaining) [2023-11-28 23:56:02,173 INFO L805 garLoopResultBuilder]: Registering result SAFE for location fErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 43 remaining) [2023-11-28 23:56:02,173 INFO L805 garLoopResultBuilder]: Registering result SAFE for location fErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 43 remaining) [2023-11-28 23:56:02,173 INFO L805 garLoopResultBuilder]: Registering result SAFE for location fErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 43 remaining) [2023-11-28 23:56:02,173 INFO L805 garLoopResultBuilder]: Registering result SAFE for location fErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 43 remaining) [2023-11-28 23:56:02,173 INFO L805 garLoopResultBuilder]: Registering result SAFE for location fErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 43 remaining) [2023-11-28 23:56:02,174 INFO L805 garLoopResultBuilder]: Registering result SAFE for location fErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 43 remaining) [2023-11-28 23:56:02,174 INFO L805 garLoopResultBuilder]: Registering result SAFE for location fErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 43 remaining) [2023-11-28 23:56:02,174 INFO L805 garLoopResultBuilder]: Registering result SAFE for location fErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 43 remaining) [2023-11-28 23:56:02,174 INFO L805 garLoopResultBuilder]: Registering result SAFE for location fErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 43 remaining) [2023-11-28 23:56:02,174 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (0 of 43 remaining) [2023-11-28 23:56:02,174 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-28 23:56:02,178 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 23:56:02,181 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-28 23:56:02,186 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 11:56:02 BoogieIcfgContainer [2023-11-28 23:56:02,186 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-28 23:56:02,187 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-28 23:56:02,187 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-28 23:56:02,187 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-28 23:56:02,188 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:55:56" (3/4) ... [2023-11-28 23:56:02,190 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-28 23:56:02,195 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure f [2023-11-28 23:56:02,202 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 28 nodes and edges [2023-11-28 23:56:02,203 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2023-11-28 23:56:02,203 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2023-11-28 23:56:02,204 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-11-28 23:56:02,318 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68ee4f1d-be20-47f3-9acb-8353a0337b3f/bin/uautomizer-verify-BQ2R08f2Ya/witness.graphml [2023-11-28 23:56:02,318 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68ee4f1d-be20-47f3-9acb-8353a0337b3f/bin/uautomizer-verify-BQ2R08f2Ya/witness.yml [2023-11-28 23:56:02,318 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-28 23:56:02,319 INFO L158 Benchmark]: Toolchain (without parser) took 6529.59ms. Allocated memory was 125.8MB in the beginning and 195.0MB in the end (delta: 69.2MB). Free memory was 80.7MB in the beginning and 82.5MB in the end (delta: -1.8MB). Peak memory consumption was 69.0MB. Max. memory is 16.1GB. [2023-11-28 23:56:02,320 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 125.8MB. Free memory is still 97.8MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-28 23:56:02,320 INFO L158 Benchmark]: CACSL2BoogieTranslator took 449.89ms. Allocated memory is still 125.8MB. Free memory was 80.3MB in the beginning and 64.0MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-11-28 23:56:02,320 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.95ms. Allocated memory is still 125.8MB. Free memory was 64.0MB in the beginning and 62.3MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-28 23:56:02,321 INFO L158 Benchmark]: Boogie Preprocessor took 57.61ms. Allocated memory is still 125.8MB. Free memory was 62.3MB in the beginning and 60.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-28 23:56:02,321 INFO L158 Benchmark]: RCFGBuilder took 600.31ms. Allocated memory was 125.8MB in the beginning and 161.5MB in the end (delta: 35.7MB). Free memory was 59.8MB in the beginning and 125.4MB in the end (delta: -65.7MB). Peak memory consumption was 20.8MB. Max. memory is 16.1GB. [2023-11-28 23:56:02,322 INFO L158 Benchmark]: TraceAbstraction took 5235.36ms. Allocated memory was 161.5MB in the beginning and 195.0MB in the end (delta: 33.6MB). Free memory was 124.5MB in the beginning and 87.8MB in the end (delta: 36.8MB). Peak memory consumption was 69.1MB. Max. memory is 16.1GB. [2023-11-28 23:56:02,322 INFO L158 Benchmark]: Witness Printer took 131.72ms. Allocated memory is still 195.0MB. Free memory was 87.8MB in the beginning and 82.5MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-11-28 23:56:02,325 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.21ms. Allocated memory is still 125.8MB. Free memory is still 97.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 449.89ms. Allocated memory is still 125.8MB. Free memory was 80.3MB in the beginning and 64.0MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.95ms. Allocated memory is still 125.8MB. Free memory was 64.0MB in the beginning and 62.3MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 57.61ms. Allocated memory is still 125.8MB. Free memory was 62.3MB in the beginning and 60.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 600.31ms. Allocated memory was 125.8MB in the beginning and 161.5MB in the end (delta: 35.7MB). Free memory was 59.8MB in the beginning and 125.4MB in the end (delta: -65.7MB). Peak memory consumption was 20.8MB. Max. memory is 16.1GB. * TraceAbstraction took 5235.36ms. Allocated memory was 161.5MB in the beginning and 195.0MB in the end (delta: 33.6MB). Free memory was 124.5MB in the beginning and 87.8MB in the end (delta: 36.8MB). Peak memory consumption was 69.1MB. Max. memory is 16.1GB. * Witness Printer took 131.72ms. Allocated memory is still 195.0MB. Free memory was 87.8MB in the beginning and 82.5MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 577]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 79 locations, 43 error locations. Started 1 CEGAR loops. OverallTime: 5.2s, OverallIterations: 14, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 573 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 573 mSDsluCounter, 648 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 261 mSDsCounter, 40 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 667 IncrementalHoareTripleChecker+Invalid, 707 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 40 mSolverCounterUnsat, 387 mSDtfsCounter, 667 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 49 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=79occurred in iteration=0, 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: 0.1s AutomataMinimizationTime, 14 MinimizatonAttempts, 14 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 157 NumberOfCodeBlocks, 157 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 143 ConstructedInterpolants, 0 QuantifiedInterpolants, 1879 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 4/4 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 - AllSpecificationsHoldResult: All specifications hold 43 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2023-11-28 23:56:02,347 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68ee4f1d-be20-47f3-9acb-8353a0337b3f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE