./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/array-memsafety/cstrlen_unsafe.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -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-dev-03d7b7b [2022-02-20 23:39:12,640 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 23:39:12,642 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 23:39:12,666 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 23:39:12,669 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 23:39:12,673 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 23:39:12,675 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 23:39:12,680 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 23:39:12,682 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 23:39:12,687 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 23:39:12,687 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 23:39:12,688 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 23:39:12,689 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 23:39:12,691 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 23:39:12,692 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 23:39:12,693 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 23:39:12,695 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 23:39:12,695 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 23:39:12,697 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 23:39:12,700 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 23:39:12,704 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 23:39:12,705 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 23:39:12,705 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 23:39:12,706 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 23:39:12,708 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 23:39:12,709 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 23:39:12,709 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 23:39:12,711 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 23:39:12,711 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 23:39:12,711 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 23:39:12,712 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 23:39:12,713 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 23:39:12,714 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 23:39:12,715 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 23:39:12,715 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 23:39:12,716 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 23:39:12,716 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 23:39:12,716 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 23:39:12,716 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 23:39:12,717 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 23:39:12,717 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 23:39:12,718 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-02-20 23:39:12,746 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 23:39:12,748 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 23:39:12,749 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 23:39:12,749 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 23:39:12,749 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 23:39:12,750 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 23:39:12,750 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 23:39:12,750 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 23:39:12,751 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 23:39:12,751 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 23:39:12,752 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 23:39:12,752 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-20 23:39:12,752 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 23:39:12,752 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 23:39:12,752 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 23:39:12,753 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-02-20 23:39:12,753 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-02-20 23:39:12,753 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-02-20 23:39:12,753 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 23:39:12,753 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 23:39:12,753 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 23:39:12,754 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 23:39:12,754 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 23:39:12,754 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 23:39:12,754 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 23:39:12,754 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:39:12,754 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 23:39:12,756 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 23:39:12,756 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 23:39:12,756 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 23:39:12,756 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-02-20 23:39:12,988 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 23:39:13,012 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 23:39:13,015 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 23:39:13,016 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 23:39:13,017 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 23:39:13,018 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-02-20 23:39:13,077 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/756ebf991/ed7d83cbf7d24256ab0ffbfa22b36d4c/FLAG8c2e03ad5 [2022-02-20 23:39:13,476 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 23:39:13,477 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/cstrlen_unsafe.i [2022-02-20 23:39:13,496 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/756ebf991/ed7d83cbf7d24256ab0ffbfa22b36d4c/FLAG8c2e03ad5 [2022-02-20 23:39:13,507 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/756ebf991/ed7d83cbf7d24256ab0ffbfa22b36d4c [2022-02-20 23:39:13,510 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 23:39:13,510 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 23:39:13,512 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 23:39:13,512 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 23:39:13,514 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 23:39:13,515 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:39:13" (1/1) ... [2022-02-20 23:39:13,515 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5de4a174 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:39:13, skipping insertion in model container [2022-02-20 23:39:13,515 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:39:13" (1/1) ... [2022-02-20 23:39:13,520 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 23:39:13,564 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 23:39:13,752 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:39:13,760 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 23:39:13,794 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:39:13,813 INFO L208 MainTranslator]: Completed translation [2022-02-20 23:39:13,814 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:39:13 WrapperNode [2022-02-20 23:39:13,814 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 23:39:13,815 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 23:39:13,815 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 23:39:13,815 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 23:39:13,832 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:39:13" (1/1) ... [2022-02-20 23:39:13,847 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:39:13" (1/1) ... [2022-02-20 23:39:13,862 INFO L137 Inliner]: procedures = 118, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 52 [2022-02-20 23:39:13,863 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 23:39:13,865 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 23:39:13,865 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 23:39:13,868 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 23:39:13,873 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:39:13" (1/1) ... [2022-02-20 23:39:13,874 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:39:13" (1/1) ... [2022-02-20 23:39:13,876 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:39:13" (1/1) ... [2022-02-20 23:39:13,878 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:39:13" (1/1) ... [2022-02-20 23:39:13,883 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:39:13" (1/1) ... [2022-02-20 23:39:13,890 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:39:13" (1/1) ... [2022-02-20 23:39:13,895 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:39:13" (1/1) ... [2022-02-20 23:39:13,901 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 23:39:13,907 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 23:39:13,907 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 23:39:13,907 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 23:39:13,908 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:39:13" (1/1) ... [2022-02-20 23:39:13,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:39:13,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:39:13,947 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-02-20 23:39:13,950 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-02-20 23:39:13,975 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 23:39:13,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 23:39:13,975 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 23:39:13,977 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 23:39:13,978 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 23:39:13,978 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 23:39:14,079 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 23:39:14,092 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 23:39:14,529 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 23:39:14,534 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 23:39:14,537 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-20 23:39:14,539 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:39:14 BoogieIcfgContainer [2022-02-20 23:39:14,539 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 23:39:14,540 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 23:39:14,541 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 23:39:14,544 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 23:39:14,559 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 11:39:13" (1/3) ... [2022-02-20 23:39:14,560 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22e615bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:39:14, skipping insertion in model container [2022-02-20 23:39:14,560 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:39:13" (2/3) ... [2022-02-20 23:39:14,561 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22e615bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:39:14, skipping insertion in model container [2022-02-20 23:39:14,561 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:39:14" (3/3) ... [2022-02-20 23:39:14,562 INFO L111 eAbstractionObserver]: Analyzing ICFG cstrlen_unsafe.i [2022-02-20 23:39:14,565 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 23:39:14,566 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 10 error locations. [2022-02-20 23:39:14,625 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 23:39:14,645 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 23:39:14,645 INFO L340 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2022-02-20 23:39:14,663 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-02-20 23:39:14,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-02-20 23:39:14,683 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:39:14,684 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-02-20 23:39:14,684 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 6 more)] === [2022-02-20 23:39:14,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:39:14,689 INFO L85 PathProgramCache]: Analyzing trace with hash 889508873, now seen corresponding path program 1 times [2022-02-20 23:39:14,696 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:39:14,696 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844607323] [2022-02-20 23:39:14,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:39:14,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:39:14,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:39:14,942 INFO L290 TraceCheckUtils]: 0: Hoare triple {34#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {34#true} is VALID [2022-02-20 23:39:14,943 INFO L290 TraceCheckUtils]: 1: Hoare triple {34#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret7#1.base, main_#t~ret7#1.offset, main_#t~ret8#1, main_~p~1#1.base, main_~p~1#1.offset, main_~res~0#1;assume { :begin_inline_build_nondet_String } true;havoc build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;havoc build_nondet_String_#t~nondet2#1, build_nondet_String_#t~malloc3#1.base, build_nondet_String_#t~malloc3#1.offset, build_nondet_String_#t~nondet5#1, build_nondet_String_#t~post4#1, build_nondet_String_~i~0#1, build_nondet_String_~length~0#1, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset;assume -2147483648 <= build_nondet_String_#t~nondet2#1 && build_nondet_String_#t~nondet2#1 <= 2147483647;build_nondet_String_~length~0#1 := build_nondet_String_#t~nondet2#1;havoc build_nondet_String_#t~nondet2#1; {34#true} is VALID [2022-02-20 23:39:14,944 INFO L290 TraceCheckUtils]: 2: Hoare triple {34#true} assume build_nondet_String_~length~0#1 < 1;build_nondet_String_~length~0#1 := 1; {36#(<= |ULTIMATE.start_build_nondet_String_~length~0#1| 1)} is VALID [2022-02-20 23:39:14,946 INFO L290 TraceCheckUtils]: 3: Hoare triple {36#(<= |ULTIMATE.start_build_nondet_String_~length~0#1| 1)} call build_nondet_String_#t~malloc3#1.base, build_nondet_String_#t~malloc3#1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length~0#1);build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset := build_nondet_String_#t~malloc3#1.base, build_nondet_String_#t~malloc3#1.offset;havoc build_nondet_String_#t~malloc3#1.base, build_nondet_String_#t~malloc3#1.offset;build_nondet_String_~i~0#1 := 0; {37#(and (<= |ULTIMATE.start_build_nondet_String_~length~0#1| 1) (= |ULTIMATE.start_build_nondet_String_~i~0#1| 0))} is VALID [2022-02-20 23:39:14,947 INFO L290 TraceCheckUtils]: 4: Hoare triple {37#(and (<= |ULTIMATE.start_build_nondet_String_~length~0#1| 1) (= |ULTIMATE.start_build_nondet_String_~i~0#1| 0))} assume !!(build_nondet_String_~i~0#1 < build_nondet_String_~length~0#1 - 1);assume -128 <= build_nondet_String_#t~nondet5#1 && build_nondet_String_#t~nondet5#1 <= 127; {35#false} is VALID [2022-02-20 23:39:14,947 INFO L290 TraceCheckUtils]: 5: Hoare triple {35#false} assume !(1 == #valid[build_nondet_String_~nondetString~0#1.base]); {35#false} is VALID [2022-02-20 23:39:14,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:39:14,948 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:39:14,948 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844607323] [2022-02-20 23:39:14,949 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844607323] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:39:14,949 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:39:14,949 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:39:14,951 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015452644] [2022-02-20 23:39:14,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:39:14,955 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-02-20 23:39:14,956 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:39:14,958 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 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-02-20 23:39:14,970 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:39:14,970 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:39:14,971 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:39:14,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:39:14,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:39:14,990 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-02-20 23:39:15,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:39:15,119 INFO L93 Difference]: Finished difference Result 54 states and 56 transitions. [2022-02-20 23:39:15,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 23:39:15,120 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-02-20 23:39:15,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:39:15,122 INFO L82 GeneralOperation]: Start removeUnreachable. 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-02-20 23:39:15,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 61 transitions. [2022-02-20 23:39:15,128 INFO L82 GeneralOperation]: Start removeUnreachable. 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-02-20 23:39:15,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 61 transitions. [2022-02-20 23:39:15,134 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 61 transitions. [2022-02-20 23:39:15,186 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:39:15,199 INFO L225 Difference]: With dead ends: 54 [2022-02-20 23:39:15,200 INFO L226 Difference]: Without dead ends: 50 [2022-02-20 23:39:15,201 INFO L932 BasicCegarLoop]: 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-02-20 23:39:15,205 INFO L933 BasicCegarLoop]: 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-02-20 23:39:15,206 INFO L934 BasicCegarLoop]: 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-02-20 23:39:15,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-02-20 23:39:15,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 31. [2022-02-20 23:39:15,225 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:39:15,225 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second 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-02-20 23:39:15,226 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second 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-02-20 23:39:15,227 INFO L87 Difference]: Start difference. First operand 50 states. Second 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-02-20 23:39:15,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:39:15,230 INFO L93 Difference]: Finished difference Result 50 states and 52 transitions. [2022-02-20 23:39:15,230 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 52 transitions. [2022-02-20 23:39:15,230 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:39:15,231 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:39:15,231 INFO L74 IsIncluded]: Start isIncluded. First 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) Second operand 50 states. [2022-02-20 23:39:15,232 INFO L87 Difference]: Start difference. First 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) Second operand 50 states. [2022-02-20 23:39:15,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:39:15,237 INFO L93 Difference]: Finished difference Result 50 states and 52 transitions. [2022-02-20 23:39:15,237 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 52 transitions. [2022-02-20 23:39:15,237 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:39:15,238 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:39:15,238 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:39:15,238 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:39:15,239 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-02-20 23:39:15,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2022-02-20 23:39:15,241 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 6 [2022-02-20 23:39:15,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:39:15,242 INFO L470 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2022-02-20 23:39:15,242 INFO L471 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-02-20 23:39:15,242 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2022-02-20 23:39:15,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-02-20 23:39:15,243 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:39:15,243 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-02-20 23:39:15,244 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 23:39:15,244 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 6 more)] === [2022-02-20 23:39:15,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:39:15,245 INFO L85 PathProgramCache]: Analyzing trace with hash 889508820, now seen corresponding path program 1 times [2022-02-20 23:39:15,245 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:39:15,246 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667323112] [2022-02-20 23:39:15,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:39:15,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:39:15,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:39:15,306 INFO L290 TraceCheckUtils]: 0: Hoare triple {225#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {225#true} is VALID [2022-02-20 23:39:15,306 INFO L290 TraceCheckUtils]: 1: Hoare triple {225#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret7#1.base, main_#t~ret7#1.offset, main_#t~ret8#1, main_~p~1#1.base, main_~p~1#1.offset, main_~res~0#1;assume { :begin_inline_build_nondet_String } true;havoc build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;havoc build_nondet_String_#t~nondet2#1, build_nondet_String_#t~malloc3#1.base, build_nondet_String_#t~malloc3#1.offset, build_nondet_String_#t~nondet5#1, build_nondet_String_#t~post4#1, build_nondet_String_~i~0#1, build_nondet_String_~length~0#1, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset;assume -2147483648 <= build_nondet_String_#t~nondet2#1 && build_nondet_String_#t~nondet2#1 <= 2147483647;build_nondet_String_~length~0#1 := build_nondet_String_#t~nondet2#1;havoc build_nondet_String_#t~nondet2#1; {225#true} is VALID [2022-02-20 23:39:15,306 INFO L290 TraceCheckUtils]: 2: Hoare triple {225#true} assume build_nondet_String_~length~0#1 < 1;build_nondet_String_~length~0#1 := 1; {225#true} is VALID [2022-02-20 23:39:15,308 INFO L290 TraceCheckUtils]: 3: Hoare triple {225#true} call build_nondet_String_#t~malloc3#1.base, build_nondet_String_#t~malloc3#1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length~0#1);build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset := build_nondet_String_#t~malloc3#1.base, build_nondet_String_#t~malloc3#1.offset;havoc build_nondet_String_#t~malloc3#1.base, build_nondet_String_#t~malloc3#1.offset;build_nondet_String_~i~0#1 := 0; {227#(= (select |#valid| |ULTIMATE.start_build_nondet_String_~nondetString~0#1.base|) 1)} is VALID [2022-02-20 23:39:15,308 INFO L290 TraceCheckUtils]: 4: Hoare triple {227#(= (select |#valid| |ULTIMATE.start_build_nondet_String_~nondetString~0#1.base|) 1)} assume !(build_nondet_String_~i~0#1 < build_nondet_String_~length~0#1 - 1); {227#(= (select |#valid| |ULTIMATE.start_build_nondet_String_~nondetString~0#1.base|) 1)} is VALID [2022-02-20 23:39:15,310 INFO L290 TraceCheckUtils]: 5: Hoare triple {227#(= (select |#valid| |ULTIMATE.start_build_nondet_String_~nondetString~0#1.base|) 1)} assume !(1 == #valid[build_nondet_String_~nondetString~0#1.base]); {226#false} is VALID [2022-02-20 23:39:15,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:39:15,311 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:39:15,311 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667323112] [2022-02-20 23:39:15,312 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667323112] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:39:15,312 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:39:15,312 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:39:15,313 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908744197] [2022-02-20 23:39:15,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:39:15,316 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-02-20 23:39:15,316 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:39:15,317 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 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-02-20 23:39:15,321 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:39:15,322 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:39:15,322 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:39:15,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:39:15,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:39:15,323 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-02-20 23:39:15,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:39:15,366 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2022-02-20 23:39:15,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:39:15,366 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-02-20 23:39:15,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:39:15,366 INFO L82 GeneralOperation]: Start removeUnreachable. 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-02-20 23:39:15,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 31 transitions. [2022-02-20 23:39:15,367 INFO L82 GeneralOperation]: Start removeUnreachable. 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-02-20 23:39:15,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 31 transitions. [2022-02-20 23:39:15,369 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 31 transitions. [2022-02-20 23:39:15,393 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:39:15,395 INFO L225 Difference]: With dead ends: 29 [2022-02-20 23:39:15,395 INFO L226 Difference]: Without dead ends: 29 [2022-02-20 23:39:15,396 INFO L932 BasicCegarLoop]: 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-02-20 23:39:15,400 INFO L933 BasicCegarLoop]: 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-02-20 23:39:15,400 INFO L934 BasicCegarLoop]: 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-02-20 23:39:15,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-02-20 23:39:15,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-02-20 23:39:15,404 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:39:15,404 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second 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-02-20 23:39:15,404 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second 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-02-20 23:39:15,404 INFO L87 Difference]: Start difference. First operand 29 states. Second 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-02-20 23:39:15,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:39:15,405 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2022-02-20 23:39:15,406 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2022-02-20 23:39:15,406 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:39:15,406 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:39:15,406 INFO L74 IsIncluded]: Start isIncluded. First 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) Second operand 29 states. [2022-02-20 23:39:15,406 INFO L87 Difference]: Start difference. First 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) Second operand 29 states. [2022-02-20 23:39:15,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:39:15,407 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2022-02-20 23:39:15,408 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2022-02-20 23:39:15,408 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:39:15,408 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:39:15,408 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:39:15,408 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:39:15,409 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-02-20 23:39:15,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2022-02-20 23:39:15,409 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 6 [2022-02-20 23:39:15,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:39:15,410 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2022-02-20 23:39:15,410 INFO L471 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-02-20 23:39:15,410 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2022-02-20 23:39:15,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-02-20 23:39:15,410 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:39:15,411 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-02-20 23:39:15,411 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 23:39:15,411 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 6 more)] === [2022-02-20 23:39:15,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:39:15,411 INFO L85 PathProgramCache]: Analyzing trace with hash 889508821, now seen corresponding path program 1 times [2022-02-20 23:39:15,412 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:39:15,412 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366807739] [2022-02-20 23:39:15,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:39:15,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:39:15,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:39:15,474 INFO L290 TraceCheckUtils]: 0: Hoare triple {346#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {346#true} is VALID [2022-02-20 23:39:15,474 INFO L290 TraceCheckUtils]: 1: Hoare triple {346#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret7#1.base, main_#t~ret7#1.offset, main_#t~ret8#1, main_~p~1#1.base, main_~p~1#1.offset, main_~res~0#1;assume { :begin_inline_build_nondet_String } true;havoc build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;havoc build_nondet_String_#t~nondet2#1, build_nondet_String_#t~malloc3#1.base, build_nondet_String_#t~malloc3#1.offset, build_nondet_String_#t~nondet5#1, build_nondet_String_#t~post4#1, build_nondet_String_~i~0#1, build_nondet_String_~length~0#1, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset;assume -2147483648 <= build_nondet_String_#t~nondet2#1 && build_nondet_String_#t~nondet2#1 <= 2147483647;build_nondet_String_~length~0#1 := build_nondet_String_#t~nondet2#1;havoc build_nondet_String_#t~nondet2#1; {346#true} is VALID [2022-02-20 23:39:15,474 INFO L290 TraceCheckUtils]: 2: Hoare triple {346#true} assume build_nondet_String_~length~0#1 < 1;build_nondet_String_~length~0#1 := 1; {348#(<= 1 |ULTIMATE.start_build_nondet_String_~length~0#1|)} is VALID [2022-02-20 23:39:15,475 INFO L290 TraceCheckUtils]: 3: Hoare triple {348#(<= 1 |ULTIMATE.start_build_nondet_String_~length~0#1|)} call build_nondet_String_#t~malloc3#1.base, build_nondet_String_#t~malloc3#1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length~0#1);build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset := build_nondet_String_#t~malloc3#1.base, build_nondet_String_#t~malloc3#1.offset;havoc build_nondet_String_#t~malloc3#1.base, build_nondet_String_#t~malloc3#1.offset;build_nondet_String_~i~0#1 := 0; {349#(and (<= |ULTIMATE.start_build_nondet_String_~length~0#1| (select |#length| |ULTIMATE.start_build_nondet_String_~nondetString~0#1.base|)) (= |ULTIMATE.start_build_nondet_String_~nondetString~0#1.offset| 0) (<= 1 |ULTIMATE.start_build_nondet_String_~length~0#1|))} is VALID [2022-02-20 23:39:15,476 INFO L290 TraceCheckUtils]: 4: Hoare triple {349#(and (<= |ULTIMATE.start_build_nondet_String_~length~0#1| (select |#length| |ULTIMATE.start_build_nondet_String_~nondetString~0#1.base|)) (= |ULTIMATE.start_build_nondet_String_~nondetString~0#1.offset| 0) (<= 1 |ULTIMATE.start_build_nondet_String_~length~0#1|))} assume !(build_nondet_String_~i~0#1 < build_nondet_String_~length~0#1 - 1); {349#(and (<= |ULTIMATE.start_build_nondet_String_~length~0#1| (select |#length| |ULTIMATE.start_build_nondet_String_~nondetString~0#1.base|)) (= |ULTIMATE.start_build_nondet_String_~nondetString~0#1.offset| 0) (<= 1 |ULTIMATE.start_build_nondet_String_~length~0#1|))} is VALID [2022-02-20 23:39:15,476 INFO L290 TraceCheckUtils]: 5: Hoare triple {349#(and (<= |ULTIMATE.start_build_nondet_String_~length~0#1| (select |#length| |ULTIMATE.start_build_nondet_String_~nondetString~0#1.base|)) (= |ULTIMATE.start_build_nondet_String_~nondetString~0#1.offset| 0) (<= 1 |ULTIMATE.start_build_nondet_String_~length~0#1|))} assume !(1 + (build_nondet_String_~nondetString~0#1.offset + (build_nondet_String_~length~0#1 - 1)) <= #length[build_nondet_String_~nondetString~0#1.base] && 0 <= build_nondet_String_~nondetString~0#1.offset + (build_nondet_String_~length~0#1 - 1)); {347#false} is VALID [2022-02-20 23:39:15,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:39:15,477 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:39:15,477 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366807739] [2022-02-20 23:39:15,477 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366807739] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:39:15,477 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:39:15,478 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:39:15,478 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523377843] [2022-02-20 23:39:15,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:39:15,478 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-02-20 23:39:15,478 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:39:15,479 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 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-02-20 23:39:15,483 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:39:15,483 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:39:15,484 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:39:15,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:39:15,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:39:15,484 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-02-20 23:39:15,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:39:15,532 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2022-02-20 23:39:15,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 23:39:15,532 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-02-20 23:39:15,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:39:15,532 INFO L82 GeneralOperation]: Start removeUnreachable. 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-02-20 23:39:15,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 29 transitions. [2022-02-20 23:39:15,533 INFO L82 GeneralOperation]: Start removeUnreachable. 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-02-20 23:39:15,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 29 transitions. [2022-02-20 23:39:15,534 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 29 transitions. [2022-02-20 23:39:15,558 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:39:15,558 INFO L225 Difference]: With dead ends: 28 [2022-02-20 23:39:15,559 INFO L226 Difference]: Without dead ends: 28 [2022-02-20 23:39:15,559 INFO L932 BasicCegarLoop]: 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-02-20 23:39:15,560 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 24 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 21 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-02-20 23:39:15,560 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 21 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:39:15,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-02-20 23:39:15,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-02-20 23:39:15,562 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:39:15,562 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second 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-02-20 23:39:15,563 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second 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-02-20 23:39:15,563 INFO L87 Difference]: Start difference. First operand 28 states. Second 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-02-20 23:39:15,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:39:15,564 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2022-02-20 23:39:15,564 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2022-02-20 23:39:15,565 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:39:15,565 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:39:15,565 INFO L74 IsIncluded]: Start isIncluded. First 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) Second operand 28 states. [2022-02-20 23:39:15,565 INFO L87 Difference]: Start difference. First 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) Second operand 28 states. [2022-02-20 23:39:15,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:39:15,566 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2022-02-20 23:39:15,566 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2022-02-20 23:39:15,567 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:39:15,567 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:39:15,567 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:39:15,567 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:39:15,567 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-02-20 23:39:15,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2022-02-20 23:39:15,568 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 6 [2022-02-20 23:39:15,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:39:15,568 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2022-02-20 23:39:15,569 INFO L471 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-02-20 23:39:15,569 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2022-02-20 23:39:15,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-02-20 23:39:15,569 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:39:15,569 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-02-20 23:39:15,570 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 23:39:15,570 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 6 more)] === [2022-02-20 23:39:15,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:39:15,570 INFO L85 PathProgramCache]: Analyzing trace with hash 889568456, now seen corresponding path program 1 times [2022-02-20 23:39:15,570 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:39:15,571 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198755379] [2022-02-20 23:39:15,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:39:15,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:39:15,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:39:15,671 INFO L290 TraceCheckUtils]: 0: Hoare triple {464#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {464#true} is VALID [2022-02-20 23:39:15,672 INFO L290 TraceCheckUtils]: 1: Hoare triple {464#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret7#1.base, main_#t~ret7#1.offset, main_#t~ret8#1, main_~p~1#1.base, main_~p~1#1.offset, main_~res~0#1;assume { :begin_inline_build_nondet_String } true;havoc build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;havoc build_nondet_String_#t~nondet2#1, build_nondet_String_#t~malloc3#1.base, build_nondet_String_#t~malloc3#1.offset, build_nondet_String_#t~nondet5#1, build_nondet_String_#t~post4#1, build_nondet_String_~i~0#1, build_nondet_String_~length~0#1, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset;assume -2147483648 <= build_nondet_String_#t~nondet2#1 && build_nondet_String_#t~nondet2#1 <= 2147483647;build_nondet_String_~length~0#1 := build_nondet_String_#t~nondet2#1;havoc build_nondet_String_#t~nondet2#1; {464#true} is VALID [2022-02-20 23:39:15,672 INFO L290 TraceCheckUtils]: 2: Hoare triple {464#true} assume !(build_nondet_String_~length~0#1 < 1); {466#(<= 1 |ULTIMATE.start_build_nondet_String_~length~0#1|)} is VALID [2022-02-20 23:39:15,673 INFO L290 TraceCheckUtils]: 3: Hoare triple {466#(<= 1 |ULTIMATE.start_build_nondet_String_~length~0#1|)} call build_nondet_String_#t~malloc3#1.base, build_nondet_String_#t~malloc3#1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length~0#1);build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset := build_nondet_String_#t~malloc3#1.base, build_nondet_String_#t~malloc3#1.offset;havoc build_nondet_String_#t~malloc3#1.base, build_nondet_String_#t~malloc3#1.offset;build_nondet_String_~i~0#1 := 0; {467#(and (= |ULTIMATE.start_build_nondet_String_~i~0#1| 0) (= |ULTIMATE.start_build_nondet_String_~nondetString~0#1.offset| 0) (= (+ |ULTIMATE.start_build_nondet_String_~length~0#1| (* (- 1) (select |#length| |ULTIMATE.start_build_nondet_String_~nondetString~0#1.base|))) 0) (<= 1 |ULTIMATE.start_build_nondet_String_~length~0#1|))} is VALID [2022-02-20 23:39:15,674 INFO L290 TraceCheckUtils]: 4: Hoare triple {467#(and (= |ULTIMATE.start_build_nondet_String_~i~0#1| 0) (= |ULTIMATE.start_build_nondet_String_~nondetString~0#1.offset| 0) (= (+ |ULTIMATE.start_build_nondet_String_~length~0#1| (* (- 1) (select |#length| |ULTIMATE.start_build_nondet_String_~nondetString~0#1.base|))) 0) (<= 1 |ULTIMATE.start_build_nondet_String_~length~0#1|))} assume !!(build_nondet_String_~i~0#1 < build_nondet_String_~length~0#1 - 1);assume -128 <= build_nondet_String_#t~nondet5#1 && build_nondet_String_#t~nondet5#1 <= 127; {468#(and (= |ULTIMATE.start_build_nondet_String_~i~0#1| 0) (= |ULTIMATE.start_build_nondet_String_~nondetString~0#1.offset| 0) (<= 1 (select |#length| |ULTIMATE.start_build_nondet_String_~nondetString~0#1.base|)))} is VALID [2022-02-20 23:39:15,675 INFO L290 TraceCheckUtils]: 5: Hoare triple {468#(and (= |ULTIMATE.start_build_nondet_String_~i~0#1| 0) (= |ULTIMATE.start_build_nondet_String_~nondetString~0#1.offset| 0) (<= 1 (select |#length| |ULTIMATE.start_build_nondet_String_~nondetString~0#1.base|)))} assume !(1 + (build_nondet_String_~nondetString~0#1.offset + build_nondet_String_~i~0#1) <= #length[build_nondet_String_~nondetString~0#1.base] && 0 <= build_nondet_String_~nondetString~0#1.offset + build_nondet_String_~i~0#1); {465#false} is VALID [2022-02-20 23:39:15,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:39:15,691 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:39:15,691 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198755379] [2022-02-20 23:39:15,691 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198755379] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:39:15,692 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:39:15,692 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:39:15,692 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436775786] [2022-02-20 23:39:15,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:39:15,692 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-02-20 23:39:15,693 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:39:15,693 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 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-02-20 23:39:15,698 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:39:15,698 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:39:15,698 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:39:15,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:39:15,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:39:15,699 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-02-20 23:39:15,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:39:15,798 INFO L93 Difference]: Finished difference Result 49 states and 52 transitions. [2022-02-20 23:39:15,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 23:39:15,798 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-02-20 23:39:15,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:39:15,798 INFO L82 GeneralOperation]: Start removeUnreachable. 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-02-20 23:39:15,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 51 transitions. [2022-02-20 23:39:15,800 INFO L82 GeneralOperation]: Start removeUnreachable. 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-02-20 23:39:15,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 51 transitions. [2022-02-20 23:39:15,801 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 51 transitions. [2022-02-20 23:39:15,859 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:39:15,860 INFO L225 Difference]: With dead ends: 49 [2022-02-20 23:39:15,860 INFO L226 Difference]: Without dead ends: 49 [2022-02-20 23:39:15,860 INFO L932 BasicCegarLoop]: 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-02-20 23:39:15,861 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 66 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:39:15,862 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [66 Valid, 51 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:39:15,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-02-20 23:39:15,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 30. [2022-02-20 23:39:15,864 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:39:15,864 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second 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-02-20 23:39:15,865 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second 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-02-20 23:39:15,865 INFO L87 Difference]: Start difference. First operand 49 states. Second 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-02-20 23:39:15,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:39:15,866 INFO L93 Difference]: Finished difference Result 49 states and 52 transitions. [2022-02-20 23:39:15,867 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2022-02-20 23:39:15,867 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:39:15,867 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:39:15,867 INFO L74 IsIncluded]: Start isIncluded. First 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) Second operand 49 states. [2022-02-20 23:39:15,868 INFO L87 Difference]: Start difference. First 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) Second operand 49 states. [2022-02-20 23:39:15,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:39:15,869 INFO L93 Difference]: Finished difference Result 49 states and 52 transitions. [2022-02-20 23:39:15,869 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2022-02-20 23:39:15,870 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:39:15,870 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:39:15,870 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:39:15,870 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:39:15,871 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-02-20 23:39:15,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2022-02-20 23:39:15,872 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 6 [2022-02-20 23:39:15,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:39:15,872 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2022-02-20 23:39:15,872 INFO L471 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-02-20 23:39:15,872 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2022-02-20 23:39:15,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-02-20 23:39:15,873 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:39:15,873 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:39:15,873 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 23:39:15,873 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 6 more)] === [2022-02-20 23:39:15,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:39:15,874 INFO L85 PathProgramCache]: Analyzing trace with hash -590959631, now seen corresponding path program 1 times [2022-02-20 23:39:15,874 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:39:15,874 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445746660] [2022-02-20 23:39:15,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:39:15,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:39:15,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:39:15,982 INFO L290 TraceCheckUtils]: 0: Hoare triple {648#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {648#true} is VALID [2022-02-20 23:39:15,982 INFO L290 TraceCheckUtils]: 1: Hoare triple {648#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret7#1.base, main_#t~ret7#1.offset, main_#t~ret8#1, main_~p~1#1.base, main_~p~1#1.offset, main_~res~0#1;assume { :begin_inline_build_nondet_String } true;havoc build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;havoc build_nondet_String_#t~nondet2#1, build_nondet_String_#t~malloc3#1.base, build_nondet_String_#t~malloc3#1.offset, build_nondet_String_#t~nondet5#1, build_nondet_String_#t~post4#1, build_nondet_String_~i~0#1, build_nondet_String_~length~0#1, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset;assume -2147483648 <= build_nondet_String_#t~nondet2#1 && build_nondet_String_#t~nondet2#1 <= 2147483647;build_nondet_String_~length~0#1 := build_nondet_String_#t~nondet2#1;havoc build_nondet_String_#t~nondet2#1; {648#true} is VALID [2022-02-20 23:39:15,983 INFO L290 TraceCheckUtils]: 2: Hoare triple {648#true} assume build_nondet_String_~length~0#1 < 1;build_nondet_String_~length~0#1 := 1; {648#true} is VALID [2022-02-20 23:39:15,983 INFO L290 TraceCheckUtils]: 3: Hoare triple {648#true} call build_nondet_String_#t~malloc3#1.base, build_nondet_String_#t~malloc3#1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length~0#1);build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset := build_nondet_String_#t~malloc3#1.base, build_nondet_String_#t~malloc3#1.offset;havoc build_nondet_String_#t~malloc3#1.base, build_nondet_String_#t~malloc3#1.offset;build_nondet_String_~i~0#1 := 0; {648#true} is VALID [2022-02-20 23:39:15,983 INFO L290 TraceCheckUtils]: 4: Hoare triple {648#true} assume !(build_nondet_String_~i~0#1 < build_nondet_String_~length~0#1 - 1); {648#true} is VALID [2022-02-20 23:39:15,984 INFO L290 TraceCheckUtils]: 5: Hoare triple {648#true} SUMMARY for call write~int(0, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset + (build_nondet_String_~length~0#1 - 1), 1); srcloc: L521-4 {650#(= (select |#valid| |ULTIMATE.start_build_nondet_String_~nondetString~0#1.base|) 1)} is VALID [2022-02-20 23:39:15,985 INFO L290 TraceCheckUtils]: 6: Hoare triple {650#(= (select |#valid| |ULTIMATE.start_build_nondet_String_~nondetString~0#1.base|) 1)} build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset := build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset; {651#(= (select |#valid| |ULTIMATE.start_build_nondet_String_#res#1.base|) 1)} is VALID [2022-02-20 23:39:15,985 INFO L290 TraceCheckUtils]: 7: Hoare triple {651#(= (select |#valid| |ULTIMATE.start_build_nondet_String_#res#1.base|) 1)} main_#t~ret7#1.base, main_#t~ret7#1.offset := build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;assume { :end_inline_build_nondet_String } true;main_~p~1#1.base, main_~p~1#1.offset := main_#t~ret7#1.base, main_#t~ret7#1.offset;havoc main_#t~ret7#1.base, main_#t~ret7#1.offset;assume { :begin_inline_cstrlen } true;cstrlen_#in~s#1.base, cstrlen_#in~s#1.offset := main_~p~1#1.base, main_~p~1#1.offset;havoc cstrlen_#res#1;havoc cstrlen_#t~mem6#1, cstrlen_~s#1.base, cstrlen_~s#1.offset, cstrlen_~p~0#1.base, cstrlen_~p~0#1.offset;cstrlen_~s#1.base, cstrlen_~s#1.offset := cstrlen_#in~s#1.base, cstrlen_#in~s#1.offset;cstrlen_~p~0#1.base, cstrlen_~p~0#1.offset := cstrlen_~s#1.base, cstrlen_~s#1.offset; {652#(= (select |#valid| |ULTIMATE.start_cstrlen_~p~0#1.base|) 1)} is VALID [2022-02-20 23:39:15,986 INFO L290 TraceCheckUtils]: 8: Hoare triple {652#(= (select |#valid| |ULTIMATE.start_cstrlen_~p~0#1.base|) 1)} assume !(1 == #valid[cstrlen_~p~0#1.base]); {649#false} is VALID [2022-02-20 23:39:15,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:39:15,986 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:39:15,987 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445746660] [2022-02-20 23:39:15,987 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445746660] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:39:15,987 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:39:15,987 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:39:15,987 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442156564] [2022-02-20 23:39:15,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:39:15,988 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-02-20 23:39:15,988 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:39:15,988 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 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-02-20 23:39:15,996 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:39:15,996 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:39:15,997 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:39:15,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:39:15,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:39:15,998 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-02-20 23:39:16,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:39:16,106 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2022-02-20 23:39:16,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 23:39:16,106 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-02-20 23:39:16,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:39:16,107 INFO L82 GeneralOperation]: Start removeUnreachable. 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-02-20 23:39:16,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 28 transitions. [2022-02-20 23:39:16,107 INFO L82 GeneralOperation]: Start removeUnreachable. 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-02-20 23:39:16,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 28 transitions. [2022-02-20 23:39:16,108 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 28 transitions. [2022-02-20 23:39:16,137 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:39:16,137 INFO L225 Difference]: With dead ends: 29 [2022-02-20 23:39:16,137 INFO L226 Difference]: Without dead ends: 29 [2022-02-20 23:39:16,138 INFO L932 BasicCegarLoop]: 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-02-20 23:39:16,138 INFO L933 BasicCegarLoop]: 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-02-20 23:39:16,139 INFO L934 BasicCegarLoop]: 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-02-20 23:39:16,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-02-20 23:39:16,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-02-20 23:39:16,140 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:39:16,140 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second 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-02-20 23:39:16,141 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second 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-02-20 23:39:16,141 INFO L87 Difference]: Start difference. First operand 29 states. Second 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-02-20 23:39:16,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:39:16,142 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2022-02-20 23:39:16,142 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2022-02-20 23:39:16,142 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:39:16,142 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:39:16,143 INFO L74 IsIncluded]: Start isIncluded. First 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) Second operand 29 states. [2022-02-20 23:39:16,143 INFO L87 Difference]: Start difference. First 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) Second operand 29 states. [2022-02-20 23:39:16,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:39:16,144 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2022-02-20 23:39:16,144 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2022-02-20 23:39:16,144 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:39:16,144 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:39:16,144 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:39:16,144 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:39:16,145 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-02-20 23:39:16,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2022-02-20 23:39:16,145 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 9 [2022-02-20 23:39:16,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:39:16,146 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2022-02-20 23:39:16,146 INFO L471 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-02-20 23:39:16,146 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2022-02-20 23:39:16,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-02-20 23:39:16,146 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:39:16,146 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:39:16,147 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 23:39:16,147 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 6 more)] === [2022-02-20 23:39:16,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:39:16,147 INFO L85 PathProgramCache]: Analyzing trace with hash -590959630, now seen corresponding path program 1 times [2022-02-20 23:39:16,147 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:39:16,147 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709182709] [2022-02-20 23:39:16,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:39:16,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:39:16,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:39:16,207 INFO L290 TraceCheckUtils]: 0: Hoare triple {775#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {775#true} is VALID [2022-02-20 23:39:16,208 INFO L290 TraceCheckUtils]: 1: Hoare triple {775#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret7#1.base, main_#t~ret7#1.offset, main_#t~ret8#1, main_~p~1#1.base, main_~p~1#1.offset, main_~res~0#1;assume { :begin_inline_build_nondet_String } true;havoc build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;havoc build_nondet_String_#t~nondet2#1, build_nondet_String_#t~malloc3#1.base, build_nondet_String_#t~malloc3#1.offset, build_nondet_String_#t~nondet5#1, build_nondet_String_#t~post4#1, build_nondet_String_~i~0#1, build_nondet_String_~length~0#1, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset;assume -2147483648 <= build_nondet_String_#t~nondet2#1 && build_nondet_String_#t~nondet2#1 <= 2147483647;build_nondet_String_~length~0#1 := build_nondet_String_#t~nondet2#1;havoc build_nondet_String_#t~nondet2#1; {775#true} is VALID [2022-02-20 23:39:16,208 INFO L290 TraceCheckUtils]: 2: Hoare triple {775#true} assume build_nondet_String_~length~0#1 < 1;build_nondet_String_~length~0#1 := 1; {777#(<= 1 |ULTIMATE.start_build_nondet_String_~length~0#1|)} is VALID [2022-02-20 23:39:16,209 INFO L290 TraceCheckUtils]: 3: Hoare triple {777#(<= 1 |ULTIMATE.start_build_nondet_String_~length~0#1|)} call build_nondet_String_#t~malloc3#1.base, build_nondet_String_#t~malloc3#1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length~0#1);build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset := build_nondet_String_#t~malloc3#1.base, build_nondet_String_#t~malloc3#1.offset;havoc build_nondet_String_#t~malloc3#1.base, build_nondet_String_#t~malloc3#1.offset;build_nondet_String_~i~0#1 := 0; {778#(and (= |ULTIMATE.start_build_nondet_String_~nondetString~0#1.offset| 0) (<= 1 (select |#length| |ULTIMATE.start_build_nondet_String_~nondetString~0#1.base|)))} is VALID [2022-02-20 23:39:16,210 INFO L290 TraceCheckUtils]: 4: Hoare triple {778#(and (= |ULTIMATE.start_build_nondet_String_~nondetString~0#1.offset| 0) (<= 1 (select |#length| |ULTIMATE.start_build_nondet_String_~nondetString~0#1.base|)))} assume !(build_nondet_String_~i~0#1 < build_nondet_String_~length~0#1 - 1); {778#(and (= |ULTIMATE.start_build_nondet_String_~nondetString~0#1.offset| 0) (<= 1 (select |#length| |ULTIMATE.start_build_nondet_String_~nondetString~0#1.base|)))} is VALID [2022-02-20 23:39:16,210 INFO L290 TraceCheckUtils]: 5: Hoare triple {778#(and (= |ULTIMATE.start_build_nondet_String_~nondetString~0#1.offset| 0) (<= 1 (select |#length| |ULTIMATE.start_build_nondet_String_~nondetString~0#1.base|)))} SUMMARY for call write~int(0, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset + (build_nondet_String_~length~0#1 - 1), 1); srcloc: L521-4 {778#(and (= |ULTIMATE.start_build_nondet_String_~nondetString~0#1.offset| 0) (<= 1 (select |#length| |ULTIMATE.start_build_nondet_String_~nondetString~0#1.base|)))} is VALID [2022-02-20 23:39:16,211 INFO L290 TraceCheckUtils]: 6: Hoare triple {778#(and (= |ULTIMATE.start_build_nondet_String_~nondetString~0#1.offset| 0) (<= 1 (select |#length| |ULTIMATE.start_build_nondet_String_~nondetString~0#1.base|)))} build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset := build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset; {779#(and (<= 1 (select |#length| |ULTIMATE.start_build_nondet_String_#res#1.base|)) (= |ULTIMATE.start_build_nondet_String_#res#1.offset| 0))} is VALID [2022-02-20 23:39:16,212 INFO L290 TraceCheckUtils]: 7: Hoare triple {779#(and (<= 1 (select |#length| |ULTIMATE.start_build_nondet_String_#res#1.base|)) (= |ULTIMATE.start_build_nondet_String_#res#1.offset| 0))} main_#t~ret7#1.base, main_#t~ret7#1.offset := build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;assume { :end_inline_build_nondet_String } true;main_~p~1#1.base, main_~p~1#1.offset := main_#t~ret7#1.base, main_#t~ret7#1.offset;havoc main_#t~ret7#1.base, main_#t~ret7#1.offset;assume { :begin_inline_cstrlen } true;cstrlen_#in~s#1.base, cstrlen_#in~s#1.offset := main_~p~1#1.base, main_~p~1#1.offset;havoc cstrlen_#res#1;havoc cstrlen_#t~mem6#1, cstrlen_~s#1.base, cstrlen_~s#1.offset, cstrlen_~p~0#1.base, cstrlen_~p~0#1.offset;cstrlen_~s#1.base, cstrlen_~s#1.offset := cstrlen_#in~s#1.base, cstrlen_#in~s#1.offset;cstrlen_~p~0#1.base, cstrlen_~p~0#1.offset := cstrlen_~s#1.base, cstrlen_~s#1.offset; {780#(and (= |ULTIMATE.start_cstrlen_~p~0#1.offset| 0) (<= 1 (select |#length| |ULTIMATE.start_cstrlen_~p~0#1.base|)))} is VALID [2022-02-20 23:39:16,212 INFO L290 TraceCheckUtils]: 8: Hoare triple {780#(and (= |ULTIMATE.start_cstrlen_~p~0#1.offset| 0) (<= 1 (select |#length| |ULTIMATE.start_cstrlen_~p~0#1.base|)))} assume !(1 + cstrlen_~p~0#1.offset <= #length[cstrlen_~p~0#1.base] && 0 <= cstrlen_~p~0#1.offset); {776#false} is VALID [2022-02-20 23:39:16,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:39:16,212 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:39:16,213 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709182709] [2022-02-20 23:39:16,213 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709182709] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:39:16,213 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:39:16,213 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 23:39:16,213 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31087301] [2022-02-20 23:39:16,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:39:16,214 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-02-20 23:39:16,214 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:39:16,214 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 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-02-20 23:39:16,222 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:39:16,222 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 23:39:16,222 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:39:16,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 23:39:16,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:39:16,224 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-02-20 23:39:16,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:39:16,382 INFO L93 Difference]: Finished difference Result 41 states and 44 transitions. [2022-02-20 23:39:16,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 23:39:16,383 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-02-20 23:39:16,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:39:16,383 INFO L82 GeneralOperation]: Start removeUnreachable. 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-02-20 23:39:16,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 40 transitions. [2022-02-20 23:39:16,384 INFO L82 GeneralOperation]: Start removeUnreachable. 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-02-20 23:39:16,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 40 transitions. [2022-02-20 23:39:16,384 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 40 transitions. [2022-02-20 23:39:16,442 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:39:16,443 INFO L225 Difference]: With dead ends: 41 [2022-02-20 23:39:16,443 INFO L226 Difference]: Without dead ends: 41 [2022-02-20 23:39:16,443 INFO L932 BasicCegarLoop]: 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-02-20 23:39:16,444 INFO L933 BasicCegarLoop]: 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-02-20 23:39:16,444 INFO L934 BasicCegarLoop]: 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-02-20 23:39:16,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-02-20 23:39:16,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 30. [2022-02-20 23:39:16,446 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:39:16,446 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second 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-02-20 23:39:16,446 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second 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-02-20 23:39:16,446 INFO L87 Difference]: Start difference. First operand 41 states. Second 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-02-20 23:39:16,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:39:16,447 INFO L93 Difference]: Finished difference Result 41 states and 44 transitions. [2022-02-20 23:39:16,447 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2022-02-20 23:39:16,448 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:39:16,448 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:39:16,448 INFO L74 IsIncluded]: Start isIncluded. First 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) Second operand 41 states. [2022-02-20 23:39:16,448 INFO L87 Difference]: Start difference. First 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) Second operand 41 states. [2022-02-20 23:39:16,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:39:16,449 INFO L93 Difference]: Finished difference Result 41 states and 44 transitions. [2022-02-20 23:39:16,449 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2022-02-20 23:39:16,449 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:39:16,449 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:39:16,450 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:39:16,450 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:39:16,461 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-02-20 23:39:16,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2022-02-20 23:39:16,462 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 9 [2022-02-20 23:39:16,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:39:16,462 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2022-02-20 23:39:16,462 INFO L471 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-02-20 23:39:16,462 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2022-02-20 23:39:16,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-02-20 23:39:16,462 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:39:16,462 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:39:16,463 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 23:39:16,463 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 6 more)] === [2022-02-20 23:39:16,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:39:16,463 INFO L85 PathProgramCache]: Analyzing trace with hash -1900556789, now seen corresponding path program 1 times [2022-02-20 23:39:16,463 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:39:16,463 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481882996] [2022-02-20 23:39:16,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:39:16,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:39:16,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:39:16,549 INFO L290 TraceCheckUtils]: 0: Hoare triple {942#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {942#true} is VALID [2022-02-20 23:39:16,550 INFO L290 TraceCheckUtils]: 1: Hoare triple {942#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret7#1.base, main_#t~ret7#1.offset, main_#t~ret8#1, main_~p~1#1.base, main_~p~1#1.offset, main_~res~0#1;assume { :begin_inline_build_nondet_String } true;havoc build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;havoc build_nondet_String_#t~nondet2#1, build_nondet_String_#t~malloc3#1.base, build_nondet_String_#t~malloc3#1.offset, build_nondet_String_#t~nondet5#1, build_nondet_String_#t~post4#1, build_nondet_String_~i~0#1, build_nondet_String_~length~0#1, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset;assume -2147483648 <= build_nondet_String_#t~nondet2#1 && build_nondet_String_#t~nondet2#1 <= 2147483647;build_nondet_String_~length~0#1 := build_nondet_String_#t~nondet2#1;havoc build_nondet_String_#t~nondet2#1; {942#true} is VALID [2022-02-20 23:39:16,550 INFO L290 TraceCheckUtils]: 2: Hoare triple {942#true} assume !(build_nondet_String_~length~0#1 < 1); {942#true} is VALID [2022-02-20 23:39:16,550 INFO L290 TraceCheckUtils]: 3: Hoare triple {942#true} call build_nondet_String_#t~malloc3#1.base, build_nondet_String_#t~malloc3#1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length~0#1);build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset := build_nondet_String_#t~malloc3#1.base, build_nondet_String_#t~malloc3#1.offset;havoc build_nondet_String_#t~malloc3#1.base, build_nondet_String_#t~malloc3#1.offset;build_nondet_String_~i~0#1 := 0; {944#(and (= |ULTIMATE.start_build_nondet_String_~i~0#1| 0) (= |ULTIMATE.start_build_nondet_String_~nondetString~0#1.offset| 0) (= (+ |ULTIMATE.start_build_nondet_String_~length~0#1| (* (- 1) (select |#length| |ULTIMATE.start_build_nondet_String_~nondetString~0#1.base|))) 0))} is VALID [2022-02-20 23:39:16,551 INFO L290 TraceCheckUtils]: 4: Hoare triple {944#(and (= |ULTIMATE.start_build_nondet_String_~i~0#1| 0) (= |ULTIMATE.start_build_nondet_String_~nondetString~0#1.offset| 0) (= (+ |ULTIMATE.start_build_nondet_String_~length~0#1| (* (- 1) (select |#length| |ULTIMATE.start_build_nondet_String_~nondetString~0#1.base|))) 0))} assume !!(build_nondet_String_~i~0#1 < build_nondet_String_~length~0#1 - 1);assume -128 <= build_nondet_String_#t~nondet5#1 && build_nondet_String_#t~nondet5#1 <= 127; {944#(and (= |ULTIMATE.start_build_nondet_String_~i~0#1| 0) (= |ULTIMATE.start_build_nondet_String_~nondetString~0#1.offset| 0) (= (+ |ULTIMATE.start_build_nondet_String_~length~0#1| (* (- 1) (select |#length| |ULTIMATE.start_build_nondet_String_~nondetString~0#1.base|))) 0))} is VALID [2022-02-20 23:39:16,552 INFO L290 TraceCheckUtils]: 5: Hoare triple {944#(and (= |ULTIMATE.start_build_nondet_String_~i~0#1| 0) (= |ULTIMATE.start_build_nondet_String_~nondetString~0#1.offset| 0) (= (+ |ULTIMATE.start_build_nondet_String_~length~0#1| (* (- 1) (select |#length| |ULTIMATE.start_build_nondet_String_~nondetString~0#1.base|))) 0))} SUMMARY for call write~int(build_nondet_String_#t~nondet5#1, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset + build_nondet_String_~i~0#1, 1); srcloc: L523 {944#(and (= |ULTIMATE.start_build_nondet_String_~i~0#1| 0) (= |ULTIMATE.start_build_nondet_String_~nondetString~0#1.offset| 0) (= (+ |ULTIMATE.start_build_nondet_String_~length~0#1| (* (- 1) (select |#length| |ULTIMATE.start_build_nondet_String_~nondetString~0#1.base|))) 0))} is VALID [2022-02-20 23:39:16,552 INFO L290 TraceCheckUtils]: 6: Hoare triple {944#(and (= |ULTIMATE.start_build_nondet_String_~i~0#1| 0) (= |ULTIMATE.start_build_nondet_String_~nondetString~0#1.offset| 0) (= (+ |ULTIMATE.start_build_nondet_String_~length~0#1| (* (- 1) (select |#length| |ULTIMATE.start_build_nondet_String_~nondetString~0#1.base|))) 0))} havoc build_nondet_String_#t~nondet5#1; {944#(and (= |ULTIMATE.start_build_nondet_String_~i~0#1| 0) (= |ULTIMATE.start_build_nondet_String_~nondetString~0#1.offset| 0) (= (+ |ULTIMATE.start_build_nondet_String_~length~0#1| (* (- 1) (select |#length| |ULTIMATE.start_build_nondet_String_~nondetString~0#1.base|))) 0))} is VALID [2022-02-20 23:39:16,553 INFO L290 TraceCheckUtils]: 7: Hoare triple {944#(and (= |ULTIMATE.start_build_nondet_String_~i~0#1| 0) (= |ULTIMATE.start_build_nondet_String_~nondetString~0#1.offset| 0) (= (+ |ULTIMATE.start_build_nondet_String_~length~0#1| (* (- 1) (select |#length| |ULTIMATE.start_build_nondet_String_~nondetString~0#1.base|))) 0))} build_nondet_String_#t~post4#1 := build_nondet_String_~i~0#1;build_nondet_String_~i~0#1 := 1 + build_nondet_String_#t~post4#1;havoc build_nondet_String_#t~post4#1; {945#(and (<= 1 |ULTIMATE.start_build_nondet_String_~i~0#1|) (= |ULTIMATE.start_build_nondet_String_~nondetString~0#1.offset| 0) (= (+ |ULTIMATE.start_build_nondet_String_~length~0#1| (* (- 1) (select |#length| |ULTIMATE.start_build_nondet_String_~nondetString~0#1.base|))) 0))} is VALID [2022-02-20 23:39:16,553 INFO L290 TraceCheckUtils]: 8: Hoare triple {945#(and (<= 1 |ULTIMATE.start_build_nondet_String_~i~0#1|) (= |ULTIMATE.start_build_nondet_String_~nondetString~0#1.offset| 0) (= (+ |ULTIMATE.start_build_nondet_String_~length~0#1| (* (- 1) (select |#length| |ULTIMATE.start_build_nondet_String_~nondetString~0#1.base|))) 0))} assume !!(build_nondet_String_~i~0#1 < build_nondet_String_~length~0#1 - 1);assume -128 <= build_nondet_String_#t~nondet5#1 && build_nondet_String_#t~nondet5#1 <= 127; {946#(and (<= 1 |ULTIMATE.start_build_nondet_String_~i~0#1|) (= |ULTIMATE.start_build_nondet_String_~nondetString~0#1.offset| 0) (<= (+ |ULTIMATE.start_build_nondet_String_~i~0#1| 2) (select |#length| |ULTIMATE.start_build_nondet_String_~nondetString~0#1.base|)))} is VALID [2022-02-20 23:39:16,554 INFO L290 TraceCheckUtils]: 9: Hoare triple {946#(and (<= 1 |ULTIMATE.start_build_nondet_String_~i~0#1|) (= |ULTIMATE.start_build_nondet_String_~nondetString~0#1.offset| 0) (<= (+ |ULTIMATE.start_build_nondet_String_~i~0#1| 2) (select |#length| |ULTIMATE.start_build_nondet_String_~nondetString~0#1.base|)))} assume !(1 + (build_nondet_String_~nondetString~0#1.offset + build_nondet_String_~i~0#1) <= #length[build_nondet_String_~nondetString~0#1.base] && 0 <= build_nondet_String_~nondetString~0#1.offset + build_nondet_String_~i~0#1); {943#false} is VALID [2022-02-20 23:39:16,554 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:39:16,554 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:39:16,555 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481882996] [2022-02-20 23:39:16,555 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481882996] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:39:16,555 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [457174481] [2022-02-20 23:39:16,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:39:16,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:39:16,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:39:16,578 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-02-20 23:39:16,579 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-02-20 23:39:16,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:39:16,627 INFO L263 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-20 23:39:16,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:39:16,640 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:39:16,770 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-02-20 23:39:16,949 INFO L290 TraceCheckUtils]: 0: Hoare triple {942#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {942#true} is VALID [2022-02-20 23:39:16,950 INFO L290 TraceCheckUtils]: 1: Hoare triple {942#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret7#1.base, main_#t~ret7#1.offset, main_#t~ret8#1, main_~p~1#1.base, main_~p~1#1.offset, main_~res~0#1;assume { :begin_inline_build_nondet_String } true;havoc build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;havoc build_nondet_String_#t~nondet2#1, build_nondet_String_#t~malloc3#1.base, build_nondet_String_#t~malloc3#1.offset, build_nondet_String_#t~nondet5#1, build_nondet_String_#t~post4#1, build_nondet_String_~i~0#1, build_nondet_String_~length~0#1, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset;assume -2147483648 <= build_nondet_String_#t~nondet2#1 && build_nondet_String_#t~nondet2#1 <= 2147483647;build_nondet_String_~length~0#1 := build_nondet_String_#t~nondet2#1;havoc build_nondet_String_#t~nondet2#1; {942#true} is VALID [2022-02-20 23:39:16,950 INFO L290 TraceCheckUtils]: 2: Hoare triple {942#true} assume !(build_nondet_String_~length~0#1 < 1); {942#true} is VALID [2022-02-20 23:39:16,953 INFO L290 TraceCheckUtils]: 3: Hoare triple {942#true} call build_nondet_String_#t~malloc3#1.base, build_nondet_String_#t~malloc3#1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length~0#1);build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset := build_nondet_String_#t~malloc3#1.base, build_nondet_String_#t~malloc3#1.offset;havoc build_nondet_String_#t~malloc3#1.base, build_nondet_String_#t~malloc3#1.offset;build_nondet_String_~i~0#1 := 0; {959#(and (<= 0 |ULTIMATE.start_build_nondet_String_~i~0#1|) (<= |ULTIMATE.start_build_nondet_String_~length~0#1| (select |#length| |ULTIMATE.start_build_nondet_String_~nondetString~0#1.base|)) (= |ULTIMATE.start_build_nondet_String_~nondetString~0#1.offset| 0))} is VALID [2022-02-20 23:39:16,954 INFO L290 TraceCheckUtils]: 4: Hoare triple {959#(and (<= 0 |ULTIMATE.start_build_nondet_String_~i~0#1|) (<= |ULTIMATE.start_build_nondet_String_~length~0#1| (select |#length| |ULTIMATE.start_build_nondet_String_~nondetString~0#1.base|)) (= |ULTIMATE.start_build_nondet_String_~nondetString~0#1.offset| 0))} assume !!(build_nondet_String_~i~0#1 < build_nondet_String_~length~0#1 - 1);assume -128 <= build_nondet_String_#t~nondet5#1 && build_nondet_String_#t~nondet5#1 <= 127; {959#(and (<= 0 |ULTIMATE.start_build_nondet_String_~i~0#1|) (<= |ULTIMATE.start_build_nondet_String_~length~0#1| (select |#length| |ULTIMATE.start_build_nondet_String_~nondetString~0#1.base|)) (= |ULTIMATE.start_build_nondet_String_~nondetString~0#1.offset| 0))} is VALID [2022-02-20 23:39:16,954 INFO L290 TraceCheckUtils]: 5: Hoare triple {959#(and (<= 0 |ULTIMATE.start_build_nondet_String_~i~0#1|) (<= |ULTIMATE.start_build_nondet_String_~length~0#1| (select |#length| |ULTIMATE.start_build_nondet_String_~nondetString~0#1.base|)) (= |ULTIMATE.start_build_nondet_String_~nondetString~0#1.offset| 0))} SUMMARY for call write~int(build_nondet_String_#t~nondet5#1, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset + build_nondet_String_~i~0#1, 1); srcloc: L523 {959#(and (<= 0 |ULTIMATE.start_build_nondet_String_~i~0#1|) (<= |ULTIMATE.start_build_nondet_String_~length~0#1| (select |#length| |ULTIMATE.start_build_nondet_String_~nondetString~0#1.base|)) (= |ULTIMATE.start_build_nondet_String_~nondetString~0#1.offset| 0))} is VALID [2022-02-20 23:39:16,955 INFO L290 TraceCheckUtils]: 6: Hoare triple {959#(and (<= 0 |ULTIMATE.start_build_nondet_String_~i~0#1|) (<= |ULTIMATE.start_build_nondet_String_~length~0#1| (select |#length| |ULTIMATE.start_build_nondet_String_~nondetString~0#1.base|)) (= |ULTIMATE.start_build_nondet_String_~nondetString~0#1.offset| 0))} havoc build_nondet_String_#t~nondet5#1; {959#(and (<= 0 |ULTIMATE.start_build_nondet_String_~i~0#1|) (<= |ULTIMATE.start_build_nondet_String_~length~0#1| (select |#length| |ULTIMATE.start_build_nondet_String_~nondetString~0#1.base|)) (= |ULTIMATE.start_build_nondet_String_~nondetString~0#1.offset| 0))} is VALID [2022-02-20 23:39:16,955 INFO L290 TraceCheckUtils]: 7: Hoare triple {959#(and (<= 0 |ULTIMATE.start_build_nondet_String_~i~0#1|) (<= |ULTIMATE.start_build_nondet_String_~length~0#1| (select |#length| |ULTIMATE.start_build_nondet_String_~nondetString~0#1.base|)) (= |ULTIMATE.start_build_nondet_String_~nondetString~0#1.offset| 0))} build_nondet_String_#t~post4#1 := build_nondet_String_~i~0#1;build_nondet_String_~i~0#1 := 1 + build_nondet_String_#t~post4#1;havoc build_nondet_String_#t~post4#1; {972#(and (<= |ULTIMATE.start_build_nondet_String_~length~0#1| (select |#length| |ULTIMATE.start_build_nondet_String_~nondetString~0#1.base|)) (<= 1 |ULTIMATE.start_build_nondet_String_~i~0#1|) (= |ULTIMATE.start_build_nondet_String_~nondetString~0#1.offset| 0))} is VALID [2022-02-20 23:39:16,956 INFO L290 TraceCheckUtils]: 8: Hoare triple {972#(and (<= |ULTIMATE.start_build_nondet_String_~length~0#1| (select |#length| |ULTIMATE.start_build_nondet_String_~nondetString~0#1.base|)) (<= 1 |ULTIMATE.start_build_nondet_String_~i~0#1|) (= |ULTIMATE.start_build_nondet_String_~nondetString~0#1.offset| 0))} assume !!(build_nondet_String_~i~0#1 < build_nondet_String_~length~0#1 - 1);assume -128 <= build_nondet_String_#t~nondet5#1 && build_nondet_String_#t~nondet5#1 <= 127; {946#(and (<= 1 |ULTIMATE.start_build_nondet_String_~i~0#1|) (= |ULTIMATE.start_build_nondet_String_~nondetString~0#1.offset| 0) (<= (+ |ULTIMATE.start_build_nondet_String_~i~0#1| 2) (select |#length| |ULTIMATE.start_build_nondet_String_~nondetString~0#1.base|)))} is VALID [2022-02-20 23:39:16,957 INFO L290 TraceCheckUtils]: 9: Hoare triple {946#(and (<= 1 |ULTIMATE.start_build_nondet_String_~i~0#1|) (= |ULTIMATE.start_build_nondet_String_~nondetString~0#1.offset| 0) (<= (+ |ULTIMATE.start_build_nondet_String_~i~0#1| 2) (select |#length| |ULTIMATE.start_build_nondet_String_~nondetString~0#1.base|)))} assume !(1 + (build_nondet_String_~nondetString~0#1.offset + build_nondet_String_~i~0#1) <= #length[build_nondet_String_~nondetString~0#1.base] && 0 <= build_nondet_String_~nondetString~0#1.offset + build_nondet_String_~i~0#1); {943#false} is VALID [2022-02-20 23:39:16,957 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:39:16,957 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:39:17,245 INFO L290 TraceCheckUtils]: 9: Hoare triple {979#(and (<= (+ |ULTIMATE.start_build_nondet_String_~nondetString~0#1.offset| |ULTIMATE.start_build_nondet_String_~i~0#1| 1) (select |#length| |ULTIMATE.start_build_nondet_String_~nondetString~0#1.base|)) (<= 0 (+ |ULTIMATE.start_build_nondet_String_~nondetString~0#1.offset| |ULTIMATE.start_build_nondet_String_~i~0#1|)))} assume !(1 + (build_nondet_String_~nondetString~0#1.offset + build_nondet_String_~i~0#1) <= #length[build_nondet_String_~nondetString~0#1.base] && 0 <= build_nondet_String_~nondetString~0#1.offset + build_nondet_String_~i~0#1); {943#false} is VALID [2022-02-20 23:39:17,246 INFO L290 TraceCheckUtils]: 8: Hoare triple {983#(or (and (<= (+ |ULTIMATE.start_build_nondet_String_~nondetString~0#1.offset| |ULTIMATE.start_build_nondet_String_~i~0#1| 1) (select |#length| |ULTIMATE.start_build_nondet_String_~nondetString~0#1.base|)) (<= 0 (+ |ULTIMATE.start_build_nondet_String_~nondetString~0#1.offset| |ULTIMATE.start_build_nondet_String_~i~0#1|))) (not (< (+ |ULTIMATE.start_build_nondet_String_~i~0#1| 1) |ULTIMATE.start_build_nondet_String_~length~0#1|)))} assume !!(build_nondet_String_~i~0#1 < build_nondet_String_~length~0#1 - 1);assume -128 <= build_nondet_String_#t~nondet5#1 && build_nondet_String_#t~nondet5#1 <= 127; {979#(and (<= (+ |ULTIMATE.start_build_nondet_String_~nondetString~0#1.offset| |ULTIMATE.start_build_nondet_String_~i~0#1| 1) (select |#length| |ULTIMATE.start_build_nondet_String_~nondetString~0#1.base|)) (<= 0 (+ |ULTIMATE.start_build_nondet_String_~nondetString~0#1.offset| |ULTIMATE.start_build_nondet_String_~i~0#1|)))} is VALID [2022-02-20 23:39:17,247 INFO L290 TraceCheckUtils]: 7: Hoare triple {987#(and (or (<= |ULTIMATE.start_build_nondet_String_~length~0#1| (+ |ULTIMATE.start_build_nondet_String_~i~0#1| 2)) (<= 0 (+ |ULTIMATE.start_build_nondet_String_~nondetString~0#1.offset| |ULTIMATE.start_build_nondet_String_~i~0#1| 1))) (or (<= |ULTIMATE.start_build_nondet_String_~length~0#1| (+ |ULTIMATE.start_build_nondet_String_~i~0#1| 2)) (<= (+ |ULTIMATE.start_build_nondet_String_~nondetString~0#1.offset| |ULTIMATE.start_build_nondet_String_~length~0#1|) (+ (select |#length| |ULTIMATE.start_build_nondet_String_~nondetString~0#1.base|) 1))))} build_nondet_String_#t~post4#1 := build_nondet_String_~i~0#1;build_nondet_String_~i~0#1 := 1 + build_nondet_String_#t~post4#1;havoc build_nondet_String_#t~post4#1; {983#(or (and (<= (+ |ULTIMATE.start_build_nondet_String_~nondetString~0#1.offset| |ULTIMATE.start_build_nondet_String_~i~0#1| 1) (select |#length| |ULTIMATE.start_build_nondet_String_~nondetString~0#1.base|)) (<= 0 (+ |ULTIMATE.start_build_nondet_String_~nondetString~0#1.offset| |ULTIMATE.start_build_nondet_String_~i~0#1|))) (not (< (+ |ULTIMATE.start_build_nondet_String_~i~0#1| 1) |ULTIMATE.start_build_nondet_String_~length~0#1|)))} is VALID [2022-02-20 23:39:17,248 INFO L290 TraceCheckUtils]: 6: Hoare triple {987#(and (or (<= |ULTIMATE.start_build_nondet_String_~length~0#1| (+ |ULTIMATE.start_build_nondet_String_~i~0#1| 2)) (<= 0 (+ |ULTIMATE.start_build_nondet_String_~nondetString~0#1.offset| |ULTIMATE.start_build_nondet_String_~i~0#1| 1))) (or (<= |ULTIMATE.start_build_nondet_String_~length~0#1| (+ |ULTIMATE.start_build_nondet_String_~i~0#1| 2)) (<= (+ |ULTIMATE.start_build_nondet_String_~nondetString~0#1.offset| |ULTIMATE.start_build_nondet_String_~length~0#1|) (+ (select |#length| |ULTIMATE.start_build_nondet_String_~nondetString~0#1.base|) 1))))} havoc build_nondet_String_#t~nondet5#1; {987#(and (or (<= |ULTIMATE.start_build_nondet_String_~length~0#1| (+ |ULTIMATE.start_build_nondet_String_~i~0#1| 2)) (<= 0 (+ |ULTIMATE.start_build_nondet_String_~nondetString~0#1.offset| |ULTIMATE.start_build_nondet_String_~i~0#1| 1))) (or (<= |ULTIMATE.start_build_nondet_String_~length~0#1| (+ |ULTIMATE.start_build_nondet_String_~i~0#1| 2)) (<= (+ |ULTIMATE.start_build_nondet_String_~nondetString~0#1.offset| |ULTIMATE.start_build_nondet_String_~length~0#1|) (+ (select |#length| |ULTIMATE.start_build_nondet_String_~nondetString~0#1.base|) 1))))} is VALID [2022-02-20 23:39:17,249 INFO L290 TraceCheckUtils]: 5: Hoare triple {987#(and (or (<= |ULTIMATE.start_build_nondet_String_~length~0#1| (+ |ULTIMATE.start_build_nondet_String_~i~0#1| 2)) (<= 0 (+ |ULTIMATE.start_build_nondet_String_~nondetString~0#1.offset| |ULTIMATE.start_build_nondet_String_~i~0#1| 1))) (or (<= |ULTIMATE.start_build_nondet_String_~length~0#1| (+ |ULTIMATE.start_build_nondet_String_~i~0#1| 2)) (<= (+ |ULTIMATE.start_build_nondet_String_~nondetString~0#1.offset| |ULTIMATE.start_build_nondet_String_~length~0#1|) (+ (select |#length| |ULTIMATE.start_build_nondet_String_~nondetString~0#1.base|) 1))))} SUMMARY for call write~int(build_nondet_String_#t~nondet5#1, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset + build_nondet_String_~i~0#1, 1); srcloc: L523 {987#(and (or (<= |ULTIMATE.start_build_nondet_String_~length~0#1| (+ |ULTIMATE.start_build_nondet_String_~i~0#1| 2)) (<= 0 (+ |ULTIMATE.start_build_nondet_String_~nondetString~0#1.offset| |ULTIMATE.start_build_nondet_String_~i~0#1| 1))) (or (<= |ULTIMATE.start_build_nondet_String_~length~0#1| (+ |ULTIMATE.start_build_nondet_String_~i~0#1| 2)) (<= (+ |ULTIMATE.start_build_nondet_String_~nondetString~0#1.offset| |ULTIMATE.start_build_nondet_String_~length~0#1|) (+ (select |#length| |ULTIMATE.start_build_nondet_String_~nondetString~0#1.base|) 1))))} is VALID [2022-02-20 23:39:17,250 INFO L290 TraceCheckUtils]: 4: Hoare triple {987#(and (or (<= |ULTIMATE.start_build_nondet_String_~length~0#1| (+ |ULTIMATE.start_build_nondet_String_~i~0#1| 2)) (<= 0 (+ |ULTIMATE.start_build_nondet_String_~nondetString~0#1.offset| |ULTIMATE.start_build_nondet_String_~i~0#1| 1))) (or (<= |ULTIMATE.start_build_nondet_String_~length~0#1| (+ |ULTIMATE.start_build_nondet_String_~i~0#1| 2)) (<= (+ |ULTIMATE.start_build_nondet_String_~nondetString~0#1.offset| |ULTIMATE.start_build_nondet_String_~length~0#1|) (+ (select |#length| |ULTIMATE.start_build_nondet_String_~nondetString~0#1.base|) 1))))} assume !!(build_nondet_String_~i~0#1 < build_nondet_String_~length~0#1 - 1);assume -128 <= build_nondet_String_#t~nondet5#1 && build_nondet_String_#t~nondet5#1 <= 127; {987#(and (or (<= |ULTIMATE.start_build_nondet_String_~length~0#1| (+ |ULTIMATE.start_build_nondet_String_~i~0#1| 2)) (<= 0 (+ |ULTIMATE.start_build_nondet_String_~nondetString~0#1.offset| |ULTIMATE.start_build_nondet_String_~i~0#1| 1))) (or (<= |ULTIMATE.start_build_nondet_String_~length~0#1| (+ |ULTIMATE.start_build_nondet_String_~i~0#1| 2)) (<= (+ |ULTIMATE.start_build_nondet_String_~nondetString~0#1.offset| |ULTIMATE.start_build_nondet_String_~length~0#1|) (+ (select |#length| |ULTIMATE.start_build_nondet_String_~nondetString~0#1.base|) 1))))} is VALID [2022-02-20 23:39:17,250 INFO L290 TraceCheckUtils]: 3: Hoare triple {942#true} call build_nondet_String_#t~malloc3#1.base, build_nondet_String_#t~malloc3#1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length~0#1);build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset := build_nondet_String_#t~malloc3#1.base, build_nondet_String_#t~malloc3#1.offset;havoc build_nondet_String_#t~malloc3#1.base, build_nondet_String_#t~malloc3#1.offset;build_nondet_String_~i~0#1 := 0; {987#(and (or (<= |ULTIMATE.start_build_nondet_String_~length~0#1| (+ |ULTIMATE.start_build_nondet_String_~i~0#1| 2)) (<= 0 (+ |ULTIMATE.start_build_nondet_String_~nondetString~0#1.offset| |ULTIMATE.start_build_nondet_String_~i~0#1| 1))) (or (<= |ULTIMATE.start_build_nondet_String_~length~0#1| (+ |ULTIMATE.start_build_nondet_String_~i~0#1| 2)) (<= (+ |ULTIMATE.start_build_nondet_String_~nondetString~0#1.offset| |ULTIMATE.start_build_nondet_String_~length~0#1|) (+ (select |#length| |ULTIMATE.start_build_nondet_String_~nondetString~0#1.base|) 1))))} is VALID [2022-02-20 23:39:17,251 INFO L290 TraceCheckUtils]: 2: Hoare triple {942#true} assume !(build_nondet_String_~length~0#1 < 1); {942#true} is VALID [2022-02-20 23:39:17,251 INFO L290 TraceCheckUtils]: 1: Hoare triple {942#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret7#1.base, main_#t~ret7#1.offset, main_#t~ret8#1, main_~p~1#1.base, main_~p~1#1.offset, main_~res~0#1;assume { :begin_inline_build_nondet_String } true;havoc build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;havoc build_nondet_String_#t~nondet2#1, build_nondet_String_#t~malloc3#1.base, build_nondet_String_#t~malloc3#1.offset, build_nondet_String_#t~nondet5#1, build_nondet_String_#t~post4#1, build_nondet_String_~i~0#1, build_nondet_String_~length~0#1, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset;assume -2147483648 <= build_nondet_String_#t~nondet2#1 && build_nondet_String_#t~nondet2#1 <= 2147483647;build_nondet_String_~length~0#1 := build_nondet_String_#t~nondet2#1;havoc build_nondet_String_#t~nondet2#1; {942#true} is VALID [2022-02-20 23:39:17,251 INFO L290 TraceCheckUtils]: 0: Hoare triple {942#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {942#true} is VALID [2022-02-20 23:39:17,251 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:39:17,252 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [457174481] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:39:17,252 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 23:39:17,252 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2022-02-20 23:39:17,252 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599423903] [2022-02-20 23:39:17,252 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 23:39:17,253 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-02-20 23:39:17,253 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:39:17,253 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 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-02-20 23:39:17,272 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:39:17,273 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 23:39:17,273 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:39:17,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 23:39:17,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2022-02-20 23:39:17,274 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-02-20 23:39:17,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:39:17,610 INFO L93 Difference]: Finished difference Result 66 states and 70 transitions. [2022-02-20 23:39:17,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 23:39:17,610 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-02-20 23:39:17,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:39:17,610 INFO L82 GeneralOperation]: Start removeUnreachable. 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-02-20 23:39:17,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 66 transitions. [2022-02-20 23:39:17,611 INFO L82 GeneralOperation]: Start removeUnreachable. 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-02-20 23:39:17,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 66 transitions. [2022-02-20 23:39:17,612 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 66 transitions. [2022-02-20 23:39:17,668 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:39:17,669 INFO L225 Difference]: With dead ends: 66 [2022-02-20 23:39:17,669 INFO L226 Difference]: Without dead ends: 66 [2022-02-20 23:39:17,669 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2022-02-20 23:39:17,670 INFO L933 BasicCegarLoop]: 43 mSDtfsCounter, 77 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:39:17,670 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [77 Valid, 138 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:39:17,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-02-20 23:39:17,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 27. [2022-02-20 23:39:17,671 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:39:17,672 INFO L82 GeneralOperation]: Start isEquivalent. First operand 66 states. Second 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-02-20 23:39:17,672 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second 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-02-20 23:39:17,672 INFO L87 Difference]: Start difference. First operand 66 states. Second 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-02-20 23:39:17,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:39:17,673 INFO L93 Difference]: Finished difference Result 66 states and 70 transitions. [2022-02-20 23:39:17,673 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2022-02-20 23:39:17,673 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:39:17,673 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:39:17,673 INFO L74 IsIncluded]: Start isIncluded. First 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) Second operand 66 states. [2022-02-20 23:39:17,674 INFO L87 Difference]: Start difference. First 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) Second operand 66 states. [2022-02-20 23:39:17,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:39:17,675 INFO L93 Difference]: Finished difference Result 66 states and 70 transitions. [2022-02-20 23:39:17,675 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2022-02-20 23:39:17,675 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:39:17,675 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:39:17,676 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:39:17,676 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:39:17,676 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-02-20 23:39:17,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2022-02-20 23:39:17,676 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 10 [2022-02-20 23:39:17,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:39:17,677 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2022-02-20 23:39:17,677 INFO L471 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-02-20 23:39:17,677 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2022-02-20 23:39:17,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-20 23:39:17,677 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:39:17,677 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:39:17,697 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-02-20 23:39:17,887 WARN L452 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-02-20 23:39:17,888 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 6 more)] === [2022-02-20 23:39:17,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:39:17,889 INFO L85 PathProgramCache]: Analyzing trace with hash -976521877, now seen corresponding path program 1 times [2022-02-20 23:39:17,889 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:39:17,889 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953385464] [2022-02-20 23:39:17,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:39:17,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:39:17,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:39:17,984 INFO L290 TraceCheckUtils]: 0: Hoare triple {1239#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {1239#true} is VALID [2022-02-20 23:39:17,985 INFO L290 TraceCheckUtils]: 1: Hoare triple {1239#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret7#1.base, main_#t~ret7#1.offset, main_#t~ret8#1, main_~p~1#1.base, main_~p~1#1.offset, main_~res~0#1;assume { :begin_inline_build_nondet_String } true;havoc build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;havoc build_nondet_String_#t~nondet2#1, build_nondet_String_#t~malloc3#1.base, build_nondet_String_#t~malloc3#1.offset, build_nondet_String_#t~nondet5#1, build_nondet_String_#t~post4#1, build_nondet_String_~i~0#1, build_nondet_String_~length~0#1, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset;assume -2147483648 <= build_nondet_String_#t~nondet2#1 && build_nondet_String_#t~nondet2#1 <= 2147483647;build_nondet_String_~length~0#1 := build_nondet_String_#t~nondet2#1;havoc build_nondet_String_#t~nondet2#1; {1239#true} is VALID [2022-02-20 23:39:17,985 INFO L290 TraceCheckUtils]: 2: Hoare triple {1239#true} assume build_nondet_String_~length~0#1 < 1;build_nondet_String_~length~0#1 := 1; {1241#(and (<= |ULTIMATE.start_build_nondet_String_~length~0#1| 1) (<= 1 |ULTIMATE.start_build_nondet_String_~length~0#1|))} is VALID [2022-02-20 23:39:17,985 INFO L290 TraceCheckUtils]: 3: Hoare triple {1241#(and (<= |ULTIMATE.start_build_nondet_String_~length~0#1| 1) (<= 1 |ULTIMATE.start_build_nondet_String_~length~0#1|))} call build_nondet_String_#t~malloc3#1.base, build_nondet_String_#t~malloc3#1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length~0#1);build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset := build_nondet_String_#t~malloc3#1.base, build_nondet_String_#t~malloc3#1.offset;havoc build_nondet_String_#t~malloc3#1.base, build_nondet_String_#t~malloc3#1.offset;build_nondet_String_~i~0#1 := 0; {1242#(and (<= |ULTIMATE.start_build_nondet_String_~length~0#1| 1) (= |ULTIMATE.start_build_nondet_String_~nondetString~0#1.offset| 0) (<= 1 |ULTIMATE.start_build_nondet_String_~length~0#1|))} is VALID [2022-02-20 23:39:17,986 INFO L290 TraceCheckUtils]: 4: Hoare triple {1242#(and (<= |ULTIMATE.start_build_nondet_String_~length~0#1| 1) (= |ULTIMATE.start_build_nondet_String_~nondetString~0#1.offset| 0) (<= 1 |ULTIMATE.start_build_nondet_String_~length~0#1|))} assume !(build_nondet_String_~i~0#1 < build_nondet_String_~length~0#1 - 1); {1242#(and (<= |ULTIMATE.start_build_nondet_String_~length~0#1| 1) (= |ULTIMATE.start_build_nondet_String_~nondetString~0#1.offset| 0) (<= 1 |ULTIMATE.start_build_nondet_String_~length~0#1|))} is VALID [2022-02-20 23:39:17,987 INFO L290 TraceCheckUtils]: 5: Hoare triple {1242#(and (<= |ULTIMATE.start_build_nondet_String_~length~0#1| 1) (= |ULTIMATE.start_build_nondet_String_~nondetString~0#1.offset| 0) (<= 1 |ULTIMATE.start_build_nondet_String_~length~0#1|))} SUMMARY for call write~int(0, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset + (build_nondet_String_~length~0#1 - 1), 1); srcloc: L521-4 {1243#(and (= |ULTIMATE.start_build_nondet_String_~nondetString~0#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_build_nondet_String_~nondetString~0#1.base|) |ULTIMATE.start_build_nondet_String_~nondetString~0#1.offset|) 0))} is VALID [2022-02-20 23:39:17,987 INFO L290 TraceCheckUtils]: 6: Hoare triple {1243#(and (= |ULTIMATE.start_build_nondet_String_~nondetString~0#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_build_nondet_String_~nondetString~0#1.base|) |ULTIMATE.start_build_nondet_String_~nondetString~0#1.offset|) 0))} build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset := build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset; {1244#(= (select (select |#memory_int| |ULTIMATE.start_build_nondet_String_#res#1.base|) |ULTIMATE.start_build_nondet_String_#res#1.offset|) 0)} is VALID [2022-02-20 23:39:17,988 INFO L290 TraceCheckUtils]: 7: Hoare triple {1244#(= (select (select |#memory_int| |ULTIMATE.start_build_nondet_String_#res#1.base|) |ULTIMATE.start_build_nondet_String_#res#1.offset|) 0)} main_#t~ret7#1.base, main_#t~ret7#1.offset := build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;assume { :end_inline_build_nondet_String } true;main_~p~1#1.base, main_~p~1#1.offset := main_#t~ret7#1.base, main_#t~ret7#1.offset;havoc main_#t~ret7#1.base, main_#t~ret7#1.offset;assume { :begin_inline_cstrlen } true;cstrlen_#in~s#1.base, cstrlen_#in~s#1.offset := main_~p~1#1.base, main_~p~1#1.offset;havoc cstrlen_#res#1;havoc cstrlen_#t~mem6#1, cstrlen_~s#1.base, cstrlen_~s#1.offset, cstrlen_~p~0#1.base, cstrlen_~p~0#1.offset;cstrlen_~s#1.base, cstrlen_~s#1.offset := cstrlen_#in~s#1.base, cstrlen_#in~s#1.offset;cstrlen_~p~0#1.base, cstrlen_~p~0#1.offset := cstrlen_~s#1.base, cstrlen_~s#1.offset; {1245#(= (select (select |#memory_int| |ULTIMATE.start_cstrlen_~p~0#1.base|) |ULTIMATE.start_cstrlen_~p~0#1.offset|) 0)} is VALID [2022-02-20 23:39:17,988 INFO L290 TraceCheckUtils]: 8: Hoare triple {1245#(= (select (select |#memory_int| |ULTIMATE.start_cstrlen_~p~0#1.base|) |ULTIMATE.start_cstrlen_~p~0#1.offset|) 0)} SUMMARY for call cstrlen_#t~mem6#1 := read~int(cstrlen_~p~0#1.base, cstrlen_~p~0#1.offset, 1); srcloc: L532-3 {1246#(= |ULTIMATE.start_cstrlen_#t~mem6#1| 0)} is VALID [2022-02-20 23:39:17,988 INFO L290 TraceCheckUtils]: 9: Hoare triple {1246#(= |ULTIMATE.start_cstrlen_#t~mem6#1| 0)} assume !!(0 != cstrlen_#t~mem6#1);havoc cstrlen_#t~mem6#1;cstrlen_~p~0#1.base, cstrlen_~p~0#1.offset := cstrlen_~p~0#1.base, 2 + cstrlen_~p~0#1.offset; {1240#false} is VALID [2022-02-20 23:39:17,989 INFO L290 TraceCheckUtils]: 10: Hoare triple {1240#false} assume !(1 + cstrlen_~p~0#1.offset <= #length[cstrlen_~p~0#1.base] && 0 <= cstrlen_~p~0#1.offset); {1240#false} is VALID [2022-02-20 23:39:17,989 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:39:17,989 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:39:17,989 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953385464] [2022-02-20 23:39:17,989 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953385464] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:39:17,989 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:39:17,989 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 23:39:17,989 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161519637] [2022-02-20 23:39:17,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:39:17,990 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-02-20 23:39:17,990 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:39:17,990 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 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-02-20 23:39:17,997 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:39:17,998 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 23:39:17,998 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:39:17,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 23:39:17,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-02-20 23:39:17,999 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-02-20 23:39:18,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:39:18,165 INFO L93 Difference]: Finished difference Result 42 states and 43 transitions. [2022-02-20 23:39:18,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 23:39:18,165 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-02-20 23:39:18,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:39:18,165 INFO L82 GeneralOperation]: Start removeUnreachable. 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-02-20 23:39:18,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 43 transitions. [2022-02-20 23:39:18,166 INFO L82 GeneralOperation]: Start removeUnreachable. 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-02-20 23:39:18,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 43 transitions. [2022-02-20 23:39:18,167 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 43 transitions. [2022-02-20 23:39:18,202 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:39:18,203 INFO L225 Difference]: With dead ends: 42 [2022-02-20 23:39:18,203 INFO L226 Difference]: Without dead ends: 42 [2022-02-20 23:39:18,203 INFO L932 BasicCegarLoop]: 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-02-20 23:39:18,203 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 61 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:39:18,204 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [61 Valid, 107 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:39:18,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-02-20 23:39:18,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 32. [2022-02-20 23:39:18,205 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:39:18,205 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second 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-02-20 23:39:18,205 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second 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-02-20 23:39:18,205 INFO L87 Difference]: Start difference. First operand 42 states. Second 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-02-20 23:39:18,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:39:18,206 INFO L93 Difference]: Finished difference Result 42 states and 43 transitions. [2022-02-20 23:39:18,206 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2022-02-20 23:39:18,206 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:39:18,206 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:39:18,206 INFO L74 IsIncluded]: Start isIncluded. First 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) Second operand 42 states. [2022-02-20 23:39:18,207 INFO L87 Difference]: Start difference. First 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) Second operand 42 states. [2022-02-20 23:39:18,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:39:18,208 INFO L93 Difference]: Finished difference Result 42 states and 43 transitions. [2022-02-20 23:39:18,208 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2022-02-20 23:39:18,208 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:39:18,208 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:39:18,208 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:39:18,208 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:39:18,208 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-02-20 23:39:18,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2022-02-20 23:39:18,209 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 11 [2022-02-20 23:39:18,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:39:18,209 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2022-02-20 23:39:18,209 INFO L471 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-02-20 23:39:18,209 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2022-02-20 23:39:18,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-20 23:39:18,210 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:39:18,210 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:39:18,210 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 23:39:18,210 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 6 more)] === [2022-02-20 23:39:18,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:39:18,210 INFO L85 PathProgramCache]: Analyzing trace with hash -296463507, now seen corresponding path program 1 times [2022-02-20 23:39:18,211 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:39:18,211 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345610649] [2022-02-20 23:39:18,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:39:18,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:39:18,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:39:18,317 INFO L290 TraceCheckUtils]: 0: Hoare triple {1415#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {1415#true} is VALID [2022-02-20 23:39:18,317 INFO L290 TraceCheckUtils]: 1: Hoare triple {1415#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret7#1.base, main_#t~ret7#1.offset, main_#t~ret8#1, main_~p~1#1.base, main_~p~1#1.offset, main_~res~0#1;assume { :begin_inline_build_nondet_String } true;havoc build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;havoc build_nondet_String_#t~nondet2#1, build_nondet_String_#t~malloc3#1.base, build_nondet_String_#t~malloc3#1.offset, build_nondet_String_#t~nondet5#1, build_nondet_String_#t~post4#1, build_nondet_String_~i~0#1, build_nondet_String_~length~0#1, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset;assume -2147483648 <= build_nondet_String_#t~nondet2#1 && build_nondet_String_#t~nondet2#1 <= 2147483647;build_nondet_String_~length~0#1 := build_nondet_String_#t~nondet2#1;havoc build_nondet_String_#t~nondet2#1; {1415#true} is VALID [2022-02-20 23:39:18,318 INFO L290 TraceCheckUtils]: 2: Hoare triple {1415#true} assume !(build_nondet_String_~length~0#1 < 1); {1417#(<= 1 |ULTIMATE.start_build_nondet_String_~length~0#1|)} is VALID [2022-02-20 23:39:18,318 INFO L290 TraceCheckUtils]: 3: Hoare triple {1417#(<= 1 |ULTIMATE.start_build_nondet_String_~length~0#1|)} call build_nondet_String_#t~malloc3#1.base, build_nondet_String_#t~malloc3#1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length~0#1);build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset := build_nondet_String_#t~malloc3#1.base, build_nondet_String_#t~malloc3#1.offset;havoc build_nondet_String_#t~malloc3#1.base, build_nondet_String_#t~malloc3#1.offset;build_nondet_String_~i~0#1 := 0; {1418#(and (= |ULTIMATE.start_build_nondet_String_~i~0#1| 0) (= |ULTIMATE.start_build_nondet_String_~nondetString~0#1.offset| 0) (<= 1 |ULTIMATE.start_build_nondet_String_~length~0#1|))} is VALID [2022-02-20 23:39:18,319 INFO L290 TraceCheckUtils]: 4: Hoare triple {1418#(and (= |ULTIMATE.start_build_nondet_String_~i~0#1| 0) (= |ULTIMATE.start_build_nondet_String_~nondetString~0#1.offset| 0) (<= 1 |ULTIMATE.start_build_nondet_String_~length~0#1|))} assume !(build_nondet_String_~i~0#1 < build_nondet_String_~length~0#1 - 1); {1419#(and (<= |ULTIMATE.start_build_nondet_String_~length~0#1| 1) (= |ULTIMATE.start_build_nondet_String_~nondetString~0#1.offset| 0) (<= 1 |ULTIMATE.start_build_nondet_String_~length~0#1|))} is VALID [2022-02-20 23:39:18,319 INFO L290 TraceCheckUtils]: 5: Hoare triple {1419#(and (<= |ULTIMATE.start_build_nondet_String_~length~0#1| 1) (= |ULTIMATE.start_build_nondet_String_~nondetString~0#1.offset| 0) (<= 1 |ULTIMATE.start_build_nondet_String_~length~0#1|))} SUMMARY for call write~int(0, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset + (build_nondet_String_~length~0#1 - 1), 1); srcloc: L521-4 {1420#(and (= |ULTIMATE.start_build_nondet_String_~nondetString~0#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_build_nondet_String_~nondetString~0#1.base|) |ULTIMATE.start_build_nondet_String_~nondetString~0#1.offset|) 0))} is VALID [2022-02-20 23:39:18,320 INFO L290 TraceCheckUtils]: 6: Hoare triple {1420#(and (= |ULTIMATE.start_build_nondet_String_~nondetString~0#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_build_nondet_String_~nondetString~0#1.base|) |ULTIMATE.start_build_nondet_String_~nondetString~0#1.offset|) 0))} build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset := build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset; {1421#(= (select (select |#memory_int| |ULTIMATE.start_build_nondet_String_#res#1.base|) |ULTIMATE.start_build_nondet_String_#res#1.offset|) 0)} is VALID [2022-02-20 23:39:18,320 INFO L290 TraceCheckUtils]: 7: Hoare triple {1421#(= (select (select |#memory_int| |ULTIMATE.start_build_nondet_String_#res#1.base|) |ULTIMATE.start_build_nondet_String_#res#1.offset|) 0)} main_#t~ret7#1.base, main_#t~ret7#1.offset := build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;assume { :end_inline_build_nondet_String } true;main_~p~1#1.base, main_~p~1#1.offset := main_#t~ret7#1.base, main_#t~ret7#1.offset;havoc main_#t~ret7#1.base, main_#t~ret7#1.offset;assume { :begin_inline_cstrlen } true;cstrlen_#in~s#1.base, cstrlen_#in~s#1.offset := main_~p~1#1.base, main_~p~1#1.offset;havoc cstrlen_#res#1;havoc cstrlen_#t~mem6#1, cstrlen_~s#1.base, cstrlen_~s#1.offset, cstrlen_~p~0#1.base, cstrlen_~p~0#1.offset;cstrlen_~s#1.base, cstrlen_~s#1.offset := cstrlen_#in~s#1.base, cstrlen_#in~s#1.offset;cstrlen_~p~0#1.base, cstrlen_~p~0#1.offset := cstrlen_~s#1.base, cstrlen_~s#1.offset; {1422#(= (select (select |#memory_int| |ULTIMATE.start_cstrlen_~p~0#1.base|) |ULTIMATE.start_cstrlen_~p~0#1.offset|) 0)} is VALID [2022-02-20 23:39:18,321 INFO L290 TraceCheckUtils]: 8: Hoare triple {1422#(= (select (select |#memory_int| |ULTIMATE.start_cstrlen_~p~0#1.base|) |ULTIMATE.start_cstrlen_~p~0#1.offset|) 0)} SUMMARY for call cstrlen_#t~mem6#1 := read~int(cstrlen_~p~0#1.base, cstrlen_~p~0#1.offset, 1); srcloc: L532-3 {1423#(= |ULTIMATE.start_cstrlen_#t~mem6#1| 0)} is VALID [2022-02-20 23:39:18,321 INFO L290 TraceCheckUtils]: 9: Hoare triple {1423#(= |ULTIMATE.start_cstrlen_#t~mem6#1| 0)} assume !!(0 != cstrlen_#t~mem6#1);havoc cstrlen_#t~mem6#1;cstrlen_~p~0#1.base, cstrlen_~p~0#1.offset := cstrlen_~p~0#1.base, 2 + cstrlen_~p~0#1.offset; {1416#false} is VALID [2022-02-20 23:39:18,321 INFO L290 TraceCheckUtils]: 10: Hoare triple {1416#false} assume !(1 + cstrlen_~p~0#1.offset <= #length[cstrlen_~p~0#1.base] && 0 <= cstrlen_~p~0#1.offset); {1416#false} is VALID [2022-02-20 23:39:18,321 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:39:18,322 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:39:18,322 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345610649] [2022-02-20 23:39:18,322 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345610649] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:39:18,322 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:39:18,322 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 23:39:18,322 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173946647] [2022-02-20 23:39:18,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:39:18,323 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-02-20 23:39:18,323 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:39:18,323 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 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-02-20 23:39:18,330 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:39:18,331 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 23:39:18,331 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:39:18,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 23:39:18,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-02-20 23:39:18,331 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-02-20 23:39:18,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:39:18,558 INFO L93 Difference]: Finished difference Result 51 states and 53 transitions. [2022-02-20 23:39:18,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-20 23:39:18,559 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-02-20 23:39:18,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:39:18,559 INFO L82 GeneralOperation]: Start removeUnreachable. 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-02-20 23:39:18,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 46 transitions. [2022-02-20 23:39:18,559 INFO L82 GeneralOperation]: Start removeUnreachable. 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-02-20 23:39:18,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 46 transitions. [2022-02-20 23:39:18,560 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 46 transitions. [2022-02-20 23:39:18,592 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:39:18,593 INFO L225 Difference]: With dead ends: 51 [2022-02-20 23:39:18,593 INFO L226 Difference]: Without dead ends: 51 [2022-02-20 23:39:18,593 INFO L932 BasicCegarLoop]: 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-02-20 23:39:18,593 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 89 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:39:18,593 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [89 Valid, 108 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:39:18,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-02-20 23:39:18,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 33. [2022-02-20 23:39:18,595 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:39:18,595 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second 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-02-20 23:39:18,595 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second 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-02-20 23:39:18,595 INFO L87 Difference]: Start difference. First operand 51 states. Second 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-02-20 23:39:18,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:39:18,596 INFO L93 Difference]: Finished difference Result 51 states and 53 transitions. [2022-02-20 23:39:18,596 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 53 transitions. [2022-02-20 23:39:18,597 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:39:18,597 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:39:18,597 INFO L74 IsIncluded]: Start isIncluded. First 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) Second operand 51 states. [2022-02-20 23:39:18,597 INFO L87 Difference]: Start difference. First 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) Second operand 51 states. [2022-02-20 23:39:18,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:39:18,598 INFO L93 Difference]: Finished difference Result 51 states and 53 transitions. [2022-02-20 23:39:18,598 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 53 transitions. [2022-02-20 23:39:18,598 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:39:18,598 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:39:18,598 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:39:18,598 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:39:18,599 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-02-20 23:39:18,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2022-02-20 23:39:18,599 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 11 [2022-02-20 23:39:18,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:39:18,599 INFO L470 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2022-02-20 23:39:18,600 INFO L471 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-02-20 23:39:18,600 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2022-02-20 23:39:18,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-02-20 23:39:18,600 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:39:18,600 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:39:18,600 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-20 23:39:18,600 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 6 more)] === [2022-02-20 23:39:18,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:39:18,601 INFO L85 PathProgramCache]: Analyzing trace with hash -2134702601, now seen corresponding path program 1 times [2022-02-20 23:39:18,601 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:39:18,601 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263593527] [2022-02-20 23:39:18,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:39:18,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:39:18,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:39:18,631 INFO L290 TraceCheckUtils]: 0: Hoare triple {1622#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {1622#true} is VALID [2022-02-20 23:39:18,631 INFO L290 TraceCheckUtils]: 1: Hoare triple {1622#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret7#1.base, main_#t~ret7#1.offset, main_#t~ret8#1, main_~p~1#1.base, main_~p~1#1.offset, main_~res~0#1;assume { :begin_inline_build_nondet_String } true;havoc build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;havoc build_nondet_String_#t~nondet2#1, build_nondet_String_#t~malloc3#1.base, build_nondet_String_#t~malloc3#1.offset, build_nondet_String_#t~nondet5#1, build_nondet_String_#t~post4#1, build_nondet_String_~i~0#1, build_nondet_String_~length~0#1, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset;assume -2147483648 <= build_nondet_String_#t~nondet2#1 && build_nondet_String_#t~nondet2#1 <= 2147483647;build_nondet_String_~length~0#1 := build_nondet_String_#t~nondet2#1;havoc build_nondet_String_#t~nondet2#1; {1622#true} is VALID [2022-02-20 23:39:18,631 INFO L290 TraceCheckUtils]: 2: Hoare triple {1622#true} assume build_nondet_String_~length~0#1 < 1;build_nondet_String_~length~0#1 := 1; {1622#true} is VALID [2022-02-20 23:39:18,631 INFO L290 TraceCheckUtils]: 3: Hoare triple {1622#true} call build_nondet_String_#t~malloc3#1.base, build_nondet_String_#t~malloc3#1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length~0#1);build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset := build_nondet_String_#t~malloc3#1.base, build_nondet_String_#t~malloc3#1.offset;havoc build_nondet_String_#t~malloc3#1.base, build_nondet_String_#t~malloc3#1.offset;build_nondet_String_~i~0#1 := 0; {1624#(= |ULTIMATE.start_build_nondet_String_~nondetString~0#1.offset| 0)} is VALID [2022-02-20 23:39:18,632 INFO L290 TraceCheckUtils]: 4: Hoare triple {1624#(= |ULTIMATE.start_build_nondet_String_~nondetString~0#1.offset| 0)} assume !(build_nondet_String_~i~0#1 < build_nondet_String_~length~0#1 - 1); {1624#(= |ULTIMATE.start_build_nondet_String_~nondetString~0#1.offset| 0)} is VALID [2022-02-20 23:39:18,632 INFO L290 TraceCheckUtils]: 5: Hoare triple {1624#(= |ULTIMATE.start_build_nondet_String_~nondetString~0#1.offset| 0)} SUMMARY for call write~int(0, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset + (build_nondet_String_~length~0#1 - 1), 1); srcloc: L521-4 {1624#(= |ULTIMATE.start_build_nondet_String_~nondetString~0#1.offset| 0)} is VALID [2022-02-20 23:39:18,632 INFO L290 TraceCheckUtils]: 6: Hoare triple {1624#(= |ULTIMATE.start_build_nondet_String_~nondetString~0#1.offset| 0)} build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset := build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset; {1625#(= |ULTIMATE.start_build_nondet_String_#res#1.offset| 0)} is VALID [2022-02-20 23:39:18,633 INFO L290 TraceCheckUtils]: 7: Hoare triple {1625#(= |ULTIMATE.start_build_nondet_String_#res#1.offset| 0)} main_#t~ret7#1.base, main_#t~ret7#1.offset := build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;assume { :end_inline_build_nondet_String } true;main_~p~1#1.base, main_~p~1#1.offset := main_#t~ret7#1.base, main_#t~ret7#1.offset;havoc main_#t~ret7#1.base, main_#t~ret7#1.offset;assume { :begin_inline_cstrlen } true;cstrlen_#in~s#1.base, cstrlen_#in~s#1.offset := main_~p~1#1.base, main_~p~1#1.offset;havoc cstrlen_#res#1;havoc cstrlen_#t~mem6#1, cstrlen_~s#1.base, cstrlen_~s#1.offset, cstrlen_~p~0#1.base, cstrlen_~p~0#1.offset;cstrlen_~s#1.base, cstrlen_~s#1.offset := cstrlen_#in~s#1.base, cstrlen_#in~s#1.offset;cstrlen_~p~0#1.base, cstrlen_~p~0#1.offset := cstrlen_~s#1.base, cstrlen_~s#1.offset; {1626#(= |ULTIMATE.start_main_~p~1#1.offset| 0)} is VALID [2022-02-20 23:39:18,633 INFO L290 TraceCheckUtils]: 8: Hoare triple {1626#(= |ULTIMATE.start_main_~p~1#1.offset| 0)} SUMMARY for call cstrlen_#t~mem6#1 := read~int(cstrlen_~p~0#1.base, cstrlen_~p~0#1.offset, 1); srcloc: L532-3 {1626#(= |ULTIMATE.start_main_~p~1#1.offset| 0)} is VALID [2022-02-20 23:39:18,634 INFO L290 TraceCheckUtils]: 9: Hoare triple {1626#(= |ULTIMATE.start_main_~p~1#1.offset| 0)} assume !(0 != cstrlen_#t~mem6#1);havoc cstrlen_#t~mem6#1; {1626#(= |ULTIMATE.start_main_~p~1#1.offset| 0)} is VALID [2022-02-20 23:39:18,634 INFO L290 TraceCheckUtils]: 10: Hoare triple {1626#(= |ULTIMATE.start_main_~p~1#1.offset| 0)} cstrlen_#res#1 := (if cstrlen_~p~0#1.offset - cstrlen_~s#1.offset < 0 && 0 != (cstrlen_~p~0#1.offset - cstrlen_~s#1.offset) % 1 then 1 + (cstrlen_~p~0#1.offset - cstrlen_~s#1.offset) / 1 else (cstrlen_~p~0#1.offset - cstrlen_~s#1.offset) / 1); {1626#(= |ULTIMATE.start_main_~p~1#1.offset| 0)} is VALID [2022-02-20 23:39:18,634 INFO L290 TraceCheckUtils]: 11: Hoare triple {1626#(= |ULTIMATE.start_main_~p~1#1.offset| 0)} main_#t~ret8#1 := cstrlen_#res#1;assume { :end_inline_cstrlen } true;assume -2147483648 <= main_#t~ret8#1 && main_#t~ret8#1 <= 2147483647;main_~res~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1; {1626#(= |ULTIMATE.start_main_~p~1#1.offset| 0)} is VALID [2022-02-20 23:39:18,635 INFO L290 TraceCheckUtils]: 12: Hoare triple {1626#(= |ULTIMATE.start_main_~p~1#1.offset| 0)} assume !(0 == main_~p~1#1.offset); {1623#false} is VALID [2022-02-20 23:39:18,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:39:18,635 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:39:18,635 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263593527] [2022-02-20 23:39:18,635 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263593527] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:39:18,635 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:39:18,635 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:39:18,635 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199040277] [2022-02-20 23:39:18,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:39:18,636 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-02-20 23:39:18,636 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:39:18,636 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 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-02-20 23:39:18,644 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:39:18,644 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:39:18,644 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:39:18,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:39:18,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:39:18,645 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-02-20 23:39:18,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:39:18,689 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2022-02-20 23:39:18,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 23:39:18,690 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-02-20 23:39:18,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:39:18,690 INFO L82 GeneralOperation]: Start removeUnreachable. 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-02-20 23:39:18,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 26 transitions. [2022-02-20 23:39:18,690 INFO L82 GeneralOperation]: Start removeUnreachable. 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-02-20 23:39:18,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 26 transitions. [2022-02-20 23:39:18,691 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 26 transitions. [2022-02-20 23:39:18,710 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:39:18,710 INFO L225 Difference]: With dead ends: 32 [2022-02-20 23:39:18,711 INFO L226 Difference]: Without dead ends: 32 [2022-02-20 23:39:18,711 INFO L932 BasicCegarLoop]: 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-02-20 23:39:18,711 INFO L933 BasicCegarLoop]: 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-02-20 23:39:18,712 INFO L934 BasicCegarLoop]: 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-02-20 23:39:18,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-02-20 23:39:18,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-02-20 23:39:18,713 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:39:18,713 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second 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-02-20 23:39:18,713 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second 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-02-20 23:39:18,713 INFO L87 Difference]: Start difference. First operand 32 states. Second 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-02-20 23:39:18,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:39:18,714 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2022-02-20 23:39:18,714 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2022-02-20 23:39:18,714 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:39:18,714 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:39:18,715 INFO L74 IsIncluded]: Start isIncluded. First 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) Second operand 32 states. [2022-02-20 23:39:18,715 INFO L87 Difference]: Start difference. First 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) Second operand 32 states. [2022-02-20 23:39:18,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:39:18,715 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2022-02-20 23:39:18,715 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2022-02-20 23:39:18,715 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:39:18,716 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:39:18,716 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:39:18,716 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:39:18,716 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-02-20 23:39:18,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2022-02-20 23:39:18,716 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 13 [2022-02-20 23:39:18,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:39:18,717 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2022-02-20 23:39:18,717 INFO L471 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-02-20 23:39:18,717 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2022-02-20 23:39:18,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-02-20 23:39:18,717 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:39:18,717 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:39:18,717 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-20 23:39:18,718 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 6 more)] === [2022-02-20 23:39:18,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:39:18,718 INFO L85 PathProgramCache]: Analyzing trace with hash -1751271107, now seen corresponding path program 1 times [2022-02-20 23:39:18,718 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:39:18,718 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146292177] [2022-02-20 23:39:18,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:39:18,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:39:18,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:39:18,755 INFO L290 TraceCheckUtils]: 0: Hoare triple {1761#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {1761#true} is VALID [2022-02-20 23:39:18,756 INFO L290 TraceCheckUtils]: 1: Hoare triple {1761#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret7#1.base, main_#t~ret7#1.offset, main_#t~ret8#1, main_~p~1#1.base, main_~p~1#1.offset, main_~res~0#1;assume { :begin_inline_build_nondet_String } true;havoc build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;havoc build_nondet_String_#t~nondet2#1, build_nondet_String_#t~malloc3#1.base, build_nondet_String_#t~malloc3#1.offset, build_nondet_String_#t~nondet5#1, build_nondet_String_#t~post4#1, build_nondet_String_~i~0#1, build_nondet_String_~length~0#1, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset;assume -2147483648 <= build_nondet_String_#t~nondet2#1 && build_nondet_String_#t~nondet2#1 <= 2147483647;build_nondet_String_~length~0#1 := build_nondet_String_#t~nondet2#1;havoc build_nondet_String_#t~nondet2#1; {1761#true} is VALID [2022-02-20 23:39:18,756 INFO L290 TraceCheckUtils]: 2: Hoare triple {1761#true} assume build_nondet_String_~length~0#1 < 1;build_nondet_String_~length~0#1 := 1; {1761#true} is VALID [2022-02-20 23:39:18,756 INFO L290 TraceCheckUtils]: 3: Hoare triple {1761#true} call build_nondet_String_#t~malloc3#1.base, build_nondet_String_#t~malloc3#1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length~0#1);build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset := build_nondet_String_#t~malloc3#1.base, build_nondet_String_#t~malloc3#1.offset;havoc build_nondet_String_#t~malloc3#1.base, build_nondet_String_#t~malloc3#1.offset;build_nondet_String_~i~0#1 := 0; {1763#(<= (+ |ULTIMATE.start_build_nondet_String_~nondetString~0#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:39:18,757 INFO L290 TraceCheckUtils]: 4: Hoare triple {1763#(<= (+ |ULTIMATE.start_build_nondet_String_~nondetString~0#1.base| 1) |#StackHeapBarrier|)} assume !(build_nondet_String_~i~0#1 < build_nondet_String_~length~0#1 - 1); {1763#(<= (+ |ULTIMATE.start_build_nondet_String_~nondetString~0#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:39:18,757 INFO L290 TraceCheckUtils]: 5: Hoare triple {1763#(<= (+ |ULTIMATE.start_build_nondet_String_~nondetString~0#1.base| 1) |#StackHeapBarrier|)} SUMMARY for call write~int(0, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset + (build_nondet_String_~length~0#1 - 1), 1); srcloc: L521-4 {1763#(<= (+ |ULTIMATE.start_build_nondet_String_~nondetString~0#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:39:18,757 INFO L290 TraceCheckUtils]: 6: Hoare triple {1763#(<= (+ |ULTIMATE.start_build_nondet_String_~nondetString~0#1.base| 1) |#StackHeapBarrier|)} build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset := build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset; {1764#(<= (+ |ULTIMATE.start_build_nondet_String_#res#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:39:18,758 INFO L290 TraceCheckUtils]: 7: Hoare triple {1764#(<= (+ |ULTIMATE.start_build_nondet_String_#res#1.base| 1) |#StackHeapBarrier|)} main_#t~ret7#1.base, main_#t~ret7#1.offset := build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;assume { :end_inline_build_nondet_String } true;main_~p~1#1.base, main_~p~1#1.offset := main_#t~ret7#1.base, main_#t~ret7#1.offset;havoc main_#t~ret7#1.base, main_#t~ret7#1.offset;assume { :begin_inline_cstrlen } true;cstrlen_#in~s#1.base, cstrlen_#in~s#1.offset := main_~p~1#1.base, main_~p~1#1.offset;havoc cstrlen_#res#1;havoc cstrlen_#t~mem6#1, cstrlen_~s#1.base, cstrlen_~s#1.offset, cstrlen_~p~0#1.base, cstrlen_~p~0#1.offset;cstrlen_~s#1.base, cstrlen_~s#1.offset := cstrlen_#in~s#1.base, cstrlen_#in~s#1.offset;cstrlen_~p~0#1.base, cstrlen_~p~0#1.offset := cstrlen_~s#1.base, cstrlen_~s#1.offset; {1765#(<= (+ |ULTIMATE.start_main_~p~1#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:39:18,758 INFO L290 TraceCheckUtils]: 8: Hoare triple {1765#(<= (+ |ULTIMATE.start_main_~p~1#1.base| 1) |#StackHeapBarrier|)} SUMMARY for call cstrlen_#t~mem6#1 := read~int(cstrlen_~p~0#1.base, cstrlen_~p~0#1.offset, 1); srcloc: L532-3 {1765#(<= (+ |ULTIMATE.start_main_~p~1#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:39:18,758 INFO L290 TraceCheckUtils]: 9: Hoare triple {1765#(<= (+ |ULTIMATE.start_main_~p~1#1.base| 1) |#StackHeapBarrier|)} assume !(0 != cstrlen_#t~mem6#1);havoc cstrlen_#t~mem6#1; {1765#(<= (+ |ULTIMATE.start_main_~p~1#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:39:18,759 INFO L290 TraceCheckUtils]: 10: Hoare triple {1765#(<= (+ |ULTIMATE.start_main_~p~1#1.base| 1) |#StackHeapBarrier|)} cstrlen_#res#1 := (if cstrlen_~p~0#1.offset - cstrlen_~s#1.offset < 0 && 0 != (cstrlen_~p~0#1.offset - cstrlen_~s#1.offset) % 1 then 1 + (cstrlen_~p~0#1.offset - cstrlen_~s#1.offset) / 1 else (cstrlen_~p~0#1.offset - cstrlen_~s#1.offset) / 1); {1765#(<= (+ |ULTIMATE.start_main_~p~1#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:39:18,759 INFO L290 TraceCheckUtils]: 11: Hoare triple {1765#(<= (+ |ULTIMATE.start_main_~p~1#1.base| 1) |#StackHeapBarrier|)} main_#t~ret8#1 := cstrlen_#res#1;assume { :end_inline_cstrlen } true;assume -2147483648 <= main_#t~ret8#1 && main_#t~ret8#1 <= 2147483647;main_~res~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1; {1765#(<= (+ |ULTIMATE.start_main_~p~1#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:39:18,759 INFO L290 TraceCheckUtils]: 12: Hoare triple {1765#(<= (+ |ULTIMATE.start_main_~p~1#1.base| 1) |#StackHeapBarrier|)} assume 0 == main_~p~1#1.offset; {1765#(<= (+ |ULTIMATE.start_main_~p~1#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:39:18,760 INFO L290 TraceCheckUtils]: 13: Hoare triple {1765#(<= (+ |ULTIMATE.start_main_~p~1#1.base| 1) |#StackHeapBarrier|)} assume !(main_~p~1#1.base < #StackHeapBarrier); {1762#false} is VALID [2022-02-20 23:39:18,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:39:18,760 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:39:18,760 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146292177] [2022-02-20 23:39:18,760 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146292177] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:39:18,760 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:39:18,761 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:39:18,761 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744208452] [2022-02-20 23:39:18,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:39:18,761 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-02-20 23:39:18,761 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:39:18,761 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 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-02-20 23:39:18,770 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:39:18,770 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:39:18,770 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:39:18,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:39:18,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:39:18,771 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-02-20 23:39:18,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:39:18,831 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2022-02-20 23:39:18,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 23:39:18,831 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-02-20 23:39:18,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:39:18,832 INFO L82 GeneralOperation]: Start removeUnreachable. 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-02-20 23:39:18,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 25 transitions. [2022-02-20 23:39:18,832 INFO L82 GeneralOperation]: Start removeUnreachable. 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-02-20 23:39:18,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 25 transitions. [2022-02-20 23:39:18,833 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 25 transitions. [2022-02-20 23:39:18,853 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:39:18,853 INFO L225 Difference]: With dead ends: 31 [2022-02-20 23:39:18,853 INFO L226 Difference]: Without dead ends: 31 [2022-02-20 23:39:18,854 INFO L932 BasicCegarLoop]: 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-02-20 23:39:18,854 INFO L933 BasicCegarLoop]: 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-02-20 23:39:18,854 INFO L934 BasicCegarLoop]: 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-02-20 23:39:18,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-02-20 23:39:18,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-02-20 23:39:18,856 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:39:18,856 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second 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-02-20 23:39:18,856 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second 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-02-20 23:39:18,856 INFO L87 Difference]: Start difference. First operand 31 states. Second 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-02-20 23:39:18,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:39:18,857 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2022-02-20 23:39:18,857 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2022-02-20 23:39:18,857 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:39:18,857 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:39:18,857 INFO L74 IsIncluded]: Start isIncluded. First 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) Second operand 31 states. [2022-02-20 23:39:18,857 INFO L87 Difference]: Start difference. First 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) Second operand 31 states. [2022-02-20 23:39:18,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:39:18,858 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2022-02-20 23:39:18,858 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2022-02-20 23:39:18,858 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:39:18,858 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:39:18,858 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:39:18,858 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:39:18,859 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-02-20 23:39:18,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2022-02-20 23:39:18,859 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 14 [2022-02-20 23:39:18,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:39:18,859 INFO L470 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2022-02-20 23:39:18,859 INFO L471 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-02-20 23:39:18,860 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2022-02-20 23:39:18,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-02-20 23:39:18,860 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:39:18,860 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:39:18,860 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-02-20 23:39:18,860 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 6 more)] === [2022-02-20 23:39:18,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:39:18,861 INFO L85 PathProgramCache]: Analyzing trace with hash 1545170617, now seen corresponding path program 1 times [2022-02-20 23:39:18,861 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:39:18,861 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908571414] [2022-02-20 23:39:18,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:39:18,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:39:18,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:39:18,903 INFO L290 TraceCheckUtils]: 0: Hoare triple {1896#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {1896#true} is VALID [2022-02-20 23:39:18,903 INFO L290 TraceCheckUtils]: 1: Hoare triple {1896#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret7#1.base, main_#t~ret7#1.offset, main_#t~ret8#1, main_~p~1#1.base, main_~p~1#1.offset, main_~res~0#1;assume { :begin_inline_build_nondet_String } true;havoc build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;havoc build_nondet_String_#t~nondet2#1, build_nondet_String_#t~malloc3#1.base, build_nondet_String_#t~malloc3#1.offset, build_nondet_String_#t~nondet5#1, build_nondet_String_#t~post4#1, build_nondet_String_~i~0#1, build_nondet_String_~length~0#1, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset;assume -2147483648 <= build_nondet_String_#t~nondet2#1 && build_nondet_String_#t~nondet2#1 <= 2147483647;build_nondet_String_~length~0#1 := build_nondet_String_#t~nondet2#1;havoc build_nondet_String_#t~nondet2#1; {1896#true} is VALID [2022-02-20 23:39:18,904 INFO L290 TraceCheckUtils]: 2: Hoare triple {1896#true} assume build_nondet_String_~length~0#1 < 1;build_nondet_String_~length~0#1 := 1; {1896#true} is VALID [2022-02-20 23:39:18,904 INFO L290 TraceCheckUtils]: 3: Hoare triple {1896#true} call build_nondet_String_#t~malloc3#1.base, build_nondet_String_#t~malloc3#1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length~0#1);build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset := build_nondet_String_#t~malloc3#1.base, build_nondet_String_#t~malloc3#1.offset;havoc build_nondet_String_#t~malloc3#1.base, build_nondet_String_#t~malloc3#1.offset;build_nondet_String_~i~0#1 := 0; {1896#true} is VALID [2022-02-20 23:39:18,904 INFO L290 TraceCheckUtils]: 4: Hoare triple {1896#true} assume !(build_nondet_String_~i~0#1 < build_nondet_String_~length~0#1 - 1); {1896#true} is VALID [2022-02-20 23:39:18,904 INFO L290 TraceCheckUtils]: 5: Hoare triple {1896#true} SUMMARY for call write~int(0, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset + (build_nondet_String_~length~0#1 - 1), 1); srcloc: L521-4 {1898#(= (select |#valid| |ULTIMATE.start_build_nondet_String_~nondetString~0#1.base|) 1)} is VALID [2022-02-20 23:39:18,905 INFO L290 TraceCheckUtils]: 6: Hoare triple {1898#(= (select |#valid| |ULTIMATE.start_build_nondet_String_~nondetString~0#1.base|) 1)} build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset := build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset; {1899#(= (select |#valid| |ULTIMATE.start_build_nondet_String_#res#1.base|) 1)} is VALID [2022-02-20 23:39:18,905 INFO L290 TraceCheckUtils]: 7: Hoare triple {1899#(= (select |#valid| |ULTIMATE.start_build_nondet_String_#res#1.base|) 1)} main_#t~ret7#1.base, main_#t~ret7#1.offset := build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;assume { :end_inline_build_nondet_String } true;main_~p~1#1.base, main_~p~1#1.offset := main_#t~ret7#1.base, main_#t~ret7#1.offset;havoc main_#t~ret7#1.base, main_#t~ret7#1.offset;assume { :begin_inline_cstrlen } true;cstrlen_#in~s#1.base, cstrlen_#in~s#1.offset := main_~p~1#1.base, main_~p~1#1.offset;havoc cstrlen_#res#1;havoc cstrlen_#t~mem6#1, cstrlen_~s#1.base, cstrlen_~s#1.offset, cstrlen_~p~0#1.base, cstrlen_~p~0#1.offset;cstrlen_~s#1.base, cstrlen_~s#1.offset := cstrlen_#in~s#1.base, cstrlen_#in~s#1.offset;cstrlen_~p~0#1.base, cstrlen_~p~0#1.offset := cstrlen_~s#1.base, cstrlen_~s#1.offset; {1900#(= (select |#valid| |ULTIMATE.start_main_~p~1#1.base|) 1)} is VALID [2022-02-20 23:39:18,905 INFO L290 TraceCheckUtils]: 8: Hoare triple {1900#(= (select |#valid| |ULTIMATE.start_main_~p~1#1.base|) 1)} SUMMARY for call cstrlen_#t~mem6#1 := read~int(cstrlen_~p~0#1.base, cstrlen_~p~0#1.offset, 1); srcloc: L532-3 {1900#(= (select |#valid| |ULTIMATE.start_main_~p~1#1.base|) 1)} is VALID [2022-02-20 23:39:18,906 INFO L290 TraceCheckUtils]: 9: Hoare triple {1900#(= (select |#valid| |ULTIMATE.start_main_~p~1#1.base|) 1)} assume !(0 != cstrlen_#t~mem6#1);havoc cstrlen_#t~mem6#1; {1900#(= (select |#valid| |ULTIMATE.start_main_~p~1#1.base|) 1)} is VALID [2022-02-20 23:39:18,906 INFO L290 TraceCheckUtils]: 10: Hoare triple {1900#(= (select |#valid| |ULTIMATE.start_main_~p~1#1.base|) 1)} cstrlen_#res#1 := (if cstrlen_~p~0#1.offset - cstrlen_~s#1.offset < 0 && 0 != (cstrlen_~p~0#1.offset - cstrlen_~s#1.offset) % 1 then 1 + (cstrlen_~p~0#1.offset - cstrlen_~s#1.offset) / 1 else (cstrlen_~p~0#1.offset - cstrlen_~s#1.offset) / 1); {1900#(= (select |#valid| |ULTIMATE.start_main_~p~1#1.base|) 1)} is VALID [2022-02-20 23:39:18,907 INFO L290 TraceCheckUtils]: 11: Hoare triple {1900#(= (select |#valid| |ULTIMATE.start_main_~p~1#1.base|) 1)} main_#t~ret8#1 := cstrlen_#res#1;assume { :end_inline_cstrlen } true;assume -2147483648 <= main_#t~ret8#1 && main_#t~ret8#1 <= 2147483647;main_~res~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1; {1900#(= (select |#valid| |ULTIMATE.start_main_~p~1#1.base|) 1)} is VALID [2022-02-20 23:39:18,907 INFO L290 TraceCheckUtils]: 12: Hoare triple {1900#(= (select |#valid| |ULTIMATE.start_main_~p~1#1.base|) 1)} assume 0 == main_~p~1#1.offset; {1900#(= (select |#valid| |ULTIMATE.start_main_~p~1#1.base|) 1)} is VALID [2022-02-20 23:39:18,907 INFO L290 TraceCheckUtils]: 13: Hoare triple {1900#(= (select |#valid| |ULTIMATE.start_main_~p~1#1.base|) 1)} assume main_~p~1#1.base < #StackHeapBarrier; {1900#(= (select |#valid| |ULTIMATE.start_main_~p~1#1.base|) 1)} is VALID [2022-02-20 23:39:18,908 INFO L290 TraceCheckUtils]: 14: Hoare triple {1900#(= (select |#valid| |ULTIMATE.start_main_~p~1#1.base|) 1)} assume !(0 == main_~p~1#1.base || 1 == #valid[main_~p~1#1.base]); {1897#false} is VALID [2022-02-20 23:39:18,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:39:18,908 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:39:18,908 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908571414] [2022-02-20 23:39:18,908 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908571414] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:39:18,908 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:39:18,908 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:39:18,909 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099672647] [2022-02-20 23:39:18,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:39:18,909 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-02-20 23:39:18,909 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:39:18,909 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 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-02-20 23:39:18,918 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:39:18,918 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:39:18,918 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:39:18,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:39:18,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:39:18,919 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-02-20 23:39:18,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:39:18,975 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2022-02-20 23:39:18,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 23:39:18,976 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-02-20 23:39:18,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:39:18,976 INFO L82 GeneralOperation]: Start removeUnreachable. 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-02-20 23:39:18,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 24 transitions. [2022-02-20 23:39:18,977 INFO L82 GeneralOperation]: Start removeUnreachable. 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-02-20 23:39:18,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 24 transitions. [2022-02-20 23:39:18,977 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 24 transitions. [2022-02-20 23:39:18,995 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:39:18,996 INFO L225 Difference]: With dead ends: 30 [2022-02-20 23:39:18,996 INFO L226 Difference]: Without dead ends: 30 [2022-02-20 23:39:18,996 INFO L932 BasicCegarLoop]: 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-02-20 23:39:18,997 INFO L933 BasicCegarLoop]: 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-02-20 23:39:18,997 INFO L934 BasicCegarLoop]: 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-02-20 23:39:18,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-02-20 23:39:18,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-02-20 23:39:18,998 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:39:18,998 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second 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-02-20 23:39:18,999 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second 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-02-20 23:39:18,999 INFO L87 Difference]: Start difference. First operand 30 states. Second 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-02-20 23:39:18,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:39:18,999 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2022-02-20 23:39:18,999 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2022-02-20 23:39:19,000 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:39:19,000 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:39:19,000 INFO L74 IsIncluded]: Start isIncluded. First 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) Second operand 30 states. [2022-02-20 23:39:19,000 INFO L87 Difference]: Start difference. First 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) Second operand 30 states. [2022-02-20 23:39:19,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:39:19,000 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2022-02-20 23:39:19,001 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2022-02-20 23:39:19,001 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:39:19,001 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:39:19,001 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:39:19,001 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:39:19,001 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-02-20 23:39:19,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2022-02-20 23:39:19,002 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 15 [2022-02-20 23:39:19,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:39:19,002 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2022-02-20 23:39:19,002 INFO L471 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-02-20 23:39:19,002 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2022-02-20 23:39:19,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-02-20 23:39:19,002 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:39:19,002 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:39:19,003 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-02-20 23:39:19,003 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 6 more)] === [2022-02-20 23:39:19,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:39:19,003 INFO L85 PathProgramCache]: Analyzing trace with hash 1218024458, now seen corresponding path program 1 times [2022-02-20 23:39:19,003 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:39:19,003 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675930744] [2022-02-20 23:39:19,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:39:19,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:39:19,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 23:39:19,019 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 23:39:19,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 23:39:19,043 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-20 23:39:19,043 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 23:39:19,044 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr5REQUIRES_VIOLATION (9 of 10 remaining) [2022-02-20 23:39:19,045 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATION (8 of 10 remaining) [2022-02-20 23:39:19,045 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATION (7 of 10 remaining) [2022-02-20 23:39:19,045 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATION (6 of 10 remaining) [2022-02-20 23:39:19,045 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATION (5 of 10 remaining) [2022-02-20 23:39:19,045 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATION (4 of 10 remaining) [2022-02-20 23:39:19,045 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_FREE (3 of 10 remaining) [2022-02-20 23:39:19,045 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_FREE (2 of 10 remaining) [2022-02-20 23:39:19,046 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_FREE (1 of 10 remaining) [2022-02-20 23:39:19,046 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (0 of 10 remaining) [2022-02-20 23:39:19,046 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-02-20 23:39:19,048 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:39:19,050 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 23:39:19,066 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 11:39:19 BoogieIcfgContainer [2022-02-20 23:39:19,066 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 23:39:19,066 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 23:39:19,066 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 23:39:19,066 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 23:39:19,067 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:39:14" (3/4) ... [2022-02-20 23:39:19,068 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-02-20 23:39:19,090 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-20 23:39:19,091 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 23:39:19,091 INFO L158 Benchmark]: Toolchain (without parser) took 5580.98ms. Allocated memory was 88.1MB in the beginning and 169.9MB in the end (delta: 81.8MB). Free memory was 46.4MB in the beginning and 68.7MB in the end (delta: -22.3MB). Peak memory consumption was 60.3MB. Max. memory is 16.1GB. [2022-02-20 23:39:19,092 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 88.1MB. Free memory was 63.7MB in the beginning and 63.7MB in the end (delta: 44.5kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 23:39:19,092 INFO L158 Benchmark]: CACSL2BoogieTranslator took 302.58ms. Allocated memory was 88.1MB in the beginning and 125.8MB in the end (delta: 37.7MB). Free memory was 46.1MB in the beginning and 91.6MB in the end (delta: -45.5MB). Peak memory consumption was 6.4MB. Max. memory is 16.1GB. [2022-02-20 23:39:19,092 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.31ms. Allocated memory is still 125.8MB. Free memory was 91.6MB in the beginning and 89.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 23:39:19,092 INFO L158 Benchmark]: Boogie Preprocessor took 41.42ms. Allocated memory is still 125.8MB. Free memory was 89.5MB in the beginning and 88.2MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 23:39:19,093 INFO L158 Benchmark]: RCFGBuilder took 632.94ms. Allocated memory is still 125.8MB. Free memory was 88.2MB in the beginning and 93.9MB in the end (delta: -5.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-02-20 23:39:19,093 INFO L158 Benchmark]: TraceAbstraction took 4525.44ms. Allocated memory was 125.8MB in the beginning and 169.9MB in the end (delta: 44.0MB). Free memory was 93.4MB in the beginning and 70.8MB in the end (delta: 22.7MB). Peak memory consumption was 68.8MB. Max. memory is 16.1GB. [2022-02-20 23:39:19,093 INFO L158 Benchmark]: Witness Printer took 24.48ms. Allocated memory is still 169.9MB. Free memory was 70.8MB in the beginning and 68.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 23:39:19,094 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 88.1MB. Free memory was 63.7MB in the beginning and 63.7MB in the end (delta: 44.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 302.58ms. Allocated memory was 88.1MB in the beginning and 125.8MB in the end (delta: 37.7MB). Free memory was 46.1MB in the beginning and 91.6MB in the end (delta: -45.5MB). Peak memory consumption was 6.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.31ms. Allocated memory is still 125.8MB. Free memory was 91.6MB in the beginning and 89.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 41.42ms. Allocated memory is still 125.8MB. Free memory was 89.5MB in the beginning and 88.2MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 632.94ms. Allocated memory is still 125.8MB. Free memory was 88.2MB in the beginning and 93.9MB in the end (delta: -5.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * TraceAbstraction took 4525.44ms. Allocated memory was 125.8MB in the beginning and 169.9MB in the end (delta: 44.0MB). Free memory was 93.4MB in the beginning and 70.8MB in the end (delta: 22.7MB). Peak memory consumption was 68.8MB. Max. memory is 16.1GB. * Witness Printer took 24.48ms. Allocated memory is still 169.9MB. Free memory was 70.8MB in the beginning and 68.7MB 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: 532]: 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: 523]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 523]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 526]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 526]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 532]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 539]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 539]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 539]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 536]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 31 locations, 10 error locations. Started 1 CEGAR loops. OverallTime: 4.4s, OverallIterations: 13, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 601 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 601 mSDsluCounter, 693 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 445 mSDsCounter, 32 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 409 IncrementalHoareTripleChecker+Invalid, 441 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 32 mSolverCounterUnsat, 248 mSDtfsCounter, 409 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.3s 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-02-20 23:39:19,131 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)