./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/array-memsafety/cstrchr_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/cstrchr_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 10a3b461143c2c5d394f7bd34cd6fefed4195b79a5252178f7ede404a303cf96 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 23:39:06,704 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 23:39:06,706 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 23:39:06,741 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 23:39:06,741 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 23:39:06,744 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 23:39:06,745 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 23:39:06,747 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 23:39:06,749 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 23:39:06,752 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 23:39:06,753 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 23:39:06,754 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 23:39:06,754 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 23:39:06,756 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 23:39:06,757 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 23:39:06,760 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 23:39:06,760 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 23:39:06,761 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 23:39:06,763 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 23:39:06,767 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 23:39:06,768 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 23:39:06,768 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 23:39:06,770 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 23:39:06,770 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 23:39:06,775 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 23:39:06,776 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 23:39:06,776 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 23:39:06,777 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 23:39:06,777 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 23:39:06,778 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 23:39:06,778 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 23:39:06,779 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 23:39:06,780 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 23:39:06,781 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 23:39:06,782 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 23:39:06,782 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 23:39:06,783 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 23:39:06,783 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 23:39:06,783 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 23:39:06,784 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 23:39:06,785 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 23:39:06,786 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:06,814 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 23:39:06,814 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 23:39:06,815 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 23:39:06,815 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 23:39:06,816 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 23:39:06,816 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 23:39:06,816 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 23:39:06,816 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 23:39:06,817 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 23:39:06,817 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 23:39:06,817 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 23:39:06,818 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-20 23:39:06,818 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 23:39:06,818 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 23:39:06,818 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 23:39:06,818 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-02-20 23:39:06,818 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-02-20 23:39:06,819 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-02-20 23:39:06,819 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 23:39:06,819 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 23:39:06,819 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 23:39:06,819 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 23:39:06,819 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 23:39:06,819 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 23:39:06,820 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 23:39:06,820 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:39:06,821 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 23:39:06,821 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 23:39:06,821 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 23:39:06,822 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 23:39:06,822 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 -> 10a3b461143c2c5d394f7bd34cd6fefed4195b79a5252178f7ede404a303cf96 [2022-02-20 23:39:07,020 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 23:39:07,035 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 23:39:07,037 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 23:39:07,038 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 23:39:07,039 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 23:39:07,040 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety/cstrchr_unsafe.i [2022-02-20 23:39:07,087 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5010867d4/8c8a44d8faa1414eb23c70bf647f85a4/FLAG72074b27a [2022-02-20 23:39:07,473 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 23:39:07,473 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/cstrchr_unsafe.i [2022-02-20 23:39:07,482 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5010867d4/8c8a44d8faa1414eb23c70bf647f85a4/FLAG72074b27a [2022-02-20 23:39:07,904 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5010867d4/8c8a44d8faa1414eb23c70bf647f85a4 [2022-02-20 23:39:07,906 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 23:39:07,907 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 23:39:07,911 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 23:39:07,911 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 23:39:07,913 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 23:39:07,915 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:39:07" (1/1) ... [2022-02-20 23:39:07,916 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@475de22b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:39:07, skipping insertion in model container [2022-02-20 23:39:07,916 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:39:07" (1/1) ... [2022-02-20 23:39:07,920 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 23:39:07,960 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 23:39:08,185 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:39:08,193 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 23:39:08,240 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:39:08,275 INFO L208 MainTranslator]: Completed translation [2022-02-20 23:39:08,276 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:39:08 WrapperNode [2022-02-20 23:39:08,276 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 23:39:08,277 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 23:39:08,277 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 23:39:08,277 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 23:39:08,283 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:08" (1/1) ... [2022-02-20 23:39:08,300 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:08" (1/1) ... [2022-02-20 23:39:08,319 INFO L137 Inliner]: procedures = 118, calls = 12, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 71 [2022-02-20 23:39:08,320 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 23:39:08,320 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 23:39:08,320 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 23:39:08,321 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 23:39:08,326 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:08" (1/1) ... [2022-02-20 23:39:08,326 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:08" (1/1) ... [2022-02-20 23:39:08,337 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:08" (1/1) ... [2022-02-20 23:39:08,337 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:08" (1/1) ... [2022-02-20 23:39:08,344 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:08" (1/1) ... [2022-02-20 23:39:08,346 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:08" (1/1) ... [2022-02-20 23:39:08,353 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:08" (1/1) ... [2022-02-20 23:39:08,355 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 23:39:08,356 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 23:39:08,356 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 23:39:08,356 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 23:39:08,357 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:39:08" (1/1) ... [2022-02-20 23:39:08,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:39:08,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:39:08,385 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:08,390 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:08,422 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 23:39:08,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 23:39:08,422 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 23:39:08,422 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 23:39:08,422 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 23:39:08,422 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 23:39:08,525 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 23:39:08,527 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 23:39:08,924 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 23:39:08,929 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 23:39:08,930 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-20 23:39:08,931 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:39:08 BoogieIcfgContainer [2022-02-20 23:39:08,931 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 23:39:08,932 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 23:39:08,932 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 23:39:08,938 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 23:39:08,938 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 11:39:07" (1/3) ... [2022-02-20 23:39:08,939 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50519a65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:39:08, skipping insertion in model container [2022-02-20 23:39:08,939 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:39:08" (2/3) ... [2022-02-20 23:39:08,939 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50519a65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:39:08, skipping insertion in model container [2022-02-20 23:39:08,940 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:39:08" (3/3) ... [2022-02-20 23:39:08,941 INFO L111 eAbstractionObserver]: Analyzing ICFG cstrchr_unsafe.i [2022-02-20 23:39:08,944 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 23:39:08,945 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 16 error locations. [2022-02-20 23:39:08,974 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 23:39:08,979 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:08,979 INFO L340 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2022-02-20 23:39:08,991 INFO L276 IsEmpty]: Start isEmpty. Operand has 45 states, 28 states have (on average 1.8214285714285714) internal successors, (51), 44 states have internal predecessors, (51), 0 states have call successors, (0), 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:08,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-02-20 23:39:08,995 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:39:08,996 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-02-20 23:39:08,996 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 12 more)] === [2022-02-20 23:39:08,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:39:09,000 INFO L85 PathProgramCache]: Analyzing trace with hash 889508873, now seen corresponding path program 1 times [2022-02-20 23:39:09,006 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:39:09,023 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880317125] [2022-02-20 23:39:09,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:39:09,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:39:09,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:39:09,145 INFO L290 TraceCheckUtils]: 0: Hoare triple {48#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {48#true} is VALID [2022-02-20 23:39:09,146 INFO L290 TraceCheckUtils]: 1: Hoare triple {48#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset, main_#t~nondet13#1, main_#t~ret14#1.base, main_#t~ret14#1.offset, main_#t~mem15#1, main_~s~0#1.base, main_~s~0#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; {48#true} is VALID [2022-02-20 23:39:09,147 INFO L290 TraceCheckUtils]: 2: Hoare triple {48#true} assume build_nondet_String_~length~0#1 < 1;build_nondet_String_~length~0#1 := 1; {50#(<= |ULTIMATE.start_build_nondet_String_~length~0#1| 1)} is VALID [2022-02-20 23:39:09,148 INFO L290 TraceCheckUtils]: 3: Hoare triple {50#(<= |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; {51#(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:09,148 INFO L290 TraceCheckUtils]: 4: Hoare triple {51#(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; {49#false} is VALID [2022-02-20 23:39:09,149 INFO L290 TraceCheckUtils]: 5: Hoare triple {49#false} assume !(1 == #valid[build_nondet_String_~nondetString~0#1.base]); {49#false} is VALID [2022-02-20 23:39:09,149 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:09,150 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:39:09,150 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880317125] [2022-02-20 23:39:09,150 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880317125] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:39:09,151 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:39:09,151 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:39:09,152 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262242602] [2022-02-20 23:39:09,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:39:09,156 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:09,156 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:39:09,158 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:09,167 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:09,168 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:39:09,169 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:39:09,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:39:09,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:39:09,187 INFO L87 Difference]: Start difference. First operand has 45 states, 28 states have (on average 1.8214285714285714) internal successors, (51), 44 states have internal predecessors, (51), 0 states have call successors, (0), 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:09,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:39:09,356 INFO L93 Difference]: Finished difference Result 82 states and 88 transitions. [2022-02-20 23:39:09,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 23:39:09,357 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:09,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:39:09,358 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:09,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 93 transitions. [2022-02-20 23:39:09,367 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:09,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 93 transitions. [2022-02-20 23:39:09,369 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 93 transitions. [2022-02-20 23:39:09,449 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:39:09,461 INFO L225 Difference]: With dead ends: 82 [2022-02-20 23:39:09,461 INFO L226 Difference]: Without dead ends: 78 [2022-02-20 23:39:09,462 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:09,466 INFO L933 BasicCegarLoop]: 45 mSDtfsCounter, 39 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 124 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:09,467 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 124 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:09,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-02-20 23:39:09,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 45. [2022-02-20 23:39:09,487 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:39:09,488 INFO L82 GeneralOperation]: Start isEquivalent. First operand 78 states. Second operand has 45 states, 29 states have (on average 1.6896551724137931) internal successors, (49), 44 states have internal predecessors, (49), 0 states have call successors, (0), 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:09,488 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand has 45 states, 29 states have (on average 1.6896551724137931) internal successors, (49), 44 states have internal predecessors, (49), 0 states have call successors, (0), 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:09,489 INFO L87 Difference]: Start difference. First operand 78 states. Second operand has 45 states, 29 states have (on average 1.6896551724137931) internal successors, (49), 44 states have internal predecessors, (49), 0 states have call successors, (0), 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:09,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:39:09,495 INFO L93 Difference]: Finished difference Result 78 states and 84 transitions. [2022-02-20 23:39:09,495 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 84 transitions. [2022-02-20 23:39:09,496 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:39:09,496 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:39:09,497 INFO L74 IsIncluded]: Start isIncluded. First operand has 45 states, 29 states have (on average 1.6896551724137931) internal successors, (49), 44 states have internal predecessors, (49), 0 states have call successors, (0), 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 78 states. [2022-02-20 23:39:09,497 INFO L87 Difference]: Start difference. First operand has 45 states, 29 states have (on average 1.6896551724137931) internal successors, (49), 44 states have internal predecessors, (49), 0 states have call successors, (0), 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 78 states. [2022-02-20 23:39:09,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:39:09,504 INFO L93 Difference]: Finished difference Result 78 states and 84 transitions. [2022-02-20 23:39:09,504 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 84 transitions. [2022-02-20 23:39:09,505 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:39:09,505 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:39:09,505 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:39:09,505 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:39:09,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 29 states have (on average 1.6896551724137931) internal successors, (49), 44 states have internal predecessors, (49), 0 states have call successors, (0), 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:09,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2022-02-20 23:39:09,512 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 6 [2022-02-20 23:39:09,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:39:09,512 INFO L470 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2022-02-20 23:39:09,514 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:09,514 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2022-02-20 23:39:09,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-02-20 23:39:09,515 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:39:09,515 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-02-20 23:39:09,516 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 23:39:09,517 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 12 more)] === [2022-02-20 23:39:09,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:39:09,519 INFO L85 PathProgramCache]: Analyzing trace with hash 889508820, now seen corresponding path program 1 times [2022-02-20 23:39:09,520 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:39:09,520 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77912417] [2022-02-20 23:39:09,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:39:09,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:39:09,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:39:09,563 INFO L290 TraceCheckUtils]: 0: Hoare triple {337#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {337#true} is VALID [2022-02-20 23:39:09,564 INFO L290 TraceCheckUtils]: 1: Hoare triple {337#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset, main_#t~nondet13#1, main_#t~ret14#1.base, main_#t~ret14#1.offset, main_#t~mem15#1, main_~s~0#1.base, main_~s~0#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; {337#true} is VALID [2022-02-20 23:39:09,564 INFO L290 TraceCheckUtils]: 2: Hoare triple {337#true} assume build_nondet_String_~length~0#1 < 1;build_nondet_String_~length~0#1 := 1; {337#true} is VALID [2022-02-20 23:39:09,565 INFO L290 TraceCheckUtils]: 3: Hoare triple {337#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; {339#(= (select |#valid| |ULTIMATE.start_build_nondet_String_~nondetString~0#1.base|) 1)} is VALID [2022-02-20 23:39:09,565 INFO L290 TraceCheckUtils]: 4: Hoare triple {339#(= (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); {339#(= (select |#valid| |ULTIMATE.start_build_nondet_String_~nondetString~0#1.base|) 1)} is VALID [2022-02-20 23:39:09,566 INFO L290 TraceCheckUtils]: 5: Hoare triple {339#(= (select |#valid| |ULTIMATE.start_build_nondet_String_~nondetString~0#1.base|) 1)} assume !(1 == #valid[build_nondet_String_~nondetString~0#1.base]); {338#false} is VALID [2022-02-20 23:39:09,566 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:09,566 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:39:09,567 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77912417] [2022-02-20 23:39:09,567 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77912417] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:39:09,567 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:39:09,567 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:39:09,567 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324262836] [2022-02-20 23:39:09,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:39:09,568 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:09,569 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:39:09,569 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:09,574 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:09,574 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:39:09,574 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:39:09,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:39:09,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:39:09,575 INFO L87 Difference]: Start difference. First operand 45 states and 49 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:09,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:39:09,626 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2022-02-20 23:39:09,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:39:09,627 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:09,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:39:09,627 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:09,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 47 transitions. [2022-02-20 23:39:09,628 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:09,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 47 transitions. [2022-02-20 23:39:09,629 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 47 transitions. [2022-02-20 23:39:09,666 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:39:09,668 INFO L225 Difference]: With dead ends: 43 [2022-02-20 23:39:09,668 INFO L226 Difference]: Without dead ends: 43 [2022-02-20 23:39:09,668 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:09,669 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 37 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:39:09,669 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 32 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:39:09,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-02-20 23:39:09,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2022-02-20 23:39:09,672 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:39:09,672 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand has 43 states, 29 states have (on average 1.6206896551724137) internal successors, (47), 42 states have internal predecessors, (47), 0 states have call successors, (0), 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:09,672 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand has 43 states, 29 states have (on average 1.6206896551724137) internal successors, (47), 42 states have internal predecessors, (47), 0 states have call successors, (0), 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:09,673 INFO L87 Difference]: Start difference. First operand 43 states. Second operand has 43 states, 29 states have (on average 1.6206896551724137) internal successors, (47), 42 states have internal predecessors, (47), 0 states have call successors, (0), 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:09,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:39:09,674 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2022-02-20 23:39:09,674 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2022-02-20 23:39:09,674 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:39:09,675 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:39:09,675 INFO L74 IsIncluded]: Start isIncluded. First operand has 43 states, 29 states have (on average 1.6206896551724137) internal successors, (47), 42 states have internal predecessors, (47), 0 states have call successors, (0), 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 43 states. [2022-02-20 23:39:09,675 INFO L87 Difference]: Start difference. First operand has 43 states, 29 states have (on average 1.6206896551724137) internal successors, (47), 42 states have internal predecessors, (47), 0 states have call successors, (0), 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 43 states. [2022-02-20 23:39:09,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:39:09,676 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2022-02-20 23:39:09,677 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2022-02-20 23:39:09,677 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:39:09,677 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:39:09,677 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:39:09,677 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:39:09,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 29 states have (on average 1.6206896551724137) internal successors, (47), 42 states have internal predecessors, (47), 0 states have call successors, (0), 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:09,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2022-02-20 23:39:09,679 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 6 [2022-02-20 23:39:09,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:39:09,679 INFO L470 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2022-02-20 23:39:09,679 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:09,679 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2022-02-20 23:39:09,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-02-20 23:39:09,680 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:39:09,680 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-02-20 23:39:09,680 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 23:39:09,680 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 12 more)] === [2022-02-20 23:39:09,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:39:09,681 INFO L85 PathProgramCache]: Analyzing trace with hash 889508821, now seen corresponding path program 1 times [2022-02-20 23:39:09,681 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:39:09,681 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152278825] [2022-02-20 23:39:09,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:39:09,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:39:09,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:39:09,735 INFO L290 TraceCheckUtils]: 0: Hoare triple {514#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {514#true} is VALID [2022-02-20 23:39:09,735 INFO L290 TraceCheckUtils]: 1: Hoare triple {514#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset, main_#t~nondet13#1, main_#t~ret14#1.base, main_#t~ret14#1.offset, main_#t~mem15#1, main_~s~0#1.base, main_~s~0#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; {514#true} is VALID [2022-02-20 23:39:09,736 INFO L290 TraceCheckUtils]: 2: Hoare triple {514#true} assume build_nondet_String_~length~0#1 < 1;build_nondet_String_~length~0#1 := 1; {516#(<= 1 |ULTIMATE.start_build_nondet_String_~length~0#1|)} is VALID [2022-02-20 23:39:09,736 INFO L290 TraceCheckUtils]: 3: Hoare triple {516#(<= 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; {517#(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:09,737 INFO L290 TraceCheckUtils]: 4: Hoare triple {517#(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); {517#(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:09,738 INFO L290 TraceCheckUtils]: 5: Hoare triple {517#(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)); {515#false} is VALID [2022-02-20 23:39:09,738 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:09,738 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:39:09,738 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152278825] [2022-02-20 23:39:09,738 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152278825] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:39:09,739 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:39:09,739 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:39:09,739 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558351691] [2022-02-20 23:39:09,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:39:09,739 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:09,740 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:39:09,740 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:09,744 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:09,745 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:39:09,745 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:39:09,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:39:09,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:39:09,746 INFO L87 Difference]: Start difference. First operand 43 states and 47 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:09,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:39:09,811 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2022-02-20 23:39:09,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 23:39:09,811 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:09,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:39:09,812 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:09,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 45 transitions. [2022-02-20 23:39:09,813 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:09,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 45 transitions. [2022-02-20 23:39:09,813 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 45 transitions. [2022-02-20 23:39:09,847 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:39:09,848 INFO L225 Difference]: With dead ends: 42 [2022-02-20 23:39:09,848 INFO L226 Difference]: Without dead ends: 42 [2022-02-20 23:39:09,848 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:09,849 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 78 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:39:09,849 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [78 Valid, 30 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:39:09,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-02-20 23:39:09,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2022-02-20 23:39:09,851 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:39:09,852 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand has 42 states, 29 states have (on average 1.5862068965517242) internal successors, (46), 41 states have internal predecessors, (46), 0 states have call successors, (0), 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:09,852 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand has 42 states, 29 states have (on average 1.5862068965517242) internal successors, (46), 41 states have internal predecessors, (46), 0 states have call successors, (0), 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:09,852 INFO L87 Difference]: Start difference. First operand 42 states. Second operand has 42 states, 29 states have (on average 1.5862068965517242) internal successors, (46), 41 states have internal predecessors, (46), 0 states have call successors, (0), 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:09,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:39:09,853 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2022-02-20 23:39:09,853 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2022-02-20 23:39:09,854 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:39:09,854 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:39:09,854 INFO L74 IsIncluded]: Start isIncluded. First operand has 42 states, 29 states have (on average 1.5862068965517242) internal successors, (46), 41 states have internal predecessors, (46), 0 states have call successors, (0), 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:09,854 INFO L87 Difference]: Start difference. First operand has 42 states, 29 states have (on average 1.5862068965517242) internal successors, (46), 41 states have internal predecessors, (46), 0 states have call successors, (0), 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:09,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:39:09,855 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2022-02-20 23:39:09,856 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2022-02-20 23:39:09,856 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:39:09,856 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:39:09,856 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:39:09,856 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:39:09,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 29 states have (on average 1.5862068965517242) internal successors, (46), 41 states have internal predecessors, (46), 0 states have call successors, (0), 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:09,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2022-02-20 23:39:09,857 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 6 [2022-02-20 23:39:09,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:39:09,858 INFO L470 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2022-02-20 23:39:09,858 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:09,858 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2022-02-20 23:39:09,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-02-20 23:39:09,858 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:39:09,859 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-02-20 23:39:09,859 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 23:39:09,859 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 12 more)] === [2022-02-20 23:39:09,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:39:09,860 INFO L85 PathProgramCache]: Analyzing trace with hash 889568456, now seen corresponding path program 1 times [2022-02-20 23:39:09,860 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:39:09,860 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205740913] [2022-02-20 23:39:09,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:39:09,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:39:09,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:39:09,912 INFO L290 TraceCheckUtils]: 0: Hoare triple {688#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {688#true} is VALID [2022-02-20 23:39:09,913 INFO L290 TraceCheckUtils]: 1: Hoare triple {688#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset, main_#t~nondet13#1, main_#t~ret14#1.base, main_#t~ret14#1.offset, main_#t~mem15#1, main_~s~0#1.base, main_~s~0#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; {688#true} is VALID [2022-02-20 23:39:09,913 INFO L290 TraceCheckUtils]: 2: Hoare triple {688#true} assume !(build_nondet_String_~length~0#1 < 1); {690#(<= 1 |ULTIMATE.start_build_nondet_String_~length~0#1|)} is VALID [2022-02-20 23:39:09,914 INFO L290 TraceCheckUtils]: 3: Hoare triple {690#(<= 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; {691#(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:09,915 INFO L290 TraceCheckUtils]: 4: Hoare triple {691#(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; {692#(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:09,915 INFO L290 TraceCheckUtils]: 5: Hoare triple {692#(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); {689#false} is VALID [2022-02-20 23:39:09,916 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:09,916 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:39:09,916 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205740913] [2022-02-20 23:39:09,916 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205740913] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:39:09,916 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:39:09,916 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:39:09,917 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567357962] [2022-02-20 23:39:09,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:39:09,917 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:09,917 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:39:09,918 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:09,922 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:09,923 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:39:09,923 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:39:09,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:39:09,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:39:09,924 INFO L87 Difference]: Start difference. First operand 42 states and 46 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:10,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:39:10,063 INFO L93 Difference]: Finished difference Result 77 states and 84 transitions. [2022-02-20 23:39:10,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 23:39:10,063 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:10,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:39:10,063 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:10,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 83 transitions. [2022-02-20 23:39:10,065 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:10,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 83 transitions. [2022-02-20 23:39:10,066 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 83 transitions. [2022-02-20 23:39:10,137 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:39:10,138 INFO L225 Difference]: With dead ends: 77 [2022-02-20 23:39:10,138 INFO L226 Difference]: Without dead ends: 77 [2022-02-20 23:39:10,138 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:10,139 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 77 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:39:10,140 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [77 Valid, 82 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:39:10,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-02-20 23:39:10,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 44. [2022-02-20 23:39:10,142 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:39:10,142 INFO L82 GeneralOperation]: Start isEquivalent. First operand 77 states. Second operand has 44 states, 31 states have (on average 1.5806451612903225) internal successors, (49), 43 states have internal predecessors, (49), 0 states have call successors, (0), 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:10,143 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand has 44 states, 31 states have (on average 1.5806451612903225) internal successors, (49), 43 states have internal predecessors, (49), 0 states have call successors, (0), 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:10,143 INFO L87 Difference]: Start difference. First operand 77 states. Second operand has 44 states, 31 states have (on average 1.5806451612903225) internal successors, (49), 43 states have internal predecessors, (49), 0 states have call successors, (0), 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:10,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:39:10,161 INFO L93 Difference]: Finished difference Result 77 states and 84 transitions. [2022-02-20 23:39:10,161 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 84 transitions. [2022-02-20 23:39:10,161 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:39:10,161 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:39:10,161 INFO L74 IsIncluded]: Start isIncluded. First operand has 44 states, 31 states have (on average 1.5806451612903225) internal successors, (49), 43 states have internal predecessors, (49), 0 states have call successors, (0), 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 77 states. [2022-02-20 23:39:10,161 INFO L87 Difference]: Start difference. First operand has 44 states, 31 states have (on average 1.5806451612903225) internal successors, (49), 43 states have internal predecessors, (49), 0 states have call successors, (0), 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 77 states. [2022-02-20 23:39:10,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:39:10,163 INFO L93 Difference]: Finished difference Result 77 states and 84 transitions. [2022-02-20 23:39:10,163 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 84 transitions. [2022-02-20 23:39:10,164 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:39:10,164 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:39:10,164 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:39:10,164 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:39:10,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 31 states have (on average 1.5806451612903225) internal successors, (49), 43 states have internal predecessors, (49), 0 states have call successors, (0), 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:10,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 49 transitions. [2022-02-20 23:39:10,165 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 49 transitions. Word has length 6 [2022-02-20 23:39:10,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:39:10,165 INFO L470 AbstractCegarLoop]: Abstraction has 44 states and 49 transitions. [2022-02-20 23:39:10,165 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:10,165 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2022-02-20 23:39:10,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-02-20 23:39:10,166 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:39:10,166 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:39:10,166 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 23:39:10,166 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 12 more)] === [2022-02-20 23:39:10,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:39:10,167 INFO L85 PathProgramCache]: Analyzing trace with hash -590959631, now seen corresponding path program 1 times [2022-02-20 23:39:10,167 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:39:10,167 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904735407] [2022-02-20 23:39:10,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:39:10,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:39:10,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:39:10,252 INFO L290 TraceCheckUtils]: 0: Hoare triple {970#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {970#true} is VALID [2022-02-20 23:39:10,252 INFO L290 TraceCheckUtils]: 1: Hoare triple {970#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset, main_#t~nondet13#1, main_#t~ret14#1.base, main_#t~ret14#1.offset, main_#t~mem15#1, main_~s~0#1.base, main_~s~0#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; {970#true} is VALID [2022-02-20 23:39:10,253 INFO L290 TraceCheckUtils]: 2: Hoare triple {970#true} assume build_nondet_String_~length~0#1 < 1;build_nondet_String_~length~0#1 := 1; {970#true} is VALID [2022-02-20 23:39:10,253 INFO L290 TraceCheckUtils]: 3: Hoare triple {970#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; {970#true} is VALID [2022-02-20 23:39:10,253 INFO L290 TraceCheckUtils]: 4: Hoare triple {970#true} assume !(build_nondet_String_~i~0#1 < build_nondet_String_~length~0#1 - 1); {970#true} is VALID [2022-02-20 23:39:10,253 INFO L290 TraceCheckUtils]: 5: Hoare triple {970#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 {972#(= (select |#valid| |ULTIMATE.start_build_nondet_String_~nondetString~0#1.base|) 1)} is VALID [2022-02-20 23:39:10,254 INFO L290 TraceCheckUtils]: 6: Hoare triple {972#(= (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; {973#(= (select |#valid| |ULTIMATE.start_build_nondet_String_#res#1.base|) 1)} is VALID [2022-02-20 23:39:10,255 INFO L290 TraceCheckUtils]: 7: Hoare triple {973#(= (select |#valid| |ULTIMATE.start_build_nondet_String_#res#1.base|) 1)} main_#t~ret12#1.base, main_#t~ret12#1.offset := build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;assume { :end_inline_build_nondet_String } true;main_~s~0#1.base, main_~s~0#1.offset := main_#t~ret12#1.base, main_#t~ret12#1.offset;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647;assume { :begin_inline_cstrchr } true;cstrchr_#in~s#1.base, cstrchr_#in~s#1.offset, cstrchr_#in~c#1 := main_~s~0#1.base, main_~s~0#1.offset, main_#t~nondet13#1;havoc cstrchr_#res#1.base, cstrchr_#res#1.offset;havoc cstrchr_#t~post9#1.base, cstrchr_#t~post9#1.offset, cstrchr_#t~mem6#1, cstrchr_#t~mem7#1, cstrchr_#t~short8#1, cstrchr_#t~mem10#1, cstrchr_#t~ite11#1.base, cstrchr_#t~ite11#1.offset, cstrchr_~s#1.base, cstrchr_~s#1.offset, cstrchr_~c#1;cstrchr_~s#1.base, cstrchr_~s#1.offset := cstrchr_#in~s#1.base, cstrchr_#in~s#1.offset;cstrchr_~c#1 := cstrchr_#in~c#1; {974#(= (select |#valid| |ULTIMATE.start_cstrchr_~s#1.base|) 1)} is VALID [2022-02-20 23:39:10,255 INFO L290 TraceCheckUtils]: 8: Hoare triple {974#(= (select |#valid| |ULTIMATE.start_cstrchr_~s#1.base|) 1)} assume !(1 == #valid[cstrchr_~s#1.base]); {971#false} is VALID [2022-02-20 23:39:10,255 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:10,255 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:39:10,256 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904735407] [2022-02-20 23:39:10,256 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904735407] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:39:10,256 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:39:10,256 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:39:10,256 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622788178] [2022-02-20 23:39:10,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:39:10,257 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:10,257 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:39:10,257 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:10,278 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:10,279 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:39:10,279 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:39:10,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:39:10,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:39:10,280 INFO L87 Difference]: Start difference. First operand 44 states and 49 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:10,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:39:10,404 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2022-02-20 23:39:10,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 23:39:10,404 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:10,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:39:10,405 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:10,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-02-20 23:39:10,405 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:10,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-02-20 23:39:10,406 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 44 transitions. [2022-02-20 23:39:10,456 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:39:10,457 INFO L225 Difference]: With dead ends: 41 [2022-02-20 23:39:10,457 INFO L226 Difference]: Without dead ends: 41 [2022-02-20 23:39:10,458 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:10,459 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 81 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:39:10,459 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [81 Valid, 38 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:39:10,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-02-20 23:39:10,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2022-02-20 23:39:10,463 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:39:10,463 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand has 41 states, 31 states have (on average 1.4838709677419355) internal successors, (46), 40 states have internal predecessors, (46), 0 states have call successors, (0), 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:10,464 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand has 41 states, 31 states have (on average 1.4838709677419355) internal successors, (46), 40 states have internal predecessors, (46), 0 states have call successors, (0), 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:10,464 INFO L87 Difference]: Start difference. First operand 41 states. Second operand has 41 states, 31 states have (on average 1.4838709677419355) internal successors, (46), 40 states have internal predecessors, (46), 0 states have call successors, (0), 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:10,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:39:10,465 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2022-02-20 23:39:10,465 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2022-02-20 23:39:10,465 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:39:10,465 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:39:10,466 INFO L74 IsIncluded]: Start isIncluded. First operand has 41 states, 31 states have (on average 1.4838709677419355) internal successors, (46), 40 states have internal predecessors, (46), 0 states have call successors, (0), 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:10,466 INFO L87 Difference]: Start difference. First operand has 41 states, 31 states have (on average 1.4838709677419355) internal successors, (46), 40 states have internal predecessors, (46), 0 states have call successors, (0), 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:10,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:39:10,467 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2022-02-20 23:39:10,467 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2022-02-20 23:39:10,467 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:39:10,467 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:39:10,467 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:39:10,467 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:39:10,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 31 states have (on average 1.4838709677419355) internal successors, (46), 40 states have internal predecessors, (46), 0 states have call successors, (0), 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:10,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2022-02-20 23:39:10,483 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 9 [2022-02-20 23:39:10,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:39:10,483 INFO L470 AbstractCegarLoop]: Abstraction has 41 states and 46 transitions. [2022-02-20 23:39:10,484 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:10,484 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2022-02-20 23:39:10,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-02-20 23:39:10,484 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:39:10,484 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:39:10,485 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 23:39:10,485 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 12 more)] === [2022-02-20 23:39:10,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:39:10,485 INFO L85 PathProgramCache]: Analyzing trace with hash -590959630, now seen corresponding path program 1 times [2022-02-20 23:39:10,485 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:39:10,486 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768951213] [2022-02-20 23:39:10,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:39:10,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:39:10,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:39:10,587 INFO L290 TraceCheckUtils]: 0: Hoare triple {1145#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {1145#true} is VALID [2022-02-20 23:39:10,587 INFO L290 TraceCheckUtils]: 1: Hoare triple {1145#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset, main_#t~nondet13#1, main_#t~ret14#1.base, main_#t~ret14#1.offset, main_#t~mem15#1, main_~s~0#1.base, main_~s~0#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; {1145#true} is VALID [2022-02-20 23:39:10,588 INFO L290 TraceCheckUtils]: 2: Hoare triple {1145#true} assume build_nondet_String_~length~0#1 < 1;build_nondet_String_~length~0#1 := 1; {1147#(<= 1 |ULTIMATE.start_build_nondet_String_~length~0#1|)} is VALID [2022-02-20 23:39:10,588 INFO L290 TraceCheckUtils]: 3: Hoare triple {1147#(<= 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; {1148#(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:10,589 INFO L290 TraceCheckUtils]: 4: Hoare triple {1148#(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); {1148#(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:10,589 INFO L290 TraceCheckUtils]: 5: Hoare triple {1148#(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 {1148#(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:10,590 INFO L290 TraceCheckUtils]: 6: Hoare triple {1148#(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; {1149#(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:10,590 INFO L290 TraceCheckUtils]: 7: Hoare triple {1149#(and (<= 1 (select |#length| |ULTIMATE.start_build_nondet_String_#res#1.base|)) (= |ULTIMATE.start_build_nondet_String_#res#1.offset| 0))} main_#t~ret12#1.base, main_#t~ret12#1.offset := build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;assume { :end_inline_build_nondet_String } true;main_~s~0#1.base, main_~s~0#1.offset := main_#t~ret12#1.base, main_#t~ret12#1.offset;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647;assume { :begin_inline_cstrchr } true;cstrchr_#in~s#1.base, cstrchr_#in~s#1.offset, cstrchr_#in~c#1 := main_~s~0#1.base, main_~s~0#1.offset, main_#t~nondet13#1;havoc cstrchr_#res#1.base, cstrchr_#res#1.offset;havoc cstrchr_#t~post9#1.base, cstrchr_#t~post9#1.offset, cstrchr_#t~mem6#1, cstrchr_#t~mem7#1, cstrchr_#t~short8#1, cstrchr_#t~mem10#1, cstrchr_#t~ite11#1.base, cstrchr_#t~ite11#1.offset, cstrchr_~s#1.base, cstrchr_~s#1.offset, cstrchr_~c#1;cstrchr_~s#1.base, cstrchr_~s#1.offset := cstrchr_#in~s#1.base, cstrchr_#in~s#1.offset;cstrchr_~c#1 := cstrchr_#in~c#1; {1150#(and (<= 1 (select |#length| |ULTIMATE.start_cstrchr_~s#1.base|)) (= |ULTIMATE.start_cstrchr_~s#1.offset| 0))} is VALID [2022-02-20 23:39:10,591 INFO L290 TraceCheckUtils]: 8: Hoare triple {1150#(and (<= 1 (select |#length| |ULTIMATE.start_cstrchr_~s#1.base|)) (= |ULTIMATE.start_cstrchr_~s#1.offset| 0))} assume !(1 + cstrchr_~s#1.offset <= #length[cstrchr_~s#1.base] && 0 <= cstrchr_~s#1.offset); {1146#false} is VALID [2022-02-20 23:39:10,591 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:10,591 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:39:10,591 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768951213] [2022-02-20 23:39:10,591 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768951213] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:39:10,592 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:39:10,592 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 23:39:10,592 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286966431] [2022-02-20 23:39:10,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:39:10,592 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:10,592 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:39:10,593 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:10,617 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:10,618 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 23:39:10,618 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:39:10,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 23:39:10,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:39:10,619 INFO L87 Difference]: Start difference. First operand 41 states and 46 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:10,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:39:10,821 INFO L93 Difference]: Finished difference Result 63 states and 70 transitions. [2022-02-20 23:39:10,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 23:39:10,821 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:10,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:39:10,821 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:10,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 68 transitions. [2022-02-20 23:39:10,822 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:10,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 68 transitions. [2022-02-20 23:39:10,823 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 68 transitions. [2022-02-20 23:39:10,876 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:39:10,877 INFO L225 Difference]: With dead ends: 63 [2022-02-20 23:39:10,877 INFO L226 Difference]: Without dead ends: 63 [2022-02-20 23:39:10,877 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:10,878 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 191 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:39:10,878 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [191 Valid, 55 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:39:10,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-02-20 23:39:10,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 48. [2022-02-20 23:39:10,880 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:39:10,880 INFO L82 GeneralOperation]: Start isEquivalent. First operand 63 states. Second operand has 48 states, 38 states have (on average 1.4473684210526316) internal successors, (55), 47 states have internal predecessors, (55), 0 states have call successors, (0), 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:10,881 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand has 48 states, 38 states have (on average 1.4473684210526316) internal successors, (55), 47 states have internal predecessors, (55), 0 states have call successors, (0), 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:10,881 INFO L87 Difference]: Start difference. First operand 63 states. Second operand has 48 states, 38 states have (on average 1.4473684210526316) internal successors, (55), 47 states have internal predecessors, (55), 0 states have call successors, (0), 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:10,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:39:10,882 INFO L93 Difference]: Finished difference Result 63 states and 70 transitions. [2022-02-20 23:39:10,882 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 70 transitions. [2022-02-20 23:39:10,883 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:39:10,883 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:39:10,883 INFO L74 IsIncluded]: Start isIncluded. First operand has 48 states, 38 states have (on average 1.4473684210526316) internal successors, (55), 47 states have internal predecessors, (55), 0 states have call successors, (0), 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 63 states. [2022-02-20 23:39:10,883 INFO L87 Difference]: Start difference. First operand has 48 states, 38 states have (on average 1.4473684210526316) internal successors, (55), 47 states have internal predecessors, (55), 0 states have call successors, (0), 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 63 states. [2022-02-20 23:39:10,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:39:10,884 INFO L93 Difference]: Finished difference Result 63 states and 70 transitions. [2022-02-20 23:39:10,884 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 70 transitions. [2022-02-20 23:39:10,885 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:39:10,885 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:39:10,885 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:39:10,885 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:39:10,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 38 states have (on average 1.4473684210526316) internal successors, (55), 47 states have internal predecessors, (55), 0 states have call successors, (0), 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:10,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 55 transitions. [2022-02-20 23:39:10,886 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 55 transitions. Word has length 9 [2022-02-20 23:39:10,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:39:10,886 INFO L470 AbstractCegarLoop]: Abstraction has 48 states and 55 transitions. [2022-02-20 23:39:10,887 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:10,887 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2022-02-20 23:39:10,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-02-20 23:39:10,887 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:39:10,887 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:39:10,887 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 23:39:10,888 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 12 more)] === [2022-02-20 23:39:10,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:39:10,888 INFO L85 PathProgramCache]: Analyzing trace with hash -1900556789, now seen corresponding path program 1 times [2022-02-20 23:39:10,888 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:39:10,888 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729566013] [2022-02-20 23:39:10,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:39:10,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:39:10,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:39:10,956 INFO L290 TraceCheckUtils]: 0: Hoare triple {1396#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {1396#true} is VALID [2022-02-20 23:39:10,957 INFO L290 TraceCheckUtils]: 1: Hoare triple {1396#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset, main_#t~nondet13#1, main_#t~ret14#1.base, main_#t~ret14#1.offset, main_#t~mem15#1, main_~s~0#1.base, main_~s~0#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; {1396#true} is VALID [2022-02-20 23:39:10,957 INFO L290 TraceCheckUtils]: 2: Hoare triple {1396#true} assume !(build_nondet_String_~length~0#1 < 1); {1396#true} is VALID [2022-02-20 23:39:10,958 INFO L290 TraceCheckUtils]: 3: Hoare triple {1396#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; {1398#(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:10,958 INFO L290 TraceCheckUtils]: 4: Hoare triple {1398#(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; {1398#(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:10,959 INFO L290 TraceCheckUtils]: 5: Hoare triple {1398#(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 {1398#(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:10,959 INFO L290 TraceCheckUtils]: 6: Hoare triple {1398#(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; {1398#(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:10,960 INFO L290 TraceCheckUtils]: 7: Hoare triple {1398#(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; {1399#(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:10,961 INFO L290 TraceCheckUtils]: 8: Hoare triple {1399#(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; {1400#(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:10,961 INFO L290 TraceCheckUtils]: 9: Hoare triple {1400#(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); {1397#false} is VALID [2022-02-20 23:39:10,961 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:10,962 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:39:10,962 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729566013] [2022-02-20 23:39:10,962 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729566013] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:39:10,962 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2068260992] [2022-02-20 23:39:10,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:39:10,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:39:10,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:39:10,975 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:10,978 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:11,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:39:11,020 INFO L263 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-20 23:39:11,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:39:11,030 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:39:11,165 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:11,310 INFO L290 TraceCheckUtils]: 0: Hoare triple {1396#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {1396#true} is VALID [2022-02-20 23:39:11,311 INFO L290 TraceCheckUtils]: 1: Hoare triple {1396#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset, main_#t~nondet13#1, main_#t~ret14#1.base, main_#t~ret14#1.offset, main_#t~mem15#1, main_~s~0#1.base, main_~s~0#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; {1396#true} is VALID [2022-02-20 23:39:11,311 INFO L290 TraceCheckUtils]: 2: Hoare triple {1396#true} assume !(build_nondet_String_~length~0#1 < 1); {1396#true} is VALID [2022-02-20 23:39:11,312 INFO L290 TraceCheckUtils]: 3: Hoare triple {1396#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; {1413#(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:11,312 INFO L290 TraceCheckUtils]: 4: Hoare triple {1413#(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; {1413#(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:11,313 INFO L290 TraceCheckUtils]: 5: Hoare triple {1413#(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 {1413#(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:11,313 INFO L290 TraceCheckUtils]: 6: Hoare triple {1413#(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; {1413#(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:11,314 INFO L290 TraceCheckUtils]: 7: Hoare triple {1413#(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; {1426#(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:11,314 INFO L290 TraceCheckUtils]: 8: Hoare triple {1426#(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; {1400#(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:11,326 INFO L290 TraceCheckUtils]: 9: Hoare triple {1400#(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); {1397#false} is VALID [2022-02-20 23:39:11,327 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:11,327 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:39:11,603 INFO L290 TraceCheckUtils]: 9: Hoare triple {1433#(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); {1397#false} is VALID [2022-02-20 23:39:11,603 INFO L290 TraceCheckUtils]: 8: Hoare triple {1437#(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; {1433#(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:11,604 INFO L290 TraceCheckUtils]: 7: Hoare triple {1441#(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; {1437#(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:11,605 INFO L290 TraceCheckUtils]: 6: Hoare triple {1441#(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; {1441#(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:11,605 INFO L290 TraceCheckUtils]: 5: Hoare triple {1441#(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 {1441#(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:11,606 INFO L290 TraceCheckUtils]: 4: Hoare triple {1441#(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; {1441#(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:11,606 INFO L290 TraceCheckUtils]: 3: Hoare triple {1396#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; {1441#(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:11,607 INFO L290 TraceCheckUtils]: 2: Hoare triple {1396#true} assume !(build_nondet_String_~length~0#1 < 1); {1396#true} is VALID [2022-02-20 23:39:11,607 INFO L290 TraceCheckUtils]: 1: Hoare triple {1396#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset, main_#t~nondet13#1, main_#t~ret14#1.base, main_#t~ret14#1.offset, main_#t~mem15#1, main_~s~0#1.base, main_~s~0#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; {1396#true} is VALID [2022-02-20 23:39:11,607 INFO L290 TraceCheckUtils]: 0: Hoare triple {1396#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {1396#true} is VALID [2022-02-20 23:39:11,607 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:11,608 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2068260992] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:39:11,608 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 23:39:11,608 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2022-02-20 23:39:11,610 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940673425] [2022-02-20 23:39:11,610 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 23:39:11,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:11,611 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:39:11,611 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:11,644 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:11,644 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 23:39:11,644 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:39:11,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 23:39:11,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2022-02-20 23:39:11,645 INFO L87 Difference]: Start difference. First operand 48 states and 55 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:12,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:39:12,062 INFO L93 Difference]: Finished difference Result 120 states and 136 transitions. [2022-02-20 23:39:12,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 23:39:12,062 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:12,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:39:12,063 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:12,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 108 transitions. [2022-02-20 23:39:12,064 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:12,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 108 transitions. [2022-02-20 23:39:12,065 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 108 transitions. [2022-02-20 23:39:12,153 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:39:12,154 INFO L225 Difference]: With dead ends: 120 [2022-02-20 23:39:12,155 INFO L226 Difference]: Without dead ends: 120 [2022-02-20 23:39:12,155 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2022-02-20 23:39:12,157 INFO L933 BasicCegarLoop]: 67 mSDtfsCounter, 197 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:39:12,157 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [197 Valid, 197 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:39:12,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-02-20 23:39:12,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 45. [2022-02-20 23:39:12,165 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:39:12,166 INFO L82 GeneralOperation]: Start isEquivalent. First operand 120 states. Second operand has 45 states, 36 states have (on average 1.4166666666666667) internal successors, (51), 44 states have internal predecessors, (51), 0 states have call successors, (0), 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:12,166 INFO L74 IsIncluded]: Start isIncluded. First operand 120 states. Second operand has 45 states, 36 states have (on average 1.4166666666666667) internal successors, (51), 44 states have internal predecessors, (51), 0 states have call successors, (0), 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:12,166 INFO L87 Difference]: Start difference. First operand 120 states. Second operand has 45 states, 36 states have (on average 1.4166666666666667) internal successors, (51), 44 states have internal predecessors, (51), 0 states have call successors, (0), 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:12,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:39:12,169 INFO L93 Difference]: Finished difference Result 120 states and 136 transitions. [2022-02-20 23:39:12,169 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 136 transitions. [2022-02-20 23:39:12,169 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:39:12,169 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:39:12,170 INFO L74 IsIncluded]: Start isIncluded. First operand has 45 states, 36 states have (on average 1.4166666666666667) internal successors, (51), 44 states have internal predecessors, (51), 0 states have call successors, (0), 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 120 states. [2022-02-20 23:39:12,170 INFO L87 Difference]: Start difference. First operand has 45 states, 36 states have (on average 1.4166666666666667) internal successors, (51), 44 states have internal predecessors, (51), 0 states have call successors, (0), 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 120 states. [2022-02-20 23:39:12,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:39:12,173 INFO L93 Difference]: Finished difference Result 120 states and 136 transitions. [2022-02-20 23:39:12,173 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 136 transitions. [2022-02-20 23:39:12,173 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:39:12,173 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:39:12,173 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:39:12,174 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:39:12,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 36 states have (on average 1.4166666666666667) internal successors, (51), 44 states have internal predecessors, (51), 0 states have call successors, (0), 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:12,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 51 transitions. [2022-02-20 23:39:12,175 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 51 transitions. Word has length 10 [2022-02-20 23:39:12,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:39:12,175 INFO L470 AbstractCegarLoop]: Abstraction has 45 states and 51 transitions. [2022-02-20 23:39:12,175 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:12,175 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2022-02-20 23:39:12,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-02-20 23:39:12,176 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:39:12,176 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:39:12,193 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:12,393 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:12,393 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 12 more)] === [2022-02-20 23:39:12,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:39:12,394 INFO L85 PathProgramCache]: Analyzing trace with hash -2134761079, now seen corresponding path program 1 times [2022-02-20 23:39:12,394 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:39:12,394 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663643112] [2022-02-20 23:39:12,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:39:12,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:39:12,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:39:12,437 INFO L290 TraceCheckUtils]: 0: Hoare triple {1873#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {1873#true} is VALID [2022-02-20 23:39:12,437 INFO L290 TraceCheckUtils]: 1: Hoare triple {1873#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset, main_#t~nondet13#1, main_#t~ret14#1.base, main_#t~ret14#1.offset, main_#t~mem15#1, main_~s~0#1.base, main_~s~0#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; {1873#true} is VALID [2022-02-20 23:39:12,437 INFO L290 TraceCheckUtils]: 2: Hoare triple {1873#true} assume build_nondet_String_~length~0#1 < 1;build_nondet_String_~length~0#1 := 1; {1873#true} is VALID [2022-02-20 23:39:12,437 INFO L290 TraceCheckUtils]: 3: Hoare triple {1873#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; {1873#true} is VALID [2022-02-20 23:39:12,438 INFO L290 TraceCheckUtils]: 4: Hoare triple {1873#true} assume !(build_nondet_String_~i~0#1 < build_nondet_String_~length~0#1 - 1); {1873#true} is VALID [2022-02-20 23:39:12,438 INFO L290 TraceCheckUtils]: 5: Hoare triple {1873#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 {1873#true} is VALID [2022-02-20 23:39:12,438 INFO L290 TraceCheckUtils]: 6: Hoare triple {1873#true} 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; {1873#true} is VALID [2022-02-20 23:39:12,438 INFO L290 TraceCheckUtils]: 7: Hoare triple {1873#true} main_#t~ret12#1.base, main_#t~ret12#1.offset := build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;assume { :end_inline_build_nondet_String } true;main_~s~0#1.base, main_~s~0#1.offset := main_#t~ret12#1.base, main_#t~ret12#1.offset;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647;assume { :begin_inline_cstrchr } true;cstrchr_#in~s#1.base, cstrchr_#in~s#1.offset, cstrchr_#in~c#1 := main_~s~0#1.base, main_~s~0#1.offset, main_#t~nondet13#1;havoc cstrchr_#res#1.base, cstrchr_#res#1.offset;havoc cstrchr_#t~post9#1.base, cstrchr_#t~post9#1.offset, cstrchr_#t~mem6#1, cstrchr_#t~mem7#1, cstrchr_#t~short8#1, cstrchr_#t~mem10#1, cstrchr_#t~ite11#1.base, cstrchr_#t~ite11#1.offset, cstrchr_~s#1.base, cstrchr_~s#1.offset, cstrchr_~c#1;cstrchr_~s#1.base, cstrchr_~s#1.offset := cstrchr_#in~s#1.base, cstrchr_#in~s#1.offset;cstrchr_~c#1 := cstrchr_#in~c#1; {1873#true} is VALID [2022-02-20 23:39:12,438 INFO L290 TraceCheckUtils]: 8: Hoare triple {1873#true} SUMMARY for call cstrchr_#t~mem6#1 := read~int(cstrchr_~s#1.base, cstrchr_~s#1.offset, 1); srcloc: L531-8 {1873#true} is VALID [2022-02-20 23:39:12,438 INFO L290 TraceCheckUtils]: 9: Hoare triple {1873#true} cstrchr_#t~short8#1 := 0 != cstrchr_#t~mem6#1; {1873#true} is VALID [2022-02-20 23:39:12,439 INFO L290 TraceCheckUtils]: 10: Hoare triple {1873#true} assume !cstrchr_#t~short8#1; {1875#(not |ULTIMATE.start_cstrchr_#t~short8#1|)} is VALID [2022-02-20 23:39:12,439 INFO L290 TraceCheckUtils]: 11: Hoare triple {1875#(not |ULTIMATE.start_cstrchr_#t~short8#1|)} assume !!cstrchr_#t~short8#1;havoc cstrchr_#t~mem6#1;havoc cstrchr_#t~mem7#1;havoc cstrchr_#t~short8#1;cstrchr_#t~post9#1.base, cstrchr_#t~post9#1.offset := cstrchr_~s#1.base, cstrchr_~s#1.offset;cstrchr_~s#1.base, cstrchr_~s#1.offset := cstrchr_#t~post9#1.base, 1 + cstrchr_#t~post9#1.offset;havoc cstrchr_#t~post9#1.base, cstrchr_#t~post9#1.offset; {1874#false} is VALID [2022-02-20 23:39:12,439 INFO L290 TraceCheckUtils]: 12: Hoare triple {1874#false} assume !(1 + cstrchr_~s#1.offset <= #length[cstrchr_~s#1.base] && 0 <= cstrchr_~s#1.offset); {1874#false} is VALID [2022-02-20 23:39:12,440 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:12,440 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:39:12,440 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663643112] [2022-02-20 23:39:12,440 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663643112] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:39:12,440 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:39:12,440 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:39:12,440 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057032955] [2022-02-20 23:39:12,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:39:12,441 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 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:12,441 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:39:12,441 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 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:12,449 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:12,449 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:39:12,449 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:39:12,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:39:12,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:39:12,450 INFO L87 Difference]: Start difference. First operand 45 states and 51 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 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:12,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:39:12,478 INFO L93 Difference]: Finished difference Result 47 states and 53 transitions. [2022-02-20 23:39:12,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:39:12,478 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 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:12,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:39:12,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 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:12,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2022-02-20 23:39:12,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 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:12,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2022-02-20 23:39:12,480 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 42 transitions. [2022-02-20 23:39:12,514 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:39:12,515 INFO L225 Difference]: With dead ends: 47 [2022-02-20 23:39:12,515 INFO L226 Difference]: Without dead ends: 47 [2022-02-20 23:39:12,515 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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:12,516 INFO L933 BasicCegarLoop]: 39 mSDtfsCounter, 0 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:39:12,517 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 72 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:39:12,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-02-20 23:39:12,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2022-02-20 23:39:12,522 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:39:12,522 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand has 47 states, 38 states have (on average 1.394736842105263) internal successors, (53), 46 states have internal predecessors, (53), 0 states have call successors, (0), 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:12,535 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand has 47 states, 38 states have (on average 1.394736842105263) internal successors, (53), 46 states have internal predecessors, (53), 0 states have call successors, (0), 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:12,536 INFO L87 Difference]: Start difference. First operand 47 states. Second operand has 47 states, 38 states have (on average 1.394736842105263) internal successors, (53), 46 states have internal predecessors, (53), 0 states have call successors, (0), 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:12,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:39:12,537 INFO L93 Difference]: Finished difference Result 47 states and 53 transitions. [2022-02-20 23:39:12,537 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions. [2022-02-20 23:39:12,538 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:39:12,538 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:39:12,543 INFO L74 IsIncluded]: Start isIncluded. First operand has 47 states, 38 states have (on average 1.394736842105263) internal successors, (53), 46 states have internal predecessors, (53), 0 states have call successors, (0), 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 47 states. [2022-02-20 23:39:12,544 INFO L87 Difference]: Start difference. First operand has 47 states, 38 states have (on average 1.394736842105263) internal successors, (53), 46 states have internal predecessors, (53), 0 states have call successors, (0), 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 47 states. [2022-02-20 23:39:12,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:39:12,545 INFO L93 Difference]: Finished difference Result 47 states and 53 transitions. [2022-02-20 23:39:12,545 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions. [2022-02-20 23:39:12,545 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:39:12,545 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:39:12,545 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:39:12,546 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:39:12,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 38 states have (on average 1.394736842105263) internal successors, (53), 46 states have internal predecessors, (53), 0 states have call successors, (0), 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:12,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 53 transitions. [2022-02-20 23:39:12,548 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 53 transitions. Word has length 13 [2022-02-20 23:39:12,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:39:12,548 INFO L470 AbstractCegarLoop]: Abstraction has 47 states and 53 transitions. [2022-02-20 23:39:12,549 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 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:12,549 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions. [2022-02-20 23:39:12,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-02-20 23:39:12,549 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:39:12,549 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:12,549 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 23:39:12,550 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 12 more)] === [2022-02-20 23:39:12,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:39:12,550 INFO L85 PathProgramCache]: Analyzing trace with hash 1483111174, now seen corresponding path program 1 times [2022-02-20 23:39:12,550 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:39:12,551 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795298369] [2022-02-20 23:39:12,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:39:12,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:39:12,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:39:12,718 INFO L290 TraceCheckUtils]: 0: Hoare triple {2066#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {2066#true} is VALID [2022-02-20 23:39:12,718 INFO L290 TraceCheckUtils]: 1: Hoare triple {2066#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset, main_#t~nondet13#1, main_#t~ret14#1.base, main_#t~ret14#1.offset, main_#t~mem15#1, main_~s~0#1.base, main_~s~0#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; {2066#true} is VALID [2022-02-20 23:39:12,719 INFO L290 TraceCheckUtils]: 2: Hoare triple {2066#true} assume build_nondet_String_~length~0#1 < 1;build_nondet_String_~length~0#1 := 1; {2068#(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:12,720 INFO L290 TraceCheckUtils]: 3: Hoare triple {2068#(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; {2069#(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:12,720 INFO L290 TraceCheckUtils]: 4: Hoare triple {2069#(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); {2069#(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:12,721 INFO L290 TraceCheckUtils]: 5: Hoare triple {2069#(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 {2070#(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:12,721 INFO L290 TraceCheckUtils]: 6: Hoare triple {2070#(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; {2071#(= (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:12,722 INFO L290 TraceCheckUtils]: 7: Hoare triple {2071#(= (select (select |#memory_int| |ULTIMATE.start_build_nondet_String_#res#1.base|) |ULTIMATE.start_build_nondet_String_#res#1.offset|) 0)} main_#t~ret12#1.base, main_#t~ret12#1.offset := build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;assume { :end_inline_build_nondet_String } true;main_~s~0#1.base, main_~s~0#1.offset := main_#t~ret12#1.base, main_#t~ret12#1.offset;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647;assume { :begin_inline_cstrchr } true;cstrchr_#in~s#1.base, cstrchr_#in~s#1.offset, cstrchr_#in~c#1 := main_~s~0#1.base, main_~s~0#1.offset, main_#t~nondet13#1;havoc cstrchr_#res#1.base, cstrchr_#res#1.offset;havoc cstrchr_#t~post9#1.base, cstrchr_#t~post9#1.offset, cstrchr_#t~mem6#1, cstrchr_#t~mem7#1, cstrchr_#t~short8#1, cstrchr_#t~mem10#1, cstrchr_#t~ite11#1.base, cstrchr_#t~ite11#1.offset, cstrchr_~s#1.base, cstrchr_~s#1.offset, cstrchr_~c#1;cstrchr_~s#1.base, cstrchr_~s#1.offset := cstrchr_#in~s#1.base, cstrchr_#in~s#1.offset;cstrchr_~c#1 := cstrchr_#in~c#1; {2072#(= (select (select |#memory_int| |ULTIMATE.start_cstrchr_~s#1.base|) |ULTIMATE.start_cstrchr_~s#1.offset|) 0)} is VALID [2022-02-20 23:39:12,723 INFO L290 TraceCheckUtils]: 8: Hoare triple {2072#(= (select (select |#memory_int| |ULTIMATE.start_cstrchr_~s#1.base|) |ULTIMATE.start_cstrchr_~s#1.offset|) 0)} SUMMARY for call cstrchr_#t~mem6#1 := read~int(cstrchr_~s#1.base, cstrchr_~s#1.offset, 1); srcloc: L531-8 {2073#(= |ULTIMATE.start_cstrchr_#t~mem6#1| 0)} is VALID [2022-02-20 23:39:12,723 INFO L290 TraceCheckUtils]: 9: Hoare triple {2073#(= |ULTIMATE.start_cstrchr_#t~mem6#1| 0)} cstrchr_#t~short8#1 := 0 != cstrchr_#t~mem6#1; {2074#(not |ULTIMATE.start_cstrchr_#t~short8#1|)} is VALID [2022-02-20 23:39:12,739 INFO L290 TraceCheckUtils]: 10: Hoare triple {2074#(not |ULTIMATE.start_cstrchr_#t~short8#1|)} assume cstrchr_#t~short8#1; {2067#false} is VALID [2022-02-20 23:39:12,740 INFO L290 TraceCheckUtils]: 11: Hoare triple {2067#false} SUMMARY for call cstrchr_#t~mem7#1 := read~int(cstrchr_~s#1.base, cstrchr_~s#1.offset, 1); srcloc: L531-3 {2067#false} is VALID [2022-02-20 23:39:12,740 INFO L290 TraceCheckUtils]: 12: Hoare triple {2067#false} cstrchr_#t~short8#1 := cstrchr_#t~mem7#1 != (if cstrchr_~c#1 % 256 <= 127 then cstrchr_~c#1 % 256 else cstrchr_~c#1 % 256 - 256); {2067#false} is VALID [2022-02-20 23:39:12,740 INFO L290 TraceCheckUtils]: 13: Hoare triple {2067#false} assume !!cstrchr_#t~short8#1;havoc cstrchr_#t~mem6#1;havoc cstrchr_#t~mem7#1;havoc cstrchr_#t~short8#1;cstrchr_#t~post9#1.base, cstrchr_#t~post9#1.offset := cstrchr_~s#1.base, cstrchr_~s#1.offset;cstrchr_~s#1.base, cstrchr_~s#1.offset := cstrchr_#t~post9#1.base, 1 + cstrchr_#t~post9#1.offset;havoc cstrchr_#t~post9#1.base, cstrchr_#t~post9#1.offset; {2067#false} is VALID [2022-02-20 23:39:12,740 INFO L290 TraceCheckUtils]: 14: Hoare triple {2067#false} assume !(1 + cstrchr_~s#1.offset <= #length[cstrchr_~s#1.base] && 0 <= cstrchr_~s#1.offset); {2067#false} is VALID [2022-02-20 23:39:12,740 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:12,740 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:39:12,740 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795298369] [2022-02-20 23:39:12,741 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795298369] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:39:12,741 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:39:12,741 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 23:39:12,741 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289087296] [2022-02-20 23:39:12,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:39:12,741 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 9 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:12,741 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:39:12,742 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 9 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:12,750 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:12,750 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 23:39:12,750 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:39:12,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 23:39:12,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-02-20 23:39:12,751 INFO L87 Difference]: Start difference. First operand 47 states and 53 transitions. Second operand has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 9 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:12,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:39:12,980 INFO L93 Difference]: Finished difference Result 70 states and 76 transitions. [2022-02-20 23:39:12,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 23:39:12,980 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 9 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:12,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:39:12,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 9 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:12,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 67 transitions. [2022-02-20 23:39:12,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 9 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:12,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 67 transitions. [2022-02-20 23:39:13,003 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 67 transitions. [2022-02-20 23:39:13,036 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:39:13,037 INFO L225 Difference]: With dead ends: 70 [2022-02-20 23:39:13,037 INFO L226 Difference]: Without dead ends: 70 [2022-02-20 23:39:13,037 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2022-02-20 23:39:13,037 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 87 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:39:13,038 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [87 Valid, 224 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:39:13,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-02-20 23:39:13,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 53. [2022-02-20 23:39:13,039 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:39:13,039 INFO L82 GeneralOperation]: Start isEquivalent. First operand 70 states. Second operand has 53 states, 44 states have (on average 1.3409090909090908) internal successors, (59), 52 states have internal predecessors, (59), 0 states have call successors, (0), 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:13,040 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand has 53 states, 44 states have (on average 1.3409090909090908) internal successors, (59), 52 states have internal predecessors, (59), 0 states have call successors, (0), 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:13,040 INFO L87 Difference]: Start difference. First operand 70 states. Second operand has 53 states, 44 states have (on average 1.3409090909090908) internal successors, (59), 52 states have internal predecessors, (59), 0 states have call successors, (0), 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:13,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:39:13,041 INFO L93 Difference]: Finished difference Result 70 states and 76 transitions. [2022-02-20 23:39:13,041 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 76 transitions. [2022-02-20 23:39:13,041 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:39:13,041 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:39:13,041 INFO L74 IsIncluded]: Start isIncluded. First operand has 53 states, 44 states have (on average 1.3409090909090908) internal successors, (59), 52 states have internal predecessors, (59), 0 states have call successors, (0), 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 70 states. [2022-02-20 23:39:13,043 INFO L87 Difference]: Start difference. First operand has 53 states, 44 states have (on average 1.3409090909090908) internal successors, (59), 52 states have internal predecessors, (59), 0 states have call successors, (0), 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 70 states. [2022-02-20 23:39:13,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:39:13,045 INFO L93 Difference]: Finished difference Result 70 states and 76 transitions. [2022-02-20 23:39:13,045 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 76 transitions. [2022-02-20 23:39:13,045 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:39:13,045 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:39:13,046 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:39:13,046 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:39:13,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 44 states have (on average 1.3409090909090908) internal successors, (59), 52 states have internal predecessors, (59), 0 states have call successors, (0), 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:13,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 59 transitions. [2022-02-20 23:39:13,057 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 59 transitions. Word has length 15 [2022-02-20 23:39:13,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:39:13,057 INFO L470 AbstractCegarLoop]: Abstraction has 53 states and 59 transitions. [2022-02-20 23:39:13,057 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 9 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:13,058 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 59 transitions. [2022-02-20 23:39:13,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-02-20 23:39:13,058 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:39:13,058 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:13,058 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-20 23:39:13,058 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 12 more)] === [2022-02-20 23:39:13,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:39:13,059 INFO L85 PathProgramCache]: Analyzing trace with hash 896305160, now seen corresponding path program 1 times [2022-02-20 23:39:13,059 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:39:13,059 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989862623] [2022-02-20 23:39:13,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:39:13,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:39:13,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:39:13,229 INFO L290 TraceCheckUtils]: 0: Hoare triple {2350#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {2350#true} is VALID [2022-02-20 23:39:13,229 INFO L290 TraceCheckUtils]: 1: Hoare triple {2350#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset, main_#t~nondet13#1, main_#t~ret14#1.base, main_#t~ret14#1.offset, main_#t~mem15#1, main_~s~0#1.base, main_~s~0#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; {2350#true} is VALID [2022-02-20 23:39:13,229 INFO L290 TraceCheckUtils]: 2: Hoare triple {2350#true} assume !(build_nondet_String_~length~0#1 < 1); {2352#(<= 1 |ULTIMATE.start_build_nondet_String_~length~0#1|)} is VALID [2022-02-20 23:39:13,230 INFO L290 TraceCheckUtils]: 3: Hoare triple {2352#(<= 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; {2353#(and (= |ULTIMATE.start_build_nondet_String_~nondetString~0#1.offset| 0) (<= 1 |ULTIMATE.start_build_nondet_String_~length~0#1|) (or (= |ULTIMATE.start_build_nondet_String_~i~0#1| 0) (= (+ (- 1) |ULTIMATE.start_build_nondet_String_~nondetString~0#1.offset| |ULTIMATE.start_build_nondet_String_~length~0#1|) 0)))} is VALID [2022-02-20 23:39:13,231 INFO L290 TraceCheckUtils]: 4: Hoare triple {2353#(and (= |ULTIMATE.start_build_nondet_String_~nondetString~0#1.offset| 0) (<= 1 |ULTIMATE.start_build_nondet_String_~length~0#1|) (or (= |ULTIMATE.start_build_nondet_String_~i~0#1| 0) (= (+ (- 1) |ULTIMATE.start_build_nondet_String_~nondetString~0#1.offset| |ULTIMATE.start_build_nondet_String_~length~0#1|) 0)))} assume !(build_nondet_String_~i~0#1 < build_nondet_String_~length~0#1 - 1); {2354#(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:13,231 INFO L290 TraceCheckUtils]: 5: Hoare triple {2354#(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 {2355#(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:13,233 INFO L290 TraceCheckUtils]: 6: Hoare triple {2355#(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; {2356#(= (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:13,234 INFO L290 TraceCheckUtils]: 7: Hoare triple {2356#(= (select (select |#memory_int| |ULTIMATE.start_build_nondet_String_#res#1.base|) |ULTIMATE.start_build_nondet_String_#res#1.offset|) 0)} main_#t~ret12#1.base, main_#t~ret12#1.offset := build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;assume { :end_inline_build_nondet_String } true;main_~s~0#1.base, main_~s~0#1.offset := main_#t~ret12#1.base, main_#t~ret12#1.offset;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647;assume { :begin_inline_cstrchr } true;cstrchr_#in~s#1.base, cstrchr_#in~s#1.offset, cstrchr_#in~c#1 := main_~s~0#1.base, main_~s~0#1.offset, main_#t~nondet13#1;havoc cstrchr_#res#1.base, cstrchr_#res#1.offset;havoc cstrchr_#t~post9#1.base, cstrchr_#t~post9#1.offset, cstrchr_#t~mem6#1, cstrchr_#t~mem7#1, cstrchr_#t~short8#1, cstrchr_#t~mem10#1, cstrchr_#t~ite11#1.base, cstrchr_#t~ite11#1.offset, cstrchr_~s#1.base, cstrchr_~s#1.offset, cstrchr_~c#1;cstrchr_~s#1.base, cstrchr_~s#1.offset := cstrchr_#in~s#1.base, cstrchr_#in~s#1.offset;cstrchr_~c#1 := cstrchr_#in~c#1; {2357#(= (select (select |#memory_int| |ULTIMATE.start_cstrchr_~s#1.base|) |ULTIMATE.start_cstrchr_~s#1.offset|) 0)} is VALID [2022-02-20 23:39:13,234 INFO L290 TraceCheckUtils]: 8: Hoare triple {2357#(= (select (select |#memory_int| |ULTIMATE.start_cstrchr_~s#1.base|) |ULTIMATE.start_cstrchr_~s#1.offset|) 0)} SUMMARY for call cstrchr_#t~mem6#1 := read~int(cstrchr_~s#1.base, cstrchr_~s#1.offset, 1); srcloc: L531-8 {2358#(= |ULTIMATE.start_cstrchr_#t~mem6#1| 0)} is VALID [2022-02-20 23:39:13,235 INFO L290 TraceCheckUtils]: 9: Hoare triple {2358#(= |ULTIMATE.start_cstrchr_#t~mem6#1| 0)} cstrchr_#t~short8#1 := 0 != cstrchr_#t~mem6#1; {2359#(not |ULTIMATE.start_cstrchr_#t~short8#1|)} is VALID [2022-02-20 23:39:13,235 INFO L290 TraceCheckUtils]: 10: Hoare triple {2359#(not |ULTIMATE.start_cstrchr_#t~short8#1|)} assume cstrchr_#t~short8#1; {2351#false} is VALID [2022-02-20 23:39:13,235 INFO L290 TraceCheckUtils]: 11: Hoare triple {2351#false} SUMMARY for call cstrchr_#t~mem7#1 := read~int(cstrchr_~s#1.base, cstrchr_~s#1.offset, 1); srcloc: L531-3 {2351#false} is VALID [2022-02-20 23:39:13,235 INFO L290 TraceCheckUtils]: 12: Hoare triple {2351#false} cstrchr_#t~short8#1 := cstrchr_#t~mem7#1 != (if cstrchr_~c#1 % 256 <= 127 then cstrchr_~c#1 % 256 else cstrchr_~c#1 % 256 - 256); {2351#false} is VALID [2022-02-20 23:39:13,235 INFO L290 TraceCheckUtils]: 13: Hoare triple {2351#false} assume !!cstrchr_#t~short8#1;havoc cstrchr_#t~mem6#1;havoc cstrchr_#t~mem7#1;havoc cstrchr_#t~short8#1;cstrchr_#t~post9#1.base, cstrchr_#t~post9#1.offset := cstrchr_~s#1.base, cstrchr_~s#1.offset;cstrchr_~s#1.base, cstrchr_~s#1.offset := cstrchr_#t~post9#1.base, 1 + cstrchr_#t~post9#1.offset;havoc cstrchr_#t~post9#1.base, cstrchr_#t~post9#1.offset; {2351#false} is VALID [2022-02-20 23:39:13,235 INFO L290 TraceCheckUtils]: 14: Hoare triple {2351#false} assume !(1 + cstrchr_~s#1.offset <= #length[cstrchr_~s#1.base] && 0 <= cstrchr_~s#1.offset); {2351#false} is VALID [2022-02-20 23:39:13,235 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:13,236 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:39:13,236 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989862623] [2022-02-20 23:39:13,236 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989862623] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:39:13,236 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:39:13,236 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-20 23:39:13,236 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587897574] [2022-02-20 23:39:13,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:39:13,236 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.5) internal successors, (15), 10 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:13,236 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:39:13,236 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 1.5) internal successors, (15), 10 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:13,245 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:13,245 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 23:39:13,245 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:39:13,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 23:39:13,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-02-20 23:39:13,246 INFO L87 Difference]: Start difference. First operand 53 states and 59 transitions. Second operand has 10 states, 10 states have (on average 1.5) internal successors, (15), 10 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:13,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:39:13,508 INFO L93 Difference]: Finished difference Result 80 states and 87 transitions. [2022-02-20 23:39:13,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 23:39:13,509 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.5) internal successors, (15), 10 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:13,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:39:13,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.5) internal successors, (15), 10 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:13,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 70 transitions. [2022-02-20 23:39:13,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.5) internal successors, (15), 10 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:13,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 70 transitions. [2022-02-20 23:39:13,510 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 70 transitions. [2022-02-20 23:39:13,547 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:39:13,548 INFO L225 Difference]: With dead ends: 80 [2022-02-20 23:39:13,548 INFO L226 Difference]: Without dead ends: 80 [2022-02-20 23:39:13,549 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=165, Unknown=0, NotChecked=0, Total=240 [2022-02-20 23:39:13,549 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 151 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:39:13,550 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [151 Valid, 204 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:39:13,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-02-20 23:39:13,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 54. [2022-02-20 23:39:13,551 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:39:13,551 INFO L82 GeneralOperation]: Start isEquivalent. First operand 80 states. Second operand has 54 states, 45 states have (on average 1.3555555555555556) internal successors, (61), 53 states have internal predecessors, (61), 0 states have call successors, (0), 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:13,552 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand has 54 states, 45 states have (on average 1.3555555555555556) internal successors, (61), 53 states have internal predecessors, (61), 0 states have call successors, (0), 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:13,552 INFO L87 Difference]: Start difference. First operand 80 states. Second operand has 54 states, 45 states have (on average 1.3555555555555556) internal successors, (61), 53 states have internal predecessors, (61), 0 states have call successors, (0), 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:13,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:39:13,553 INFO L93 Difference]: Finished difference Result 80 states and 87 transitions. [2022-02-20 23:39:13,553 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 87 transitions. [2022-02-20 23:39:13,553 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:39:13,553 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:39:13,553 INFO L74 IsIncluded]: Start isIncluded. First operand has 54 states, 45 states have (on average 1.3555555555555556) internal successors, (61), 53 states have internal predecessors, (61), 0 states have call successors, (0), 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 80 states. [2022-02-20 23:39:13,554 INFO L87 Difference]: Start difference. First operand has 54 states, 45 states have (on average 1.3555555555555556) internal successors, (61), 53 states have internal predecessors, (61), 0 states have call successors, (0), 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 80 states. [2022-02-20 23:39:13,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:39:13,555 INFO L93 Difference]: Finished difference Result 80 states and 87 transitions. [2022-02-20 23:39:13,555 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 87 transitions. [2022-02-20 23:39:13,555 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:39:13,555 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:39:13,555 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:39:13,555 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:39:13,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 45 states have (on average 1.3555555555555556) internal successors, (61), 53 states have internal predecessors, (61), 0 states have call successors, (0), 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:13,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 61 transitions. [2022-02-20 23:39:13,556 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 61 transitions. Word has length 15 [2022-02-20 23:39:13,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:39:13,556 INFO L470 AbstractCegarLoop]: Abstraction has 54 states and 61 transitions. [2022-02-20 23:39:13,557 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.5) internal successors, (15), 10 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:13,557 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 61 transitions. [2022-02-20 23:39:13,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-02-20 23:39:13,571 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:39:13,571 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:39:13,572 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-20 23:39:13,572 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 12 more)] === [2022-02-20 23:39:13,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:39:13,572 INFO L85 PathProgramCache]: Analyzing trace with hash 639793573, now seen corresponding path program 1 times [2022-02-20 23:39:13,572 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:39:13,573 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313454124] [2022-02-20 23:39:13,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:39:13,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:39:13,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:39:13,630 INFO L290 TraceCheckUtils]: 0: Hoare triple {2668#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {2668#true} is VALID [2022-02-20 23:39:13,630 INFO L290 TraceCheckUtils]: 1: Hoare triple {2668#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset, main_#t~nondet13#1, main_#t~ret14#1.base, main_#t~ret14#1.offset, main_#t~mem15#1, main_~s~0#1.base, main_~s~0#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; {2668#true} is VALID [2022-02-20 23:39:13,630 INFO L290 TraceCheckUtils]: 2: Hoare triple {2668#true} assume build_nondet_String_~length~0#1 < 1;build_nondet_String_~length~0#1 := 1; {2668#true} is VALID [2022-02-20 23:39:13,631 INFO L290 TraceCheckUtils]: 3: Hoare triple {2668#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; {2668#true} is VALID [2022-02-20 23:39:13,631 INFO L290 TraceCheckUtils]: 4: Hoare triple {2668#true} assume !(build_nondet_String_~i~0#1 < build_nondet_String_~length~0#1 - 1); {2668#true} is VALID [2022-02-20 23:39:13,631 INFO L290 TraceCheckUtils]: 5: Hoare triple {2668#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 {2668#true} is VALID [2022-02-20 23:39:13,631 INFO L290 TraceCheckUtils]: 6: Hoare triple {2668#true} 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; {2668#true} is VALID [2022-02-20 23:39:13,631 INFO L290 TraceCheckUtils]: 7: Hoare triple {2668#true} main_#t~ret12#1.base, main_#t~ret12#1.offset := build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;assume { :end_inline_build_nondet_String } true;main_~s~0#1.base, main_~s~0#1.offset := main_#t~ret12#1.base, main_#t~ret12#1.offset;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647;assume { :begin_inline_cstrchr } true;cstrchr_#in~s#1.base, cstrchr_#in~s#1.offset, cstrchr_#in~c#1 := main_~s~0#1.base, main_~s~0#1.offset, main_#t~nondet13#1;havoc cstrchr_#res#1.base, cstrchr_#res#1.offset;havoc cstrchr_#t~post9#1.base, cstrchr_#t~post9#1.offset, cstrchr_#t~mem6#1, cstrchr_#t~mem7#1, cstrchr_#t~short8#1, cstrchr_#t~mem10#1, cstrchr_#t~ite11#1.base, cstrchr_#t~ite11#1.offset, cstrchr_~s#1.base, cstrchr_~s#1.offset, cstrchr_~c#1;cstrchr_~s#1.base, cstrchr_~s#1.offset := cstrchr_#in~s#1.base, cstrchr_#in~s#1.offset;cstrchr_~c#1 := cstrchr_#in~c#1; {2668#true} is VALID [2022-02-20 23:39:13,632 INFO L290 TraceCheckUtils]: 8: Hoare triple {2668#true} SUMMARY for call cstrchr_#t~mem6#1 := read~int(cstrchr_~s#1.base, cstrchr_~s#1.offset, 1); srcloc: L531-8 {2670#(= (select |#valid| |ULTIMATE.start_cstrchr_~s#1.base|) 1)} is VALID [2022-02-20 23:39:13,632 INFO L290 TraceCheckUtils]: 9: Hoare triple {2670#(= (select |#valid| |ULTIMATE.start_cstrchr_~s#1.base|) 1)} cstrchr_#t~short8#1 := 0 != cstrchr_#t~mem6#1; {2670#(= (select |#valid| |ULTIMATE.start_cstrchr_~s#1.base|) 1)} is VALID [2022-02-20 23:39:13,633 INFO L290 TraceCheckUtils]: 10: Hoare triple {2670#(= (select |#valid| |ULTIMATE.start_cstrchr_~s#1.base|) 1)} assume !cstrchr_#t~short8#1; {2670#(= (select |#valid| |ULTIMATE.start_cstrchr_~s#1.base|) 1)} is VALID [2022-02-20 23:39:13,633 INFO L290 TraceCheckUtils]: 11: Hoare triple {2670#(= (select |#valid| |ULTIMATE.start_cstrchr_~s#1.base|) 1)} assume !cstrchr_#t~short8#1;havoc cstrchr_#t~mem6#1;havoc cstrchr_#t~mem7#1;havoc cstrchr_#t~short8#1; {2670#(= (select |#valid| |ULTIMATE.start_cstrchr_~s#1.base|) 1)} is VALID [2022-02-20 23:39:13,633 INFO L290 TraceCheckUtils]: 12: Hoare triple {2670#(= (select |#valid| |ULTIMATE.start_cstrchr_~s#1.base|) 1)} SUMMARY for call cstrchr_#t~mem10#1 := read~int(cstrchr_~s#1.base, cstrchr_~s#1.offset, 1); srcloc: L531-9 {2670#(= (select |#valid| |ULTIMATE.start_cstrchr_~s#1.base|) 1)} is VALID [2022-02-20 23:39:13,634 INFO L290 TraceCheckUtils]: 13: Hoare triple {2670#(= (select |#valid| |ULTIMATE.start_cstrchr_~s#1.base|) 1)} assume cstrchr_#t~mem10#1 == cstrchr_~c#1;cstrchr_#t~ite11#1.base, cstrchr_#t~ite11#1.offset := cstrchr_~s#1.base, cstrchr_~s#1.offset; {2671#(= (select |#valid| |ULTIMATE.start_cstrchr_#t~ite11#1.base|) 1)} is VALID [2022-02-20 23:39:13,634 INFO L290 TraceCheckUtils]: 14: Hoare triple {2671#(= (select |#valid| |ULTIMATE.start_cstrchr_#t~ite11#1.base|) 1)} cstrchr_#res#1.base, cstrchr_#res#1.offset := cstrchr_#t~ite11#1.base, cstrchr_#t~ite11#1.offset;havoc cstrchr_#t~mem10#1;havoc cstrchr_#t~ite11#1.base, cstrchr_#t~ite11#1.offset; {2672#(= (select |#valid| |ULTIMATE.start_cstrchr_#res#1.base|) 1)} is VALID [2022-02-20 23:39:13,635 INFO L290 TraceCheckUtils]: 15: Hoare triple {2672#(= (select |#valid| |ULTIMATE.start_cstrchr_#res#1.base|) 1)} main_#t~ret14#1.base, main_#t~ret14#1.offset := cstrchr_#res#1.base, cstrchr_#res#1.offset;assume { :end_inline_cstrchr } true; {2673#(= (select |#valid| |ULTIMATE.start_main_#t~ret14#1.base|) 1)} is VALID [2022-02-20 23:39:13,635 INFO L290 TraceCheckUtils]: 16: Hoare triple {2673#(= (select |#valid| |ULTIMATE.start_main_#t~ret14#1.base|) 1)} assume !(1 == #valid[main_#t~ret14#1.base]); {2669#false} is VALID [2022-02-20 23:39:13,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:13,635 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:39:13,636 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313454124] [2022-02-20 23:39:13,636 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313454124] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:39:13,636 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:39:13,636 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 23:39:13,636 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955780758] [2022-02-20 23:39:13,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:39:13,637 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 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 17 [2022-02-20 23:39:13,637 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:39:13,637 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 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:13,649 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:39:13,649 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 23:39:13,649 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:39:13,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 23:39:13,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:39:13,650 INFO L87 Difference]: Start difference. First operand 54 states and 61 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 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:13,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:39:13,883 INFO L93 Difference]: Finished difference Result 65 states and 72 transitions. [2022-02-20 23:39:13,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 23:39:13,883 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 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 17 [2022-02-20 23:39:13,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:39:13,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 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:13,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 53 transitions. [2022-02-20 23:39:13,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 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:13,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 53 transitions. [2022-02-20 23:39:13,885 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 53 transitions. [2022-02-20 23:39:13,931 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:39:13,932 INFO L225 Difference]: With dead ends: 65 [2022-02-20 23:39:13,932 INFO L226 Difference]: Without dead ends: 65 [2022-02-20 23:39:13,932 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-02-20 23:39:13,933 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 39 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:39:13,933 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 87 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:39:13,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-02-20 23:39:13,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 57. [2022-02-20 23:39:13,934 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:39:13,934 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand has 57 states, 48 states have (on average 1.3541666666666667) internal successors, (65), 56 states have internal predecessors, (65), 0 states have call successors, (0), 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:13,935 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand has 57 states, 48 states have (on average 1.3541666666666667) internal successors, (65), 56 states have internal predecessors, (65), 0 states have call successors, (0), 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:13,935 INFO L87 Difference]: Start difference. First operand 65 states. Second operand has 57 states, 48 states have (on average 1.3541666666666667) internal successors, (65), 56 states have internal predecessors, (65), 0 states have call successors, (0), 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:13,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:39:13,935 INFO L93 Difference]: Finished difference Result 65 states and 72 transitions. [2022-02-20 23:39:13,936 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 72 transitions. [2022-02-20 23:39:13,936 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:39:13,936 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:39:13,936 INFO L74 IsIncluded]: Start isIncluded. First operand has 57 states, 48 states have (on average 1.3541666666666667) internal successors, (65), 56 states have internal predecessors, (65), 0 states have call successors, (0), 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 65 states. [2022-02-20 23:39:13,936 INFO L87 Difference]: Start difference. First operand has 57 states, 48 states have (on average 1.3541666666666667) internal successors, (65), 56 states have internal predecessors, (65), 0 states have call successors, (0), 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 65 states. [2022-02-20 23:39:13,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:39:13,937 INFO L93 Difference]: Finished difference Result 65 states and 72 transitions. [2022-02-20 23:39:13,937 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 72 transitions. [2022-02-20 23:39:13,937 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:39:13,938 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:39:13,938 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:39:13,938 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:39:13,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 48 states have (on average 1.3541666666666667) internal successors, (65), 56 states have internal predecessors, (65), 0 states have call successors, (0), 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:13,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 65 transitions. [2022-02-20 23:39:13,939 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 65 transitions. Word has length 17 [2022-02-20 23:39:13,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:39:13,939 INFO L470 AbstractCegarLoop]: Abstraction has 57 states and 65 transitions. [2022-02-20 23:39:13,939 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 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:13,939 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 65 transitions. [2022-02-20 23:39:13,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-02-20 23:39:13,939 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:39:13,940 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:39:13,940 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-02-20 23:39:13,940 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 12 more)] === [2022-02-20 23:39:13,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:39:13,940 INFO L85 PathProgramCache]: Analyzing trace with hash 639793574, now seen corresponding path program 1 times [2022-02-20 23:39:13,940 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:39:13,941 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272139115] [2022-02-20 23:39:13,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:39:13,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:39:13,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:39:14,069 INFO L290 TraceCheckUtils]: 0: Hoare triple {2936#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {2936#true} is VALID [2022-02-20 23:39:14,069 INFO L290 TraceCheckUtils]: 1: Hoare triple {2936#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset, main_#t~nondet13#1, main_#t~ret14#1.base, main_#t~ret14#1.offset, main_#t~mem15#1, main_~s~0#1.base, main_~s~0#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; {2936#true} is VALID [2022-02-20 23:39:14,070 INFO L290 TraceCheckUtils]: 2: Hoare triple {2936#true} assume build_nondet_String_~length~0#1 < 1;build_nondet_String_~length~0#1 := 1; {2938#(<= 1 |ULTIMATE.start_build_nondet_String_~length~0#1|)} is VALID [2022-02-20 23:39:14,070 INFO L290 TraceCheckUtils]: 3: Hoare triple {2938#(<= 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; {2939#(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:14,071 INFO L290 TraceCheckUtils]: 4: Hoare triple {2939#(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); {2939#(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:14,072 INFO L290 TraceCheckUtils]: 5: Hoare triple {2939#(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 {2939#(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:14,072 INFO L290 TraceCheckUtils]: 6: Hoare triple {2939#(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; {2940#(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:14,073 INFO L290 TraceCheckUtils]: 7: Hoare triple {2940#(and (<= 1 (select |#length| |ULTIMATE.start_build_nondet_String_#res#1.base|)) (= |ULTIMATE.start_build_nondet_String_#res#1.offset| 0))} main_#t~ret12#1.base, main_#t~ret12#1.offset := build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;assume { :end_inline_build_nondet_String } true;main_~s~0#1.base, main_~s~0#1.offset := main_#t~ret12#1.base, main_#t~ret12#1.offset;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647;assume { :begin_inline_cstrchr } true;cstrchr_#in~s#1.base, cstrchr_#in~s#1.offset, cstrchr_#in~c#1 := main_~s~0#1.base, main_~s~0#1.offset, main_#t~nondet13#1;havoc cstrchr_#res#1.base, cstrchr_#res#1.offset;havoc cstrchr_#t~post9#1.base, cstrchr_#t~post9#1.offset, cstrchr_#t~mem6#1, cstrchr_#t~mem7#1, cstrchr_#t~short8#1, cstrchr_#t~mem10#1, cstrchr_#t~ite11#1.base, cstrchr_#t~ite11#1.offset, cstrchr_~s#1.base, cstrchr_~s#1.offset, cstrchr_~c#1;cstrchr_~s#1.base, cstrchr_~s#1.offset := cstrchr_#in~s#1.base, cstrchr_#in~s#1.offset;cstrchr_~c#1 := cstrchr_#in~c#1; {2941#(and (<= 1 (select |#length| |ULTIMATE.start_cstrchr_~s#1.base|)) (= |ULTIMATE.start_cstrchr_~s#1.offset| 0))} is VALID [2022-02-20 23:39:14,073 INFO L290 TraceCheckUtils]: 8: Hoare triple {2941#(and (<= 1 (select |#length| |ULTIMATE.start_cstrchr_~s#1.base|)) (= |ULTIMATE.start_cstrchr_~s#1.offset| 0))} SUMMARY for call cstrchr_#t~mem6#1 := read~int(cstrchr_~s#1.base, cstrchr_~s#1.offset, 1); srcloc: L531-8 {2941#(and (<= 1 (select |#length| |ULTIMATE.start_cstrchr_~s#1.base|)) (= |ULTIMATE.start_cstrchr_~s#1.offset| 0))} is VALID [2022-02-20 23:39:14,074 INFO L290 TraceCheckUtils]: 9: Hoare triple {2941#(and (<= 1 (select |#length| |ULTIMATE.start_cstrchr_~s#1.base|)) (= |ULTIMATE.start_cstrchr_~s#1.offset| 0))} cstrchr_#t~short8#1 := 0 != cstrchr_#t~mem6#1; {2941#(and (<= 1 (select |#length| |ULTIMATE.start_cstrchr_~s#1.base|)) (= |ULTIMATE.start_cstrchr_~s#1.offset| 0))} is VALID [2022-02-20 23:39:14,074 INFO L290 TraceCheckUtils]: 10: Hoare triple {2941#(and (<= 1 (select |#length| |ULTIMATE.start_cstrchr_~s#1.base|)) (= |ULTIMATE.start_cstrchr_~s#1.offset| 0))} assume !cstrchr_#t~short8#1; {2941#(and (<= 1 (select |#length| |ULTIMATE.start_cstrchr_~s#1.base|)) (= |ULTIMATE.start_cstrchr_~s#1.offset| 0))} is VALID [2022-02-20 23:39:14,075 INFO L290 TraceCheckUtils]: 11: Hoare triple {2941#(and (<= 1 (select |#length| |ULTIMATE.start_cstrchr_~s#1.base|)) (= |ULTIMATE.start_cstrchr_~s#1.offset| 0))} assume !cstrchr_#t~short8#1;havoc cstrchr_#t~mem6#1;havoc cstrchr_#t~mem7#1;havoc cstrchr_#t~short8#1; {2941#(and (<= 1 (select |#length| |ULTIMATE.start_cstrchr_~s#1.base|)) (= |ULTIMATE.start_cstrchr_~s#1.offset| 0))} is VALID [2022-02-20 23:39:14,075 INFO L290 TraceCheckUtils]: 12: Hoare triple {2941#(and (<= 1 (select |#length| |ULTIMATE.start_cstrchr_~s#1.base|)) (= |ULTIMATE.start_cstrchr_~s#1.offset| 0))} SUMMARY for call cstrchr_#t~mem10#1 := read~int(cstrchr_~s#1.base, cstrchr_~s#1.offset, 1); srcloc: L531-9 {2941#(and (<= 1 (select |#length| |ULTIMATE.start_cstrchr_~s#1.base|)) (= |ULTIMATE.start_cstrchr_~s#1.offset| 0))} is VALID [2022-02-20 23:39:14,076 INFO L290 TraceCheckUtils]: 13: Hoare triple {2941#(and (<= 1 (select |#length| |ULTIMATE.start_cstrchr_~s#1.base|)) (= |ULTIMATE.start_cstrchr_~s#1.offset| 0))} assume cstrchr_#t~mem10#1 == cstrchr_~c#1;cstrchr_#t~ite11#1.base, cstrchr_#t~ite11#1.offset := cstrchr_~s#1.base, cstrchr_~s#1.offset; {2942#(and (<= 1 (select |#length| |ULTIMATE.start_cstrchr_#t~ite11#1.base|)) (= |ULTIMATE.start_cstrchr_#t~ite11#1.offset| 0))} is VALID [2022-02-20 23:39:14,076 INFO L290 TraceCheckUtils]: 14: Hoare triple {2942#(and (<= 1 (select |#length| |ULTIMATE.start_cstrchr_#t~ite11#1.base|)) (= |ULTIMATE.start_cstrchr_#t~ite11#1.offset| 0))} cstrchr_#res#1.base, cstrchr_#res#1.offset := cstrchr_#t~ite11#1.base, cstrchr_#t~ite11#1.offset;havoc cstrchr_#t~mem10#1;havoc cstrchr_#t~ite11#1.base, cstrchr_#t~ite11#1.offset; {2943#(and (<= 1 (select |#length| |ULTIMATE.start_cstrchr_#res#1.base|)) (= |ULTIMATE.start_cstrchr_#res#1.offset| 0))} is VALID [2022-02-20 23:39:14,077 INFO L290 TraceCheckUtils]: 15: Hoare triple {2943#(and (<= 1 (select |#length| |ULTIMATE.start_cstrchr_#res#1.base|)) (= |ULTIMATE.start_cstrchr_#res#1.offset| 0))} main_#t~ret14#1.base, main_#t~ret14#1.offset := cstrchr_#res#1.base, cstrchr_#res#1.offset;assume { :end_inline_cstrchr } true; {2944#(and (<= 1 (select |#length| |ULTIMATE.start_main_#t~ret14#1.base|)) (= |ULTIMATE.start_main_#t~ret14#1.offset| 0))} is VALID [2022-02-20 23:39:14,077 INFO L290 TraceCheckUtils]: 16: Hoare triple {2944#(and (<= 1 (select |#length| |ULTIMATE.start_main_#t~ret14#1.base|)) (= |ULTIMATE.start_main_#t~ret14#1.offset| 0))} assume !(1 + main_#t~ret14#1.offset <= #length[main_#t~ret14#1.base] && 0 <= main_#t~ret14#1.offset); {2937#false} is VALID [2022-02-20 23:39:14,077 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,078 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:39:14,078 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272139115] [2022-02-20 23:39:14,078 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272139115] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:39:14,078 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:39:14,078 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 23:39:14,078 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415058692] [2022-02-20 23:39:14,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:39:14,079 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 9 states have internal predecessors, (17), 0 states have call successors, (0), 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 17 [2022-02-20 23:39:14,079 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:39:14,079 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 2.125) internal successors, (17), 9 states have internal predecessors, (17), 0 states have call successors, (0), 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,106 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:39:14,106 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 23:39:14,106 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:39:14,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 23:39:14,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-02-20 23:39:14,107 INFO L87 Difference]: Start difference. First operand 57 states and 65 transitions. Second operand has 9 states, 8 states have (on average 2.125) internal successors, (17), 9 states have internal predecessors, (17), 0 states have call successors, (0), 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,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:39:14,563 INFO L93 Difference]: Finished difference Result 84 states and 91 transitions. [2022-02-20 23:39:14,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-20 23:39:14,563 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 9 states have internal predecessors, (17), 0 states have call successors, (0), 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 17 [2022-02-20 23:39:14,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:39:14,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.125) internal successors, (17), 9 states have internal predecessors, (17), 0 states have call successors, (0), 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,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 76 transitions. [2022-02-20 23:39:14,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.125) internal successors, (17), 9 states have internal predecessors, (17), 0 states have call successors, (0), 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,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 76 transitions. [2022-02-20 23:39:14,564 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 76 transitions. [2022-02-20 23:39:14,624 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:39:14,625 INFO L225 Difference]: With dead ends: 84 [2022-02-20 23:39:14,625 INFO L226 Difference]: Without dead ends: 84 [2022-02-20 23:39:14,626 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2022-02-20 23:39:14,626 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 235 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:39:14,626 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [235 Valid, 112 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:39:14,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-02-20 23:39:14,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 61. [2022-02-20 23:39:14,629 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:39:14,629 INFO L82 GeneralOperation]: Start isEquivalent. First operand 84 states. Second operand has 61 states, 52 states have (on average 1.3461538461538463) internal successors, (70), 60 states have internal predecessors, (70), 0 states have call successors, (0), 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,629 INFO L74 IsIncluded]: Start isIncluded. First operand 84 states. Second operand has 61 states, 52 states have (on average 1.3461538461538463) internal successors, (70), 60 states have internal predecessors, (70), 0 states have call successors, (0), 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,630 INFO L87 Difference]: Start difference. First operand 84 states. Second operand has 61 states, 52 states have (on average 1.3461538461538463) internal successors, (70), 60 states have internal predecessors, (70), 0 states have call successors, (0), 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,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:39:14,631 INFO L93 Difference]: Finished difference Result 84 states and 91 transitions. [2022-02-20 23:39:14,631 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 91 transitions. [2022-02-20 23:39:14,631 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:39:14,631 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:39:14,631 INFO L74 IsIncluded]: Start isIncluded. First operand has 61 states, 52 states have (on average 1.3461538461538463) internal successors, (70), 60 states have internal predecessors, (70), 0 states have call successors, (0), 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 84 states. [2022-02-20 23:39:14,632 INFO L87 Difference]: Start difference. First operand has 61 states, 52 states have (on average 1.3461538461538463) internal successors, (70), 60 states have internal predecessors, (70), 0 states have call successors, (0), 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 84 states. [2022-02-20 23:39:14,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:39:14,633 INFO L93 Difference]: Finished difference Result 84 states and 91 transitions. [2022-02-20 23:39:14,633 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 91 transitions. [2022-02-20 23:39:14,633 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:39:14,633 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:39:14,633 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:39:14,633 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:39:14,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 52 states have (on average 1.3461538461538463) internal successors, (70), 60 states have internal predecessors, (70), 0 states have call successors, (0), 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,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 70 transitions. [2022-02-20 23:39:14,634 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 70 transitions. Word has length 17 [2022-02-20 23:39:14,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:39:14,634 INFO L470 AbstractCegarLoop]: Abstraction has 61 states and 70 transitions. [2022-02-20 23:39:14,635 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 9 states have internal predecessors, (17), 0 states have call successors, (0), 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,635 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 70 transitions. [2022-02-20 23:39:14,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-02-20 23:39:14,635 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:39:14,635 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:39:14,635 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-02-20 23:39:14,636 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 12 more)] === [2022-02-20 23:39:14,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:39:14,636 INFO L85 PathProgramCache]: Analyzing trace with hash 639853155, now seen corresponding path program 1 times [2022-02-20 23:39:14,636 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:39:14,636 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500548608] [2022-02-20 23:39:14,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:39:14,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:39:14,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 23:39:14,650 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 23:39:14,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 23:39:14,681 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-20 23:39:14,681 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 23:39:14,682 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr10REQUIRES_VIOLATION (15 of 16 remaining) [2022-02-20 23:39:14,683 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATION (14 of 16 remaining) [2022-02-20 23:39:14,684 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATION (13 of 16 remaining) [2022-02-20 23:39:14,684 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATION (12 of 16 remaining) [2022-02-20 23:39:14,684 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATION (11 of 16 remaining) [2022-02-20 23:39:14,684 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATION (10 of 16 remaining) [2022-02-20 23:39:14,684 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATION (9 of 16 remaining) [2022-02-20 23:39:14,684 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATION (8 of 16 remaining) [2022-02-20 23:39:14,684 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATION (7 of 16 remaining) [2022-02-20 23:39:14,684 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATION (6 of 16 remaining) [2022-02-20 23:39:14,685 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATION (5 of 16 remaining) [2022-02-20 23:39:14,685 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATION (4 of 16 remaining) [2022-02-20 23:39:14,685 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE (3 of 16 remaining) [2022-02-20 23:39:14,685 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE (2 of 16 remaining) [2022-02-20 23:39:14,685 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE (1 of 16 remaining) [2022-02-20 23:39:14,685 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2022-02-20 23:39:14,686 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-02-20 23:39:14,688 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:39:14,690 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 23:39:14,730 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 11:39:14 BoogieIcfgContainer [2022-02-20 23:39:14,734 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 23:39:14,735 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 23:39:14,735 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 23:39:14,735 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 23:39:14,735 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:08" (3/4) ... [2022-02-20 23:39:14,737 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-02-20 23:39:14,771 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-20 23:39:14,771 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 23:39:14,775 INFO L158 Benchmark]: Toolchain (without parser) took 6865.11ms. Allocated memory was 111.1MB in the beginning and 184.5MB in the end (delta: 73.4MB). Free memory was 81.5MB in the beginning and 128.3MB in the end (delta: -46.8MB). Peak memory consumption was 25.8MB. Max. memory is 16.1GB. [2022-02-20 23:39:14,775 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 111.1MB. Free memory was 67.0MB in the beginning and 66.9MB in the end (delta: 84.1kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 23:39:14,775 INFO L158 Benchmark]: CACSL2BoogieTranslator took 365.44ms. Allocated memory is still 111.1MB. Free memory was 81.2MB in the beginning and 79.1MB in the end (delta: 2.1MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-02-20 23:39:14,776 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.93ms. Allocated memory is still 111.1MB. Free memory was 79.1MB in the beginning and 77.1MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 23:39:14,777 INFO L158 Benchmark]: Boogie Preprocessor took 35.12ms. Allocated memory is still 111.1MB. Free memory was 77.1MB in the beginning and 75.3MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 23:39:14,777 INFO L158 Benchmark]: RCFGBuilder took 575.28ms. Allocated memory is still 111.1MB. Free memory was 75.3MB in the beginning and 59.6MB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-02-20 23:39:14,777 INFO L158 Benchmark]: TraceAbstraction took 5801.94ms. Allocated memory was 111.1MB in the beginning and 184.5MB in the end (delta: 73.4MB). Free memory was 59.2MB in the beginning and 131.5MB in the end (delta: -72.3MB). Peak memory consumption was 3.5MB. Max. memory is 16.1GB. [2022-02-20 23:39:14,777 INFO L158 Benchmark]: Witness Printer took 36.66ms. Allocated memory is still 184.5MB. Free memory was 131.5MB in the beginning and 128.3MB in the end (delta: 3.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 23:39:14,780 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.14ms. Allocated memory is still 111.1MB. Free memory was 67.0MB in the beginning and 66.9MB in the end (delta: 84.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 365.44ms. Allocated memory is still 111.1MB. Free memory was 81.2MB in the beginning and 79.1MB in the end (delta: 2.1MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.93ms. Allocated memory is still 111.1MB. Free memory was 79.1MB in the beginning and 77.1MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 35.12ms. Allocated memory is still 111.1MB. Free memory was 77.1MB in the beginning and 75.3MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 575.28ms. Allocated memory is still 111.1MB. Free memory was 75.3MB in the beginning and 59.6MB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 5801.94ms. Allocated memory was 111.1MB in the beginning and 184.5MB in the end (delta: 73.4MB). Free memory was 59.2MB in the beginning and 131.5MB in the end (delta: -72.3MB). Peak memory consumption was 3.5MB. Max. memory is 16.1GB. * Witness Printer took 36.66ms. Allocated memory is still 184.5MB. Free memory was 131.5MB in the beginning and 128.3MB in the end (delta: 3.2MB). 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: 537]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L536] CALL, EXPR build_nondet_String() [L515] int length = __VERIFIER_nondet_int(); [L516] COND TRUE length < 1 [L517] length = 1 VAL [length=1] [L519] char* nondetString = (char*) malloc(length * sizeof(char)); [L521] int i = 0; VAL [i=0, length=1, nondetString={-1:0}] [L521] COND FALSE !(i < length - 1) VAL [i=0, length=1, nondetString={-1:0}] [L526] nondetString[length-1] = '\0' VAL [i=0, length=1, nondetString={-1:0}] [L527] return nondetString; VAL [\result={-1:0}, i=0, length=1, nondetString={-1:0}] [L536] RET, EXPR build_nondet_String() [L536] char* s = build_nondet_String(); [L537] CALL cstrchr(s,__VERIFIER_nondet_int()) [L531] EXPR \read(*s) VAL [\old(c)=2, \read(*s)=0, c=2, s={-1:0}, s={-1:0}] [L531] *s != '\0' && *s != (char)c VAL [*s != '\0' && *s != (char)c=0, \old(c)=2, \read(*s)=0, c=2, s={-1:0}, s={-1:0}] [L531] COND FALSE !(*s != '\0' && *s != (char)c) [L533] EXPR \read(*s) VAL [\old(c)=2, \read(*s)=0, c=2, s={-1:0}, s={-1:0}] [L533] EXPR (*s == c) ? (char *) s : 0 VAL [(*s == c) ? (char *) s : 0={0:0}, \old(c)=2, \read(*s)=0, c=2, s={-1:0}, s={-1:0}] [L533] return ( (*s == c) ? (char *) s : 0 ); [L537] RET cstrchr(s,__VERIFIER_nondet_int()) - 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: 531]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 531]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 531]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 531]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 533]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 533]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 537]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 538]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 538]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 538]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 535]: 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, 45 locations, 16 error locations. Started 1 CEGAR loops. OverallTime: 5.7s, OverallIterations: 13, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1212 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1212 mSDsluCounter, 1257 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 871 mSDsCounter, 48 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 730 IncrementalHoareTripleChecker+Invalid, 778 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 48 mSolverCounterUnsat, 386 mSDtfsCounter, 730 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 108 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=61occurred in iteration=12, InterpolantAutomatonStates: 73, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 12 MinimizatonAttempts, 230 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 156 NumberOfCodeBlocks, 156 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 135 ConstructedInterpolants, 0 QuantifiedInterpolants, 797 SizeOfPredicates, 1 NumberOfNonLiveVariables, 45 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 14 InterpolantComputations, 11 PerfectInterpolantSequences, 4/9 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:14,813 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-deref)