./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 f4b24e32 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-?-f4b24e3 [2022-07-14 05:59:20,295 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-14 05:59:20,297 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-14 05:59:20,338 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-14 05:59:20,339 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-14 05:59:20,340 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-14 05:59:20,342 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-14 05:59:20,344 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-14 05:59:20,346 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-14 05:59:20,352 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-14 05:59:20,354 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-14 05:59:20,356 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-14 05:59:20,356 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-14 05:59:20,359 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-14 05:59:20,361 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-14 05:59:20,365 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-14 05:59:20,366 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-14 05:59:20,368 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-14 05:59:20,370 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-14 05:59:20,377 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-14 05:59:20,379 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-14 05:59:20,381 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-14 05:59:20,382 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-14 05:59:20,383 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-14 05:59:20,384 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-14 05:59:20,387 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-14 05:59:20,388 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-14 05:59:20,389 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-14 05:59:20,390 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-14 05:59:20,390 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-14 05:59:20,392 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-14 05:59:20,392 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-14 05:59:20,394 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-14 05:59:20,395 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-14 05:59:20,396 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-14 05:59:20,397 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-14 05:59:20,397 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-14 05:59:20,398 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-14 05:59:20,398 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-14 05:59:20,398 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-14 05:59:20,399 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-14 05:59:20,401 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-14 05:59:20,402 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-07-14 05:59:20,441 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-14 05:59:20,442 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-14 05:59:20,442 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-14 05:59:20,442 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-14 05:59:20,443 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-14 05:59:20,443 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-14 05:59:20,444 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-14 05:59:20,444 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-14 05:59:20,444 INFO L138 SettingsManager]: * Use SBE=true [2022-07-14 05:59:20,444 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-14 05:59:20,445 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-14 05:59:20,445 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-14 05:59:20,445 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-14 05:59:20,446 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-14 05:59:20,446 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-14 05:59:20,446 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-14 05:59:20,446 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-14 05:59:20,446 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-14 05:59:20,447 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-14 05:59:20,448 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-14 05:59:20,448 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-14 05:59:20,448 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-14 05:59:20,448 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-14 05:59:20,449 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-14 05:59:20,449 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-14 05:59:20,449 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 05:59:20,449 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-14 05:59:20,450 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-14 05:59:20,450 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-14 05:59:20,450 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-14 05:59:20,450 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 [2022-07-14 05:59:20,693 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-14 05:59:20,716 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-14 05:59:20,718 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-14 05:59:20,719 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-14 05:59:20,720 INFO L275 PluginConnector]: CDTParser initialized [2022-07-14 05:59:20,722 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety/cstrlen_unsafe.i [2022-07-14 05:59:20,814 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a3df5522/a9821f8d8d2e47c4a094d0f79380cf13/FLAGb8cc2a6e8 [2022-07-14 05:59:21,294 INFO L306 CDTParser]: Found 1 translation units. [2022-07-14 05:59:21,297 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/cstrlen_unsafe.i [2022-07-14 05:59:21,320 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a3df5522/a9821f8d8d2e47c4a094d0f79380cf13/FLAGb8cc2a6e8 [2022-07-14 05:59:21,653 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a3df5522/a9821f8d8d2e47c4a094d0f79380cf13 [2022-07-14 05:59:21,655 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-14 05:59:21,657 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-14 05:59:21,659 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-14 05:59:21,659 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-14 05:59:21,667 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-14 05:59:21,668 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 05:59:21" (1/1) ... [2022-07-14 05:59:21,670 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5aa13492 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 05:59:21, skipping insertion in model container [2022-07-14 05:59:21,671 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 05:59:21" (1/1) ... [2022-07-14 05:59:21,698 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-14 05:59:21,792 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-14 05:59:22,235 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 05:59:22,244 INFO L203 MainTranslator]: Completed pre-run [2022-07-14 05:59:22,292 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 05:59:22,317 INFO L208 MainTranslator]: Completed translation [2022-07-14 05:59:22,318 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 05:59:22 WrapperNode [2022-07-14 05:59:22,318 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-14 05:59:22,319 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-14 05:59:22,320 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-14 05:59:22,320 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-14 05:59:22,327 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 05:59:22" (1/1) ... [2022-07-14 05:59:22,338 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 05:59:22" (1/1) ... [2022-07-14 05:59:22,353 INFO L137 Inliner]: procedures = 118, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 52 [2022-07-14 05:59:22,354 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-14 05:59:22,354 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-14 05:59:22,355 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-14 05:59:22,355 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-14 05:59:22,361 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 05:59:22" (1/1) ... [2022-07-14 05:59:22,361 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 05:59:22" (1/1) ... [2022-07-14 05:59:22,367 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 05:59:22" (1/1) ... [2022-07-14 05:59:22,369 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 05:59:22" (1/1) ... [2022-07-14 05:59:22,374 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 05:59:22" (1/1) ... [2022-07-14 05:59:22,378 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 05:59:22" (1/1) ... [2022-07-14 05:59:22,379 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 05:59:22" (1/1) ... [2022-07-14 05:59:22,381 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-14 05:59:22,388 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-14 05:59:22,388 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-14 05:59:22,388 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-14 05:59:22,389 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 05:59:22" (1/1) ... [2022-07-14 05:59:22,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 05:59:22,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 05:59:22,413 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) [2022-07-14 05:59:22,419 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 [2022-07-14 05:59:22,441 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-14 05:59:22,442 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-14 05:59:22,443 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-14 05:59:22,443 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-14 05:59:22,443 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-14 05:59:22,443 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-14 05:59:22,515 INFO L234 CfgBuilder]: Building ICFG [2022-07-14 05:59:22,516 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-14 05:59:22,688 INFO L275 CfgBuilder]: Performing block encoding [2022-07-14 05:59:22,694 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-14 05:59:22,694 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-14 05:59:22,696 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 05:59:22 BoogieIcfgContainer [2022-07-14 05:59:22,696 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-14 05:59:22,700 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-14 05:59:22,701 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-14 05:59:22,704 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-14 05:59:22,705 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.07 05:59:21" (1/3) ... [2022-07-14 05:59:22,705 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@384ffa42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 05:59:22, skipping insertion in model container [2022-07-14 05:59:22,706 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 05:59:22" (2/3) ... [2022-07-14 05:59:22,706 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@384ffa42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 05:59:22, skipping insertion in model container [2022-07-14 05:59:22,706 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 05:59:22" (3/3) ... [2022-07-14 05:59:22,707 INFO L111 eAbstractionObserver]: Analyzing ICFG cstrlen_unsafe.i [2022-07-14 05:59:22,723 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-14 05:59:22,723 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 10 error locations. [2022-07-14 05:59:22,782 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-14 05:59:22,789 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=FINITE_AUTOMATA, 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=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@4ad7eded, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@142d433e [2022-07-14 05:59:22,790 INFO L358 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2022-07-14 05:59:22,794 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) [2022-07-14 05:59:22,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-14 05:59:22,816 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:59:22,817 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-14 05:59:22,817 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)] === [2022-07-14 05:59:22,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:59:22,824 INFO L85 PathProgramCache]: Analyzing trace with hash 889508873, now seen corresponding path program 1 times [2022-07-14 05:59:22,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:59:22,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453720035] [2022-07-14 05:59:22,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:59:22,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:59:22,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:59:22,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:59:22,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:59:22,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453720035] [2022-07-14 05:59:22,986 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453720035] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:59:22,986 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:59:22,986 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 05:59:22,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760658741] [2022-07-14 05:59:22,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:59:22,992 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 05:59:22,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:59:23,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 05:59:23,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-14 05:59:23,018 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) [2022-07-14 05:59:23,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:59:23,059 INFO L93 Difference]: Finished difference Result 54 states and 56 transitions. [2022-07-14 05:59:23,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 05:59:23,063 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 [2022-07-14 05:59:23,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:59:23,069 INFO L225 Difference]: With dead ends: 54 [2022-07-14 05:59:23,070 INFO L226 Difference]: Without dead ends: 50 [2022-07-14 05:59:23,072 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 [2022-07-14 05:59:23,077 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 23 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 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 [2022-07-14 05:59:23,078 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 76 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 05:59:23,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-07-14 05:59:23,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 31. [2022-07-14 05:59:23,104 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) [2022-07-14 05:59:23,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2022-07-14 05:59:23,106 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 6 [2022-07-14 05:59:23,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:59:23,107 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2022-07-14 05:59:23,107 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) [2022-07-14 05:59:23,107 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2022-07-14 05:59:23,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-14 05:59:23,107 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:59:23,108 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-14 05:59:23,108 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-14 05:59:23,108 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)] === [2022-07-14 05:59:23,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:59:23,109 INFO L85 PathProgramCache]: Analyzing trace with hash 889508820, now seen corresponding path program 1 times [2022-07-14 05:59:23,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:59:23,110 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345225317] [2022-07-14 05:59:23,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:59:23,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:59:23,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:59:23,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:59:23,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:59:23,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345225317] [2022-07-14 05:59:23,187 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345225317] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:59:23,187 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:59:23,187 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 05:59:23,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019444583] [2022-07-14 05:59:23,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:59:23,189 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 05:59:23,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:59:23,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 05:59:23,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 05:59:23,191 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) [2022-07-14 05:59:23,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:59:23,225 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2022-07-14 05:59:23,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 05:59:23,226 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 [2022-07-14 05:59:23,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:59:23,233 INFO L225 Difference]: With dead ends: 29 [2022-07-14 05:59:23,233 INFO L226 Difference]: Without dead ends: 29 [2022-07-14 05:59:23,234 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 [2022-07-14 05:59:23,235 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 [2022-07-14 05:59:23,236 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] [2022-07-14 05:59:23,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-07-14 05:59:23,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-07-14 05:59:23,240 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) [2022-07-14 05:59:23,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2022-07-14 05:59:23,242 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 6 [2022-07-14 05:59:23,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:59:23,243 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2022-07-14 05:59:23,243 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) [2022-07-14 05:59:23,243 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2022-07-14 05:59:23,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-14 05:59:23,244 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:59:23,244 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-14 05:59:23,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-14 05:59:23,249 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)] === [2022-07-14 05:59:23,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:59:23,251 INFO L85 PathProgramCache]: Analyzing trace with hash 889508821, now seen corresponding path program 1 times [2022-07-14 05:59:23,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:59:23,257 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161596740] [2022-07-14 05:59:23,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:59:23,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:59:23,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:59:23,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:59:23,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:59:23,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161596740] [2022-07-14 05:59:23,338 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161596740] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:59:23,339 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:59:23,339 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 05:59:23,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597634254] [2022-07-14 05:59:23,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:59:23,341 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 05:59:23,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:59:23,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 05:59:23,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-14 05:59:23,342 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) [2022-07-14 05:59:23,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:59:23,371 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2022-07-14 05:59:23,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 05:59:23,373 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 [2022-07-14 05:59:23,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:59:23,375 INFO L225 Difference]: With dead ends: 28 [2022-07-14 05:59:23,375 INFO L226 Difference]: Without dead ends: 28 [2022-07-14 05:59:23,375 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 [2022-07-14 05:59:23,377 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 46 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 05:59:23,377 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 20 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 05:59:23,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-07-14 05:59:23,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-07-14 05:59:23,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 27 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:59:23,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2022-07-14 05:59:23,381 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 6 [2022-07-14 05:59:23,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:59:23,381 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2022-07-14 05:59:23,381 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) [2022-07-14 05:59:23,381 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2022-07-14 05:59:23,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-14 05:59:23,382 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:59:23,382 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-14 05:59:23,382 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-14 05:59:23,382 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)] === [2022-07-14 05:59:23,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:59:23,383 INFO L85 PathProgramCache]: Analyzing trace with hash 889568456, now seen corresponding path program 1 times [2022-07-14 05:59:23,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:59:23,383 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399353088] [2022-07-14 05:59:23,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:59:23,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:59:23,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:59:23,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:59:23,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:59:23,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399353088] [2022-07-14 05:59:23,495 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399353088] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:59:23,496 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:59:23,496 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 05:59:23,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685432808] [2022-07-14 05:59:23,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:59:23,496 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 05:59:23,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:59:23,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 05:59:23,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-14 05:59:23,497 INFO L87 Difference]: Start difference. First operand 28 states and 30 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) [2022-07-14 05:59:23,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:59:23,544 INFO L93 Difference]: Finished difference Result 49 states and 52 transitions. [2022-07-14 05:59:23,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 05:59:23,544 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 [2022-07-14 05:59:23,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:59:23,545 INFO L225 Difference]: With dead ends: 49 [2022-07-14 05:59:23,545 INFO L226 Difference]: Without dead ends: 49 [2022-07-14 05:59:23,546 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-14 05:59:23,548 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 65 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 05:59:23,548 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 37 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 05:59:23,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-07-14 05:59:23,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 30. [2022-07-14 05:59:23,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 23 states have (on average 1.434782608695652) 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) [2022-07-14 05:59:23,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2022-07-14 05:59:23,553 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 6 [2022-07-14 05:59:23,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:59:23,553 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2022-07-14 05:59:23,553 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) [2022-07-14 05:59:23,554 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2022-07-14 05:59:23,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-14 05:59:23,554 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:59:23,554 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:59:23,554 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-14 05:59:23,555 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-07-14 05:59:23,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:59:23,555 INFO L85 PathProgramCache]: Analyzing trace with hash -590959631, now seen corresponding path program 1 times [2022-07-14 05:59:23,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:59:23,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164645793] [2022-07-14 05:59:23,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:59:23,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:59:23,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:59:23,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:59:23,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:59:23,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164645793] [2022-07-14 05:59:23,603 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164645793] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:59:23,603 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:59:23,603 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 05:59:23,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127506547] [2022-07-14 05:59:23,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:59:23,604 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 05:59:23,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:59:23,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 05:59:23,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-14 05:59:23,607 INFO L87 Difference]: Start difference. First operand 30 states and 33 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) [2022-07-14 05:59:23,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:59:23,667 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2022-07-14 05:59:23,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 05:59:23,668 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 [2022-07-14 05:59:23,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:59:23,669 INFO L225 Difference]: With dead ends: 29 [2022-07-14 05:59:23,670 INFO L226 Difference]: Without dead ends: 29 [2022-07-14 05:59:23,671 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 [2022-07-14 05:59:23,673 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 39 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 05:59:23,673 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 31 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 05:59:23,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-07-14 05:59:23,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-07-14 05:59:23,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 23 states have (on average 1.391304347826087) internal successors, (32), 28 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) [2022-07-14 05:59:23,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2022-07-14 05:59:23,677 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 9 [2022-07-14 05:59:23,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:59:23,678 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2022-07-14 05:59:23,678 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) [2022-07-14 05:59:23,678 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2022-07-14 05:59:23,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-14 05:59:23,679 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:59:23,681 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:59:23,681 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-14 05:59:23,681 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-07-14 05:59:23,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:59:23,682 INFO L85 PathProgramCache]: Analyzing trace with hash -590959630, now seen corresponding path program 1 times [2022-07-14 05:59:23,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:59:23,682 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113579920] [2022-07-14 05:59:23,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:59:23,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:59:23,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:59:23,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:59:23,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:59:23,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113579920] [2022-07-14 05:59:23,781 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113579920] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:59:23,781 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:59:23,781 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 05:59:23,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923055681] [2022-07-14 05:59:23,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:59:23,782 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 05:59:23,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:59:23,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 05:59:23,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 05:59:23,783 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 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) [2022-07-14 05:59:23,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:59:23,855 INFO L93 Difference]: Finished difference Result 41 states and 44 transitions. [2022-07-14 05:59:23,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 05:59:23,855 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 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 [2022-07-14 05:59:23,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:59:23,858 INFO L225 Difference]: With dead ends: 41 [2022-07-14 05:59:23,858 INFO L226 Difference]: Without dead ends: 41 [2022-07-14 05:59:23,860 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-07-14 05:59:23,862 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 101 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 05:59:23,865 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 39 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 05:59:23,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-07-14 05:59:23,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 30. [2022-07-14 05:59:23,871 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) [2022-07-14 05:59:23,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2022-07-14 05:59:23,872 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 9 [2022-07-14 05:59:23,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:59:23,872 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2022-07-14 05:59:23,872 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 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) [2022-07-14 05:59:23,872 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2022-07-14 05:59:23,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-14 05:59:23,873 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:59:23,873 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:59:23,873 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-14 05:59:23,874 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-07-14 05:59:23,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:59:23,874 INFO L85 PathProgramCache]: Analyzing trace with hash -1900556789, now seen corresponding path program 1 times [2022-07-14 05:59:23,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:59:23,875 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050503945] [2022-07-14 05:59:23,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:59:23,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:59:23,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:59:23,953 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:59:23,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:59:23,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050503945] [2022-07-14 05:59:23,954 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050503945] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 05:59:23,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1369421913] [2022-07-14 05:59:23,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:59:23,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 05:59:23,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 05:59:23,961 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) [2022-07-14 05:59:23,962 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-14 05:59:24,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:59:24,021 INFO L263 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-14 05:59:24,027 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 05:59:24,121 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 05:59:24,204 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:59:24,205 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 05:59:24,373 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:59:24,373 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1369421913] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 05:59:24,375 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 05:59:24,375 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2022-07-14 05:59:24,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267304334] [2022-07-14 05:59:24,375 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 05:59:24,376 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-14 05:59:24,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:59:24,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-14 05:59:24,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2022-07-14 05:59:24,377 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:59:24,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:59:24,493 INFO L93 Difference]: Finished difference Result 66 states and 70 transitions. [2022-07-14 05:59:24,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 05:59:24,495 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 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 [2022-07-14 05:59:24,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:59:24,498 INFO L225 Difference]: With dead ends: 66 [2022-07-14 05:59:24,498 INFO L226 Difference]: Without dead ends: 66 [2022-07-14 05:59:24,499 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2022-07-14 05:59:24,500 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 183 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 05:59:24,501 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 133 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 05:59:24,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-07-14 05:59:24,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 27. [2022-07-14 05:59:24,510 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) [2022-07-14 05:59:24,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2022-07-14 05:59:24,512 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 10 [2022-07-14 05:59:24,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:59:24,513 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2022-07-14 05:59:24,513 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:59:24,513 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2022-07-14 05:59:24,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-14 05:59:24,514 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:59:24,514 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:59:24,540 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-14 05:59:24,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 05:59:24,727 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-07-14 05:59:24,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:59:24,728 INFO L85 PathProgramCache]: Analyzing trace with hash -976521877, now seen corresponding path program 1 times [2022-07-14 05:59:24,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:59:24,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307304394] [2022-07-14 05:59:24,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:59:24,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:59:24,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:59:24,907 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:59:24,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:59:24,907 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307304394] [2022-07-14 05:59:24,907 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307304394] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:59:24,908 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:59:24,908 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-14 05:59:24,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933259898] [2022-07-14 05:59:24,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:59:24,909 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-14 05:59:24,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:59:24,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-14 05:59:24,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-14 05:59:24,910 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) [2022-07-14 05:59:25,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:59:25,034 INFO L93 Difference]: Finished difference Result 42 states and 43 transitions. [2022-07-14 05:59:25,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-14 05:59:25,040 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 [2022-07-14 05:59:25,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:59:25,040 INFO L225 Difference]: With dead ends: 42 [2022-07-14 05:59:25,041 INFO L226 Difference]: Without dead ends: 42 [2022-07-14 05:59:25,041 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 [2022-07-14 05:59:25,043 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 48 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 05:59:25,044 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 124 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 05:59:25,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-07-14 05:59:25,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 32. [2022-07-14 05:59:25,047 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) [2022-07-14 05:59:25,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2022-07-14 05:59:25,047 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 11 [2022-07-14 05:59:25,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:59:25,048 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2022-07-14 05:59:25,048 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) [2022-07-14 05:59:25,048 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2022-07-14 05:59:25,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-14 05:59:25,048 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:59:25,048 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:59:25,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-14 05:59:25,048 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-07-14 05:59:25,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:59:25,049 INFO L85 PathProgramCache]: Analyzing trace with hash -296463507, now seen corresponding path program 1 times [2022-07-14 05:59:25,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:59:25,049 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519240443] [2022-07-14 05:59:25,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:59:25,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:59:25,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:59:25,160 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:59:25,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:59:25,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519240443] [2022-07-14 05:59:25,161 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519240443] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:59:25,161 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:59:25,161 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-14 05:59:25,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941482619] [2022-07-14 05:59:25,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:59:25,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-14 05:59:25,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:59:25,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-14 05:59:25,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-07-14 05:59:25,163 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) [2022-07-14 05:59:25,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:59:25,282 INFO L93 Difference]: Finished difference Result 51 states and 53 transitions. [2022-07-14 05:59:25,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-14 05:59:25,288 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 [2022-07-14 05:59:25,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:59:25,289 INFO L225 Difference]: With dead ends: 51 [2022-07-14 05:59:25,289 INFO L226 Difference]: Without dead ends: 51 [2022-07-14 05:59:25,290 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2022-07-14 05:59:25,290 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 85 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 05:59:25,291 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 109 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 05:59:25,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-07-14 05:59:25,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 33. [2022-07-14 05:59:25,293 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) [2022-07-14 05:59:25,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2022-07-14 05:59:25,295 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 11 [2022-07-14 05:59:25,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:59:25,295 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2022-07-14 05:59:25,296 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) [2022-07-14 05:59:25,296 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2022-07-14 05:59:25,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-14 05:59:25,296 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:59:25,296 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:59:25,297 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-14 05:59:25,297 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-07-14 05:59:25,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:59:25,297 INFO L85 PathProgramCache]: Analyzing trace with hash -2134702601, now seen corresponding path program 1 times [2022-07-14 05:59:25,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:59:25,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122264869] [2022-07-14 05:59:25,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:59:25,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:59:25,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:59:25,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:59:25,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:59:25,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122264869] [2022-07-14 05:59:25,332 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122264869] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:59:25,333 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:59:25,333 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 05:59:25,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101083692] [2022-07-14 05:59:25,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:59:25,333 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 05:59:25,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:59:25,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 05:59:25,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-14 05:59:25,334 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) [2022-07-14 05:59:25,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:59:25,352 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2022-07-14 05:59:25,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 05:59:25,352 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 [2022-07-14 05:59:25,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:59:25,353 INFO L225 Difference]: With dead ends: 32 [2022-07-14 05:59:25,353 INFO L226 Difference]: Without dead ends: 32 [2022-07-14 05:59:25,353 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 [2022-07-14 05:59:25,354 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 [2022-07-14 05:59:25,354 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] [2022-07-14 05:59:25,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-07-14 05:59:25,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-07-14 05:59:25,356 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) [2022-07-14 05:59:25,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2022-07-14 05:59:25,357 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 13 [2022-07-14 05:59:25,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:59:25,357 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2022-07-14 05:59:25,357 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) [2022-07-14 05:59:25,357 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2022-07-14 05:59:25,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-14 05:59:25,358 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:59:25,358 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:59:25,358 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-14 05:59:25,358 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-07-14 05:59:25,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:59:25,359 INFO L85 PathProgramCache]: Analyzing trace with hash -1751271107, now seen corresponding path program 1 times [2022-07-14 05:59:25,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:59:25,359 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724319734] [2022-07-14 05:59:25,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:59:25,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:59:25,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:59:25,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:59:25,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:59:25,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724319734] [2022-07-14 05:59:25,393 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724319734] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:59:25,393 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:59:25,393 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 05:59:25,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747374907] [2022-07-14 05:59:25,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:59:25,393 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 05:59:25,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:59:25,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 05:59:25,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-14 05:59:25,394 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) [2022-07-14 05:59:25,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:59:25,420 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2022-07-14 05:59:25,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 05:59:25,421 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 [2022-07-14 05:59:25,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:59:25,422 INFO L225 Difference]: With dead ends: 31 [2022-07-14 05:59:25,422 INFO L226 Difference]: Without dead ends: 31 [2022-07-14 05:59:25,422 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 [2022-07-14 05:59:25,423 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 [2022-07-14 05:59:25,423 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] [2022-07-14 05:59:25,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-07-14 05:59:25,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-07-14 05:59:25,428 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) [2022-07-14 05:59:25,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2022-07-14 05:59:25,428 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 14 [2022-07-14 05:59:25,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:59:25,428 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2022-07-14 05:59:25,428 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) [2022-07-14 05:59:25,429 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2022-07-14 05:59:25,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-14 05:59:25,429 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:59:25,430 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:59:25,430 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-14 05:59:25,431 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-07-14 05:59:25,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:59:25,431 INFO L85 PathProgramCache]: Analyzing trace with hash 1545170617, now seen corresponding path program 1 times [2022-07-14 05:59:25,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:59:25,432 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176110060] [2022-07-14 05:59:25,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:59:25,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:59:25,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:59:25,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:59:25,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:59:25,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176110060] [2022-07-14 05:59:25,488 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176110060] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:59:25,488 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:59:25,488 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 05:59:25,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785107567] [2022-07-14 05:59:25,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:59:25,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 05:59:25,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:59:25,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 05:59:25,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-14 05:59:25,491 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) [2022-07-14 05:59:25,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:59:25,516 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2022-07-14 05:59:25,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 05:59:25,516 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 [2022-07-14 05:59:25,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:59:25,517 INFO L225 Difference]: With dead ends: 30 [2022-07-14 05:59:25,517 INFO L226 Difference]: Without dead ends: 30 [2022-07-14 05:59:25,517 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 [2022-07-14 05:59:25,518 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 [2022-07-14 05:59:25,518 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] [2022-07-14 05:59:25,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-07-14 05:59:25,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-07-14 05:59:25,520 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) [2022-07-14 05:59:25,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2022-07-14 05:59:25,520 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 15 [2022-07-14 05:59:25,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:59:25,520 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2022-07-14 05:59:25,521 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) [2022-07-14 05:59:25,521 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2022-07-14 05:59:25,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-14 05:59:25,523 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:59:25,523 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:59:25,524 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-14 05:59:25,524 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-07-14 05:59:25,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:59:25,524 INFO L85 PathProgramCache]: Analyzing trace with hash 1218024458, now seen corresponding path program 1 times [2022-07-14 05:59:25,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:59:25,525 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232951836] [2022-07-14 05:59:25,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:59:25,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:59:25,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 05:59:25,563 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 05:59:25,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 05:59:25,602 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 05:59:25,602 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-14 05:59:25,603 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 10 remaining) [2022-07-14 05:59:25,605 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 10 remaining) [2022-07-14 05:59:25,605 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 10 remaining) [2022-07-14 05:59:25,605 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 10 remaining) [2022-07-14 05:59:25,606 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 10 remaining) [2022-07-14 05:59:25,606 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 10 remaining) [2022-07-14 05:59:25,606 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_FREE (3 of 10 remaining) [2022-07-14 05:59:25,606 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_FREE (2 of 10 remaining) [2022-07-14 05:59:25,606 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_FREE (1 of 10 remaining) [2022-07-14 05:59:25,606 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (0 of 10 remaining) [2022-07-14 05:59:25,607 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-14 05:59:25,610 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:59:25,613 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-14 05:59:25,633 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.07 05:59:25 BoogieIcfgContainer [2022-07-14 05:59:25,633 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-14 05:59:25,634 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-14 05:59:25,634 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-14 05:59:25,634 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-14 05:59:25,635 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 05:59:22" (3/4) ... [2022-07-14 05:59:25,636 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-07-14 05:59:25,665 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-14 05:59:25,665 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-14 05:59:25,666 INFO L158 Benchmark]: Toolchain (without parser) took 4008.66ms. Allocated memory was 98.6MB in the beginning and 123.7MB in the end (delta: 25.2MB). Free memory was 64.4MB in the beginning and 45.4MB in the end (delta: 19.0MB). Peak memory consumption was 42.4MB. Max. memory is 16.1GB. [2022-07-14 05:59:25,666 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 98.6MB. Free memory was 53.3MB in the beginning and 53.3MB in the end (delta: 70.0kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-14 05:59:25,666 INFO L158 Benchmark]: CACSL2BoogieTranslator took 659.67ms. Allocated memory was 98.6MB in the beginning and 123.7MB in the end (delta: 25.2MB). Free memory was 64.3MB in the beginning and 92.5MB in the end (delta: -28.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-07-14 05:59:25,667 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.46ms. Allocated memory is still 123.7MB. Free memory was 92.1MB in the beginning and 90.4MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-14 05:59:25,667 INFO L158 Benchmark]: Boogie Preprocessor took 32.94ms. Allocated memory is still 123.7MB. Free memory was 90.4MB in the beginning and 89.3MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-14 05:59:25,667 INFO L158 Benchmark]: RCFGBuilder took 308.16ms. Allocated memory is still 123.7MB. Free memory was 89.0MB in the beginning and 78.0MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-14 05:59:25,667 INFO L158 Benchmark]: TraceAbstraction took 2933.36ms. Allocated memory is still 123.7MB. Free memory was 77.4MB in the beginning and 47.5MB in the end (delta: 29.9MB). Peak memory consumption was 30.4MB. Max. memory is 16.1GB. [2022-07-14 05:59:25,668 INFO L158 Benchmark]: Witness Printer took 31.40ms. Allocated memory is still 123.7MB. Free memory was 47.5MB in the beginning and 45.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-14 05:59:25,669 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.26ms. Allocated memory is still 98.6MB. Free memory was 53.3MB in the beginning and 53.3MB in the end (delta: 70.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 659.67ms. Allocated memory was 98.6MB in the beginning and 123.7MB in the end (delta: 25.2MB). Free memory was 64.3MB in the beginning and 92.5MB in the end (delta: -28.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.46ms. Allocated memory is still 123.7MB. Free memory was 92.1MB in the beginning and 90.4MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 32.94ms. Allocated memory is still 123.7MB. Free memory was 90.4MB in the beginning and 89.3MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 308.16ms. Allocated memory is still 123.7MB. Free memory was 89.0MB in the beginning and 78.0MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 2933.36ms. Allocated memory is still 123.7MB. Free memory was 77.4MB in the beginning and 47.5MB in the end (delta: 29.9MB). Peak memory consumption was 30.4MB. Max. memory is 16.1GB. * Witness Printer took 31.40ms. Allocated memory is still 123.7MB. Free memory was 47.5MB in the beginning and 45.4MB 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: 2.8s, OverallIterations: 13, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 711 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 711 mSDsluCounter, 691 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 443 mSDsCounter, 33 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 399 IncrementalHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 33 mSolverCounterUnsat, 248 mSDtfsCounter, 399 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 96 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=33occurred in iteration=9, InterpolantAutomatonStates: 65, 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, 12 MinimizatonAttempts, 116 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 141 NumberOfCodeBlocks, 141 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 122 ConstructedInterpolants, 0 QuantifiedInterpolants, 730 SizeOfPredicates, 1 NumberOfNonLiveVariables, 45 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 14 InterpolantComputations, 11 PerfectInterpolantSequences, 3/8 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! [2022-07-14 05:59:25,714 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with 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)