./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/array-memsafety/cstrlen_unsafe.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 3dbbec33 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/array-memsafety/cstrlen_unsafe.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1fa4bda6bd30ba2cdf5e016e12b6593fa4b1ef45b4dc13eb01e28da7c534ab67 --- Real Ultimate output --- This is Ultimate 0.2.2-?-3dbbec3 [2023-02-14 13:13:46,721 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-14 13:13:46,723 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-14 13:13:46,748 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-14 13:13:46,748 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-14 13:13:46,749 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-14 13:13:46,750 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-14 13:13:46,752 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-14 13:13:46,753 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-14 13:13:46,754 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-14 13:13:46,755 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-14 13:13:46,756 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-14 13:13:46,756 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-14 13:13:46,757 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-14 13:13:46,758 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-14 13:13:46,758 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-14 13:13:46,759 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-14 13:13:46,760 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-14 13:13:46,761 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-14 13:13:46,762 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-14 13:13:46,764 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-14 13:13:46,765 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-14 13:13:46,765 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-14 13:13:46,766 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-14 13:13:46,769 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-14 13:13:46,769 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-14 13:13:46,770 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-14 13:13:46,771 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-14 13:13:46,771 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-14 13:13:46,772 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-14 13:13:46,772 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-14 13:13:46,773 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-14 13:13:46,773 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-14 13:13:46,774 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-14 13:13:46,775 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-14 13:13:46,775 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-14 13:13:46,776 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-14 13:13:46,776 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-14 13:13:46,776 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-14 13:13:46,777 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-14 13:13:46,778 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-14 13:13:46,778 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-02-14 13:13:46,802 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-14 13:13:46,803 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-14 13:13:46,803 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-14 13:13:46,803 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-14 13:13:46,804 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-14 13:13:46,804 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-14 13:13:46,806 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-14 13:13:46,806 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-14 13:13:46,806 INFO L138 SettingsManager]: * Use SBE=true [2023-02-14 13:13:46,806 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-14 13:13:46,807 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-14 13:13:46,807 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-14 13:13:46,807 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-14 13:13:46,807 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-14 13:13:46,808 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-14 13:13:46,808 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-14 13:13:46,808 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-14 13:13:46,808 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-14 13:13:46,809 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-14 13:13:46,809 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-14 13:13:46,810 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-14 13:13:46,810 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-14 13:13:46,810 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-14 13:13:46,810 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-14 13:13:46,810 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-14 13:13:46,810 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-14 13:13:46,811 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-14 13:13:46,811 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-14 13:13:46,811 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-14 13:13:46,811 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-14 13:13:46,812 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-14 13:13:46,812 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-14 13:13:46,812 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-14 13:13:46,812 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-14 13:13:46,812 INFO L138 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:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1fa4bda6bd30ba2cdf5e016e12b6593fa4b1ef45b4dc13eb01e28da7c534ab67 [2023-02-14 13:13:47,052 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-14 13:13:47,076 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-14 13:13:47,078 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-14 13:13:47,080 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-14 13:13:47,080 INFO L275 PluginConnector]: CDTParser initialized [2023-02-14 13:13:47,081 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety/cstrlen_unsafe.i [2023-02-14 13:13:48,265 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-14 13:13:48,509 INFO L351 CDTParser]: Found 1 translation units. [2023-02-14 13:13:48,509 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/cstrlen_unsafe.i [2023-02-14 13:13:48,517 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/14282858a/72dc2fe06c4b461ab773dcbff34cee7e/FLAG90db6fa1d [2023-02-14 13:13:48,531 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/14282858a/72dc2fe06c4b461ab773dcbff34cee7e [2023-02-14 13:13:48,535 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-14 13:13:48,537 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-14 13:13:48,540 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-14 13:13:48,541 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-14 13:13:48,544 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-14 13:13:48,544 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.02 01:13:48" (1/1) ... [2023-02-14 13:13:48,547 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4cc55b55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:13:48, skipping insertion in model container [2023-02-14 13:13:48,548 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.02 01:13:48" (1/1) ... [2023-02-14 13:13:48,554 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-14 13:13:48,594 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-14 13:13:48,884 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-14 13:13:48,893 INFO L203 MainTranslator]: Completed pre-run [2023-02-14 13:13:48,929 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-14 13:13:48,957 INFO L208 MainTranslator]: Completed translation [2023-02-14 13:13:48,958 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:13:48 WrapperNode [2023-02-14 13:13:48,959 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-14 13:13:48,960 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-14 13:13:48,960 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-14 13:13:48,960 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-14 13:13:48,966 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:13:48" (1/1) ... [2023-02-14 13:13:48,988 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:13:48" (1/1) ... [2023-02-14 13:13:49,010 INFO L138 Inliner]: procedures = 118, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 52 [2023-02-14 13:13:49,011 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-14 13:13:49,011 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-14 13:13:49,012 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-14 13:13:49,012 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-14 13:13:49,020 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:13:48" (1/1) ... [2023-02-14 13:13:49,020 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:13:48" (1/1) ... [2023-02-14 13:13:49,026 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:13:48" (1/1) ... [2023-02-14 13:13:49,027 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:13:48" (1/1) ... [2023-02-14 13:13:49,032 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:13:48" (1/1) ... [2023-02-14 13:13:49,043 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:13:48" (1/1) ... [2023-02-14 13:13:49,045 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:13:48" (1/1) ... [2023-02-14 13:13:49,051 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:13:48" (1/1) ... [2023-02-14 13:13:49,053 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-14 13:13:49,065 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-14 13:13:49,065 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-14 13:13:49,065 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-14 13:13:49,066 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:13:48" (1/1) ... [2023-02-14 13:13:49,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-14 13:13:49,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 13:13:49,095 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-02-14 13:13:49,097 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-02-14 13:13:49,122 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-02-14 13:13:49,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-02-14 13:13:49,123 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-14 13:13:49,123 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-14 13:13:49,123 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-14 13:13:49,123 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-14 13:13:49,217 INFO L235 CfgBuilder]: Building ICFG [2023-02-14 13:13:49,219 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-14 13:13:49,419 INFO L276 CfgBuilder]: Performing block encoding [2023-02-14 13:13:49,425 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-14 13:13:49,425 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2023-02-14 13:13:49,427 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.02 01:13:49 BoogieIcfgContainer [2023-02-14 13:13:49,427 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-14 13:13:49,432 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-14 13:13:49,432 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-14 13:13:49,435 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-14 13:13:49,435 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.02 01:13:48" (1/3) ... [2023-02-14 13:13:49,436 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19e0bf38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.02 01:13:49, skipping insertion in model container [2023-02-14 13:13:49,436 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:13:48" (2/3) ... [2023-02-14 13:13:49,437 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19e0bf38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.02 01:13:49, skipping insertion in model container [2023-02-14 13:13:49,437 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.02 01:13:49" (3/3) ... [2023-02-14 13:13:49,438 INFO L112 eAbstractionObserver]: Analyzing ICFG cstrlen_unsafe.i [2023-02-14 13:13:49,459 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-14 13:13:49,459 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 10 error locations. [2023-02-14 13:13:49,493 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-14 13:13:49,498 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;@19a2b639, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-14 13:13:49,499 INFO L358 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2023-02-14 13:13:49,503 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 20 states have (on average 1.75) internal successors, (35), 30 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:13:49,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-02-14 13:13:49,507 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:13:49,508 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-02-14 13:13:49,509 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-02-14 13:13:49,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:13:49,513 INFO L85 PathProgramCache]: Analyzing trace with hash 889508873, now seen corresponding path program 1 times [2023-02-14 13:13:49,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:13:49,521 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324244825] [2023-02-14 13:13:49,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:13:49,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:13:49,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:13:49,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 13:13:49,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:13:49,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324244825] [2023-02-14 13:13:49,766 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324244825] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 13:13:49,766 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 13:13:49,767 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-14 13:13:49,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966764487] [2023-02-14 13:13:49,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 13:13:49,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-14 13:13:49,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:13:49,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-14 13:13:49,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-02-14 13:13:49,809 INFO L87 Difference]: Start difference. First operand has 31 states, 20 states have (on average 1.75) internal successors, (35), 30 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:13:49,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:13:49,857 INFO L93 Difference]: Finished difference Result 54 states and 56 transitions. [2023-02-14 13:13:49,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-14 13:13:49,860 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2023-02-14 13:13:49,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:13:49,867 INFO L225 Difference]: With dead ends: 54 [2023-02-14 13:13:49,867 INFO L226 Difference]: Without dead ends: 50 [2023-02-14 13:13:49,869 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-02-14 13:13:49,872 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 22 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-14 13:13:49,873 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 76 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-14 13:13:49,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2023-02-14 13:13:49,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 31. [2023-02-14 13:13:49,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 30 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:13:49,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2023-02-14 13:13:49,910 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 6 [2023-02-14 13:13:49,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:13:49,911 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2023-02-14 13:13:49,911 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:13:49,911 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2023-02-14 13:13:49,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-02-14 13:13:49,912 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:13:49,912 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-02-14 13:13:49,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-14 13:13:49,914 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-02-14 13:13:49,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:13:49,914 INFO L85 PathProgramCache]: Analyzing trace with hash 889508820, now seen corresponding path program 1 times [2023-02-14 13:13:49,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:13:49,915 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438725183] [2023-02-14 13:13:49,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:13:49,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:13:49,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:13:50,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 13:13:50,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:13:50,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438725183] [2023-02-14 13:13:50,015 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438725183] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 13:13:50,015 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 13:13:50,016 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-14 13:13:50,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031761037] [2023-02-14 13:13:50,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 13:13:50,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-14 13:13:50,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:13:50,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-14 13:13:50,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-14 13:13:50,019 INFO L87 Difference]: Start difference. First operand 31 states and 33 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:13:50,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:13:50,046 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2023-02-14 13:13:50,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-14 13:13:50,048 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2023-02-14 13:13:50,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:13:50,049 INFO L225 Difference]: With dead ends: 29 [2023-02-14 13:13:50,049 INFO L226 Difference]: Without dead ends: 29 [2023-02-14 13:13:50,049 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-02-14 13:13:50,051 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 21 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-14 13:13:50,053 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 22 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-14 13:13:50,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2023-02-14 13:13:50,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2023-02-14 13:13:50,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 28 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:13:50,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2023-02-14 13:13:50,062 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 6 [2023-02-14 13:13:50,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:13:50,063 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2023-02-14 13:13:50,064 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:13:50,065 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2023-02-14 13:13:50,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-02-14 13:13:50,066 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:13:50,067 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-02-14 13:13:50,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-14 13:13:50,067 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-02-14 13:13:50,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:13:50,068 INFO L85 PathProgramCache]: Analyzing trace with hash 889508821, now seen corresponding path program 1 times [2023-02-14 13:13:50,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:13:50,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156112231] [2023-02-14 13:13:50,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:13:50,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:13:50,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:13:50,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 13:13:50,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:13:50,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156112231] [2023-02-14 13:13:50,205 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156112231] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 13:13:50,205 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 13:13:50,206 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-14 13:13:50,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132029912] [2023-02-14 13:13:50,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 13:13:50,206 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-14 13:13:50,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:13:50,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-14 13:13:50,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-02-14 13:13:50,208 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:13:50,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:13:50,257 INFO L93 Difference]: Finished difference Result 46 states and 48 transitions. [2023-02-14 13:13:50,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-14 13:13:50,258 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2023-02-14 13:13:50,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:13:50,259 INFO L225 Difference]: With dead ends: 46 [2023-02-14 13:13:50,260 INFO L226 Difference]: Without dead ends: 46 [2023-02-14 13:13:50,261 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-02-14 13:13:50,262 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 34 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-14 13:13:50,264 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 44 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-14 13:13:50,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2023-02-14 13:13:50,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 30. [2023-02-14 13:13:50,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 29 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:13:50,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2023-02-14 13:13:50,272 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 6 [2023-02-14 13:13:50,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:13:50,273 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2023-02-14 13:13:50,273 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:13:50,273 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2023-02-14 13:13:50,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-02-14 13:13:50,274 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:13:50,274 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-02-14 13:13:50,274 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-14 13:13:50,275 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-02-14 13:13:50,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:13:50,275 INFO L85 PathProgramCache]: Analyzing trace with hash 889568456, now seen corresponding path program 1 times [2023-02-14 13:13:50,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:13:50,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176589603] [2023-02-14 13:13:50,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:13:50,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:13:50,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:13:50,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 13:13:50,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:13:50,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176589603] [2023-02-14 13:13:50,472 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176589603] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 13:13:50,472 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 13:13:50,472 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-14 13:13:50,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082565674] [2023-02-14 13:13:50,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 13:13:50,473 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-14 13:13:50,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:13:50,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-14 13:13:50,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-02-14 13:13:50,477 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:13:50,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:13:50,565 INFO L93 Difference]: Finished difference Result 52 states and 55 transitions. [2023-02-14 13:13:50,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-14 13:13:50,580 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2023-02-14 13:13:50,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:13:50,582 INFO L225 Difference]: With dead ends: 52 [2023-02-14 13:13:50,582 INFO L226 Difference]: Without dead ends: 52 [2023-02-14 13:13:50,583 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-02-14 13:13:50,588 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 71 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-14 13:13:50,590 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 47 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-14 13:13:50,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2023-02-14 13:13:50,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 32. [2023-02-14 13:13:50,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 31 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:13:50,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2023-02-14 13:13:50,597 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 6 [2023-02-14 13:13:50,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:13:50,597 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2023-02-14 13:13:50,598 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:13:50,598 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2023-02-14 13:13:50,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-02-14 13:13:50,598 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:13:50,599 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-02-14 13:13:50,599 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-02-14 13:13:50,599 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-02-14 13:13:50,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:13:50,601 INFO L85 PathProgramCache]: Analyzing trace with hash 889568403, now seen corresponding path program 1 times [2023-02-14 13:13:50,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:13:50,601 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161551104] [2023-02-14 13:13:50,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:13:50,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:13:50,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:13:50,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 13:13:50,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:13:50,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161551104] [2023-02-14 13:13:50,814 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161551104] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 13:13:50,814 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 13:13:50,814 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-14 13:13:50,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240830764] [2023-02-14 13:13:50,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 13:13:50,816 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-14 13:13:50,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:13:50,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-14 13:13:50,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-02-14 13:13:50,817 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:13:50,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:13:50,869 INFO L93 Difference]: Finished difference Result 51 states and 54 transitions. [2023-02-14 13:13:50,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-14 13:13:50,870 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2023-02-14 13:13:50,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:13:50,871 INFO L225 Difference]: With dead ends: 51 [2023-02-14 13:13:50,871 INFO L226 Difference]: Without dead ends: 51 [2023-02-14 13:13:50,871 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-02-14 13:13:50,874 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 48 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-14 13:13:50,874 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 49 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-14 13:13:50,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2023-02-14 13:13:50,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 32. [2023-02-14 13:13:50,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 31 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:13:50,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2023-02-14 13:13:50,879 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 6 [2023-02-14 13:13:50,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:13:50,879 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2023-02-14 13:13:50,879 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:13:50,879 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2023-02-14 13:13:50,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-02-14 13:13:50,880 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:13:50,880 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:13:50,880 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-02-14 13:13:50,880 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-02-14 13:13:50,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:13:50,881 INFO L85 PathProgramCache]: Analyzing trace with hash -590959631, now seen corresponding path program 1 times [2023-02-14 13:13:50,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:13:50,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025417275] [2023-02-14 13:13:50,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:13:50,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:13:50,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:13:50,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 13:13:50,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:13:50,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025417275] [2023-02-14 13:13:50,938 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025417275] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 13:13:50,938 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 13:13:50,939 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-14 13:13:50,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11084359] [2023-02-14 13:13:50,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 13:13:50,939 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-14 13:13:50,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:13:50,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-14 13:13:50,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-14 13:13:50,940 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:13:50,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:13:50,976 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2023-02-14 13:13:50,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-14 13:13:50,977 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-02-14 13:13:50,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:13:50,977 INFO L225 Difference]: With dead ends: 31 [2023-02-14 13:13:50,977 INFO L226 Difference]: Without dead ends: 31 [2023-02-14 13:13:50,978 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-02-14 13:13:50,978 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 42 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-14 13:13:50,979 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 31 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-14 13:13:50,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2023-02-14 13:13:50,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2023-02-14 13:13:50,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 24 states have (on average 1.4166666666666667) internal successors, (34), 30 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:13:50,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2023-02-14 13:13:50,981 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 9 [2023-02-14 13:13:50,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:13:50,982 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2023-02-14 13:13:50,982 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:13:50,982 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2023-02-14 13:13:50,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-02-14 13:13:50,982 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:13:50,983 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:13:50,983 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-02-14 13:13:50,983 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-02-14 13:13:50,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:13:50,984 INFO L85 PathProgramCache]: Analyzing trace with hash -590959630, now seen corresponding path program 1 times [2023-02-14 13:13:50,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:13:50,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477450847] [2023-02-14 13:13:50,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:13:50,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:13:50,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:13:51,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 13:13:51,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:13:51,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477450847] [2023-02-14 13:13:51,108 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477450847] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 13:13:51,108 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 13:13:51,108 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-14 13:13:51,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879607757] [2023-02-14 13:13:51,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 13:13:51,109 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-14 13:13:51,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:13:51,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-14 13:13:51,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-02-14 13:13:51,110 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand has 7 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:13:51,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:13:51,196 INFO L93 Difference]: Finished difference Result 43 states and 46 transitions. [2023-02-14 13:13:51,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-14 13:13:51,196 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-02-14 13:13:51,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:13:51,197 INFO L225 Difference]: With dead ends: 43 [2023-02-14 13:13:51,197 INFO L226 Difference]: Without dead ends: 43 [2023-02-14 13:13:51,197 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2023-02-14 13:13:51,198 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 138 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-14 13:13:51,198 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 39 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-14 13:13:51,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2023-02-14 13:13:51,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 32. [2023-02-14 13:13:51,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 25 states have (on average 1.4) internal successors, (35), 31 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:13:51,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2023-02-14 13:13:51,201 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 9 [2023-02-14 13:13:51,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:13:51,201 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2023-02-14 13:13:51,202 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:13:51,202 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2023-02-14 13:13:51,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-02-14 13:13:51,202 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:13:51,202 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:13:51,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-02-14 13:13:51,203 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-02-14 13:13:51,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:13:51,203 INFO L85 PathProgramCache]: Analyzing trace with hash -1900556789, now seen corresponding path program 1 times [2023-02-14 13:13:51,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:13:51,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307721422] [2023-02-14 13:13:51,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:13:51,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:13:51,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:13:51,399 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 13:13:51,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:13:51,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307721422] [2023-02-14 13:13:51,400 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307721422] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:13:51,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [150312819] [2023-02-14 13:13:51,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:13:51,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:13:51,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 13:13:51,404 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 13:13:51,406 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-02-14 13:13:51,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:13:51,464 INFO L263 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 11 conjunts are in the unsatisfiable core [2023-02-14 13:13:51,469 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 13:13:51,539 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2023-02-14 13:13:51,747 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 13:13:51,747 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 13:13:51,971 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 13:13:51,971 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [150312819] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 13:13:51,971 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 13:13:51,971 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 16 [2023-02-14 13:13:51,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485035305] [2023-02-14 13:13:51,972 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 13:13:51,973 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-02-14 13:13:51,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:13:51,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-02-14 13:13:51,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2023-02-14 13:13:51,977 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand has 17 states, 16 states have (on average 1.75) internal successors, (28), 17 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:13:52,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:13:52,200 INFO L93 Difference]: Finished difference Result 68 states and 72 transitions. [2023-02-14 13:13:52,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-14 13:13:52,201 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 1.75) internal successors, (28), 17 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2023-02-14 13:13:52,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:13:52,203 INFO L225 Difference]: With dead ends: 68 [2023-02-14 13:13:52,203 INFO L226 Difference]: Without dead ends: 68 [2023-02-14 13:13:52,204 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=129, Invalid=291, Unknown=0, NotChecked=0, Total=420 [2023-02-14 13:13:52,207 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 146 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 13:13:52,207 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 182 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 13:13:52,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2023-02-14 13:13:52,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 30. [2023-02-14 13:13:52,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 24 states have (on average 1.375) internal successors, (33), 29 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:13:52,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2023-02-14 13:13:52,212 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 10 [2023-02-14 13:13:52,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:13:52,213 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2023-02-14 13:13:52,213 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 1.75) internal successors, (28), 17 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:13:52,213 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2023-02-14 13:13:52,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-02-14 13:13:52,214 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:13:52,214 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:13:52,224 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-02-14 13:13:52,421 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:13:52,422 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-02-14 13:13:52,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:13:52,422 INFO L85 PathProgramCache]: Analyzing trace with hash -1900556842, now seen corresponding path program 1 times [2023-02-14 13:13:52,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:13:52,422 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827361374] [2023-02-14 13:13:52,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:13:52,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:13:52,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:13:52,599 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 13:13:52,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:13:52,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827361374] [2023-02-14 13:13:52,600 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827361374] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:13:52,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [684562724] [2023-02-14 13:13:52,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:13:52,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:13:52,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 13:13:52,602 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 13:13:52,605 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-02-14 13:13:52,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:13:52,645 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-14 13:13:52,646 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 13:13:52,661 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2023-02-14 13:13:52,736 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 13:13:52,736 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 13:13:52,805 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 13:13:52,805 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [684562724] provided 1 perfect and 1 imperfect interpolant sequences [2023-02-14 13:13:52,806 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-02-14 13:13:52,806 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 4] total 12 [2023-02-14 13:13:52,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177473994] [2023-02-14 13:13:52,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 13:13:52,806 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-14 13:13:52,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:13:52,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-14 13:13:52,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2023-02-14 13:13:52,807 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:13:52,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:13:52,850 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2023-02-14 13:13:52,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-14 13:13:52,851 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2023-02-14 13:13:52,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:13:52,851 INFO L225 Difference]: With dead ends: 29 [2023-02-14 13:13:52,851 INFO L226 Difference]: Without dead ends: 29 [2023-02-14 13:13:52,852 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2023-02-14 13:13:52,852 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 54 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-14 13:13:52,853 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 18 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-14 13:13:52,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2023-02-14 13:13:52,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2023-02-14 13:13:52,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 26 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:13:52,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2023-02-14 13:13:52,855 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 10 [2023-02-14 13:13:52,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:13:52,855 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2023-02-14 13:13:52,856 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:13:52,856 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2023-02-14 13:13:52,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-02-14 13:13:52,856 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:13:52,856 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:13:52,863 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-02-14 13:13:53,062 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2023-02-14 13:13:53,062 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-02-14 13:13:53,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:13:53,063 INFO L85 PathProgramCache]: Analyzing trace with hash -976521877, now seen corresponding path program 1 times [2023-02-14 13:13:53,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:13:53,063 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97696122] [2023-02-14 13:13:53,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:13:53,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:13:53,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:13:53,192 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 13:13:53,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:13:53,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97696122] [2023-02-14 13:13:53,193 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97696122] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 13:13:53,193 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 13:13:53,193 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-02-14 13:13:53,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808155946] [2023-02-14 13:13:53,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 13:13:53,194 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-14 13:13:53,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:13:53,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-14 13:13:53,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-02-14 13:13:53,195 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand has 8 states, 8 states have (on average 1.375) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:13:53,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:13:53,264 INFO L93 Difference]: Finished difference Result 42 states and 43 transitions. [2023-02-14 13:13:53,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-14 13:13:53,265 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.375) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2023-02-14 13:13:53,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:13:53,265 INFO L225 Difference]: With dead ends: 42 [2023-02-14 13:13:53,265 INFO L226 Difference]: Without dead ends: 42 [2023-02-14 13:13:53,266 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2023-02-14 13:13:53,266 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 50 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-14 13:13:53,267 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 124 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-14 13:13:53,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2023-02-14 13:13:53,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 32. [2023-02-14 13:13:53,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 31 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:13:53,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2023-02-14 13:13:53,270 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 11 [2023-02-14 13:13:53,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:13:53,270 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2023-02-14 13:13:53,271 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.375) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:13:53,271 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2023-02-14 13:13:53,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-02-14 13:13:53,271 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:13:53,272 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:13:53,273 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-02-14 13:13:53,274 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-02-14 13:13:53,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:13:53,274 INFO L85 PathProgramCache]: Analyzing trace with hash -296463507, now seen corresponding path program 1 times [2023-02-14 13:13:53,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:13:53,275 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702192899] [2023-02-14 13:13:53,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:13:53,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:13:53,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:13:53,440 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 13:13:53,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:13:53,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702192899] [2023-02-14 13:13:53,441 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702192899] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 13:13:53,441 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 13:13:53,441 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-02-14 13:13:53,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450402070] [2023-02-14 13:13:53,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 13:13:53,442 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-14 13:13:53,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:13:53,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-14 13:13:53,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-02-14 13:13:53,443 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand has 9 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:13:53,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:13:53,529 INFO L93 Difference]: Finished difference Result 51 states and 53 transitions. [2023-02-14 13:13:53,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-14 13:13:53,530 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2023-02-14 13:13:53,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:13:53,530 INFO L225 Difference]: With dead ends: 51 [2023-02-14 13:13:53,531 INFO L226 Difference]: Without dead ends: 51 [2023-02-14 13:13:53,531 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2023-02-14 13:13:53,531 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 89 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-14 13:13:53,532 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 94 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-14 13:13:53,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2023-02-14 13:13:53,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 33. [2023-02-14 13:13:53,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 32 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:13:53,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2023-02-14 13:13:53,534 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 11 [2023-02-14 13:13:53,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:13:53,534 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2023-02-14 13:13:53,534 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:13:53,535 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2023-02-14 13:13:53,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-02-14 13:13:53,535 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:13:53,535 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:13:53,535 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-02-14 13:13:53,536 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-02-14 13:13:53,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:13:53,536 INFO L85 PathProgramCache]: Analyzing trace with hash -2134702601, now seen corresponding path program 1 times [2023-02-14 13:13:53,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:13:53,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890470614] [2023-02-14 13:13:53,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:13:53,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:13:53,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:13:53,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 13:13:53,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:13:53,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890470614] [2023-02-14 13:13:53,575 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890470614] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 13:13:53,575 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 13:13:53,575 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-14 13:13:53,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128972226] [2023-02-14 13:13:53,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 13:13:53,577 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-14 13:13:53,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:13:53,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-14 13:13:53,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-14 13:13:53,578 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:13:53,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:13:53,600 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2023-02-14 13:13:53,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-14 13:13:53,600 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2023-02-14 13:13:53,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:13:53,601 INFO L225 Difference]: With dead ends: 32 [2023-02-14 13:13:53,601 INFO L226 Difference]: Without dead ends: 32 [2023-02-14 13:13:53,601 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-02-14 13:13:53,602 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 39 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-14 13:13:53,602 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 39 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-14 13:13:53,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2023-02-14 13:13:53,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2023-02-14 13:13:53,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 28 states have (on average 1.25) internal successors, (35), 31 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:13:53,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2023-02-14 13:13:53,608 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 13 [2023-02-14 13:13:53,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:13:53,608 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2023-02-14 13:13:53,608 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:13:53,609 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2023-02-14 13:13:53,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-02-14 13:13:53,610 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:13:53,610 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:13:53,610 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-02-14 13:13:53,610 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-02-14 13:13:53,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:13:53,611 INFO L85 PathProgramCache]: Analyzing trace with hash -1751271107, now seen corresponding path program 1 times [2023-02-14 13:13:53,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:13:53,611 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242420520] [2023-02-14 13:13:53,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:13:53,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:13:53,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:13:53,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 13:13:53,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:13:53,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242420520] [2023-02-14 13:13:53,654 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242420520] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 13:13:53,654 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 13:13:53,654 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-14 13:13:53,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573942732] [2023-02-14 13:13:53,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 13:13:53,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-14 13:13:53,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:13:53,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-14 13:13:53,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-14 13:13:53,656 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:13:53,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:13:53,680 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2023-02-14 13:13:53,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-14 13:13:53,681 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2023-02-14 13:13:53,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:13:53,681 INFO L225 Difference]: With dead ends: 31 [2023-02-14 13:13:53,681 INFO L226 Difference]: Without dead ends: 31 [2023-02-14 13:13:53,682 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-02-14 13:13:53,682 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 35 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-14 13:13:53,683 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 31 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-14 13:13:53,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2023-02-14 13:13:53,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2023-02-14 13:13:53,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 30 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:13:53,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2023-02-14 13:13:53,696 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 14 [2023-02-14 13:13:53,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:13:53,697 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2023-02-14 13:13:53,697 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:13:53,697 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2023-02-14 13:13:53,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-02-14 13:13:53,699 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:13:53,699 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:13:53,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-02-14 13:13:53,699 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-02-14 13:13:53,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:13:53,700 INFO L85 PathProgramCache]: Analyzing trace with hash 1545170617, now seen corresponding path program 1 times [2023-02-14 13:13:53,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:13:53,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241691350] [2023-02-14 13:13:53,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:13:53,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:13:53,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:13:53,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 13:13:53,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:13:53,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241691350] [2023-02-14 13:13:53,769 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241691350] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 13:13:53,770 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 13:13:53,770 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-14 13:13:53,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793661544] [2023-02-14 13:13:53,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 13:13:53,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-14 13:13:53,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:13:53,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-14 13:13:53,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-14 13:13:53,771 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:13:53,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:13:53,809 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2023-02-14 13:13:53,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-14 13:13:53,809 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2023-02-14 13:13:53,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:13:53,810 INFO L225 Difference]: With dead ends: 30 [2023-02-14 13:13:53,810 INFO L226 Difference]: Without dead ends: 30 [2023-02-14 13:13:53,810 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-02-14 13:13:53,811 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 26 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-14 13:13:53,811 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 30 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-14 13:13:53,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2023-02-14 13:13:53,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2023-02-14 13:13:53,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 29 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:13:53,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2023-02-14 13:13:53,813 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 15 [2023-02-14 13:13:53,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:13:53,813 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2023-02-14 13:13:53,813 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:13:53,813 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2023-02-14 13:13:53,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-02-14 13:13:53,814 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:13:53,814 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:13:53,814 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-02-14 13:13:53,814 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-02-14 13:13:53,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:13:53,815 INFO L85 PathProgramCache]: Analyzing trace with hash 1218024458, now seen corresponding path program 1 times [2023-02-14 13:13:53,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:13:53,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352672166] [2023-02-14 13:13:53,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:13:53,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:13:53,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 13:13:53,835 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-14 13:13:53,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 13:13:53,863 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-14 13:13:53,863 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-02-14 13:13:53,864 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 10 remaining) [2023-02-14 13:13:53,866 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 10 remaining) [2023-02-14 13:13:53,866 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 10 remaining) [2023-02-14 13:13:53,867 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 10 remaining) [2023-02-14 13:13:53,867 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 10 remaining) [2023-02-14 13:13:53,867 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 10 remaining) [2023-02-14 13:13:53,868 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_FREE (3 of 10 remaining) [2023-02-14 13:13:53,868 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_FREE (2 of 10 remaining) [2023-02-14 13:13:53,868 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_FREE (1 of 10 remaining) [2023-02-14 13:13:53,868 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (0 of 10 remaining) [2023-02-14 13:13:53,868 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-02-14 13:13:53,871 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:13:53,876 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-14 13:13:53,900 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.02 01:13:53 BoogieIcfgContainer [2023-02-14 13:13:53,901 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-14 13:13:53,901 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-14 13:13:53,901 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-14 13:13:53,901 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-14 13:13:53,902 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.02 01:13:49" (3/4) ... [2023-02-14 13:13:53,903 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-02-14 13:13:53,951 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-02-14 13:13:53,951 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-14 13:13:53,952 INFO L158 Benchmark]: Toolchain (without parser) took 5414.65ms. Allocated memory was 151.0MB in the beginning and 184.5MB in the end (delta: 33.6MB). Free memory was 104.3MB in the beginning and 148.2MB in the end (delta: -44.0MB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-14 13:13:53,952 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 98.6MB. Free memory was 50.3MB in the beginning and 50.1MB in the end (delta: 134.3kB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-14 13:13:53,952 INFO L158 Benchmark]: CACSL2BoogieTranslator took 418.45ms. Allocated memory is still 151.0MB. Free memory was 103.9MB in the beginning and 88.2MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-02-14 13:13:53,953 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.14ms. Allocated memory is still 151.0MB. Free memory was 88.2MB in the beginning and 86.2MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-14 13:13:53,953 INFO L158 Benchmark]: Boogie Preprocessor took 41.69ms. Allocated memory is still 151.0MB. Free memory was 86.2MB in the beginning and 85.0MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-14 13:13:53,954 INFO L158 Benchmark]: RCFGBuilder took 365.11ms. Allocated memory was 151.0MB in the beginning and 184.5MB in the end (delta: 33.6MB). Free memory was 85.0MB in the beginning and 152.6MB in the end (delta: -67.6MB). Peak memory consumption was 16.4MB. Max. memory is 16.1GB. [2023-02-14 13:13:53,955 INFO L158 Benchmark]: TraceAbstraction took 4469.19ms. Allocated memory is still 184.5MB. Free memory was 152.2MB in the beginning and 150.3MB in the end (delta: 1.9MB). Peak memory consumption was 3.0MB. Max. memory is 16.1GB. [2023-02-14 13:13:53,955 INFO L158 Benchmark]: Witness Printer took 50.10ms. Allocated memory is still 184.5MB. Free memory was 150.3MB in the beginning and 148.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-14 13:13:53,958 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 98.6MB. Free memory was 50.3MB in the beginning and 50.1MB in the end (delta: 134.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 418.45ms. Allocated memory is still 151.0MB. Free memory was 103.9MB in the beginning and 88.2MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.14ms. Allocated memory is still 151.0MB. Free memory was 88.2MB in the beginning and 86.2MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 41.69ms. Allocated memory is still 151.0MB. Free memory was 86.2MB in the beginning and 85.0MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 365.11ms. Allocated memory was 151.0MB in the beginning and 184.5MB in the end (delta: 33.6MB). Free memory was 85.0MB in the beginning and 152.6MB in the end (delta: -67.6MB). Peak memory consumption was 16.4MB. Max. memory is 16.1GB. * TraceAbstraction took 4469.19ms. Allocated memory is still 184.5MB. Free memory was 152.2MB in the beginning and 150.3MB in the end (delta: 1.9MB). Peak memory consumption was 3.0MB. Max. memory is 16.1GB. * Witness Printer took 50.10ms. Allocated memory is still 184.5MB. Free memory was 150.3MB in the beginning and 148.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. 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 - CounterExampleResult [Line: -1]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L537] CALL, EXPR build_nondet_String() [L515] int length = __VERIFIER_nondet_int(); [L516] COND FALSE !(length < 1) VAL [length=2] [L519] char* nondetString = (char*) malloc(length * sizeof(char)); [L521] int i = 0; VAL [i=0, length=2, nondetString={-1:0}] [L521] COND TRUE i < length - 1 [L523] nondetString[i] = __VERIFIER_nondet_char() VAL [__VERIFIER_nondet_char()=-2, i=0, length=2, nondetString={-1:0}] [L521] i++ VAL [i=1, length=2, nondetString={-1:0}] [L521] COND FALSE !(i < length - 1) VAL [i=1, length=2, nondetString={-1:0}] [L526] nondetString[length-1] = '\0' VAL [i=1, length=2, nondetString={-1:0}] [L527] return nondetString; VAL [\result={-1:0}, i=1, length=2, nondetString={-1:0}] [L537] RET, EXPR build_nondet_String() [L537] char* p = build_nondet_String(); [L538] CALL cstrlen(p) [L531] const char *p = s; VAL [p={-1:0}, s={-1:0}, s={-1:0}] [L532] EXPR \read(*p) VAL [\read(*p)=-2, p={-1:0}, s={-1:0}, s={-1:0}] [L532] COND TRUE *p != '\0' [L533] p = p+2 VAL [p={-1:2}, s={-1:0}, s={-1:0}] [L532] \read(*p) - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 539]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 539]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 539]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 536]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 31 locations, 10 error locations. Started 1 CEGAR loops. OverallTime: 4.4s, OverallIterations: 15, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 815 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 815 mSDsluCounter, 826 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 544 mSDsCounter, 18 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 541 IncrementalHoareTripleChecker+Invalid, 559 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 18 mSolverCounterUnsat, 282 mSDtfsCounter, 541 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 130 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=33occurred in iteration=11, InterpolantAutomatonStates: 78, 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, 153 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 167 NumberOfCodeBlocks, 167 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 154 ConstructedInterpolants, 0 QuantifiedInterpolants, 1495 SizeOfPredicates, 2 NumberOfNonLiveVariables, 88 ConjunctsInSsa, 20 ConjunctsInUnsatCore, 18 InterpolantComputations, 13 PerfectInterpolantSequences, 4/11 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-02-14 13:13:53,986 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-deref)