./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/array-memsafety/openbsd_cstpncpy-alloca-1.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/openbsd_cstpncpy-alloca-1.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 36c3a12d89778d96e6058a4f11ff4e1483403bd2fab9b14de640491057c7f753 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 23:40:39,240 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 23:40:39,241 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 23:40:39,266 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 23:40:39,266 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 23:40:39,268 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 23:40:39,270 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 23:40:39,273 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 23:40:39,274 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 23:40:39,281 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 23:40:39,282 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 23:40:39,283 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 23:40:39,283 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 23:40:39,285 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 23:40:39,287 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 23:40:39,288 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 23:40:39,288 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 23:40:39,289 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 23:40:39,292 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 23:40:39,296 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 23:40:39,297 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 23:40:39,298 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 23:40:39,299 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 23:40:39,300 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 23:40:39,305 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 23:40:39,305 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 23:40:39,305 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 23:40:39,306 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 23:40:39,307 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 23:40:39,308 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 23:40:39,308 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 23:40:39,309 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 23:40:39,310 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 23:40:39,311 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 23:40:39,312 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 23:40:39,312 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 23:40:39,313 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 23:40:39,313 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 23:40:39,313 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 23:40:39,314 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 23:40:39,314 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 23:40:39,316 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:40:39,347 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 23:40:39,347 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 23:40:39,355 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 23:40:39,355 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 23:40:39,356 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 23:40:39,356 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 23:40:39,356 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 23:40:39,357 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 23:40:39,357 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 23:40:39,357 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 23:40:39,357 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 23:40:39,358 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-20 23:40:39,358 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 23:40:39,358 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 23:40:39,358 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 23:40:39,358 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-02-20 23:40:39,358 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-02-20 23:40:39,358 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-02-20 23:40:39,359 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 23:40:39,359 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 23:40:39,359 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 23:40:39,359 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 23:40:39,359 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 23:40:39,359 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 23:40:39,359 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 23:40:39,360 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:40:39,360 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 23:40:39,361 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 23:40:39,361 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 23:40:39,361 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 23:40:39,361 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 -> 36c3a12d89778d96e6058a4f11ff4e1483403bd2fab9b14de640491057c7f753 [2022-02-20 23:40:39,571 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 23:40:39,585 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 23:40:39,587 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 23:40:39,588 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 23:40:39,588 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 23:40:39,589 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety/openbsd_cstpncpy-alloca-1.i [2022-02-20 23:40:39,648 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e988ec726/27cc2d44fa3842cfb640655c1b5e5af2/FLAGbc51e4ed6 [2022-02-20 23:40:40,022 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 23:40:40,022 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/openbsd_cstpncpy-alloca-1.i [2022-02-20 23:40:40,029 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e988ec726/27cc2d44fa3842cfb640655c1b5e5af2/FLAGbc51e4ed6 [2022-02-20 23:40:40,388 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e988ec726/27cc2d44fa3842cfb640655c1b5e5af2 [2022-02-20 23:40:40,397 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 23:40:40,398 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 23:40:40,399 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 23:40:40,399 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 23:40:40,421 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 23:40:40,422 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:40:40" (1/1) ... [2022-02-20 23:40:40,423 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2daf3e81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:40:40, skipping insertion in model container [2022-02-20 23:40:40,423 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:40:40" (1/1) ... [2022-02-20 23:40:40,427 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 23:40:40,467 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 23:40:40,678 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:40:40,683 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 23:40:40,712 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:40:40,728 INFO L208 MainTranslator]: Completed translation [2022-02-20 23:40:40,729 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:40:40 WrapperNode [2022-02-20 23:40:40,729 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 23:40:40,730 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 23:40:40,730 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 23:40:40,730 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 23:40:40,744 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:40:40" (1/1) ... [2022-02-20 23:40:40,752 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:40:40" (1/1) ... [2022-02-20 23:40:40,770 INFO L137 Inliner]: procedures = 119, calls = 23, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 98 [2022-02-20 23:40:40,770 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 23:40:40,771 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 23:40:40,771 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 23:40:40,771 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 23:40:40,776 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:40:40" (1/1) ... [2022-02-20 23:40:40,776 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:40:40" (1/1) ... [2022-02-20 23:40:40,778 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:40:40" (1/1) ... [2022-02-20 23:40:40,778 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:40:40" (1/1) ... [2022-02-20 23:40:40,785 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:40:40" (1/1) ... [2022-02-20 23:40:40,788 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:40:40" (1/1) ... [2022-02-20 23:40:40,789 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:40:40" (1/1) ... [2022-02-20 23:40:40,790 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 23:40:40,791 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 23:40:40,791 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 23:40:40,791 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 23:40:40,792 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:40:40" (1/1) ... [2022-02-20 23:40:40,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:40:40,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:40:40,821 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:40:40,827 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:40:40,848 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 23:40:40,849 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 23:40:40,849 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-20 23:40:40,850 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 23:40:40,851 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-20 23:40:40,851 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 23:40:40,851 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 23:40:40,851 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 23:40:40,926 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 23:40:40,928 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 23:40:41,224 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 23:40:41,229 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 23:40:41,229 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-02-20 23:40:41,230 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:40:41 BoogieIcfgContainer [2022-02-20 23:40:41,230 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 23:40:41,231 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 23:40:41,232 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 23:40:41,234 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 23:40:41,234 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 11:40:40" (1/3) ... [2022-02-20 23:40:41,235 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5be25a3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:40:41, skipping insertion in model container [2022-02-20 23:40:41,235 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:40:40" (2/3) ... [2022-02-20 23:40:41,235 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5be25a3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:40:41, skipping insertion in model container [2022-02-20 23:40:41,235 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:40:41" (3/3) ... [2022-02-20 23:40:41,236 INFO L111 eAbstractionObserver]: Analyzing ICFG openbsd_cstpncpy-alloca-1.i [2022-02-20 23:40:41,240 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 23:40:41,240 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 23 error locations. [2022-02-20 23:40:41,267 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 23:40:41,271 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:40:41,272 INFO L340 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2022-02-20 23:40:41,283 INFO L276 IsEmpty]: Start isEmpty. Operand has 59 states, 35 states have (on average 1.9428571428571428) internal successors, (68), 58 states have internal predecessors, (68), 0 states have call successors, (0), 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:40:41,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-02-20 23:40:41,286 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:40:41,287 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:40:41,287 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2022-02-20 23:40:41,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:40:41,290 INFO L85 PathProgramCache]: Analyzing trace with hash 1805029043, now seen corresponding path program 1 times [2022-02-20 23:40:41,297 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:40:41,297 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159757799] [2022-02-20 23:40:41,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:40:41,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:40:41,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:40:41,485 INFO L290 TraceCheckUtils]: 0: Hoare triple {62#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {62#true} is VALID [2022-02-20 23:40:41,486 INFO L290 TraceCheckUtils]: 1: Hoare triple {62#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~nondet12#1, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_#t~nondet16#1, main_#t~post15#1, main_~i~0#1, main_#t~ret17#1.base, main_#t~ret17#1.offset, main_~length~0#1, main_~n~0#1, main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset, main_~nondetString~0#1.base, main_~nondetString~0#1.offset;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~length~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~n~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; {62#true} is VALID [2022-02-20 23:40:41,487 INFO L290 TraceCheckUtils]: 2: Hoare triple {62#true} assume main_~length~0#1 < 1;main_~length~0#1 := 1; {64#(= |ULTIMATE.start_main_~length~0#1| 1)} is VALID [2022-02-20 23:40:41,488 INFO L290 TraceCheckUtils]: 3: Hoare triple {64#(= |ULTIMATE.start_main_~length~0#1| 1)} assume main_~n~0#1 < 1;main_~n~0#1 := 1; {64#(= |ULTIMATE.start_main_~length~0#1| 1)} is VALID [2022-02-20 23:40:41,489 INFO L290 TraceCheckUtils]: 4: Hoare triple {64#(= |ULTIMATE.start_main_~length~0#1| 1)} call main_#t~malloc13#1.base, main_#t~malloc13#1.offset := #Ultimate.allocOnStack(main_~n~0#1);main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset := main_#t~malloc13#1.base, main_#t~malloc13#1.offset;call main_#t~malloc14#1.base, main_#t~malloc14#1.offset := #Ultimate.allocOnStack(main_~length~0#1);main_~nondetString~0#1.base, main_~nondetString~0#1.offset := main_#t~malloc14#1.base, main_#t~malloc14#1.offset;main_~i~0#1 := 0; {65#(and (= (select |#valid| |ULTIMATE.start_main_~nondetString~0#1.base|) 1) (= |ULTIMATE.start_main_~length~0#1| 1))} is VALID [2022-02-20 23:40:41,490 INFO L290 TraceCheckUtils]: 5: Hoare triple {65#(and (= (select |#valid| |ULTIMATE.start_main_~nondetString~0#1.base|) 1) (= |ULTIMATE.start_main_~length~0#1| 1))} assume !(main_~i~0#1 < main_~length~0#1 - 1); {66#(= (select |#valid| |ULTIMATE.start_main_~nondetString~0#1.base|) 1)} is VALID [2022-02-20 23:40:41,490 INFO L290 TraceCheckUtils]: 6: Hoare triple {66#(= (select |#valid| |ULTIMATE.start_main_~nondetString~0#1.base|) 1)} assume !(1 == #valid[main_~nondetString~0#1.base]); {63#false} is VALID [2022-02-20 23:40:41,491 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:40:41,492 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:40:41,492 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159757799] [2022-02-20 23:40:41,492 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159757799] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:40:41,493 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:40:41,493 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:40:41,494 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312093882] [2022-02-20 23:40:41,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:40:41,498 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 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 7 [2022-02-20 23:40:41,498 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:40:41,500 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 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:40:41,508 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:40:41,509 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:40:41,510 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:40:41,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:40:41,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:40:41,533 INFO L87 Difference]: Start difference. First operand has 59 states, 35 states have (on average 1.9428571428571428) internal successors, (68), 58 states have internal predecessors, (68), 0 states have call successors, (0), 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 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 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:40:41,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:40:41,815 INFO L93 Difference]: Finished difference Result 111 states and 122 transitions. [2022-02-20 23:40:41,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 23:40:41,815 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 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 7 [2022-02-20 23:40:41,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:40:41,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 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:40:41,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 132 transitions. [2022-02-20 23:40:41,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 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:40:41,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 132 transitions. [2022-02-20 23:40:41,840 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 132 transitions. [2022-02-20 23:40:41,941 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 132 edges. 132 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:40:41,949 INFO L225 Difference]: With dead ends: 111 [2022-02-20 23:40:41,949 INFO L226 Difference]: Without dead ends: 107 [2022-02-20 23:40:41,950 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:40:41,953 INFO L933 BasicCegarLoop]: 36 mSDtfsCounter, 106 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:40:41,953 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [106 Valid, 103 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:40:41,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-02-20 23:40:41,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 55. [2022-02-20 23:40:41,972 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:40:41,973 INFO L82 GeneralOperation]: Start isEquivalent. First operand 107 states. Second operand has 55 states, 34 states have (on average 1.7941176470588236) internal successors, (61), 54 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:40:41,973 INFO L74 IsIncluded]: Start isIncluded. First operand 107 states. Second operand has 55 states, 34 states have (on average 1.7941176470588236) internal successors, (61), 54 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:40:41,974 INFO L87 Difference]: Start difference. First operand 107 states. Second operand has 55 states, 34 states have (on average 1.7941176470588236) internal successors, (61), 54 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:40:41,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:40:41,978 INFO L93 Difference]: Finished difference Result 107 states and 118 transitions. [2022-02-20 23:40:41,978 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 118 transitions. [2022-02-20 23:40:41,978 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:40:41,979 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:40:41,979 INFO L74 IsIncluded]: Start isIncluded. First operand has 55 states, 34 states have (on average 1.7941176470588236) internal successors, (61), 54 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 107 states. [2022-02-20 23:40:41,979 INFO L87 Difference]: Start difference. First operand has 55 states, 34 states have (on average 1.7941176470588236) internal successors, (61), 54 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 107 states. [2022-02-20 23:40:41,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:40:41,983 INFO L93 Difference]: Finished difference Result 107 states and 118 transitions. [2022-02-20 23:40:41,983 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 118 transitions. [2022-02-20 23:40:41,984 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:40:41,984 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:40:41,984 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:40:41,984 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:40:41,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 34 states have (on average 1.7941176470588236) internal successors, (61), 54 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:40:41,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 61 transitions. [2022-02-20 23:40:41,987 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 61 transitions. Word has length 7 [2022-02-20 23:40:41,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:40:41,987 INFO L470 AbstractCegarLoop]: Abstraction has 55 states and 61 transitions. [2022-02-20 23:40:41,988 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 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:40:41,988 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 61 transitions. [2022-02-20 23:40:41,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-02-20 23:40:41,988 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:40:41,988 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:40:41,989 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 23:40:41,989 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2022-02-20 23:40:41,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:40:41,990 INFO L85 PathProgramCache]: Analyzing trace with hash 1805029044, now seen corresponding path program 1 times [2022-02-20 23:40:41,990 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:40:41,990 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059141433] [2022-02-20 23:40:41,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:40:41,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:40:42,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:40:42,043 INFO L290 TraceCheckUtils]: 0: Hoare triple {449#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {449#true} is VALID [2022-02-20 23:40:42,043 INFO L290 TraceCheckUtils]: 1: Hoare triple {449#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~nondet12#1, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_#t~nondet16#1, main_#t~post15#1, main_~i~0#1, main_#t~ret17#1.base, main_#t~ret17#1.offset, main_~length~0#1, main_~n~0#1, main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset, main_~nondetString~0#1.base, main_~nondetString~0#1.offset;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~length~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~n~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; {449#true} is VALID [2022-02-20 23:40:42,044 INFO L290 TraceCheckUtils]: 2: Hoare triple {449#true} assume main_~length~0#1 < 1;main_~length~0#1 := 1; {451#(<= 1 |ULTIMATE.start_main_~length~0#1|)} is VALID [2022-02-20 23:40:42,044 INFO L290 TraceCheckUtils]: 3: Hoare triple {451#(<= 1 |ULTIMATE.start_main_~length~0#1|)} assume main_~n~0#1 < 1;main_~n~0#1 := 1; {451#(<= 1 |ULTIMATE.start_main_~length~0#1|)} is VALID [2022-02-20 23:40:42,045 INFO L290 TraceCheckUtils]: 4: Hoare triple {451#(<= 1 |ULTIMATE.start_main_~length~0#1|)} call main_#t~malloc13#1.base, main_#t~malloc13#1.offset := #Ultimate.allocOnStack(main_~n~0#1);main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset := main_#t~malloc13#1.base, main_#t~malloc13#1.offset;call main_#t~malloc14#1.base, main_#t~malloc14#1.offset := #Ultimate.allocOnStack(main_~length~0#1);main_~nondetString~0#1.base, main_~nondetString~0#1.offset := main_#t~malloc14#1.base, main_#t~malloc14#1.offset;main_~i~0#1 := 0; {452#(and (= |ULTIMATE.start_main_~nondetString~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~length~0#1|) (<= |ULTIMATE.start_main_~length~0#1| (select |#length| |ULTIMATE.start_main_~nondetString~0#1.base|)))} is VALID [2022-02-20 23:40:42,045 INFO L290 TraceCheckUtils]: 5: Hoare triple {452#(and (= |ULTIMATE.start_main_~nondetString~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~length~0#1|) (<= |ULTIMATE.start_main_~length~0#1| (select |#length| |ULTIMATE.start_main_~nondetString~0#1.base|)))} assume !(main_~i~0#1 < main_~length~0#1 - 1); {452#(and (= |ULTIMATE.start_main_~nondetString~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~length~0#1|) (<= |ULTIMATE.start_main_~length~0#1| (select |#length| |ULTIMATE.start_main_~nondetString~0#1.base|)))} is VALID [2022-02-20 23:40:42,046 INFO L290 TraceCheckUtils]: 6: Hoare triple {452#(and (= |ULTIMATE.start_main_~nondetString~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~length~0#1|) (<= |ULTIMATE.start_main_~length~0#1| (select |#length| |ULTIMATE.start_main_~nondetString~0#1.base|)))} assume !(1 + (main_~nondetString~0#1.offset + (main_~length~0#1 - 1)) <= #length[main_~nondetString~0#1.base] && 0 <= main_~nondetString~0#1.offset + (main_~length~0#1 - 1)); {450#false} is VALID [2022-02-20 23:40:42,046 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:40:42,046 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:40:42,046 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059141433] [2022-02-20 23:40:42,047 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059141433] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:40:42,047 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:40:42,047 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:40:42,047 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897477463] [2022-02-20 23:40:42,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:40:42,048 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 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 7 [2022-02-20 23:40:42,048 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:40:42,048 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 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:40:42,053 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:40:42,054 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:40:42,054 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:40:42,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:40:42,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:40:42,055 INFO L87 Difference]: Start difference. First operand 55 states and 61 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 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:40:42,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:40:42,157 INFO L93 Difference]: Finished difference Result 54 states and 60 transitions. [2022-02-20 23:40:42,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 23:40:42,157 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 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 7 [2022-02-20 23:40:42,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:40:42,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 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:40:42,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 61 transitions. [2022-02-20 23:40:42,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 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:40:42,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 61 transitions. [2022-02-20 23:40:42,159 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 61 transitions. [2022-02-20 23:40:42,202 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:40:42,203 INFO L225 Difference]: With dead ends: 54 [2022-02-20 23:40:42,203 INFO L226 Difference]: Without dead ends: 54 [2022-02-20 23:40:42,203 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:40:42,204 INFO L933 BasicCegarLoop]: 53 mSDtfsCounter, 60 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:40:42,204 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [60 Valid, 83 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:40:42,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-02-20 23:40:42,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2022-02-20 23:40:42,207 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:40:42,207 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand has 54 states, 34 states have (on average 1.7647058823529411) internal successors, (60), 53 states have internal predecessors, (60), 0 states have call successors, (0), 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:40:42,207 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand has 54 states, 34 states have (on average 1.7647058823529411) internal successors, (60), 53 states have internal predecessors, (60), 0 states have call successors, (0), 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:40:42,207 INFO L87 Difference]: Start difference. First operand 54 states. Second operand has 54 states, 34 states have (on average 1.7647058823529411) internal successors, (60), 53 states have internal predecessors, (60), 0 states have call successors, (0), 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:40:42,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:40:42,209 INFO L93 Difference]: Finished difference Result 54 states and 60 transitions. [2022-02-20 23:40:42,209 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 60 transitions. [2022-02-20 23:40:42,209 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:40:42,209 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:40:42,210 INFO L74 IsIncluded]: Start isIncluded. First operand has 54 states, 34 states have (on average 1.7647058823529411) internal successors, (60), 53 states have internal predecessors, (60), 0 states have call successors, (0), 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 54 states. [2022-02-20 23:40:42,210 INFO L87 Difference]: Start difference. First operand has 54 states, 34 states have (on average 1.7647058823529411) internal successors, (60), 53 states have internal predecessors, (60), 0 states have call successors, (0), 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 54 states. [2022-02-20 23:40:42,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:40:42,211 INFO L93 Difference]: Finished difference Result 54 states and 60 transitions. [2022-02-20 23:40:42,212 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 60 transitions. [2022-02-20 23:40:42,212 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:40:42,212 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:40:42,212 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:40:42,212 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:40:42,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 34 states have (on average 1.7647058823529411) internal successors, (60), 53 states have internal predecessors, (60), 0 states have call successors, (0), 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:40:42,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 60 transitions. [2022-02-20 23:40:42,214 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 60 transitions. Word has length 7 [2022-02-20 23:40:42,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:40:42,214 INFO L470 AbstractCegarLoop]: Abstraction has 54 states and 60 transitions. [2022-02-20 23:40:42,214 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 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:40:42,214 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 60 transitions. [2022-02-20 23:40:42,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-02-20 23:40:42,215 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:40:42,215 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:40:42,215 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 23:40:42,215 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2022-02-20 23:40:42,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:40:42,216 INFO L85 PathProgramCache]: Analyzing trace with hash 1805029097, now seen corresponding path program 1 times [2022-02-20 23:40:42,216 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:40:42,216 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643821699] [2022-02-20 23:40:42,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:40:42,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:40:42,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:40:42,267 INFO L290 TraceCheckUtils]: 0: Hoare triple {671#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {671#true} is VALID [2022-02-20 23:40:42,267 INFO L290 TraceCheckUtils]: 1: Hoare triple {671#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~nondet12#1, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_#t~nondet16#1, main_#t~post15#1, main_~i~0#1, main_#t~ret17#1.base, main_#t~ret17#1.offset, main_~length~0#1, main_~n~0#1, main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset, main_~nondetString~0#1.base, main_~nondetString~0#1.offset;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~length~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~n~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; {671#true} is VALID [2022-02-20 23:40:42,269 INFO L290 TraceCheckUtils]: 2: Hoare triple {671#true} assume main_~length~0#1 < 1;main_~length~0#1 := 1; {673#(<= |ULTIMATE.start_main_~length~0#1| 1)} is VALID [2022-02-20 23:40:42,270 INFO L290 TraceCheckUtils]: 3: Hoare triple {673#(<= |ULTIMATE.start_main_~length~0#1| 1)} assume main_~n~0#1 < 1;main_~n~0#1 := 1; {673#(<= |ULTIMATE.start_main_~length~0#1| 1)} is VALID [2022-02-20 23:40:42,270 INFO L290 TraceCheckUtils]: 4: Hoare triple {673#(<= |ULTIMATE.start_main_~length~0#1| 1)} call main_#t~malloc13#1.base, main_#t~malloc13#1.offset := #Ultimate.allocOnStack(main_~n~0#1);main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset := main_#t~malloc13#1.base, main_#t~malloc13#1.offset;call main_#t~malloc14#1.base, main_#t~malloc14#1.offset := #Ultimate.allocOnStack(main_~length~0#1);main_~nondetString~0#1.base, main_~nondetString~0#1.offset := main_#t~malloc14#1.base, main_#t~malloc14#1.offset;main_~i~0#1 := 0; {674#(and (<= |ULTIMATE.start_main_~length~0#1| 1) (= |ULTIMATE.start_main_~i~0#1| 0))} is VALID [2022-02-20 23:40:42,271 INFO L290 TraceCheckUtils]: 5: Hoare triple {674#(and (<= |ULTIMATE.start_main_~length~0#1| 1) (= |ULTIMATE.start_main_~i~0#1| 0))} assume !!(main_~i~0#1 < main_~length~0#1 - 1);assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127; {672#false} is VALID [2022-02-20 23:40:42,271 INFO L290 TraceCheckUtils]: 6: Hoare triple {672#false} assume !(1 + (main_~nondetString~0#1.offset + main_~i~0#1) <= #length[main_~nondetString~0#1.base] && 0 <= main_~nondetString~0#1.offset + main_~i~0#1); {672#false} is VALID [2022-02-20 23:40:42,271 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:40:42,271 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:40:42,272 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643821699] [2022-02-20 23:40:42,272 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643821699] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:40:42,272 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:40:42,272 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:40:42,272 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006901559] [2022-02-20 23:40:42,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:40:42,273 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 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 7 [2022-02-20 23:40:42,274 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:40:42,274 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 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:40:42,279 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:40:42,279 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:40:42,280 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:40:42,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:40:42,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:40:42,280 INFO L87 Difference]: Start difference. First operand 54 states and 60 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 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:40:42,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:40:42,382 INFO L93 Difference]: Finished difference Result 101 states and 111 transitions. [2022-02-20 23:40:42,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 23:40:42,382 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 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 7 [2022-02-20 23:40:42,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:40:42,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 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:40:42,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 112 transitions. [2022-02-20 23:40:42,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 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:40:42,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 112 transitions. [2022-02-20 23:40:42,385 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 112 transitions. [2022-02-20 23:40:42,461 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:40:42,464 INFO L225 Difference]: With dead ends: 101 [2022-02-20 23:40:42,464 INFO L226 Difference]: Without dead ends: 101 [2022-02-20 23:40:42,465 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:40:42,468 INFO L933 BasicCegarLoop]: 57 mSDtfsCounter, 98 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:40:42,469 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [98 Valid, 112 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:40:42,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-02-20 23:40:42,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 57. [2022-02-20 23:40:42,471 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:40:42,474 INFO L82 GeneralOperation]: Start isEquivalent. First operand 101 states. Second operand has 57 states, 37 states have (on average 1.7297297297297298) internal successors, (64), 56 states have internal predecessors, (64), 0 states have call successors, (0), 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:40:42,474 INFO L74 IsIncluded]: Start isIncluded. First operand 101 states. Second operand has 57 states, 37 states have (on average 1.7297297297297298) internal successors, (64), 56 states have internal predecessors, (64), 0 states have call successors, (0), 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:40:42,475 INFO L87 Difference]: Start difference. First operand 101 states. Second operand has 57 states, 37 states have (on average 1.7297297297297298) internal successors, (64), 56 states have internal predecessors, (64), 0 states have call successors, (0), 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:40:42,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:40:42,477 INFO L93 Difference]: Finished difference Result 101 states and 111 transitions. [2022-02-20 23:40:42,477 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 111 transitions. [2022-02-20 23:40:42,478 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:40:42,478 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:40:42,478 INFO L74 IsIncluded]: Start isIncluded. First operand has 57 states, 37 states have (on average 1.7297297297297298) internal successors, (64), 56 states have internal predecessors, (64), 0 states have call successors, (0), 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 101 states. [2022-02-20 23:40:42,478 INFO L87 Difference]: Start difference. First operand has 57 states, 37 states have (on average 1.7297297297297298) internal successors, (64), 56 states have internal predecessors, (64), 0 states have call successors, (0), 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 101 states. [2022-02-20 23:40:42,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:40:42,480 INFO L93 Difference]: Finished difference Result 101 states and 111 transitions. [2022-02-20 23:40:42,480 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 111 transitions. [2022-02-20 23:40:42,481 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:40:42,481 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:40:42,481 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:40:42,481 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:40:42,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 37 states have (on average 1.7297297297297298) internal successors, (64), 56 states have internal predecessors, (64), 0 states have call successors, (0), 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:40:42,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 64 transitions. [2022-02-20 23:40:42,482 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 64 transitions. Word has length 7 [2022-02-20 23:40:42,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:40:42,482 INFO L470 AbstractCegarLoop]: Abstraction has 57 states and 64 transitions. [2022-02-20 23:40:42,482 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 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:40:42,482 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 64 transitions. [2022-02-20 23:40:42,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-02-20 23:40:42,483 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:40:42,483 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:40:42,483 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 23:40:42,483 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2022-02-20 23:40:42,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:40:42,483 INFO L85 PathProgramCache]: Analyzing trace with hash 1806876139, now seen corresponding path program 1 times [2022-02-20 23:40:42,483 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:40:42,483 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804408546] [2022-02-20 23:40:42,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:40:42,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:40:42,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:40:42,537 INFO L290 TraceCheckUtils]: 0: Hoare triple {1037#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {1037#true} is VALID [2022-02-20 23:40:42,538 INFO L290 TraceCheckUtils]: 1: Hoare triple {1037#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~nondet12#1, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_#t~nondet16#1, main_#t~post15#1, main_~i~0#1, main_#t~ret17#1.base, main_#t~ret17#1.offset, main_~length~0#1, main_~n~0#1, main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset, main_~nondetString~0#1.base, main_~nondetString~0#1.offset;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~length~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~n~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; {1037#true} is VALID [2022-02-20 23:40:42,538 INFO L290 TraceCheckUtils]: 2: Hoare triple {1037#true} assume !(main_~length~0#1 < 1); {1039#(<= 1 |ULTIMATE.start_main_~length~0#1|)} is VALID [2022-02-20 23:40:42,539 INFO L290 TraceCheckUtils]: 3: Hoare triple {1039#(<= 1 |ULTIMATE.start_main_~length~0#1|)} assume main_~n~0#1 < 1;main_~n~0#1 := 1; {1039#(<= 1 |ULTIMATE.start_main_~length~0#1|)} is VALID [2022-02-20 23:40:42,539 INFO L290 TraceCheckUtils]: 4: Hoare triple {1039#(<= 1 |ULTIMATE.start_main_~length~0#1|)} call main_#t~malloc13#1.base, main_#t~malloc13#1.offset := #Ultimate.allocOnStack(main_~n~0#1);main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset := main_#t~malloc13#1.base, main_#t~malloc13#1.offset;call main_#t~malloc14#1.base, main_#t~malloc14#1.offset := #Ultimate.allocOnStack(main_~length~0#1);main_~nondetString~0#1.base, main_~nondetString~0#1.offset := main_#t~malloc14#1.base, main_#t~malloc14#1.offset;main_~i~0#1 := 0; {1040#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~nondetString~0#1.offset| 0) (<= 1 (select |#length| |ULTIMATE.start_main_~nondetString~0#1.base|)))} is VALID [2022-02-20 23:40:42,540 INFO L290 TraceCheckUtils]: 5: Hoare triple {1040#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~nondetString~0#1.offset| 0) (<= 1 (select |#length| |ULTIMATE.start_main_~nondetString~0#1.base|)))} assume !!(main_~i~0#1 < main_~length~0#1 - 1);assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127; {1040#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~nondetString~0#1.offset| 0) (<= 1 (select |#length| |ULTIMATE.start_main_~nondetString~0#1.base|)))} is VALID [2022-02-20 23:40:42,540 INFO L290 TraceCheckUtils]: 6: Hoare triple {1040#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~nondetString~0#1.offset| 0) (<= 1 (select |#length| |ULTIMATE.start_main_~nondetString~0#1.base|)))} assume !(1 + (main_~nondetString~0#1.offset + main_~i~0#1) <= #length[main_~nondetString~0#1.base] && 0 <= main_~nondetString~0#1.offset + main_~i~0#1); {1038#false} is VALID [2022-02-20 23:40:42,541 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:40:42,541 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:40:42,541 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804408546] [2022-02-20 23:40:42,541 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804408546] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:40:42,541 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:40:42,541 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:40:42,541 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112922345] [2022-02-20 23:40:42,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:40:42,542 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 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 7 [2022-02-20 23:40:42,542 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:40:42,542 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 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:40:42,546 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:40:42,547 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:40:42,547 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:40:42,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:40:42,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:40:42,547 INFO L87 Difference]: Start difference. First operand 57 states and 64 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 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:40:42,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:40:42,707 INFO L93 Difference]: Finished difference Result 105 states and 116 transitions. [2022-02-20 23:40:42,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 23:40:42,708 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 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 7 [2022-02-20 23:40:42,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:40:42,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 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:40:42,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 113 transitions. [2022-02-20 23:40:42,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 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:40:42,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 113 transitions. [2022-02-20 23:40:42,710 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 113 transitions. [2022-02-20 23:40:42,796 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 113 edges. 113 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:40:42,797 INFO L225 Difference]: With dead ends: 105 [2022-02-20 23:40:42,797 INFO L226 Difference]: Without dead ends: 105 [2022-02-20 23:40:42,798 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:40:42,802 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 154 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:40:42,803 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [154 Valid, 69 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:40:42,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-02-20 23:40:42,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 59. [2022-02-20 23:40:42,810 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:40:42,810 INFO L82 GeneralOperation]: Start isEquivalent. First operand 105 states. Second operand has 59 states, 39 states have (on average 1.7179487179487178) internal successors, (67), 58 states have internal predecessors, (67), 0 states have call successors, (0), 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:40:42,810 INFO L74 IsIncluded]: Start isIncluded. First operand 105 states. Second operand has 59 states, 39 states have (on average 1.7179487179487178) internal successors, (67), 58 states have internal predecessors, (67), 0 states have call successors, (0), 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:40:42,811 INFO L87 Difference]: Start difference. First operand 105 states. Second operand has 59 states, 39 states have (on average 1.7179487179487178) internal successors, (67), 58 states have internal predecessors, (67), 0 states have call successors, (0), 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:40:42,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:40:42,814 INFO L93 Difference]: Finished difference Result 105 states and 116 transitions. [2022-02-20 23:40:42,814 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 116 transitions. [2022-02-20 23:40:42,817 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:40:42,820 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:40:42,820 INFO L74 IsIncluded]: Start isIncluded. First operand has 59 states, 39 states have (on average 1.7179487179487178) internal successors, (67), 58 states have internal predecessors, (67), 0 states have call successors, (0), 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 105 states. [2022-02-20 23:40:42,821 INFO L87 Difference]: Start difference. First operand has 59 states, 39 states have (on average 1.7179487179487178) internal successors, (67), 58 states have internal predecessors, (67), 0 states have call successors, (0), 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 105 states. [2022-02-20 23:40:42,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:40:42,826 INFO L93 Difference]: Finished difference Result 105 states and 116 transitions. [2022-02-20 23:40:42,827 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 116 transitions. [2022-02-20 23:40:42,827 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:40:42,827 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:40:42,828 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:40:42,828 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:40:42,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 39 states have (on average 1.7179487179487178) internal successors, (67), 58 states have internal predecessors, (67), 0 states have call successors, (0), 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:40:42,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 67 transitions. [2022-02-20 23:40:42,830 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 67 transitions. Word has length 7 [2022-02-20 23:40:42,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:40:42,830 INFO L470 AbstractCegarLoop]: Abstraction has 59 states and 67 transitions. [2022-02-20 23:40:42,830 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 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:40:42,831 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 67 transitions. [2022-02-20 23:40:42,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-02-20 23:40:42,831 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:40:42,831 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:40:42,832 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 23:40:42,832 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2022-02-20 23:40:42,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:40:42,832 INFO L85 PathProgramCache]: Analyzing trace with hash -533877068, now seen corresponding path program 1 times [2022-02-20 23:40:42,833 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:40:42,833 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968627849] [2022-02-20 23:40:42,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:40:42,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:40:42,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:40:42,893 INFO L290 TraceCheckUtils]: 0: Hoare triple {1419#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {1419#true} is VALID [2022-02-20 23:40:42,893 INFO L290 TraceCheckUtils]: 1: Hoare triple {1419#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~nondet12#1, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_#t~nondet16#1, main_#t~post15#1, main_~i~0#1, main_#t~ret17#1.base, main_#t~ret17#1.offset, main_~length~0#1, main_~n~0#1, main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset, main_~nondetString~0#1.base, main_~nondetString~0#1.offset;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~length~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~n~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; {1419#true} is VALID [2022-02-20 23:40:42,893 INFO L290 TraceCheckUtils]: 2: Hoare triple {1419#true} assume main_~length~0#1 < 1;main_~length~0#1 := 1; {1419#true} is VALID [2022-02-20 23:40:42,894 INFO L290 TraceCheckUtils]: 3: Hoare triple {1419#true} assume main_~n~0#1 < 1;main_~n~0#1 := 1; {1419#true} is VALID [2022-02-20 23:40:42,894 INFO L290 TraceCheckUtils]: 4: Hoare triple {1419#true} call main_#t~malloc13#1.base, main_#t~malloc13#1.offset := #Ultimate.allocOnStack(main_~n~0#1);main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset := main_#t~malloc13#1.base, main_#t~malloc13#1.offset;call main_#t~malloc14#1.base, main_#t~malloc14#1.offset := #Ultimate.allocOnStack(main_~length~0#1);main_~nondetString~0#1.base, main_~nondetString~0#1.offset := main_#t~malloc14#1.base, main_#t~malloc14#1.offset;main_~i~0#1 := 0; {1419#true} is VALID [2022-02-20 23:40:42,894 INFO L290 TraceCheckUtils]: 5: Hoare triple {1419#true} assume !(main_~i~0#1 < main_~length~0#1 - 1); {1419#true} is VALID [2022-02-20 23:40:42,894 INFO L290 TraceCheckUtils]: 6: Hoare triple {1419#true} SUMMARY for call write~int(0, main_~nondetString~0#1.base, main_~nondetString~0#1.offset + (main_~length~0#1 - 1), 1); srcloc: L543-4 {1419#true} is VALID [2022-02-20 23:40:42,895 INFO L290 TraceCheckUtils]: 7: Hoare triple {1419#true} assume { :begin_inline_cstpncpy } true;cstpncpy_#in~dst#1.base, cstpncpy_#in~dst#1.offset, cstpncpy_#in~src#1.base, cstpncpy_#in~src#1.offset, cstpncpy_#in~n#1 := main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset, main_~nondetString~0#1.base, main_~nondetString~0#1.offset, main_~n~0#1;havoc cstpncpy_#res#1.base, cstpncpy_#res#1.offset;havoc cstpncpy_#t~mem2#1.base, cstpncpy_#t~mem2#1.offset, cstpncpy_#t~mem3#1.base, cstpncpy_#t~mem3#1.offset, cstpncpy_#t~post5#1.base, cstpncpy_#t~post5#1.offset, cstpncpy_#t~post6#1.base, cstpncpy_#t~post6#1.offset, cstpncpy_#t~mem7#1, cstpncpy_#t~post9#1.base, cstpncpy_#t~post9#1.offset, cstpncpy_#t~pre8#1, cstpncpy_#t~pre4#1, cstpncpy_~d~0#1.base, cstpncpy_~d~0#1.offset, cstpncpy_~s~0#1.base, cstpncpy_~s~0#1.offset, cstpncpy_#t~mem10#1.base, cstpncpy_#t~mem10#1.offset, cstpncpy_~#dst#1.base, cstpncpy_~#dst#1.offset, cstpncpy_~src#1.base, cstpncpy_~src#1.offset, cstpncpy_~n#1;call cstpncpy_~#dst#1.base, cstpncpy_~#dst#1.offset := #Ultimate.allocOnStack(4); {1421#(= (select |#valid| |ULTIMATE.start_cstpncpy_~#dst#1.base|) 1)} is VALID [2022-02-20 23:40:42,896 INFO L290 TraceCheckUtils]: 8: Hoare triple {1421#(= (select |#valid| |ULTIMATE.start_cstpncpy_~#dst#1.base|) 1)} assume !(1 == #valid[cstpncpy_~#dst#1.base]); {1420#false} is VALID [2022-02-20 23:40:42,896 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:40:42,896 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:40:42,897 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968627849] [2022-02-20 23:40:42,897 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968627849] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:40:42,897 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:40:42,897 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:40:42,897 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223722932] [2022-02-20 23:40:42,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:40:42,898 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 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:40:42,898 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:40:42,898 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 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:40:42,904 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:40:42,908 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:40:42,909 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:40:42,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:40:42,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:40:42,911 INFO L87 Difference]: Start difference. First operand 59 states and 67 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 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:40:42,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:40:42,967 INFO L93 Difference]: Finished difference Result 53 states and 61 transitions. [2022-02-20 23:40:42,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:40:42,967 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 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:40:42,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:40:42,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 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:40:42,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 60 transitions. [2022-02-20 23:40:42,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 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:40:42,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 60 transitions. [2022-02-20 23:40:42,969 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 60 transitions. [2022-02-20 23:40:43,011 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:40:43,012 INFO L225 Difference]: With dead ends: 53 [2022-02-20 23:40:43,012 INFO L226 Difference]: Without dead ends: 53 [2022-02-20 23:40:43,012 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:40:43,013 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 36 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:40:43,013 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 44 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:40:43,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-02-20 23:40:43,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2022-02-20 23:40:43,026 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:40:43,027 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand has 53 states, 39 states have (on average 1.564102564102564) internal successors, (61), 52 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:40:43,027 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand has 53 states, 39 states have (on average 1.564102564102564) internal successors, (61), 52 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:40:43,027 INFO L87 Difference]: Start difference. First operand 53 states. Second operand has 53 states, 39 states have (on average 1.564102564102564) internal successors, (61), 52 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:40:43,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:40:43,028 INFO L93 Difference]: Finished difference Result 53 states and 61 transitions. [2022-02-20 23:40:43,028 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 61 transitions. [2022-02-20 23:40:43,030 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:40:43,031 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:40:43,031 INFO L74 IsIncluded]: Start isIncluded. First operand has 53 states, 39 states have (on average 1.564102564102564) internal successors, (61), 52 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 53 states. [2022-02-20 23:40:43,031 INFO L87 Difference]: Start difference. First operand has 53 states, 39 states have (on average 1.564102564102564) internal successors, (61), 52 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 53 states. [2022-02-20 23:40:43,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:40:43,032 INFO L93 Difference]: Finished difference Result 53 states and 61 transitions. [2022-02-20 23:40:43,033 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 61 transitions. [2022-02-20 23:40:43,033 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:40:43,033 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:40:43,033 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:40:43,033 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:40:43,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 39 states have (on average 1.564102564102564) internal successors, (61), 52 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:40:43,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 61 transitions. [2022-02-20 23:40:43,034 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 61 transitions. Word has length 9 [2022-02-20 23:40:43,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:40:43,034 INFO L470 AbstractCegarLoop]: Abstraction has 53 states and 61 transitions. [2022-02-20 23:40:43,035 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 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:40:43,035 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 61 transitions. [2022-02-20 23:40:43,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-02-20 23:40:43,035 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:40:43,035 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:40:43,035 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 23:40:43,035 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2022-02-20 23:40:43,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:40:43,037 INFO L85 PathProgramCache]: Analyzing trace with hash -533877067, now seen corresponding path program 1 times [2022-02-20 23:40:43,037 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:40:43,037 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646263420] [2022-02-20 23:40:43,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:40:43,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:40:43,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:40:43,077 INFO L290 TraceCheckUtils]: 0: Hoare triple {1636#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {1636#true} is VALID [2022-02-20 23:40:43,077 INFO L290 TraceCheckUtils]: 1: Hoare triple {1636#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~nondet12#1, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_#t~nondet16#1, main_#t~post15#1, main_~i~0#1, main_#t~ret17#1.base, main_#t~ret17#1.offset, main_~length~0#1, main_~n~0#1, main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset, main_~nondetString~0#1.base, main_~nondetString~0#1.offset;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~length~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~n~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; {1636#true} is VALID [2022-02-20 23:40:43,078 INFO L290 TraceCheckUtils]: 2: Hoare triple {1636#true} assume main_~length~0#1 < 1;main_~length~0#1 := 1; {1636#true} is VALID [2022-02-20 23:40:43,078 INFO L290 TraceCheckUtils]: 3: Hoare triple {1636#true} assume main_~n~0#1 < 1;main_~n~0#1 := 1; {1636#true} is VALID [2022-02-20 23:40:43,078 INFO L290 TraceCheckUtils]: 4: Hoare triple {1636#true} call main_#t~malloc13#1.base, main_#t~malloc13#1.offset := #Ultimate.allocOnStack(main_~n~0#1);main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset := main_#t~malloc13#1.base, main_#t~malloc13#1.offset;call main_#t~malloc14#1.base, main_#t~malloc14#1.offset := #Ultimate.allocOnStack(main_~length~0#1);main_~nondetString~0#1.base, main_~nondetString~0#1.offset := main_#t~malloc14#1.base, main_#t~malloc14#1.offset;main_~i~0#1 := 0; {1636#true} is VALID [2022-02-20 23:40:43,078 INFO L290 TraceCheckUtils]: 5: Hoare triple {1636#true} assume !(main_~i~0#1 < main_~length~0#1 - 1); {1636#true} is VALID [2022-02-20 23:40:43,078 INFO L290 TraceCheckUtils]: 6: Hoare triple {1636#true} SUMMARY for call write~int(0, main_~nondetString~0#1.base, main_~nondetString~0#1.offset + (main_~length~0#1 - 1), 1); srcloc: L543-4 {1636#true} is VALID [2022-02-20 23:40:43,079 INFO L290 TraceCheckUtils]: 7: Hoare triple {1636#true} assume { :begin_inline_cstpncpy } true;cstpncpy_#in~dst#1.base, cstpncpy_#in~dst#1.offset, cstpncpy_#in~src#1.base, cstpncpy_#in~src#1.offset, cstpncpy_#in~n#1 := main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset, main_~nondetString~0#1.base, main_~nondetString~0#1.offset, main_~n~0#1;havoc cstpncpy_#res#1.base, cstpncpy_#res#1.offset;havoc cstpncpy_#t~mem2#1.base, cstpncpy_#t~mem2#1.offset, cstpncpy_#t~mem3#1.base, cstpncpy_#t~mem3#1.offset, cstpncpy_#t~post5#1.base, cstpncpy_#t~post5#1.offset, cstpncpy_#t~post6#1.base, cstpncpy_#t~post6#1.offset, cstpncpy_#t~mem7#1, cstpncpy_#t~post9#1.base, cstpncpy_#t~post9#1.offset, cstpncpy_#t~pre8#1, cstpncpy_#t~pre4#1, cstpncpy_~d~0#1.base, cstpncpy_~d~0#1.offset, cstpncpy_~s~0#1.base, cstpncpy_~s~0#1.offset, cstpncpy_#t~mem10#1.base, cstpncpy_#t~mem10#1.offset, cstpncpy_~#dst#1.base, cstpncpy_~#dst#1.offset, cstpncpy_~src#1.base, cstpncpy_~src#1.offset, cstpncpy_~n#1;call cstpncpy_~#dst#1.base, cstpncpy_~#dst#1.offset := #Ultimate.allocOnStack(4); {1638#(and (= |ULTIMATE.start_cstpncpy_~#dst#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_cstpncpy_~#dst#1.base|)))} is VALID [2022-02-20 23:40:43,079 INFO L290 TraceCheckUtils]: 8: Hoare triple {1638#(and (= |ULTIMATE.start_cstpncpy_~#dst#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_cstpncpy_~#dst#1.base|)))} assume !(4 + cstpncpy_~#dst#1.offset <= #length[cstpncpy_~#dst#1.base] && 0 <= cstpncpy_~#dst#1.offset); {1637#false} is VALID [2022-02-20 23:40:43,080 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:40:43,080 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:40:43,080 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646263420] [2022-02-20 23:40:43,080 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646263420] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:40:43,080 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:40:43,080 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:40:43,080 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691099445] [2022-02-20 23:40:43,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:40:43,081 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 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:40:43,081 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:40:43,081 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 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:40:43,087 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:40:43,087 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:40:43,087 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:40:43,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:40:43,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:40:43,088 INFO L87 Difference]: Start difference. First operand 53 states and 61 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 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:40:43,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:40:43,141 INFO L93 Difference]: Finished difference Result 47 states and 55 transitions. [2022-02-20 23:40:43,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:40:43,141 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 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:40:43,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:40:43,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 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:40:43,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 54 transitions. [2022-02-20 23:40:43,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 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:40:43,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 54 transitions. [2022-02-20 23:40:43,143 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 54 transitions. [2022-02-20 23:40:43,179 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:40:43,179 INFO L225 Difference]: With dead ends: 47 [2022-02-20 23:40:43,179 INFO L226 Difference]: Without dead ends: 47 [2022-02-20 23:40:43,180 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:40:43,180 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 30 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:40:43,180 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 47 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:40:43,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-02-20 23:40:43,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2022-02-20 23:40:43,182 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:40:43,182 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand has 47 states, 39 states have (on average 1.4102564102564104) internal successors, (55), 46 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:40:43,182 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand has 47 states, 39 states have (on average 1.4102564102564104) internal successors, (55), 46 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:40:43,183 INFO L87 Difference]: Start difference. First operand 47 states. Second operand has 47 states, 39 states have (on average 1.4102564102564104) internal successors, (55), 46 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:40:43,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:40:43,184 INFO L93 Difference]: Finished difference Result 47 states and 55 transitions. [2022-02-20 23:40:43,184 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2022-02-20 23:40:43,184 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:40:43,184 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:40:43,184 INFO L74 IsIncluded]: Start isIncluded. First operand has 47 states, 39 states have (on average 1.4102564102564104) internal successors, (55), 46 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 47 states. [2022-02-20 23:40:43,184 INFO L87 Difference]: Start difference. First operand has 47 states, 39 states have (on average 1.4102564102564104) internal successors, (55), 46 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 47 states. [2022-02-20 23:40:43,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:40:43,185 INFO L93 Difference]: Finished difference Result 47 states and 55 transitions. [2022-02-20 23:40:43,185 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2022-02-20 23:40:43,185 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:40:43,186 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:40:43,186 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:40:43,186 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:40:43,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 39 states have (on average 1.4102564102564104) internal successors, (55), 46 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:40:43,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 55 transitions. [2022-02-20 23:40:43,187 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 55 transitions. Word has length 9 [2022-02-20 23:40:43,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:40:43,187 INFO L470 AbstractCegarLoop]: Abstraction has 47 states and 55 transitions. [2022-02-20 23:40:43,187 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 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:40:43,187 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2022-02-20 23:40:43,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-20 23:40:43,188 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:40:43,188 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:40:43,188 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 23:40:43,188 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2022-02-20 23:40:43,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:40:43,188 INFO L85 PathProgramCache]: Analyzing trace with hash -1226025170, now seen corresponding path program 1 times [2022-02-20 23:40:43,189 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:40:43,189 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020119814] [2022-02-20 23:40:43,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:40:43,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:40:43,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:40:43,265 INFO L290 TraceCheckUtils]: 0: Hoare triple {1829#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {1829#true} is VALID [2022-02-20 23:40:43,265 INFO L290 TraceCheckUtils]: 1: Hoare triple {1829#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~nondet12#1, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_#t~nondet16#1, main_#t~post15#1, main_~i~0#1, main_#t~ret17#1.base, main_#t~ret17#1.offset, main_~length~0#1, main_~n~0#1, main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset, main_~nondetString~0#1.base, main_~nondetString~0#1.offset;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~length~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~n~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; {1829#true} is VALID [2022-02-20 23:40:43,265 INFO L290 TraceCheckUtils]: 2: Hoare triple {1829#true} assume !(main_~length~0#1 < 1); {1829#true} is VALID [2022-02-20 23:40:43,266 INFO L290 TraceCheckUtils]: 3: Hoare triple {1829#true} assume main_~n~0#1 < 1;main_~n~0#1 := 1; {1829#true} is VALID [2022-02-20 23:40:43,266 INFO L290 TraceCheckUtils]: 4: Hoare triple {1829#true} call main_#t~malloc13#1.base, main_#t~malloc13#1.offset := #Ultimate.allocOnStack(main_~n~0#1);main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset := main_#t~malloc13#1.base, main_#t~malloc13#1.offset;call main_#t~malloc14#1.base, main_#t~malloc14#1.offset := #Ultimate.allocOnStack(main_~length~0#1);main_~nondetString~0#1.base, main_~nondetString~0#1.offset := main_#t~malloc14#1.base, main_#t~malloc14#1.offset;main_~i~0#1 := 0; {1831#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~nondetString~0#1.offset| 0) (= (+ |ULTIMATE.start_main_~length~0#1| (* (- 1) (select |#length| |ULTIMATE.start_main_~nondetString~0#1.base|))) 0))} is VALID [2022-02-20 23:40:43,267 INFO L290 TraceCheckUtils]: 5: Hoare triple {1831#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~nondetString~0#1.offset| 0) (= (+ |ULTIMATE.start_main_~length~0#1| (* (- 1) (select |#length| |ULTIMATE.start_main_~nondetString~0#1.base|))) 0))} assume !!(main_~i~0#1 < main_~length~0#1 - 1);assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127; {1831#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~nondetString~0#1.offset| 0) (= (+ |ULTIMATE.start_main_~length~0#1| (* (- 1) (select |#length| |ULTIMATE.start_main_~nondetString~0#1.base|))) 0))} is VALID [2022-02-20 23:40:43,268 INFO L290 TraceCheckUtils]: 6: Hoare triple {1831#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~nondetString~0#1.offset| 0) (= (+ |ULTIMATE.start_main_~length~0#1| (* (- 1) (select |#length| |ULTIMATE.start_main_~nondetString~0#1.base|))) 0))} SUMMARY for call write~int(main_#t~nondet16#1, main_~nondetString~0#1.base, main_~nondetString~0#1.offset + main_~i~0#1, 1); srcloc: L545 {1831#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~nondetString~0#1.offset| 0) (= (+ |ULTIMATE.start_main_~length~0#1| (* (- 1) (select |#length| |ULTIMATE.start_main_~nondetString~0#1.base|))) 0))} is VALID [2022-02-20 23:40:43,268 INFO L290 TraceCheckUtils]: 7: Hoare triple {1831#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~nondetString~0#1.offset| 0) (= (+ |ULTIMATE.start_main_~length~0#1| (* (- 1) (select |#length| |ULTIMATE.start_main_~nondetString~0#1.base|))) 0))} havoc main_#t~nondet16#1; {1831#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~nondetString~0#1.offset| 0) (= (+ |ULTIMATE.start_main_~length~0#1| (* (- 1) (select |#length| |ULTIMATE.start_main_~nondetString~0#1.base|))) 0))} is VALID [2022-02-20 23:40:43,269 INFO L290 TraceCheckUtils]: 8: Hoare triple {1831#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~nondetString~0#1.offset| 0) (= (+ |ULTIMATE.start_main_~length~0#1| (* (- 1) (select |#length| |ULTIMATE.start_main_~nondetString~0#1.base|))) 0))} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1; {1832#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (= |ULTIMATE.start_main_~nondetString~0#1.offset| 0) (= (+ |ULTIMATE.start_main_~length~0#1| (* (- 1) (select |#length| |ULTIMATE.start_main_~nondetString~0#1.base|))) 0))} is VALID [2022-02-20 23:40:43,269 INFO L290 TraceCheckUtils]: 9: Hoare triple {1832#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (= |ULTIMATE.start_main_~nondetString~0#1.offset| 0) (= (+ |ULTIMATE.start_main_~length~0#1| (* (- 1) (select |#length| |ULTIMATE.start_main_~nondetString~0#1.base|))) 0))} assume !!(main_~i~0#1 < main_~length~0#1 - 1);assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127; {1833#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= (+ 2 |ULTIMATE.start_main_~i~0#1|) (select |#length| |ULTIMATE.start_main_~nondetString~0#1.base|)) (= |ULTIMATE.start_main_~nondetString~0#1.offset| 0))} is VALID [2022-02-20 23:40:43,270 INFO L290 TraceCheckUtils]: 10: Hoare triple {1833#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= (+ 2 |ULTIMATE.start_main_~i~0#1|) (select |#length| |ULTIMATE.start_main_~nondetString~0#1.base|)) (= |ULTIMATE.start_main_~nondetString~0#1.offset| 0))} assume !(1 + (main_~nondetString~0#1.offset + main_~i~0#1) <= #length[main_~nondetString~0#1.base] && 0 <= main_~nondetString~0#1.offset + main_~i~0#1); {1830#false} is VALID [2022-02-20 23:40:43,270 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:40:43,270 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:40:43,270 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020119814] [2022-02-20 23:40:43,270 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020119814] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:40:43,270 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1069144446] [2022-02-20 23:40:43,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:40:43,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:40:43,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:40:43,272 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:40:43,272 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:40:43,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:40:43,332 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 12 conjunts are in the unsatisfiable core [2022-02-20 23:40:43,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:40:43,356 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:40:43,507 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-02-20 23:40:43,508 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 1 case distinctions, treesize of input 9 treesize of output 15 [2022-02-20 23:40:43,636 INFO L290 TraceCheckUtils]: 0: Hoare triple {1829#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {1829#true} is VALID [2022-02-20 23:40:43,637 INFO L290 TraceCheckUtils]: 1: Hoare triple {1829#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~nondet12#1, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_#t~nondet16#1, main_#t~post15#1, main_~i~0#1, main_#t~ret17#1.base, main_#t~ret17#1.offset, main_~length~0#1, main_~n~0#1, main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset, main_~nondetString~0#1.base, main_~nondetString~0#1.offset;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~length~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~n~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; {1829#true} is VALID [2022-02-20 23:40:43,637 INFO L290 TraceCheckUtils]: 2: Hoare triple {1829#true} assume !(main_~length~0#1 < 1); {1829#true} is VALID [2022-02-20 23:40:43,638 INFO L290 TraceCheckUtils]: 3: Hoare triple {1829#true} assume main_~n~0#1 < 1;main_~n~0#1 := 1; {1829#true} is VALID [2022-02-20 23:40:43,639 INFO L290 TraceCheckUtils]: 4: Hoare triple {1829#true} call main_#t~malloc13#1.base, main_#t~malloc13#1.offset := #Ultimate.allocOnStack(main_~n~0#1);main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset := main_#t~malloc13#1.base, main_#t~malloc13#1.offset;call main_#t~malloc14#1.base, main_#t~malloc14#1.offset := #Ultimate.allocOnStack(main_~length~0#1);main_~nondetString~0#1.base, main_~nondetString~0#1.offset := main_#t~malloc14#1.base, main_#t~malloc14#1.offset;main_~i~0#1 := 0; {1849#(and (= |ULTIMATE.start_main_~nondetString~0#1.offset| 0) (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~length~0#1| (select |#length| |ULTIMATE.start_main_~nondetString~0#1.base|)))} is VALID [2022-02-20 23:40:43,639 INFO L290 TraceCheckUtils]: 5: Hoare triple {1849#(and (= |ULTIMATE.start_main_~nondetString~0#1.offset| 0) (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~length~0#1| (select |#length| |ULTIMATE.start_main_~nondetString~0#1.base|)))} assume !!(main_~i~0#1 < main_~length~0#1 - 1);assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127; {1849#(and (= |ULTIMATE.start_main_~nondetString~0#1.offset| 0) (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~length~0#1| (select |#length| |ULTIMATE.start_main_~nondetString~0#1.base|)))} is VALID [2022-02-20 23:40:43,640 INFO L290 TraceCheckUtils]: 6: Hoare triple {1849#(and (= |ULTIMATE.start_main_~nondetString~0#1.offset| 0) (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~length~0#1| (select |#length| |ULTIMATE.start_main_~nondetString~0#1.base|)))} SUMMARY for call write~int(main_#t~nondet16#1, main_~nondetString~0#1.base, main_~nondetString~0#1.offset + main_~i~0#1, 1); srcloc: L545 {1849#(and (= |ULTIMATE.start_main_~nondetString~0#1.offset| 0) (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~length~0#1| (select |#length| |ULTIMATE.start_main_~nondetString~0#1.base|)))} is VALID [2022-02-20 23:40:43,640 INFO L290 TraceCheckUtils]: 7: Hoare triple {1849#(and (= |ULTIMATE.start_main_~nondetString~0#1.offset| 0) (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~length~0#1| (select |#length| |ULTIMATE.start_main_~nondetString~0#1.base|)))} havoc main_#t~nondet16#1; {1849#(and (= |ULTIMATE.start_main_~nondetString~0#1.offset| 0) (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~length~0#1| (select |#length| |ULTIMATE.start_main_~nondetString~0#1.base|)))} is VALID [2022-02-20 23:40:43,641 INFO L290 TraceCheckUtils]: 8: Hoare triple {1849#(and (= |ULTIMATE.start_main_~nondetString~0#1.offset| 0) (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~length~0#1| (select |#length| |ULTIMATE.start_main_~nondetString~0#1.base|)))} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1; {1862#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (= |ULTIMATE.start_main_~nondetString~0#1.offset| 0) (<= |ULTIMATE.start_main_~length~0#1| (select |#length| |ULTIMATE.start_main_~nondetString~0#1.base|)))} is VALID [2022-02-20 23:40:43,641 INFO L290 TraceCheckUtils]: 9: Hoare triple {1862#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (= |ULTIMATE.start_main_~nondetString~0#1.offset| 0) (<= |ULTIMATE.start_main_~length~0#1| (select |#length| |ULTIMATE.start_main_~nondetString~0#1.base|)))} assume !!(main_~i~0#1 < main_~length~0#1 - 1);assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127; {1833#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= (+ 2 |ULTIMATE.start_main_~i~0#1|) (select |#length| |ULTIMATE.start_main_~nondetString~0#1.base|)) (= |ULTIMATE.start_main_~nondetString~0#1.offset| 0))} is VALID [2022-02-20 23:40:43,642 INFO L290 TraceCheckUtils]: 10: Hoare triple {1833#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= (+ 2 |ULTIMATE.start_main_~i~0#1|) (select |#length| |ULTIMATE.start_main_~nondetString~0#1.base|)) (= |ULTIMATE.start_main_~nondetString~0#1.offset| 0))} assume !(1 + (main_~nondetString~0#1.offset + main_~i~0#1) <= #length[main_~nondetString~0#1.base] && 0 <= main_~nondetString~0#1.offset + main_~i~0#1); {1830#false} is VALID [2022-02-20 23:40:43,642 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:40:43,642 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:40:43,898 INFO L290 TraceCheckUtils]: 10: Hoare triple {1869#(and (<= (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~nondetString~0#1.offset| 1) (select |#length| |ULTIMATE.start_main_~nondetString~0#1.base|)) (<= 0 (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~nondetString~0#1.offset|)))} assume !(1 + (main_~nondetString~0#1.offset + main_~i~0#1) <= #length[main_~nondetString~0#1.base] && 0 <= main_~nondetString~0#1.offset + main_~i~0#1); {1830#false} is VALID [2022-02-20 23:40:43,899 INFO L290 TraceCheckUtils]: 9: Hoare triple {1873#(or (and (<= (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~nondetString~0#1.offset| 1) (select |#length| |ULTIMATE.start_main_~nondetString~0#1.base|)) (<= 0 (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~nondetString~0#1.offset|))) (not (< (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~length~0#1|)))} assume !!(main_~i~0#1 < main_~length~0#1 - 1);assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127; {1869#(and (<= (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~nondetString~0#1.offset| 1) (select |#length| |ULTIMATE.start_main_~nondetString~0#1.base|)) (<= 0 (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~nondetString~0#1.offset|)))} is VALID [2022-02-20 23:40:43,900 INFO L290 TraceCheckUtils]: 8: Hoare triple {1877#(and (or (<= |ULTIMATE.start_main_~length~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|)) (<= 0 (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~nondetString~0#1.offset| 1))) (or (<= |ULTIMATE.start_main_~length~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|)) (<= (+ |ULTIMATE.start_main_~length~0#1| |ULTIMATE.start_main_~nondetString~0#1.offset|) (+ (select |#length| |ULTIMATE.start_main_~nondetString~0#1.base|) 1))))} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1; {1873#(or (and (<= (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~nondetString~0#1.offset| 1) (select |#length| |ULTIMATE.start_main_~nondetString~0#1.base|)) (<= 0 (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~nondetString~0#1.offset|))) (not (< (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~length~0#1|)))} is VALID [2022-02-20 23:40:43,900 INFO L290 TraceCheckUtils]: 7: Hoare triple {1877#(and (or (<= |ULTIMATE.start_main_~length~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|)) (<= 0 (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~nondetString~0#1.offset| 1))) (or (<= |ULTIMATE.start_main_~length~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|)) (<= (+ |ULTIMATE.start_main_~length~0#1| |ULTIMATE.start_main_~nondetString~0#1.offset|) (+ (select |#length| |ULTIMATE.start_main_~nondetString~0#1.base|) 1))))} havoc main_#t~nondet16#1; {1877#(and (or (<= |ULTIMATE.start_main_~length~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|)) (<= 0 (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~nondetString~0#1.offset| 1))) (or (<= |ULTIMATE.start_main_~length~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|)) (<= (+ |ULTIMATE.start_main_~length~0#1| |ULTIMATE.start_main_~nondetString~0#1.offset|) (+ (select |#length| |ULTIMATE.start_main_~nondetString~0#1.base|) 1))))} is VALID [2022-02-20 23:40:43,901 INFO L290 TraceCheckUtils]: 6: Hoare triple {1877#(and (or (<= |ULTIMATE.start_main_~length~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|)) (<= 0 (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~nondetString~0#1.offset| 1))) (or (<= |ULTIMATE.start_main_~length~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|)) (<= (+ |ULTIMATE.start_main_~length~0#1| |ULTIMATE.start_main_~nondetString~0#1.offset|) (+ (select |#length| |ULTIMATE.start_main_~nondetString~0#1.base|) 1))))} SUMMARY for call write~int(main_#t~nondet16#1, main_~nondetString~0#1.base, main_~nondetString~0#1.offset + main_~i~0#1, 1); srcloc: L545 {1877#(and (or (<= |ULTIMATE.start_main_~length~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|)) (<= 0 (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~nondetString~0#1.offset| 1))) (or (<= |ULTIMATE.start_main_~length~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|)) (<= (+ |ULTIMATE.start_main_~length~0#1| |ULTIMATE.start_main_~nondetString~0#1.offset|) (+ (select |#length| |ULTIMATE.start_main_~nondetString~0#1.base|) 1))))} is VALID [2022-02-20 23:40:43,902 INFO L290 TraceCheckUtils]: 5: Hoare triple {1877#(and (or (<= |ULTIMATE.start_main_~length~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|)) (<= 0 (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~nondetString~0#1.offset| 1))) (or (<= |ULTIMATE.start_main_~length~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|)) (<= (+ |ULTIMATE.start_main_~length~0#1| |ULTIMATE.start_main_~nondetString~0#1.offset|) (+ (select |#length| |ULTIMATE.start_main_~nondetString~0#1.base|) 1))))} assume !!(main_~i~0#1 < main_~length~0#1 - 1);assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127; {1877#(and (or (<= |ULTIMATE.start_main_~length~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|)) (<= 0 (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~nondetString~0#1.offset| 1))) (or (<= |ULTIMATE.start_main_~length~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|)) (<= (+ |ULTIMATE.start_main_~length~0#1| |ULTIMATE.start_main_~nondetString~0#1.offset|) (+ (select |#length| |ULTIMATE.start_main_~nondetString~0#1.base|) 1))))} is VALID [2022-02-20 23:40:43,902 INFO L290 TraceCheckUtils]: 4: Hoare triple {1829#true} call main_#t~malloc13#1.base, main_#t~malloc13#1.offset := #Ultimate.allocOnStack(main_~n~0#1);main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset := main_#t~malloc13#1.base, main_#t~malloc13#1.offset;call main_#t~malloc14#1.base, main_#t~malloc14#1.offset := #Ultimate.allocOnStack(main_~length~0#1);main_~nondetString~0#1.base, main_~nondetString~0#1.offset := main_#t~malloc14#1.base, main_#t~malloc14#1.offset;main_~i~0#1 := 0; {1877#(and (or (<= |ULTIMATE.start_main_~length~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|)) (<= 0 (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~nondetString~0#1.offset| 1))) (or (<= |ULTIMATE.start_main_~length~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|)) (<= (+ |ULTIMATE.start_main_~length~0#1| |ULTIMATE.start_main_~nondetString~0#1.offset|) (+ (select |#length| |ULTIMATE.start_main_~nondetString~0#1.base|) 1))))} is VALID [2022-02-20 23:40:43,903 INFO L290 TraceCheckUtils]: 3: Hoare triple {1829#true} assume main_~n~0#1 < 1;main_~n~0#1 := 1; {1829#true} is VALID [2022-02-20 23:40:43,903 INFO L290 TraceCheckUtils]: 2: Hoare triple {1829#true} assume !(main_~length~0#1 < 1); {1829#true} is VALID [2022-02-20 23:40:43,903 INFO L290 TraceCheckUtils]: 1: Hoare triple {1829#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~nondet12#1, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_#t~nondet16#1, main_#t~post15#1, main_~i~0#1, main_#t~ret17#1.base, main_#t~ret17#1.offset, main_~length~0#1, main_~n~0#1, main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset, main_~nondetString~0#1.base, main_~nondetString~0#1.offset;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~length~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~n~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; {1829#true} is VALID [2022-02-20 23:40:43,903 INFO L290 TraceCheckUtils]: 0: Hoare triple {1829#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {1829#true} is VALID [2022-02-20 23:40:43,903 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:40:43,904 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1069144446] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:40:43,904 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 23:40:43,904 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2022-02-20 23:40:43,904 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857423945] [2022-02-20 23:40:43,904 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 23:40:43,904 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-02-20 23:40:43,905 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:40:43,911 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 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:40:43,926 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:40:43,926 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 23:40:43,927 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:40:43,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 23:40:43,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2022-02-20 23:40:43,927 INFO L87 Difference]: Start difference. First operand 47 states and 55 transitions. Second operand has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 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:40:44,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:40:44,261 INFO L93 Difference]: Finished difference Result 83 states and 95 transitions. [2022-02-20 23:40:44,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 23:40:44,261 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-02-20 23:40:44,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:40:44,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 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:40:44,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 92 transitions. [2022-02-20 23:40:44,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 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:40:44,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 92 transitions. [2022-02-20 23:40:44,263 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 92 transitions. [2022-02-20 23:40:44,329 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:40:44,330 INFO L225 Difference]: With dead ends: 83 [2022-02-20 23:40:44,330 INFO L226 Difference]: Without dead ends: 83 [2022-02-20 23:40:44,330 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 15 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:40:44,330 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 88 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:40:44,331 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [88 Valid, 127 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:40:44,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-02-20 23:40:44,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 44. [2022-02-20 23:40:44,332 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:40:44,332 INFO L82 GeneralOperation]: Start isEquivalent. First operand 83 states. Second operand has 44 states, 37 states have (on average 1.3783783783783783) internal successors, (51), 43 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:40:44,332 INFO L74 IsIncluded]: Start isIncluded. First operand 83 states. Second operand has 44 states, 37 states have (on average 1.3783783783783783) internal successors, (51), 43 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:40:44,332 INFO L87 Difference]: Start difference. First operand 83 states. Second operand has 44 states, 37 states have (on average 1.3783783783783783) internal successors, (51), 43 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:40:44,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:40:44,334 INFO L93 Difference]: Finished difference Result 83 states and 95 transitions. [2022-02-20 23:40:44,334 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 95 transitions. [2022-02-20 23:40:44,334 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:40:44,334 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:40:44,334 INFO L74 IsIncluded]: Start isIncluded. First operand has 44 states, 37 states have (on average 1.3783783783783783) internal successors, (51), 43 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 83 states. [2022-02-20 23:40:44,334 INFO L87 Difference]: Start difference. First operand has 44 states, 37 states have (on average 1.3783783783783783) internal successors, (51), 43 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 83 states. [2022-02-20 23:40:44,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:40:44,336 INFO L93 Difference]: Finished difference Result 83 states and 95 transitions. [2022-02-20 23:40:44,336 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 95 transitions. [2022-02-20 23:40:44,336 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:40:44,336 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:40:44,336 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:40:44,336 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:40:44,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 37 states have (on average 1.3783783783783783) internal successors, (51), 43 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:40:44,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 51 transitions. [2022-02-20 23:40:44,337 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 51 transitions. Word has length 11 [2022-02-20 23:40:44,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:40:44,337 INFO L470 AbstractCegarLoop]: Abstraction has 44 states and 51 transitions. [2022-02-20 23:40:44,338 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 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:40:44,338 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2022-02-20 23:40:44,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-02-20 23:40:44,338 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:40:44,338 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:40:44,357 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:40:44,555 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:40:44,555 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2022-02-20 23:40:44,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:40:44,556 INFO L85 PathProgramCache]: Analyzing trace with hash 229648597, now seen corresponding path program 1 times [2022-02-20 23:40:44,556 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:40:44,556 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732999768] [2022-02-20 23:40:44,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:40:44,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:40:44,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:40:44,638 INFO L290 TraceCheckUtils]: 0: Hoare triple {2200#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {2200#true} is VALID [2022-02-20 23:40:44,639 INFO L290 TraceCheckUtils]: 1: Hoare triple {2200#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~nondet12#1, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_#t~nondet16#1, main_#t~post15#1, main_~i~0#1, main_#t~ret17#1.base, main_#t~ret17#1.offset, main_~length~0#1, main_~n~0#1, main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset, main_~nondetString~0#1.base, main_~nondetString~0#1.offset;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~length~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~n~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; {2200#true} is VALID [2022-02-20 23:40:44,639 INFO L290 TraceCheckUtils]: 2: Hoare triple {2200#true} assume main_~length~0#1 < 1;main_~length~0#1 := 1; {2200#true} is VALID [2022-02-20 23:40:44,639 INFO L290 TraceCheckUtils]: 3: Hoare triple {2200#true} assume main_~n~0#1 < 1;main_~n~0#1 := 1; {2202#(and (<= 1 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~n~0#1| 1))} is VALID [2022-02-20 23:40:44,640 INFO L290 TraceCheckUtils]: 4: Hoare triple {2202#(and (<= 1 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~n~0#1| 1))} call main_#t~malloc13#1.base, main_#t~malloc13#1.offset := #Ultimate.allocOnStack(main_~n~0#1);main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset := main_#t~malloc13#1.base, main_#t~malloc13#1.offset;call main_#t~malloc14#1.base, main_#t~malloc14#1.offset := #Ultimate.allocOnStack(main_~length~0#1);main_~nondetString~0#1.base, main_~nondetString~0#1.offset := main_#t~malloc14#1.base, main_#t~malloc14#1.offset;main_~i~0#1 := 0; {2202#(and (<= 1 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~n~0#1| 1))} is VALID [2022-02-20 23:40:44,640 INFO L290 TraceCheckUtils]: 5: Hoare triple {2202#(and (<= 1 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~n~0#1| 1))} assume !(main_~i~0#1 < main_~length~0#1 - 1); {2202#(and (<= 1 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~n~0#1| 1))} is VALID [2022-02-20 23:40:44,641 INFO L290 TraceCheckUtils]: 6: Hoare triple {2202#(and (<= 1 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~n~0#1| 1))} SUMMARY for call write~int(0, main_~nondetString~0#1.base, main_~nondetString~0#1.offset + (main_~length~0#1 - 1), 1); srcloc: L543-4 {2202#(and (<= 1 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~n~0#1| 1))} is VALID [2022-02-20 23:40:44,642 INFO L290 TraceCheckUtils]: 7: Hoare triple {2202#(and (<= 1 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~n~0#1| 1))} assume { :begin_inline_cstpncpy } true;cstpncpy_#in~dst#1.base, cstpncpy_#in~dst#1.offset, cstpncpy_#in~src#1.base, cstpncpy_#in~src#1.offset, cstpncpy_#in~n#1 := main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset, main_~nondetString~0#1.base, main_~nondetString~0#1.offset, main_~n~0#1;havoc cstpncpy_#res#1.base, cstpncpy_#res#1.offset;havoc cstpncpy_#t~mem2#1.base, cstpncpy_#t~mem2#1.offset, cstpncpy_#t~mem3#1.base, cstpncpy_#t~mem3#1.offset, cstpncpy_#t~post5#1.base, cstpncpy_#t~post5#1.offset, cstpncpy_#t~post6#1.base, cstpncpy_#t~post6#1.offset, cstpncpy_#t~mem7#1, cstpncpy_#t~post9#1.base, cstpncpy_#t~post9#1.offset, cstpncpy_#t~pre8#1, cstpncpy_#t~pre4#1, cstpncpy_~d~0#1.base, cstpncpy_~d~0#1.offset, cstpncpy_~s~0#1.base, cstpncpy_~s~0#1.offset, cstpncpy_#t~mem10#1.base, cstpncpy_#t~mem10#1.offset, cstpncpy_~#dst#1.base, cstpncpy_~#dst#1.offset, cstpncpy_~src#1.base, cstpncpy_~src#1.offset, cstpncpy_~n#1;call cstpncpy_~#dst#1.base, cstpncpy_~#dst#1.offset := #Ultimate.allocOnStack(4); {2203#(and (<= |ULTIMATE.start_cstpncpy_#in~n#1| 1) (<= 1 |ULTIMATE.start_cstpncpy_#in~n#1|))} is VALID [2022-02-20 23:40:44,642 INFO L290 TraceCheckUtils]: 8: Hoare triple {2203#(and (<= |ULTIMATE.start_cstpncpy_#in~n#1| 1) (<= 1 |ULTIMATE.start_cstpncpy_#in~n#1|))} SUMMARY for call write~$Pointer$(cstpncpy_#in~dst#1.base, cstpncpy_#in~dst#1.offset, cstpncpy_~#dst#1.base, cstpncpy_~#dst#1.offset, 4); srcloc: L513 {2203#(and (<= |ULTIMATE.start_cstpncpy_#in~n#1| 1) (<= 1 |ULTIMATE.start_cstpncpy_#in~n#1|))} is VALID [2022-02-20 23:40:44,643 INFO L290 TraceCheckUtils]: 9: Hoare triple {2203#(and (<= |ULTIMATE.start_cstpncpy_#in~n#1| 1) (<= 1 |ULTIMATE.start_cstpncpy_#in~n#1|))} cstpncpy_~src#1.base, cstpncpy_~src#1.offset := cstpncpy_#in~src#1.base, cstpncpy_#in~src#1.offset;cstpncpy_~n#1 := cstpncpy_#in~n#1; {2204#(and (<= 1 |ULTIMATE.start_cstpncpy_~n#1|) (<= (div |ULTIMATE.start_cstpncpy_~n#1| 4294967296) 0))} is VALID [2022-02-20 23:40:44,643 INFO L290 TraceCheckUtils]: 10: Hoare triple {2204#(and (<= 1 |ULTIMATE.start_cstpncpy_~n#1|) (<= (div |ULTIMATE.start_cstpncpy_~n#1| 4294967296) 0))} assume !(0 != cstpncpy_~n#1 % 4294967296); {2201#false} is VALID [2022-02-20 23:40:44,644 INFO L290 TraceCheckUtils]: 11: Hoare triple {2201#false} SUMMARY for call cstpncpy_#t~mem10#1.base, cstpncpy_#t~mem10#1.offset := read~$Pointer$(cstpncpy_~#dst#1.base, cstpncpy_~#dst#1.offset, 4); srcloc: L516-1 {2201#false} is VALID [2022-02-20 23:40:44,644 INFO L290 TraceCheckUtils]: 12: Hoare triple {2201#false} cstpncpy_#res#1.base, cstpncpy_#res#1.offset := cstpncpy_#t~mem10#1.base, cstpncpy_#t~mem10#1.offset;havoc cstpncpy_#t~mem10#1.base, cstpncpy_#t~mem10#1.offset;call ULTIMATE.dealloc(cstpncpy_~#dst#1.base, cstpncpy_~#dst#1.offset);havoc cstpncpy_~#dst#1.base, cstpncpy_~#dst#1.offset; {2201#false} is VALID [2022-02-20 23:40:44,644 INFO L290 TraceCheckUtils]: 13: Hoare triple {2201#false} main_#t~ret17#1.base, main_#t~ret17#1.offset := cstpncpy_#res#1.base, cstpncpy_#res#1.offset;assume { :end_inline_cstpncpy } true;havoc main_#t~ret17#1.base, main_#t~ret17#1.offset;main_#res#1 := 0;call ULTIMATE.dealloc(main_#t~malloc13#1.base, main_#t~malloc13#1.offset);havoc main_#t~malloc13#1.base, main_#t~malloc13#1.offset;call ULTIMATE.dealloc(main_#t~malloc14#1.base, main_#t~malloc14#1.offset);havoc main_#t~malloc14#1.base, main_#t~malloc14#1.offset; {2201#false} is VALID [2022-02-20 23:40:44,644 INFO L290 TraceCheckUtils]: 14: Hoare triple {2201#false} assume !(#valid == main_old_#valid#1); {2201#false} is VALID [2022-02-20 23:40:44,644 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:40:44,644 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:40:44,645 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732999768] [2022-02-20 23:40:44,645 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732999768] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:40:44,645 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:40:44,645 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 23:40:44,645 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142023825] [2022-02-20 23:40:44,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:40:44,646 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-02-20 23:40:44,646 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:40:44,646 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:40:44,656 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:40:44,656 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:40:44,656 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:40:44,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:40:44,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:40:44,657 INFO L87 Difference]: Start difference. First operand 44 states and 51 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:40:44,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:40:44,837 INFO L93 Difference]: Finished difference Result 94 states and 105 transitions. [2022-02-20 23:40:44,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 23:40:44,837 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-02-20 23:40:44,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:40:44,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:40:44,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 100 transitions. [2022-02-20 23:40:44,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:40:44,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 100 transitions. [2022-02-20 23:40:44,839 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 100 transitions. [2022-02-20 23:40:44,907 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:40:44,908 INFO L225 Difference]: With dead ends: 94 [2022-02-20 23:40:44,908 INFO L226 Difference]: Without dead ends: 94 [2022-02-20 23:40:44,908 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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:40:44,908 INFO L933 BasicCegarLoop]: 44 mSDtfsCounter, 104 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:40:44,909 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [104 Valid, 183 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:40:44,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-02-20 23:40:44,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 56. [2022-02-20 23:40:44,910 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:40:44,910 INFO L82 GeneralOperation]: Start isEquivalent. First operand 94 states. Second operand has 56 states, 49 states have (on average 1.3061224489795917) internal successors, (64), 55 states have internal predecessors, (64), 0 states have call successors, (0), 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:40:44,910 INFO L74 IsIncluded]: Start isIncluded. First operand 94 states. Second operand has 56 states, 49 states have (on average 1.3061224489795917) internal successors, (64), 55 states have internal predecessors, (64), 0 states have call successors, (0), 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:40:44,911 INFO L87 Difference]: Start difference. First operand 94 states. Second operand has 56 states, 49 states have (on average 1.3061224489795917) internal successors, (64), 55 states have internal predecessors, (64), 0 states have call successors, (0), 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:40:44,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:40:44,912 INFO L93 Difference]: Finished difference Result 94 states and 105 transitions. [2022-02-20 23:40:44,912 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 105 transitions. [2022-02-20 23:40:44,912 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:40:44,912 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:40:44,912 INFO L74 IsIncluded]: Start isIncluded. First operand has 56 states, 49 states have (on average 1.3061224489795917) internal successors, (64), 55 states have internal predecessors, (64), 0 states have call successors, (0), 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 94 states. [2022-02-20 23:40:44,915 INFO L87 Difference]: Start difference. First operand has 56 states, 49 states have (on average 1.3061224489795917) internal successors, (64), 55 states have internal predecessors, (64), 0 states have call successors, (0), 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 94 states. [2022-02-20 23:40:44,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:40:44,916 INFO L93 Difference]: Finished difference Result 94 states and 105 transitions. [2022-02-20 23:40:44,916 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 105 transitions. [2022-02-20 23:40:44,917 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:40:44,917 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:40:44,917 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:40:44,917 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:40:44,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 49 states have (on average 1.3061224489795917) internal successors, (64), 55 states have internal predecessors, (64), 0 states have call successors, (0), 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:40:44,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 64 transitions. [2022-02-20 23:40:44,918 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 64 transitions. Word has length 15 [2022-02-20 23:40:44,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:40:44,918 INFO L470 AbstractCegarLoop]: Abstraction has 56 states and 64 transitions. [2022-02-20 23:40:44,918 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:40:44,919 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 64 transitions. [2022-02-20 23:40:44,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-02-20 23:40:44,919 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:40:44,919 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:40:44,919 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 23:40:44,919 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2022-02-20 23:40:44,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:40:44,920 INFO L85 PathProgramCache]: Analyzing trace with hash 487814035, now seen corresponding path program 1 times [2022-02-20 23:40:44,920 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:40:44,920 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486044657] [2022-02-20 23:40:44,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:40:44,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:40:44,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:40:45,008 INFO L290 TraceCheckUtils]: 0: Hoare triple {2549#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {2549#true} is VALID [2022-02-20 23:40:45,009 INFO L290 TraceCheckUtils]: 1: Hoare triple {2549#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~nondet12#1, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_#t~nondet16#1, main_#t~post15#1, main_~i~0#1, main_#t~ret17#1.base, main_#t~ret17#1.offset, main_~length~0#1, main_~n~0#1, main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset, main_~nondetString~0#1.base, main_~nondetString~0#1.offset;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~length~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~n~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; {2551#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-20 23:40:45,009 INFO L290 TraceCheckUtils]: 2: Hoare triple {2551#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume main_~length~0#1 < 1;main_~length~0#1 := 1; {2551#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-20 23:40:45,009 INFO L290 TraceCheckUtils]: 3: Hoare triple {2551#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume !(main_~n~0#1 < 1); {2552#(and (<= |ULTIMATE.start_main_~n~0#1| 2147483647) (<= 1 |ULTIMATE.start_main_~n~0#1|))} is VALID [2022-02-20 23:40:45,010 INFO L290 TraceCheckUtils]: 4: Hoare triple {2552#(and (<= |ULTIMATE.start_main_~n~0#1| 2147483647) (<= 1 |ULTIMATE.start_main_~n~0#1|))} call main_#t~malloc13#1.base, main_#t~malloc13#1.offset := #Ultimate.allocOnStack(main_~n~0#1);main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset := main_#t~malloc13#1.base, main_#t~malloc13#1.offset;call main_#t~malloc14#1.base, main_#t~malloc14#1.offset := #Ultimate.allocOnStack(main_~length~0#1);main_~nondetString~0#1.base, main_~nondetString~0#1.offset := main_#t~malloc14#1.base, main_#t~malloc14#1.offset;main_~i~0#1 := 0; {2552#(and (<= |ULTIMATE.start_main_~n~0#1| 2147483647) (<= 1 |ULTIMATE.start_main_~n~0#1|))} is VALID [2022-02-20 23:40:45,010 INFO L290 TraceCheckUtils]: 5: Hoare triple {2552#(and (<= |ULTIMATE.start_main_~n~0#1| 2147483647) (<= 1 |ULTIMATE.start_main_~n~0#1|))} assume !(main_~i~0#1 < main_~length~0#1 - 1); {2552#(and (<= |ULTIMATE.start_main_~n~0#1| 2147483647) (<= 1 |ULTIMATE.start_main_~n~0#1|))} is VALID [2022-02-20 23:40:45,011 INFO L290 TraceCheckUtils]: 6: Hoare triple {2552#(and (<= |ULTIMATE.start_main_~n~0#1| 2147483647) (<= 1 |ULTIMATE.start_main_~n~0#1|))} SUMMARY for call write~int(0, main_~nondetString~0#1.base, main_~nondetString~0#1.offset + (main_~length~0#1 - 1), 1); srcloc: L543-4 {2552#(and (<= |ULTIMATE.start_main_~n~0#1| 2147483647) (<= 1 |ULTIMATE.start_main_~n~0#1|))} is VALID [2022-02-20 23:40:45,011 INFO L290 TraceCheckUtils]: 7: Hoare triple {2552#(and (<= |ULTIMATE.start_main_~n~0#1| 2147483647) (<= 1 |ULTIMATE.start_main_~n~0#1|))} assume { :begin_inline_cstpncpy } true;cstpncpy_#in~dst#1.base, cstpncpy_#in~dst#1.offset, cstpncpy_#in~src#1.base, cstpncpy_#in~src#1.offset, cstpncpy_#in~n#1 := main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset, main_~nondetString~0#1.base, main_~nondetString~0#1.offset, main_~n~0#1;havoc cstpncpy_#res#1.base, cstpncpy_#res#1.offset;havoc cstpncpy_#t~mem2#1.base, cstpncpy_#t~mem2#1.offset, cstpncpy_#t~mem3#1.base, cstpncpy_#t~mem3#1.offset, cstpncpy_#t~post5#1.base, cstpncpy_#t~post5#1.offset, cstpncpy_#t~post6#1.base, cstpncpy_#t~post6#1.offset, cstpncpy_#t~mem7#1, cstpncpy_#t~post9#1.base, cstpncpy_#t~post9#1.offset, cstpncpy_#t~pre8#1, cstpncpy_#t~pre4#1, cstpncpy_~d~0#1.base, cstpncpy_~d~0#1.offset, cstpncpy_~s~0#1.base, cstpncpy_~s~0#1.offset, cstpncpy_#t~mem10#1.base, cstpncpy_#t~mem10#1.offset, cstpncpy_~#dst#1.base, cstpncpy_~#dst#1.offset, cstpncpy_~src#1.base, cstpncpy_~src#1.offset, cstpncpy_~n#1;call cstpncpy_~#dst#1.base, cstpncpy_~#dst#1.offset := #Ultimate.allocOnStack(4); {2553#(and (<= 1 |ULTIMATE.start_cstpncpy_#in~n#1|) (<= |ULTIMATE.start_cstpncpy_#in~n#1| 2147483647))} is VALID [2022-02-20 23:40:45,012 INFO L290 TraceCheckUtils]: 8: Hoare triple {2553#(and (<= 1 |ULTIMATE.start_cstpncpy_#in~n#1|) (<= |ULTIMATE.start_cstpncpy_#in~n#1| 2147483647))} SUMMARY for call write~$Pointer$(cstpncpy_#in~dst#1.base, cstpncpy_#in~dst#1.offset, cstpncpy_~#dst#1.base, cstpncpy_~#dst#1.offset, 4); srcloc: L513 {2553#(and (<= 1 |ULTIMATE.start_cstpncpy_#in~n#1|) (<= |ULTIMATE.start_cstpncpy_#in~n#1| 2147483647))} is VALID [2022-02-20 23:40:45,012 INFO L290 TraceCheckUtils]: 9: Hoare triple {2553#(and (<= 1 |ULTIMATE.start_cstpncpy_#in~n#1|) (<= |ULTIMATE.start_cstpncpy_#in~n#1| 2147483647))} cstpncpy_~src#1.base, cstpncpy_~src#1.offset := cstpncpy_#in~src#1.base, cstpncpy_#in~src#1.offset;cstpncpy_~n#1 := cstpncpy_#in~n#1; {2554#(and (<= 1 |ULTIMATE.start_cstpncpy_~n#1|) (<= (div |ULTIMATE.start_cstpncpy_~n#1| 4294967296) 0))} is VALID [2022-02-20 23:40:45,013 INFO L290 TraceCheckUtils]: 10: Hoare triple {2554#(and (<= 1 |ULTIMATE.start_cstpncpy_~n#1|) (<= (div |ULTIMATE.start_cstpncpy_~n#1| 4294967296) 0))} assume !(0 != cstpncpy_~n#1 % 4294967296); {2550#false} is VALID [2022-02-20 23:40:45,013 INFO L290 TraceCheckUtils]: 11: Hoare triple {2550#false} SUMMARY for call cstpncpy_#t~mem10#1.base, cstpncpy_#t~mem10#1.offset := read~$Pointer$(cstpncpy_~#dst#1.base, cstpncpy_~#dst#1.offset, 4); srcloc: L516-1 {2550#false} is VALID [2022-02-20 23:40:45,015 INFO L290 TraceCheckUtils]: 12: Hoare triple {2550#false} cstpncpy_#res#1.base, cstpncpy_#res#1.offset := cstpncpy_#t~mem10#1.base, cstpncpy_#t~mem10#1.offset;havoc cstpncpy_#t~mem10#1.base, cstpncpy_#t~mem10#1.offset;call ULTIMATE.dealloc(cstpncpy_~#dst#1.base, cstpncpy_~#dst#1.offset);havoc cstpncpy_~#dst#1.base, cstpncpy_~#dst#1.offset; {2550#false} is VALID [2022-02-20 23:40:45,016 INFO L290 TraceCheckUtils]: 13: Hoare triple {2550#false} main_#t~ret17#1.base, main_#t~ret17#1.offset := cstpncpy_#res#1.base, cstpncpy_#res#1.offset;assume { :end_inline_cstpncpy } true;havoc main_#t~ret17#1.base, main_#t~ret17#1.offset;main_#res#1 := 0;call ULTIMATE.dealloc(main_#t~malloc13#1.base, main_#t~malloc13#1.offset);havoc main_#t~malloc13#1.base, main_#t~malloc13#1.offset;call ULTIMATE.dealloc(main_#t~malloc14#1.base, main_#t~malloc14#1.offset);havoc main_#t~malloc14#1.base, main_#t~malloc14#1.offset; {2550#false} is VALID [2022-02-20 23:40:45,016 INFO L290 TraceCheckUtils]: 14: Hoare triple {2550#false} assume !(#valid == main_old_#valid#1); {2550#false} is VALID [2022-02-20 23:40:45,016 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:40:45,016 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:40:45,016 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486044657] [2022-02-20 23:40:45,016 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486044657] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:40:45,016 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:40:45,017 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 23:40:45,017 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947365363] [2022-02-20 23:40:45,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:40:45,017 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 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:40:45,018 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:40:45,018 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 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:40:45,027 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:40:45,027 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 23:40:45,027 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:40:45,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 23:40:45,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:40:45,028 INFO L87 Difference]: Start difference. First operand 56 states and 64 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 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:40:45,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:40:45,178 INFO L93 Difference]: Finished difference Result 67 states and 75 transitions. [2022-02-20 23:40:45,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 23:40:45,178 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 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:40:45,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:40:45,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 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:40:45,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 59 transitions. [2022-02-20 23:40:45,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 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:40:45,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 59 transitions. [2022-02-20 23:40:45,180 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 59 transitions. [2022-02-20 23:40:45,225 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:40:45,226 INFO L225 Difference]: With dead ends: 67 [2022-02-20 23:40:45,226 INFO L226 Difference]: Without dead ends: 67 [2022-02-20 23:40:45,226 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-02-20 23:40:45,227 INFO L933 BasicCegarLoop]: 37 mSDtfsCounter, 156 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:40:45,227 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [156 Valid, 83 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:40:45,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-02-20 23:40:45,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 44. [2022-02-20 23:40:45,229 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:40:45,229 INFO L82 GeneralOperation]: Start isEquivalent. First operand 67 states. Second operand has 44 states, 37 states have (on average 1.3513513513513513) internal successors, (50), 43 states have internal predecessors, (50), 0 states have call successors, (0), 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:40:45,229 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand has 44 states, 37 states have (on average 1.3513513513513513) internal successors, (50), 43 states have internal predecessors, (50), 0 states have call successors, (0), 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:40:45,229 INFO L87 Difference]: Start difference. First operand 67 states. Second operand has 44 states, 37 states have (on average 1.3513513513513513) internal successors, (50), 43 states have internal predecessors, (50), 0 states have call successors, (0), 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:40:45,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:40:45,230 INFO L93 Difference]: Finished difference Result 67 states and 75 transitions. [2022-02-20 23:40:45,230 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 75 transitions. [2022-02-20 23:40:45,231 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:40:45,231 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:40:45,231 INFO L74 IsIncluded]: Start isIncluded. First operand has 44 states, 37 states have (on average 1.3513513513513513) internal successors, (50), 43 states have internal predecessors, (50), 0 states have call successors, (0), 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 67 states. [2022-02-20 23:40:45,231 INFO L87 Difference]: Start difference. First operand has 44 states, 37 states have (on average 1.3513513513513513) internal successors, (50), 43 states have internal predecessors, (50), 0 states have call successors, (0), 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 67 states. [2022-02-20 23:40:45,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:40:45,232 INFO L93 Difference]: Finished difference Result 67 states and 75 transitions. [2022-02-20 23:40:45,232 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 75 transitions. [2022-02-20 23:40:45,232 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:40:45,233 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:40:45,233 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:40:45,233 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:40:45,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 37 states have (on average 1.3513513513513513) internal successors, (50), 43 states have internal predecessors, (50), 0 states have call successors, (0), 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:40:45,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 50 transitions. [2022-02-20 23:40:45,234 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 50 transitions. Word has length 15 [2022-02-20 23:40:45,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:40:45,234 INFO L470 AbstractCegarLoop]: Abstraction has 44 states and 50 transitions. [2022-02-20 23:40:45,234 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 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:40:45,234 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 50 transitions. [2022-02-20 23:40:45,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-20 23:40:45,234 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:40:45,235 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:40:45,235 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-20 23:40:45,235 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2022-02-20 23:40:45,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:40:45,235 INFO L85 PathProgramCache]: Analyzing trace with hash -994678340, now seen corresponding path program 1 times [2022-02-20 23:40:45,236 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:40:45,236 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482093038] [2022-02-20 23:40:45,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:40:45,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:40:45,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:40:45,339 INFO L290 TraceCheckUtils]: 0: Hoare triple {2806#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {2806#true} is VALID [2022-02-20 23:40:45,340 INFO L290 TraceCheckUtils]: 1: Hoare triple {2806#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~nondet12#1, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_#t~nondet16#1, main_#t~post15#1, main_~i~0#1, main_#t~ret17#1.base, main_#t~ret17#1.offset, main_~length~0#1, main_~n~0#1, main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset, main_~nondetString~0#1.base, main_~nondetString~0#1.offset;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~length~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~n~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; {2806#true} is VALID [2022-02-20 23:40:45,340 INFO L290 TraceCheckUtils]: 2: Hoare triple {2806#true} assume main_~length~0#1 < 1;main_~length~0#1 := 1; {2806#true} is VALID [2022-02-20 23:40:45,340 INFO L290 TraceCheckUtils]: 3: Hoare triple {2806#true} assume main_~n~0#1 < 1;main_~n~0#1 := 1; {2806#true} is VALID [2022-02-20 23:40:45,341 INFO L290 TraceCheckUtils]: 4: Hoare triple {2806#true} call main_#t~malloc13#1.base, main_#t~malloc13#1.offset := #Ultimate.allocOnStack(main_~n~0#1);main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset := main_#t~malloc13#1.base, main_#t~malloc13#1.offset;call main_#t~malloc14#1.base, main_#t~malloc14#1.offset := #Ultimate.allocOnStack(main_~length~0#1);main_~nondetString~0#1.base, main_~nondetString~0#1.offset := main_#t~malloc14#1.base, main_#t~malloc14#1.offset;main_~i~0#1 := 0; {2808#(= (select |#valid| |ULTIMATE.start_main_~nondetString~0#1.base|) 1)} is VALID [2022-02-20 23:40:45,341 INFO L290 TraceCheckUtils]: 5: Hoare triple {2808#(= (select |#valid| |ULTIMATE.start_main_~nondetString~0#1.base|) 1)} assume !(main_~i~0#1 < main_~length~0#1 - 1); {2808#(= (select |#valid| |ULTIMATE.start_main_~nondetString~0#1.base|) 1)} is VALID [2022-02-20 23:40:45,341 INFO L290 TraceCheckUtils]: 6: Hoare triple {2808#(= (select |#valid| |ULTIMATE.start_main_~nondetString~0#1.base|) 1)} SUMMARY for call write~int(0, main_~nondetString~0#1.base, main_~nondetString~0#1.offset + (main_~length~0#1 - 1), 1); srcloc: L543-4 {2808#(= (select |#valid| |ULTIMATE.start_main_~nondetString~0#1.base|) 1)} is VALID [2022-02-20 23:40:45,342 INFO L290 TraceCheckUtils]: 7: Hoare triple {2808#(= (select |#valid| |ULTIMATE.start_main_~nondetString~0#1.base|) 1)} assume { :begin_inline_cstpncpy } true;cstpncpy_#in~dst#1.base, cstpncpy_#in~dst#1.offset, cstpncpy_#in~src#1.base, cstpncpy_#in~src#1.offset, cstpncpy_#in~n#1 := main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset, main_~nondetString~0#1.base, main_~nondetString~0#1.offset, main_~n~0#1;havoc cstpncpy_#res#1.base, cstpncpy_#res#1.offset;havoc cstpncpy_#t~mem2#1.base, cstpncpy_#t~mem2#1.offset, cstpncpy_#t~mem3#1.base, cstpncpy_#t~mem3#1.offset, cstpncpy_#t~post5#1.base, cstpncpy_#t~post5#1.offset, cstpncpy_#t~post6#1.base, cstpncpy_#t~post6#1.offset, cstpncpy_#t~mem7#1, cstpncpy_#t~post9#1.base, cstpncpy_#t~post9#1.offset, cstpncpy_#t~pre8#1, cstpncpy_#t~pre4#1, cstpncpy_~d~0#1.base, cstpncpy_~d~0#1.offset, cstpncpy_~s~0#1.base, cstpncpy_~s~0#1.offset, cstpncpy_#t~mem10#1.base, cstpncpy_#t~mem10#1.offset, cstpncpy_~#dst#1.base, cstpncpy_~#dst#1.offset, cstpncpy_~src#1.base, cstpncpy_~src#1.offset, cstpncpy_~n#1;call cstpncpy_~#dst#1.base, cstpncpy_~#dst#1.offset := #Ultimate.allocOnStack(4); {2809#(or (= (select |#valid| |ULTIMATE.start_cstpncpy_#in~src#1.base|) 1) (= |ULTIMATE.start_cstpncpy_#in~src#1.base| |ULTIMATE.start_cstpncpy_~#dst#1.base|))} is VALID [2022-02-20 23:40:45,343 INFO L290 TraceCheckUtils]: 8: Hoare triple {2809#(or (= (select |#valid| |ULTIMATE.start_cstpncpy_#in~src#1.base|) 1) (= |ULTIMATE.start_cstpncpy_#in~src#1.base| |ULTIMATE.start_cstpncpy_~#dst#1.base|))} SUMMARY for call write~$Pointer$(cstpncpy_#in~dst#1.base, cstpncpy_#in~dst#1.offset, cstpncpy_~#dst#1.base, cstpncpy_~#dst#1.offset, 4); srcloc: L513 {2810#(= (select |#valid| |ULTIMATE.start_cstpncpy_#in~src#1.base|) 1)} is VALID [2022-02-20 23:40:45,343 INFO L290 TraceCheckUtils]: 9: Hoare triple {2810#(= (select |#valid| |ULTIMATE.start_cstpncpy_#in~src#1.base|) 1)} cstpncpy_~src#1.base, cstpncpy_~src#1.offset := cstpncpy_#in~src#1.base, cstpncpy_#in~src#1.offset;cstpncpy_~n#1 := cstpncpy_#in~n#1; {2811#(= (select |#valid| |ULTIMATE.start_cstpncpy_~src#1.base|) 1)} is VALID [2022-02-20 23:40:45,344 INFO L290 TraceCheckUtils]: 10: Hoare triple {2811#(= (select |#valid| |ULTIMATE.start_cstpncpy_~src#1.base|) 1)} assume 0 != cstpncpy_~n#1 % 4294967296; {2811#(= (select |#valid| |ULTIMATE.start_cstpncpy_~src#1.base|) 1)} is VALID [2022-02-20 23:40:45,345 INFO L290 TraceCheckUtils]: 11: Hoare triple {2811#(= (select |#valid| |ULTIMATE.start_cstpncpy_~src#1.base|) 1)} SUMMARY for call cstpncpy_#t~mem2#1.base, cstpncpy_#t~mem2#1.offset := read~$Pointer$(cstpncpy_~#dst#1.base, cstpncpy_~#dst#1.offset, 4); srcloc: L517 {2811#(= (select |#valid| |ULTIMATE.start_cstpncpy_~src#1.base|) 1)} is VALID [2022-02-20 23:40:45,345 INFO L290 TraceCheckUtils]: 12: Hoare triple {2811#(= (select |#valid| |ULTIMATE.start_cstpncpy_~src#1.base|) 1)} cstpncpy_~d~0#1.base, cstpncpy_~d~0#1.offset := cstpncpy_#t~mem2#1.base, cstpncpy_#t~mem2#1.offset;havoc cstpncpy_#t~mem2#1.base, cstpncpy_#t~mem2#1.offset;cstpncpy_~s~0#1.base, cstpncpy_~s~0#1.offset := cstpncpy_~src#1.base, cstpncpy_~src#1.offset; {2812#(= (select |#valid| |ULTIMATE.start_cstpncpy_~s~0#1.base|) 1)} is VALID [2022-02-20 23:40:45,352 INFO L290 TraceCheckUtils]: 13: Hoare triple {2812#(= (select |#valid| |ULTIMATE.start_cstpncpy_~s~0#1.base|) 1)} SUMMARY for call cstpncpy_#t~mem3#1.base, cstpncpy_#t~mem3#1.offset := read~$Pointer$(cstpncpy_~#dst#1.base, cstpncpy_~#dst#1.offset, 4); srcloc: L519 {2812#(= (select |#valid| |ULTIMATE.start_cstpncpy_~s~0#1.base|) 1)} is VALID [2022-02-20 23:40:45,354 INFO L290 TraceCheckUtils]: 14: Hoare triple {2812#(= (select |#valid| |ULTIMATE.start_cstpncpy_~s~0#1.base|) 1)} SUMMARY for call write~$Pointer$(cstpncpy_#t~mem3#1.base, cstpncpy_#t~mem3#1.offset + (if cstpncpy_~n#1 % 4294967296 % 4294967296 <= 2147483647 then cstpncpy_~n#1 % 4294967296 % 4294967296 else cstpncpy_~n#1 % 4294967296 % 4294967296 - 4294967296), cstpncpy_~#dst#1.base, cstpncpy_~#dst#1.offset, 4); srcloc: L519-1 {2812#(= (select |#valid| |ULTIMATE.start_cstpncpy_~s~0#1.base|) 1)} is VALID [2022-02-20 23:40:45,354 INFO L290 TraceCheckUtils]: 15: Hoare triple {2812#(= (select |#valid| |ULTIMATE.start_cstpncpy_~s~0#1.base|) 1)} havoc cstpncpy_#t~mem3#1.base, cstpncpy_#t~mem3#1.offset; {2812#(= (select |#valid| |ULTIMATE.start_cstpncpy_~s~0#1.base|) 1)} is VALID [2022-02-20 23:40:45,355 INFO L290 TraceCheckUtils]: 16: Hoare triple {2812#(= (select |#valid| |ULTIMATE.start_cstpncpy_~s~0#1.base|) 1)} cstpncpy_#t~post5#1.base, cstpncpy_#t~post5#1.offset := cstpncpy_~d~0#1.base, cstpncpy_~d~0#1.offset;cstpncpy_~d~0#1.base, cstpncpy_~d~0#1.offset := cstpncpy_#t~post5#1.base, 1 + cstpncpy_#t~post5#1.offset;cstpncpy_#t~post6#1.base, cstpncpy_#t~post6#1.offset := cstpncpy_~s~0#1.base, cstpncpy_~s~0#1.offset;cstpncpy_~s~0#1.base, cstpncpy_~s~0#1.offset := cstpncpy_#t~post6#1.base, 1 + cstpncpy_#t~post6#1.offset; {2813#(= (select |#valid| |ULTIMATE.start_cstpncpy_#t~post6#1.base|) 1)} is VALID [2022-02-20 23:40:45,355 INFO L290 TraceCheckUtils]: 17: Hoare triple {2813#(= (select |#valid| |ULTIMATE.start_cstpncpy_#t~post6#1.base|) 1)} assume !(1 == #valid[cstpncpy_#t~post6#1.base]); {2807#false} is VALID [2022-02-20 23:40:45,356 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:40:45,356 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:40:45,356 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482093038] [2022-02-20 23:40:45,356 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482093038] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:40:45,356 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:40:45,356 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 23:40:45,356 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597243347] [2022-02-20 23:40:45,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:40:45,356 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 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 18 [2022-02-20 23:40:45,356 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:40:45,356 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 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:40:45,367 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:40:45,367 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 23:40:45,367 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:40:45,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 23:40:45,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-02-20 23:40:45,368 INFO L87 Difference]: Start difference. First operand 44 states and 50 transitions. Second operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 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:40:45,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:40:45,551 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2022-02-20 23:40:45,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 23:40:45,551 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 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 18 [2022-02-20 23:40:45,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:40:45,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 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:40:45,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 46 transitions. [2022-02-20 23:40:45,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 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:40:45,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 46 transitions. [2022-02-20 23:40:45,553 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 46 transitions. [2022-02-20 23:40:45,584 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:40:45,584 INFO L225 Difference]: With dead ends: 43 [2022-02-20 23:40:45,584 INFO L226 Difference]: Without dead ends: 43 [2022-02-20 23:40:45,585 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2022-02-20 23:40:45,585 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 105 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:40:45,585 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [105 Valid, 81 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:40:45,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-02-20 23:40:45,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2022-02-20 23:40:45,586 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:40:45,586 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand has 43 states, 37 states have (on average 1.3243243243243243) internal successors, (49), 42 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:40:45,586 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand has 43 states, 37 states have (on average 1.3243243243243243) internal successors, (49), 42 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:40:45,587 INFO L87 Difference]: Start difference. First operand 43 states. Second operand has 43 states, 37 states have (on average 1.3243243243243243) internal successors, (49), 42 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:40:45,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:40:45,587 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2022-02-20 23:40:45,587 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2022-02-20 23:40:45,587 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:40:45,587 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:40:45,587 INFO L74 IsIncluded]: Start isIncluded. First operand has 43 states, 37 states have (on average 1.3243243243243243) internal successors, (49), 42 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 43 states. [2022-02-20 23:40:45,587 INFO L87 Difference]: Start difference. First operand has 43 states, 37 states have (on average 1.3243243243243243) internal successors, (49), 42 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 43 states. [2022-02-20 23:40:45,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:40:45,588 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2022-02-20 23:40:45,588 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2022-02-20 23:40:45,588 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:40:45,588 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:40:45,588 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:40:45,588 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:40:45,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 37 states have (on average 1.3243243243243243) internal successors, (49), 42 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:40:45,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 49 transitions. [2022-02-20 23:40:45,592 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 49 transitions. Word has length 18 [2022-02-20 23:40:45,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:40:45,592 INFO L470 AbstractCegarLoop]: Abstraction has 43 states and 49 transitions. [2022-02-20 23:40:45,593 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 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:40:45,593 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2022-02-20 23:40:45,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-20 23:40:45,593 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:40:45,593 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:40:45,593 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-20 23:40:45,593 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2022-02-20 23:40:45,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:40:45,593 INFO L85 PathProgramCache]: Analyzing trace with hash -994678339, now seen corresponding path program 1 times [2022-02-20 23:40:45,593 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:40:45,593 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891127860] [2022-02-20 23:40:45,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:40:45,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:40:45,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:40:45,708 INFO L290 TraceCheckUtils]: 0: Hoare triple {2996#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {2996#true} is VALID [2022-02-20 23:40:45,708 INFO L290 TraceCheckUtils]: 1: Hoare triple {2996#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~nondet12#1, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_#t~nondet16#1, main_#t~post15#1, main_~i~0#1, main_#t~ret17#1.base, main_#t~ret17#1.offset, main_~length~0#1, main_~n~0#1, main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset, main_~nondetString~0#1.base, main_~nondetString~0#1.offset;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~length~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~n~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; {2996#true} is VALID [2022-02-20 23:40:45,709 INFO L290 TraceCheckUtils]: 2: Hoare triple {2996#true} assume main_~length~0#1 < 1;main_~length~0#1 := 1; {2998#(<= 1 |ULTIMATE.start_main_~length~0#1|)} is VALID [2022-02-20 23:40:45,709 INFO L290 TraceCheckUtils]: 3: Hoare triple {2998#(<= 1 |ULTIMATE.start_main_~length~0#1|)} assume main_~n~0#1 < 1;main_~n~0#1 := 1; {2998#(<= 1 |ULTIMATE.start_main_~length~0#1|)} is VALID [2022-02-20 23:40:45,710 INFO L290 TraceCheckUtils]: 4: Hoare triple {2998#(<= 1 |ULTIMATE.start_main_~length~0#1|)} call main_#t~malloc13#1.base, main_#t~malloc13#1.offset := #Ultimate.allocOnStack(main_~n~0#1);main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset := main_#t~malloc13#1.base, main_#t~malloc13#1.offset;call main_#t~malloc14#1.base, main_#t~malloc14#1.offset := #Ultimate.allocOnStack(main_~length~0#1);main_~nondetString~0#1.base, main_~nondetString~0#1.offset := main_#t~malloc14#1.base, main_#t~malloc14#1.offset;main_~i~0#1 := 0; {2999#(and (= |ULTIMATE.start_main_~nondetString~0#1.offset| 0) (<= 1 (select |#length| |ULTIMATE.start_main_~nondetString~0#1.base|)))} is VALID [2022-02-20 23:40:45,710 INFO L290 TraceCheckUtils]: 5: Hoare triple {2999#(and (= |ULTIMATE.start_main_~nondetString~0#1.offset| 0) (<= 1 (select |#length| |ULTIMATE.start_main_~nondetString~0#1.base|)))} assume !(main_~i~0#1 < main_~length~0#1 - 1); {2999#(and (= |ULTIMATE.start_main_~nondetString~0#1.offset| 0) (<= 1 (select |#length| |ULTIMATE.start_main_~nondetString~0#1.base|)))} is VALID [2022-02-20 23:40:45,711 INFO L290 TraceCheckUtils]: 6: Hoare triple {2999#(and (= |ULTIMATE.start_main_~nondetString~0#1.offset| 0) (<= 1 (select |#length| |ULTIMATE.start_main_~nondetString~0#1.base|)))} SUMMARY for call write~int(0, main_~nondetString~0#1.base, main_~nondetString~0#1.offset + (main_~length~0#1 - 1), 1); srcloc: L543-4 {3000#(and (= |ULTIMATE.start_main_~nondetString~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~nondetString~0#1.base|) 1) (<= 1 (select |#length| |ULTIMATE.start_main_~nondetString~0#1.base|)))} is VALID [2022-02-20 23:40:45,711 INFO L290 TraceCheckUtils]: 7: Hoare triple {3000#(and (= |ULTIMATE.start_main_~nondetString~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~nondetString~0#1.base|) 1) (<= 1 (select |#length| |ULTIMATE.start_main_~nondetString~0#1.base|)))} assume { :begin_inline_cstpncpy } true;cstpncpy_#in~dst#1.base, cstpncpy_#in~dst#1.offset, cstpncpy_#in~src#1.base, cstpncpy_#in~src#1.offset, cstpncpy_#in~n#1 := main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset, main_~nondetString~0#1.base, main_~nondetString~0#1.offset, main_~n~0#1;havoc cstpncpy_#res#1.base, cstpncpy_#res#1.offset;havoc cstpncpy_#t~mem2#1.base, cstpncpy_#t~mem2#1.offset, cstpncpy_#t~mem3#1.base, cstpncpy_#t~mem3#1.offset, cstpncpy_#t~post5#1.base, cstpncpy_#t~post5#1.offset, cstpncpy_#t~post6#1.base, cstpncpy_#t~post6#1.offset, cstpncpy_#t~mem7#1, cstpncpy_#t~post9#1.base, cstpncpy_#t~post9#1.offset, cstpncpy_#t~pre8#1, cstpncpy_#t~pre4#1, cstpncpy_~d~0#1.base, cstpncpy_~d~0#1.offset, cstpncpy_~s~0#1.base, cstpncpy_~s~0#1.offset, cstpncpy_#t~mem10#1.base, cstpncpy_#t~mem10#1.offset, cstpncpy_~#dst#1.base, cstpncpy_~#dst#1.offset, cstpncpy_~src#1.base, cstpncpy_~src#1.offset, cstpncpy_~n#1;call cstpncpy_~#dst#1.base, cstpncpy_~#dst#1.offset := #Ultimate.allocOnStack(4); {3001#(and (= |ULTIMATE.start_cstpncpy_#in~src#1.offset| 0) (<= 1 (select |#length| |ULTIMATE.start_cstpncpy_#in~src#1.base|)))} is VALID [2022-02-20 23:40:45,712 INFO L290 TraceCheckUtils]: 8: Hoare triple {3001#(and (= |ULTIMATE.start_cstpncpy_#in~src#1.offset| 0) (<= 1 (select |#length| |ULTIMATE.start_cstpncpy_#in~src#1.base|)))} SUMMARY for call write~$Pointer$(cstpncpy_#in~dst#1.base, cstpncpy_#in~dst#1.offset, cstpncpy_~#dst#1.base, cstpncpy_~#dst#1.offset, 4); srcloc: L513 {3001#(and (= |ULTIMATE.start_cstpncpy_#in~src#1.offset| 0) (<= 1 (select |#length| |ULTIMATE.start_cstpncpy_#in~src#1.base|)))} is VALID [2022-02-20 23:40:45,712 INFO L290 TraceCheckUtils]: 9: Hoare triple {3001#(and (= |ULTIMATE.start_cstpncpy_#in~src#1.offset| 0) (<= 1 (select |#length| |ULTIMATE.start_cstpncpy_#in~src#1.base|)))} cstpncpy_~src#1.base, cstpncpy_~src#1.offset := cstpncpy_#in~src#1.base, cstpncpy_#in~src#1.offset;cstpncpy_~n#1 := cstpncpy_#in~n#1; {3002#(and (<= 1 (select |#length| |ULTIMATE.start_cstpncpy_~src#1.base|)) (= |ULTIMATE.start_cstpncpy_~src#1.offset| 0))} is VALID [2022-02-20 23:40:45,713 INFO L290 TraceCheckUtils]: 10: Hoare triple {3002#(and (<= 1 (select |#length| |ULTIMATE.start_cstpncpy_~src#1.base|)) (= |ULTIMATE.start_cstpncpy_~src#1.offset| 0))} assume 0 != cstpncpy_~n#1 % 4294967296; {3002#(and (<= 1 (select |#length| |ULTIMATE.start_cstpncpy_~src#1.base|)) (= |ULTIMATE.start_cstpncpy_~src#1.offset| 0))} is VALID [2022-02-20 23:40:45,713 INFO L290 TraceCheckUtils]: 11: Hoare triple {3002#(and (<= 1 (select |#length| |ULTIMATE.start_cstpncpy_~src#1.base|)) (= |ULTIMATE.start_cstpncpy_~src#1.offset| 0))} SUMMARY for call cstpncpy_#t~mem2#1.base, cstpncpy_#t~mem2#1.offset := read~$Pointer$(cstpncpy_~#dst#1.base, cstpncpy_~#dst#1.offset, 4); srcloc: L517 {3002#(and (<= 1 (select |#length| |ULTIMATE.start_cstpncpy_~src#1.base|)) (= |ULTIMATE.start_cstpncpy_~src#1.offset| 0))} is VALID [2022-02-20 23:40:45,714 INFO L290 TraceCheckUtils]: 12: Hoare triple {3002#(and (<= 1 (select |#length| |ULTIMATE.start_cstpncpy_~src#1.base|)) (= |ULTIMATE.start_cstpncpy_~src#1.offset| 0))} cstpncpy_~d~0#1.base, cstpncpy_~d~0#1.offset := cstpncpy_#t~mem2#1.base, cstpncpy_#t~mem2#1.offset;havoc cstpncpy_#t~mem2#1.base, cstpncpy_#t~mem2#1.offset;cstpncpy_~s~0#1.base, cstpncpy_~s~0#1.offset := cstpncpy_~src#1.base, cstpncpy_~src#1.offset; {3003#(and (<= 1 (select |#length| |ULTIMATE.start_cstpncpy_~s~0#1.base|)) (= |ULTIMATE.start_cstpncpy_~s~0#1.offset| 0))} is VALID [2022-02-20 23:40:45,714 INFO L290 TraceCheckUtils]: 13: Hoare triple {3003#(and (<= 1 (select |#length| |ULTIMATE.start_cstpncpy_~s~0#1.base|)) (= |ULTIMATE.start_cstpncpy_~s~0#1.offset| 0))} SUMMARY for call cstpncpy_#t~mem3#1.base, cstpncpy_#t~mem3#1.offset := read~$Pointer$(cstpncpy_~#dst#1.base, cstpncpy_~#dst#1.offset, 4); srcloc: L519 {3003#(and (<= 1 (select |#length| |ULTIMATE.start_cstpncpy_~s~0#1.base|)) (= |ULTIMATE.start_cstpncpy_~s~0#1.offset| 0))} is VALID [2022-02-20 23:40:45,714 INFO L290 TraceCheckUtils]: 14: Hoare triple {3003#(and (<= 1 (select |#length| |ULTIMATE.start_cstpncpy_~s~0#1.base|)) (= |ULTIMATE.start_cstpncpy_~s~0#1.offset| 0))} SUMMARY for call write~$Pointer$(cstpncpy_#t~mem3#1.base, cstpncpy_#t~mem3#1.offset + (if cstpncpy_~n#1 % 4294967296 % 4294967296 <= 2147483647 then cstpncpy_~n#1 % 4294967296 % 4294967296 else cstpncpy_~n#1 % 4294967296 % 4294967296 - 4294967296), cstpncpy_~#dst#1.base, cstpncpy_~#dst#1.offset, 4); srcloc: L519-1 {3003#(and (<= 1 (select |#length| |ULTIMATE.start_cstpncpy_~s~0#1.base|)) (= |ULTIMATE.start_cstpncpy_~s~0#1.offset| 0))} is VALID [2022-02-20 23:40:45,715 INFO L290 TraceCheckUtils]: 15: Hoare triple {3003#(and (<= 1 (select |#length| |ULTIMATE.start_cstpncpy_~s~0#1.base|)) (= |ULTIMATE.start_cstpncpy_~s~0#1.offset| 0))} havoc cstpncpy_#t~mem3#1.base, cstpncpy_#t~mem3#1.offset; {3003#(and (<= 1 (select |#length| |ULTIMATE.start_cstpncpy_~s~0#1.base|)) (= |ULTIMATE.start_cstpncpy_~s~0#1.offset| 0))} is VALID [2022-02-20 23:40:45,715 INFO L290 TraceCheckUtils]: 16: Hoare triple {3003#(and (<= 1 (select |#length| |ULTIMATE.start_cstpncpy_~s~0#1.base|)) (= |ULTIMATE.start_cstpncpy_~s~0#1.offset| 0))} cstpncpy_#t~post5#1.base, cstpncpy_#t~post5#1.offset := cstpncpy_~d~0#1.base, cstpncpy_~d~0#1.offset;cstpncpy_~d~0#1.base, cstpncpy_~d~0#1.offset := cstpncpy_#t~post5#1.base, 1 + cstpncpy_#t~post5#1.offset;cstpncpy_#t~post6#1.base, cstpncpy_#t~post6#1.offset := cstpncpy_~s~0#1.base, cstpncpy_~s~0#1.offset;cstpncpy_~s~0#1.base, cstpncpy_~s~0#1.offset := cstpncpy_#t~post6#1.base, 1 + cstpncpy_#t~post6#1.offset; {3004#(and (= |ULTIMATE.start_cstpncpy_#t~post6#1.offset| 0) (<= 1 (select |#length| |ULTIMATE.start_cstpncpy_#t~post6#1.base|)))} is VALID [2022-02-20 23:40:45,716 INFO L290 TraceCheckUtils]: 17: Hoare triple {3004#(and (= |ULTIMATE.start_cstpncpy_#t~post6#1.offset| 0) (<= 1 (select |#length| |ULTIMATE.start_cstpncpy_#t~post6#1.base|)))} assume !(1 + cstpncpy_#t~post6#1.offset <= #length[cstpncpy_#t~post6#1.base] && 0 <= cstpncpy_#t~post6#1.offset); {2997#false} is VALID [2022-02-20 23:40:45,716 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:40:45,716 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:40:45,716 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891127860] [2022-02-20 23:40:45,716 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891127860] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:40:45,716 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:40:45,716 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 23:40:45,716 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887493449] [2022-02-20 23:40:45,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:40:45,717 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 9 states have internal predecessors, (18), 0 states have call successors, (0), 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 18 [2022-02-20 23:40:45,717 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:40:45,717 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 2.25) internal successors, (18), 9 states have internal predecessors, (18), 0 states have call successors, (0), 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:40:45,730 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:40:45,731 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 23:40:45,731 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:40:45,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 23:40:45,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-02-20 23:40:45,731 INFO L87 Difference]: Start difference. First operand 43 states and 49 transitions. Second operand has 9 states, 8 states have (on average 2.25) internal successors, (18), 9 states have internal predecessors, (18), 0 states have call successors, (0), 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:40:46,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:40:46,071 INFO L93 Difference]: Finished difference Result 49 states and 56 transitions. [2022-02-20 23:40:46,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-20 23:40:46,071 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 9 states have internal predecessors, (18), 0 states have call successors, (0), 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 18 [2022-02-20 23:40:46,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:40:46,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.25) internal successors, (18), 9 states have internal predecessors, (18), 0 states have call successors, (0), 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:40:46,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 53 transitions. [2022-02-20 23:40:46,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.25) internal successors, (18), 9 states have internal predecessors, (18), 0 states have call successors, (0), 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:40:46,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 53 transitions. [2022-02-20 23:40:46,072 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 53 transitions. [2022-02-20 23:40:46,115 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:40:46,116 INFO L225 Difference]: With dead ends: 49 [2022-02-20 23:40:46,116 INFO L226 Difference]: Without dead ends: 49 [2022-02-20 23:40:46,116 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2022-02-20 23:40:46,116 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 195 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:40:46,117 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [195 Valid, 82 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:40:46,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-02-20 23:40:46,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 45. [2022-02-20 23:40:46,118 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:40:46,118 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand has 45 states, 39 states have (on average 1.3076923076923077) 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:40:46,118 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand has 45 states, 39 states have (on average 1.3076923076923077) 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:40:46,118 INFO L87 Difference]: Start difference. First operand 49 states. Second operand has 45 states, 39 states have (on average 1.3076923076923077) 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:40:46,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:40:46,119 INFO L93 Difference]: Finished difference Result 49 states and 56 transitions. [2022-02-20 23:40:46,119 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 56 transitions. [2022-02-20 23:40:46,119 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:40:46,119 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:40:46,119 INFO L74 IsIncluded]: Start isIncluded. First operand has 45 states, 39 states have (on average 1.3076923076923077) 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 49 states. [2022-02-20 23:40:46,119 INFO L87 Difference]: Start difference. First operand has 45 states, 39 states have (on average 1.3076923076923077) 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 49 states. [2022-02-20 23:40:46,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:40:46,119 INFO L93 Difference]: Finished difference Result 49 states and 56 transitions. [2022-02-20 23:40:46,119 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 56 transitions. [2022-02-20 23:40:46,120 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:40:46,120 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:40:46,120 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:40:46,120 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:40:46,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 39 states have (on average 1.3076923076923077) 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:40:46,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 51 transitions. [2022-02-20 23:40:46,120 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 51 transitions. Word has length 18 [2022-02-20 23:40:46,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:40:46,120 INFO L470 AbstractCegarLoop]: Abstraction has 45 states and 51 transitions. [2022-02-20 23:40:46,120 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 9 states have internal predecessors, (18), 0 states have call successors, (0), 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:40:46,121 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2022-02-20 23:40:46,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-02-20 23:40:46,121 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:40:46,121 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:40:46,121 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-02-20 23:40:46,121 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2022-02-20 23:40:46,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:40:46,121 INFO L85 PathProgramCache]: Analyzing trace with hash -770257435, now seen corresponding path program 1 times [2022-02-20 23:40:46,121 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:40:46,121 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176297705] [2022-02-20 23:40:46,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:40:46,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:40:46,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:40:46,286 INFO L290 TraceCheckUtils]: 0: Hoare triple {3211#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {3211#true} is VALID [2022-02-20 23:40:46,286 INFO L290 TraceCheckUtils]: 1: Hoare triple {3211#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~nondet12#1, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_#t~nondet16#1, main_#t~post15#1, main_~i~0#1, main_#t~ret17#1.base, main_#t~ret17#1.offset, main_~length~0#1, main_~n~0#1, main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset, main_~nondetString~0#1.base, main_~nondetString~0#1.offset;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~length~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~n~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; {3211#true} is VALID [2022-02-20 23:40:46,286 INFO L290 TraceCheckUtils]: 2: Hoare triple {3211#true} assume main_~length~0#1 < 1;main_~length~0#1 := 1; {3211#true} is VALID [2022-02-20 23:40:46,287 INFO L290 TraceCheckUtils]: 3: Hoare triple {3211#true} assume main_~n~0#1 < 1;main_~n~0#1 := 1; {3213#(<= 1 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 23:40:46,287 INFO L290 TraceCheckUtils]: 4: Hoare triple {3213#(<= 1 |ULTIMATE.start_main_~n~0#1|)} call main_#t~malloc13#1.base, main_#t~malloc13#1.offset := #Ultimate.allocOnStack(main_~n~0#1);main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset := main_#t~malloc13#1.base, main_#t~malloc13#1.offset;call main_#t~malloc14#1.base, main_#t~malloc14#1.offset := #Ultimate.allocOnStack(main_~length~0#1);main_~nondetString~0#1.base, main_~nondetString~0#1.offset := main_#t~malloc14#1.base, main_#t~malloc14#1.offset;main_~i~0#1 := 0; {3214#(and (= |ULTIMATE.start_main_~n~0#1| (select |#length| |ULTIMATE.start_main_~nondetArea~0#1.base|)) (= |ULTIMATE.start_main_~nondetArea~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~n~0#1|))} is VALID [2022-02-20 23:40:46,288 INFO L290 TraceCheckUtils]: 5: Hoare triple {3214#(and (= |ULTIMATE.start_main_~n~0#1| (select |#length| |ULTIMATE.start_main_~nondetArea~0#1.base|)) (= |ULTIMATE.start_main_~nondetArea~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~n~0#1|))} assume !(main_~i~0#1 < main_~length~0#1 - 1); {3214#(and (= |ULTIMATE.start_main_~n~0#1| (select |#length| |ULTIMATE.start_main_~nondetArea~0#1.base|)) (= |ULTIMATE.start_main_~nondetArea~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~n~0#1|))} is VALID [2022-02-20 23:40:46,288 INFO L290 TraceCheckUtils]: 6: Hoare triple {3214#(and (= |ULTIMATE.start_main_~n~0#1| (select |#length| |ULTIMATE.start_main_~nondetArea~0#1.base|)) (= |ULTIMATE.start_main_~nondetArea~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~n~0#1|))} SUMMARY for call write~int(0, main_~nondetString~0#1.base, main_~nondetString~0#1.offset + (main_~length~0#1 - 1), 1); srcloc: L543-4 {3214#(and (= |ULTIMATE.start_main_~n~0#1| (select |#length| |ULTIMATE.start_main_~nondetArea~0#1.base|)) (= |ULTIMATE.start_main_~nondetArea~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~n~0#1|))} is VALID [2022-02-20 23:40:46,289 INFO L290 TraceCheckUtils]: 7: Hoare triple {3214#(and (= |ULTIMATE.start_main_~n~0#1| (select |#length| |ULTIMATE.start_main_~nondetArea~0#1.base|)) (= |ULTIMATE.start_main_~nondetArea~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~n~0#1|))} assume { :begin_inline_cstpncpy } true;cstpncpy_#in~dst#1.base, cstpncpy_#in~dst#1.offset, cstpncpy_#in~src#1.base, cstpncpy_#in~src#1.offset, cstpncpy_#in~n#1 := main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset, main_~nondetString~0#1.base, main_~nondetString~0#1.offset, main_~n~0#1;havoc cstpncpy_#res#1.base, cstpncpy_#res#1.offset;havoc cstpncpy_#t~mem2#1.base, cstpncpy_#t~mem2#1.offset, cstpncpy_#t~mem3#1.base, cstpncpy_#t~mem3#1.offset, cstpncpy_#t~post5#1.base, cstpncpy_#t~post5#1.offset, cstpncpy_#t~post6#1.base, cstpncpy_#t~post6#1.offset, cstpncpy_#t~mem7#1, cstpncpy_#t~post9#1.base, cstpncpy_#t~post9#1.offset, cstpncpy_#t~pre8#1, cstpncpy_#t~pre4#1, cstpncpy_~d~0#1.base, cstpncpy_~d~0#1.offset, cstpncpy_~s~0#1.base, cstpncpy_~s~0#1.offset, cstpncpy_#t~mem10#1.base, cstpncpy_#t~mem10#1.offset, cstpncpy_~#dst#1.base, cstpncpy_~#dst#1.offset, cstpncpy_~src#1.base, cstpncpy_~src#1.offset, cstpncpy_~n#1;call cstpncpy_~#dst#1.base, cstpncpy_~#dst#1.offset := #Ultimate.allocOnStack(4); {3215#(and (= |ULTIMATE.start_cstpncpy_#in~dst#1.offset| 0) (<= 1 (select |#length| |ULTIMATE.start_cstpncpy_#in~dst#1.base|)))} is VALID [2022-02-20 23:40:46,290 INFO L290 TraceCheckUtils]: 8: Hoare triple {3215#(and (= |ULTIMATE.start_cstpncpy_#in~dst#1.offset| 0) (<= 1 (select |#length| |ULTIMATE.start_cstpncpy_#in~dst#1.base|)))} SUMMARY for call write~$Pointer$(cstpncpy_#in~dst#1.base, cstpncpy_#in~dst#1.offset, cstpncpy_~#dst#1.base, cstpncpy_~#dst#1.offset, 4); srcloc: L513 {3216#(and (<= 1 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_cstpncpy_~#dst#1.base|) |ULTIMATE.start_cstpncpy_~#dst#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_cstpncpy_~#dst#1.base|) |ULTIMATE.start_cstpncpy_~#dst#1.offset|) 0))} is VALID [2022-02-20 23:40:46,291 INFO L290 TraceCheckUtils]: 9: Hoare triple {3216#(and (<= 1 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_cstpncpy_~#dst#1.base|) |ULTIMATE.start_cstpncpy_~#dst#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_cstpncpy_~#dst#1.base|) |ULTIMATE.start_cstpncpy_~#dst#1.offset|) 0))} cstpncpy_~src#1.base, cstpncpy_~src#1.offset := cstpncpy_#in~src#1.base, cstpncpy_#in~src#1.offset;cstpncpy_~n#1 := cstpncpy_#in~n#1; {3216#(and (<= 1 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_cstpncpy_~#dst#1.base|) |ULTIMATE.start_cstpncpy_~#dst#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_cstpncpy_~#dst#1.base|) |ULTIMATE.start_cstpncpy_~#dst#1.offset|) 0))} is VALID [2022-02-20 23:40:46,291 INFO L290 TraceCheckUtils]: 10: Hoare triple {3216#(and (<= 1 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_cstpncpy_~#dst#1.base|) |ULTIMATE.start_cstpncpy_~#dst#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_cstpncpy_~#dst#1.base|) |ULTIMATE.start_cstpncpy_~#dst#1.offset|) 0))} assume 0 != cstpncpy_~n#1 % 4294967296; {3216#(and (<= 1 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_cstpncpy_~#dst#1.base|) |ULTIMATE.start_cstpncpy_~#dst#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_cstpncpy_~#dst#1.base|) |ULTIMATE.start_cstpncpy_~#dst#1.offset|) 0))} is VALID [2022-02-20 23:40:46,291 INFO L290 TraceCheckUtils]: 11: Hoare triple {3216#(and (<= 1 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_cstpncpy_~#dst#1.base|) |ULTIMATE.start_cstpncpy_~#dst#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_cstpncpy_~#dst#1.base|) |ULTIMATE.start_cstpncpy_~#dst#1.offset|) 0))} SUMMARY for call cstpncpy_#t~mem2#1.base, cstpncpy_#t~mem2#1.offset := read~$Pointer$(cstpncpy_~#dst#1.base, cstpncpy_~#dst#1.offset, 4); srcloc: L517 {3217#(and (= |ULTIMATE.start_cstpncpy_#t~mem2#1.offset| 0) (<= 1 (select |#length| |ULTIMATE.start_cstpncpy_#t~mem2#1.base|)))} is VALID [2022-02-20 23:40:46,292 INFO L290 TraceCheckUtils]: 12: Hoare triple {3217#(and (= |ULTIMATE.start_cstpncpy_#t~mem2#1.offset| 0) (<= 1 (select |#length| |ULTIMATE.start_cstpncpy_#t~mem2#1.base|)))} cstpncpy_~d~0#1.base, cstpncpy_~d~0#1.offset := cstpncpy_#t~mem2#1.base, cstpncpy_#t~mem2#1.offset;havoc cstpncpy_#t~mem2#1.base, cstpncpy_#t~mem2#1.offset;cstpncpy_~s~0#1.base, cstpncpy_~s~0#1.offset := cstpncpy_~src#1.base, cstpncpy_~src#1.offset; {3218#(and (= |ULTIMATE.start_cstpncpy_~d~0#1.offset| 0) (<= 1 (select |#length| |ULTIMATE.start_cstpncpy_~d~0#1.base|)))} is VALID [2022-02-20 23:40:46,292 INFO L290 TraceCheckUtils]: 13: Hoare triple {3218#(and (= |ULTIMATE.start_cstpncpy_~d~0#1.offset| 0) (<= 1 (select |#length| |ULTIMATE.start_cstpncpy_~d~0#1.base|)))} SUMMARY for call cstpncpy_#t~mem3#1.base, cstpncpy_#t~mem3#1.offset := read~$Pointer$(cstpncpy_~#dst#1.base, cstpncpy_~#dst#1.offset, 4); srcloc: L519 {3218#(and (= |ULTIMATE.start_cstpncpy_~d~0#1.offset| 0) (<= 1 (select |#length| |ULTIMATE.start_cstpncpy_~d~0#1.base|)))} is VALID [2022-02-20 23:40:46,293 INFO L290 TraceCheckUtils]: 14: Hoare triple {3218#(and (= |ULTIMATE.start_cstpncpy_~d~0#1.offset| 0) (<= 1 (select |#length| |ULTIMATE.start_cstpncpy_~d~0#1.base|)))} SUMMARY for call write~$Pointer$(cstpncpy_#t~mem3#1.base, cstpncpy_#t~mem3#1.offset + (if cstpncpy_~n#1 % 4294967296 % 4294967296 <= 2147483647 then cstpncpy_~n#1 % 4294967296 % 4294967296 else cstpncpy_~n#1 % 4294967296 % 4294967296 - 4294967296), cstpncpy_~#dst#1.base, cstpncpy_~#dst#1.offset, 4); srcloc: L519-1 {3218#(and (= |ULTIMATE.start_cstpncpy_~d~0#1.offset| 0) (<= 1 (select |#length| |ULTIMATE.start_cstpncpy_~d~0#1.base|)))} is VALID [2022-02-20 23:40:46,293 INFO L290 TraceCheckUtils]: 15: Hoare triple {3218#(and (= |ULTIMATE.start_cstpncpy_~d~0#1.offset| 0) (<= 1 (select |#length| |ULTIMATE.start_cstpncpy_~d~0#1.base|)))} havoc cstpncpy_#t~mem3#1.base, cstpncpy_#t~mem3#1.offset; {3218#(and (= |ULTIMATE.start_cstpncpy_~d~0#1.offset| 0) (<= 1 (select |#length| |ULTIMATE.start_cstpncpy_~d~0#1.base|)))} is VALID [2022-02-20 23:40:46,294 INFO L290 TraceCheckUtils]: 16: Hoare triple {3218#(and (= |ULTIMATE.start_cstpncpy_~d~0#1.offset| 0) (<= 1 (select |#length| |ULTIMATE.start_cstpncpy_~d~0#1.base|)))} cstpncpy_#t~post5#1.base, cstpncpy_#t~post5#1.offset := cstpncpy_~d~0#1.base, cstpncpy_~d~0#1.offset;cstpncpy_~d~0#1.base, cstpncpy_~d~0#1.offset := cstpncpy_#t~post5#1.base, 1 + cstpncpy_#t~post5#1.offset;cstpncpy_#t~post6#1.base, cstpncpy_#t~post6#1.offset := cstpncpy_~s~0#1.base, cstpncpy_~s~0#1.offset;cstpncpy_~s~0#1.base, cstpncpy_~s~0#1.offset := cstpncpy_#t~post6#1.base, 1 + cstpncpy_#t~post6#1.offset; {3219#(and (= |ULTIMATE.start_cstpncpy_#t~post5#1.offset| 0) (<= 1 (select |#length| |ULTIMATE.start_cstpncpy_#t~post5#1.base|)))} is VALID [2022-02-20 23:40:46,294 INFO L290 TraceCheckUtils]: 17: Hoare triple {3219#(and (= |ULTIMATE.start_cstpncpy_#t~post5#1.offset| 0) (<= 1 (select |#length| |ULTIMATE.start_cstpncpy_#t~post5#1.base|)))} SUMMARY for call cstpncpy_#t~mem7#1 := read~int(cstpncpy_#t~post6#1.base, cstpncpy_#t~post6#1.offset, 1); srcloc: L521 {3219#(and (= |ULTIMATE.start_cstpncpy_#t~post5#1.offset| 0) (<= 1 (select |#length| |ULTIMATE.start_cstpncpy_#t~post5#1.base|)))} is VALID [2022-02-20 23:40:46,295 INFO L290 TraceCheckUtils]: 18: Hoare triple {3219#(and (= |ULTIMATE.start_cstpncpy_#t~post5#1.offset| 0) (<= 1 (select |#length| |ULTIMATE.start_cstpncpy_#t~post5#1.base|)))} assume !(1 + cstpncpy_#t~post5#1.offset <= #length[cstpncpy_#t~post5#1.base] && 0 <= cstpncpy_#t~post5#1.offset); {3212#false} is VALID [2022-02-20 23:40:46,295 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:40:46,295 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:40:46,295 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176297705] [2022-02-20 23:40:46,295 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176297705] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:40:46,295 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:40:46,295 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 23:40:46,295 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637113823] [2022-02-20 23:40:46,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:40:46,296 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 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 19 [2022-02-20 23:40:46,296 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:40:46,296 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 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:40:46,311 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:40:46,311 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 23:40:46,312 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:40:46,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 23:40:46,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-02-20 23:40:46,312 INFO L87 Difference]: Start difference. First operand 45 states and 51 transitions. Second operand has 9 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 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:40:46,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:40:46,634 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2022-02-20 23:40:46,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 23:40:46,635 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 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 19 [2022-02-20 23:40:46,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:40:46,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 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:40:46,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 52 transitions. [2022-02-20 23:40:46,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 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:40:46,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 52 transitions. [2022-02-20 23:40:46,636 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 52 transitions. [2022-02-20 23:40:46,673 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:40:46,674 INFO L225 Difference]: With dead ends: 48 [2022-02-20 23:40:46,674 INFO L226 Difference]: Without dead ends: 48 [2022-02-20 23:40:46,674 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2022-02-20 23:40:46,675 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 83 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:40:46,675 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [83 Valid, 152 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:40:46,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-02-20 23:40:46,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46. [2022-02-20 23:40:46,676 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:40:46,676 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand has 46 states, 40 states have (on average 1.325) internal successors, (53), 45 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:40:46,676 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand has 46 states, 40 states have (on average 1.325) internal successors, (53), 45 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:40:46,676 INFO L87 Difference]: Start difference. First operand 48 states. Second operand has 46 states, 40 states have (on average 1.325) internal successors, (53), 45 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:40:46,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:40:46,677 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2022-02-20 23:40:46,677 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2022-02-20 23:40:46,677 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:40:46,677 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:40:46,677 INFO L74 IsIncluded]: Start isIncluded. First operand has 46 states, 40 states have (on average 1.325) internal successors, (53), 45 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 48 states. [2022-02-20 23:40:46,677 INFO L87 Difference]: Start difference. First operand has 46 states, 40 states have (on average 1.325) internal successors, (53), 45 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 48 states. [2022-02-20 23:40:46,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:40:46,678 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2022-02-20 23:40:46,678 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2022-02-20 23:40:46,678 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:40:46,678 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:40:46,678 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:40:46,678 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:40:46,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 40 states have (on average 1.325) internal successors, (53), 45 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:40:46,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 53 transitions. [2022-02-20 23:40:46,679 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 53 transitions. Word has length 19 [2022-02-20 23:40:46,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:40:46,679 INFO L470 AbstractCegarLoop]: Abstraction has 46 states and 53 transitions. [2022-02-20 23:40:46,679 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 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:40:46,679 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 53 transitions. [2022-02-20 23:40:46,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-02-20 23:40:46,679 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:40:46,679 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:40:46,679 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-02-20 23:40:46,679 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2022-02-20 23:40:46,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:40:46,680 INFO L85 PathProgramCache]: Analyzing trace with hash -770257436, now seen corresponding path program 1 times [2022-02-20 23:40:46,680 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:40:46,680 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123138371] [2022-02-20 23:40:46,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:40:46,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:40:46,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:40:46,847 INFO L290 TraceCheckUtils]: 0: Hoare triple {3424#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {3424#true} is VALID [2022-02-20 23:40:46,847 INFO L290 TraceCheckUtils]: 1: Hoare triple {3424#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~nondet12#1, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_#t~nondet16#1, main_#t~post15#1, main_~i~0#1, main_#t~ret17#1.base, main_#t~ret17#1.offset, main_~length~0#1, main_~n~0#1, main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset, main_~nondetString~0#1.base, main_~nondetString~0#1.offset;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~length~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~n~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; {3424#true} is VALID [2022-02-20 23:40:46,847 INFO L290 TraceCheckUtils]: 2: Hoare triple {3424#true} assume main_~length~0#1 < 1;main_~length~0#1 := 1; {3424#true} is VALID [2022-02-20 23:40:46,848 INFO L290 TraceCheckUtils]: 3: Hoare triple {3424#true} assume main_~n~0#1 < 1;main_~n~0#1 := 1; {3426#(and (<= 1 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~n~0#1| 1))} is VALID [2022-02-20 23:40:46,849 INFO L290 TraceCheckUtils]: 4: Hoare triple {3426#(and (<= 1 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~n~0#1| 1))} call main_#t~malloc13#1.base, main_#t~malloc13#1.offset := #Ultimate.allocOnStack(main_~n~0#1);main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset := main_#t~malloc13#1.base, main_#t~malloc13#1.offset;call main_#t~malloc14#1.base, main_#t~malloc14#1.offset := #Ultimate.allocOnStack(main_~length~0#1);main_~nondetString~0#1.base, main_~nondetString~0#1.offset := main_#t~malloc14#1.base, main_#t~malloc14#1.offset;main_~i~0#1 := 0; {3427#(= (select |#valid| |ULTIMATE.start_main_~nondetString~0#1.base|) (select |#valid| |ULTIMATE.start_main_~nondetArea~0#1.base|))} is VALID [2022-02-20 23:40:46,849 INFO L290 TraceCheckUtils]: 5: Hoare triple {3427#(= (select |#valid| |ULTIMATE.start_main_~nondetString~0#1.base|) (select |#valid| |ULTIMATE.start_main_~nondetArea~0#1.base|))} assume !(main_~i~0#1 < main_~length~0#1 - 1); {3427#(= (select |#valid| |ULTIMATE.start_main_~nondetString~0#1.base|) (select |#valid| |ULTIMATE.start_main_~nondetArea~0#1.base|))} is VALID [2022-02-20 23:40:46,850 INFO L290 TraceCheckUtils]: 6: Hoare triple {3427#(= (select |#valid| |ULTIMATE.start_main_~nondetString~0#1.base|) (select |#valid| |ULTIMATE.start_main_~nondetArea~0#1.base|))} SUMMARY for call write~int(0, main_~nondetString~0#1.base, main_~nondetString~0#1.offset + (main_~length~0#1 - 1), 1); srcloc: L543-4 {3428#(or (= (select |#valid| |ULTIMATE.start_main_~nondetArea~0#1.base|) 1) (= |ULTIMATE.start_main_~nondetArea~0#1.base| |ULTIMATE.start_main_~nondetString~0#1.base|))} is VALID [2022-02-20 23:40:46,850 INFO L290 TraceCheckUtils]: 7: Hoare triple {3428#(or (= (select |#valid| |ULTIMATE.start_main_~nondetArea~0#1.base|) 1) (= |ULTIMATE.start_main_~nondetArea~0#1.base| |ULTIMATE.start_main_~nondetString~0#1.base|))} assume { :begin_inline_cstpncpy } true;cstpncpy_#in~dst#1.base, cstpncpy_#in~dst#1.offset, cstpncpy_#in~src#1.base, cstpncpy_#in~src#1.offset, cstpncpy_#in~n#1 := main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset, main_~nondetString~0#1.base, main_~nondetString~0#1.offset, main_~n~0#1;havoc cstpncpy_#res#1.base, cstpncpy_#res#1.offset;havoc cstpncpy_#t~mem2#1.base, cstpncpy_#t~mem2#1.offset, cstpncpy_#t~mem3#1.base, cstpncpy_#t~mem3#1.offset, cstpncpy_#t~post5#1.base, cstpncpy_#t~post5#1.offset, cstpncpy_#t~post6#1.base, cstpncpy_#t~post6#1.offset, cstpncpy_#t~mem7#1, cstpncpy_#t~post9#1.base, cstpncpy_#t~post9#1.offset, cstpncpy_#t~pre8#1, cstpncpy_#t~pre4#1, cstpncpy_~d~0#1.base, cstpncpy_~d~0#1.offset, cstpncpy_~s~0#1.base, cstpncpy_~s~0#1.offset, cstpncpy_#t~mem10#1.base, cstpncpy_#t~mem10#1.offset, cstpncpy_~#dst#1.base, cstpncpy_~#dst#1.offset, cstpncpy_~src#1.base, cstpncpy_~src#1.offset, cstpncpy_~n#1;call cstpncpy_~#dst#1.base, cstpncpy_~#dst#1.offset := #Ultimate.allocOnStack(4); {3429#(or (= (select |#valid| |ULTIMATE.start_cstpncpy_#in~dst#1.base|) 1) (= |ULTIMATE.start_cstpncpy_~#dst#1.base| |ULTIMATE.start_cstpncpy_#in~dst#1.base|) (= |ULTIMATE.start_cstpncpy_#in~src#1.base| |ULTIMATE.start_cstpncpy_#in~dst#1.base|))} is VALID [2022-02-20 23:40:46,851 INFO L290 TraceCheckUtils]: 8: Hoare triple {3429#(or (= (select |#valid| |ULTIMATE.start_cstpncpy_#in~dst#1.base|) 1) (= |ULTIMATE.start_cstpncpy_~#dst#1.base| |ULTIMATE.start_cstpncpy_#in~dst#1.base|) (= |ULTIMATE.start_cstpncpy_#in~src#1.base| |ULTIMATE.start_cstpncpy_#in~dst#1.base|))} SUMMARY for call write~$Pointer$(cstpncpy_#in~dst#1.base, cstpncpy_#in~dst#1.offset, cstpncpy_~#dst#1.base, cstpncpy_~#dst#1.offset, 4); srcloc: L513 {3430#(or (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_cstpncpy_~#dst#1.base|) |ULTIMATE.start_cstpncpy_~#dst#1.offset|)) 1) (= |ULTIMATE.start_cstpncpy_#in~src#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_cstpncpy_~#dst#1.base|) |ULTIMATE.start_cstpncpy_~#dst#1.offset|)))} is VALID [2022-02-20 23:40:46,852 INFO L290 TraceCheckUtils]: 9: Hoare triple {3430#(or (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_cstpncpy_~#dst#1.base|) |ULTIMATE.start_cstpncpy_~#dst#1.offset|)) 1) (= |ULTIMATE.start_cstpncpy_#in~src#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_cstpncpy_~#dst#1.base|) |ULTIMATE.start_cstpncpy_~#dst#1.offset|)))} cstpncpy_~src#1.base, cstpncpy_~src#1.offset := cstpncpy_#in~src#1.base, cstpncpy_#in~src#1.offset;cstpncpy_~n#1 := cstpncpy_#in~n#1; {3431#(or (= |ULTIMATE.start_cstpncpy_~src#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_cstpncpy_~#dst#1.base|) |ULTIMATE.start_cstpncpy_~#dst#1.offset|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_cstpncpy_~#dst#1.base|) |ULTIMATE.start_cstpncpy_~#dst#1.offset|)) 1))} is VALID [2022-02-20 23:40:46,852 INFO L290 TraceCheckUtils]: 10: Hoare triple {3431#(or (= |ULTIMATE.start_cstpncpy_~src#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_cstpncpy_~#dst#1.base|) |ULTIMATE.start_cstpncpy_~#dst#1.offset|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_cstpncpy_~#dst#1.base|) |ULTIMATE.start_cstpncpy_~#dst#1.offset|)) 1))} assume 0 != cstpncpy_~n#1 % 4294967296; {3431#(or (= |ULTIMATE.start_cstpncpy_~src#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_cstpncpy_~#dst#1.base|) |ULTIMATE.start_cstpncpy_~#dst#1.offset|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_cstpncpy_~#dst#1.base|) |ULTIMATE.start_cstpncpy_~#dst#1.offset|)) 1))} is VALID [2022-02-20 23:40:46,853 INFO L290 TraceCheckUtils]: 11: Hoare triple {3431#(or (= |ULTIMATE.start_cstpncpy_~src#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_cstpncpy_~#dst#1.base|) |ULTIMATE.start_cstpncpy_~#dst#1.offset|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_cstpncpy_~#dst#1.base|) |ULTIMATE.start_cstpncpy_~#dst#1.offset|)) 1))} SUMMARY for call cstpncpy_#t~mem2#1.base, cstpncpy_#t~mem2#1.offset := read~$Pointer$(cstpncpy_~#dst#1.base, cstpncpy_~#dst#1.offset, 4); srcloc: L517 {3432#(or (= (select |#valid| |ULTIMATE.start_cstpncpy_#t~mem2#1.base|) 1) (= |ULTIMATE.start_cstpncpy_~src#1.base| |ULTIMATE.start_cstpncpy_#t~mem2#1.base|))} is VALID [2022-02-20 23:40:46,853 INFO L290 TraceCheckUtils]: 12: Hoare triple {3432#(or (= (select |#valid| |ULTIMATE.start_cstpncpy_#t~mem2#1.base|) 1) (= |ULTIMATE.start_cstpncpy_~src#1.base| |ULTIMATE.start_cstpncpy_#t~mem2#1.base|))} cstpncpy_~d~0#1.base, cstpncpy_~d~0#1.offset := cstpncpy_#t~mem2#1.base, cstpncpy_#t~mem2#1.offset;havoc cstpncpy_#t~mem2#1.base, cstpncpy_#t~mem2#1.offset;cstpncpy_~s~0#1.base, cstpncpy_~s~0#1.offset := cstpncpy_~src#1.base, cstpncpy_~src#1.offset; {3433#(or (= (select |#valid| |ULTIMATE.start_cstpncpy_~d~0#1.base|) 1) (= |ULTIMATE.start_cstpncpy_~d~0#1.base| |ULTIMATE.start_cstpncpy_~s~0#1.base|))} is VALID [2022-02-20 23:40:46,853 INFO L290 TraceCheckUtils]: 13: Hoare triple {3433#(or (= (select |#valid| |ULTIMATE.start_cstpncpy_~d~0#1.base|) 1) (= |ULTIMATE.start_cstpncpy_~d~0#1.base| |ULTIMATE.start_cstpncpy_~s~0#1.base|))} SUMMARY for call cstpncpy_#t~mem3#1.base, cstpncpy_#t~mem3#1.offset := read~$Pointer$(cstpncpy_~#dst#1.base, cstpncpy_~#dst#1.offset, 4); srcloc: L519 {3433#(or (= (select |#valid| |ULTIMATE.start_cstpncpy_~d~0#1.base|) 1) (= |ULTIMATE.start_cstpncpy_~d~0#1.base| |ULTIMATE.start_cstpncpy_~s~0#1.base|))} is VALID [2022-02-20 23:40:46,855 INFO L290 TraceCheckUtils]: 14: Hoare triple {3433#(or (= (select |#valid| |ULTIMATE.start_cstpncpy_~d~0#1.base|) 1) (= |ULTIMATE.start_cstpncpy_~d~0#1.base| |ULTIMATE.start_cstpncpy_~s~0#1.base|))} SUMMARY for call write~$Pointer$(cstpncpy_#t~mem3#1.base, cstpncpy_#t~mem3#1.offset + (if cstpncpy_~n#1 % 4294967296 % 4294967296 <= 2147483647 then cstpncpy_~n#1 % 4294967296 % 4294967296 else cstpncpy_~n#1 % 4294967296 % 4294967296 - 4294967296), cstpncpy_~#dst#1.base, cstpncpy_~#dst#1.offset, 4); srcloc: L519-1 {3433#(or (= (select |#valid| |ULTIMATE.start_cstpncpy_~d~0#1.base|) 1) (= |ULTIMATE.start_cstpncpy_~d~0#1.base| |ULTIMATE.start_cstpncpy_~s~0#1.base|))} is VALID [2022-02-20 23:40:46,855 INFO L290 TraceCheckUtils]: 15: Hoare triple {3433#(or (= (select |#valid| |ULTIMATE.start_cstpncpy_~d~0#1.base|) 1) (= |ULTIMATE.start_cstpncpy_~d~0#1.base| |ULTIMATE.start_cstpncpy_~s~0#1.base|))} havoc cstpncpy_#t~mem3#1.base, cstpncpy_#t~mem3#1.offset; {3433#(or (= (select |#valid| |ULTIMATE.start_cstpncpy_~d~0#1.base|) 1) (= |ULTIMATE.start_cstpncpy_~d~0#1.base| |ULTIMATE.start_cstpncpy_~s~0#1.base|))} is VALID [2022-02-20 23:40:46,862 INFO L290 TraceCheckUtils]: 16: Hoare triple {3433#(or (= (select |#valid| |ULTIMATE.start_cstpncpy_~d~0#1.base|) 1) (= |ULTIMATE.start_cstpncpy_~d~0#1.base| |ULTIMATE.start_cstpncpy_~s~0#1.base|))} cstpncpy_#t~post5#1.base, cstpncpy_#t~post5#1.offset := cstpncpy_~d~0#1.base, cstpncpy_~d~0#1.offset;cstpncpy_~d~0#1.base, cstpncpy_~d~0#1.offset := cstpncpy_#t~post5#1.base, 1 + cstpncpy_#t~post5#1.offset;cstpncpy_#t~post6#1.base, cstpncpy_#t~post6#1.offset := cstpncpy_~s~0#1.base, cstpncpy_~s~0#1.offset;cstpncpy_~s~0#1.base, cstpncpy_~s~0#1.offset := cstpncpy_#t~post6#1.base, 1 + cstpncpy_#t~post6#1.offset; {3434#(or (= |ULTIMATE.start_cstpncpy_#t~post6#1.base| |ULTIMATE.start_cstpncpy_#t~post5#1.base|) (= 1 (select |#valid| |ULTIMATE.start_cstpncpy_#t~post5#1.base|)))} is VALID [2022-02-20 23:40:46,862 INFO L290 TraceCheckUtils]: 17: Hoare triple {3434#(or (= |ULTIMATE.start_cstpncpy_#t~post6#1.base| |ULTIMATE.start_cstpncpy_#t~post5#1.base|) (= 1 (select |#valid| |ULTIMATE.start_cstpncpy_#t~post5#1.base|)))} SUMMARY for call cstpncpy_#t~mem7#1 := read~int(cstpncpy_#t~post6#1.base, cstpncpy_#t~post6#1.offset, 1); srcloc: L521 {3435#(= 1 (select |#valid| |ULTIMATE.start_cstpncpy_#t~post5#1.base|))} is VALID [2022-02-20 23:40:46,863 INFO L290 TraceCheckUtils]: 18: Hoare triple {3435#(= 1 (select |#valid| |ULTIMATE.start_cstpncpy_#t~post5#1.base|))} assume !(1 == #valid[cstpncpy_#t~post5#1.base]); {3425#false} is VALID [2022-02-20 23:40:46,863 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:40:46,863 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:40:46,863 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123138371] [2022-02-20 23:40:46,863 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123138371] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:40:46,863 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:40:46,863 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-02-20 23:40:46,863 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659367253] [2022-02-20 23:40:46,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:40:46,863 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 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 19 [2022-02-20 23:40:46,864 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:40:46,864 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 12 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 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:40:46,876 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:40:46,877 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-02-20 23:40:46,877 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:40:46,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-20 23:40:46,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2022-02-20 23:40:46,877 INFO L87 Difference]: Start difference. First operand 46 states and 53 transitions. Second operand has 12 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 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:40:47,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:40:47,749 INFO L93 Difference]: Finished difference Result 85 states and 94 transitions. [2022-02-20 23:40:47,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-02-20 23:40:47,749 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 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 19 [2022-02-20 23:40:47,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:40:47,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 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:40:47,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 84 transitions. [2022-02-20 23:40:47,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 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:40:47,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 84 transitions. [2022-02-20 23:40:47,751 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states and 84 transitions. [2022-02-20 23:40:47,826 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:40:47,827 INFO L225 Difference]: With dead ends: 85 [2022-02-20 23:40:47,827 INFO L226 Difference]: Without dead ends: 85 [2022-02-20 23:40:47,827 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=230, Invalid=640, Unknown=0, NotChecked=0, Total=870 [2022-02-20 23:40:47,828 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 244 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:40:47,828 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [244 Valid, 157 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:40:47,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-02-20 23:40:47,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 45. [2022-02-20 23:40:47,829 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:40:47,829 INFO L82 GeneralOperation]: Start isEquivalent. First operand 85 states. Second operand has 45 states, 40 states have (on average 1.275) 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:40:47,829 INFO L74 IsIncluded]: Start isIncluded. First operand 85 states. Second operand has 45 states, 40 states have (on average 1.275) 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:40:47,829 INFO L87 Difference]: Start difference. First operand 85 states. Second operand has 45 states, 40 states have (on average 1.275) 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:40:47,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:40:47,830 INFO L93 Difference]: Finished difference Result 85 states and 94 transitions. [2022-02-20 23:40:47,830 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 94 transitions. [2022-02-20 23:40:47,830 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:40:47,830 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:40:47,830 INFO L74 IsIncluded]: Start isIncluded. First operand has 45 states, 40 states have (on average 1.275) 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 85 states. [2022-02-20 23:40:47,830 INFO L87 Difference]: Start difference. First operand has 45 states, 40 states have (on average 1.275) 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 85 states. [2022-02-20 23:40:47,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:40:47,841 INFO L93 Difference]: Finished difference Result 85 states and 94 transitions. [2022-02-20 23:40:47,841 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 94 transitions. [2022-02-20 23:40:47,841 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:40:47,841 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:40:47,841 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:40:47,841 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:40:47,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 40 states have (on average 1.275) 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:40:47,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 51 transitions. [2022-02-20 23:40:47,842 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 51 transitions. Word has length 19 [2022-02-20 23:40:47,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:40:47,842 INFO L470 AbstractCegarLoop]: Abstraction has 45 states and 51 transitions. [2022-02-20 23:40:47,843 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 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:40:47,843 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2022-02-20 23:40:47,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-02-20 23:40:47,843 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:40:47,843 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:40:47,843 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-02-20 23:40:47,844 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2022-02-20 23:40:47,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:40:47,844 INFO L85 PathProgramCache]: Analyzing trace with hash 1682807689, now seen corresponding path program 1 times [2022-02-20 23:40:47,844 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:40:47,844 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844741639] [2022-02-20 23:40:47,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:40:47,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:40:47,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:40:47,897 INFO L290 TraceCheckUtils]: 0: Hoare triple {3774#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {3774#true} is VALID [2022-02-20 23:40:47,898 INFO L290 TraceCheckUtils]: 1: Hoare triple {3774#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~nondet12#1, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_#t~nondet16#1, main_#t~post15#1, main_~i~0#1, main_#t~ret17#1.base, main_#t~ret17#1.offset, main_~length~0#1, main_~n~0#1, main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset, main_~nondetString~0#1.base, main_~nondetString~0#1.offset;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~length~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~n~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; {3774#true} is VALID [2022-02-20 23:40:47,898 INFO L290 TraceCheckUtils]: 2: Hoare triple {3774#true} assume main_~length~0#1 < 1;main_~length~0#1 := 1; {3774#true} is VALID [2022-02-20 23:40:47,898 INFO L290 TraceCheckUtils]: 3: Hoare triple {3774#true} assume main_~n~0#1 < 1;main_~n~0#1 := 1; {3774#true} is VALID [2022-02-20 23:40:47,898 INFO L290 TraceCheckUtils]: 4: Hoare triple {3774#true} call main_#t~malloc13#1.base, main_#t~malloc13#1.offset := #Ultimate.allocOnStack(main_~n~0#1);main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset := main_#t~malloc13#1.base, main_#t~malloc13#1.offset;call main_#t~malloc14#1.base, main_#t~malloc14#1.offset := #Ultimate.allocOnStack(main_~length~0#1);main_~nondetString~0#1.base, main_~nondetString~0#1.offset := main_#t~malloc14#1.base, main_#t~malloc14#1.offset;main_~i~0#1 := 0; {3774#true} is VALID [2022-02-20 23:40:47,898 INFO L290 TraceCheckUtils]: 5: Hoare triple {3774#true} assume !(main_~i~0#1 < main_~length~0#1 - 1); {3774#true} is VALID [2022-02-20 23:40:47,898 INFO L290 TraceCheckUtils]: 6: Hoare triple {3774#true} SUMMARY for call write~int(0, main_~nondetString~0#1.base, main_~nondetString~0#1.offset + (main_~length~0#1 - 1), 1); srcloc: L543-4 {3774#true} is VALID [2022-02-20 23:40:47,898 INFO L290 TraceCheckUtils]: 7: Hoare triple {3774#true} assume { :begin_inline_cstpncpy } true;cstpncpy_#in~dst#1.base, cstpncpy_#in~dst#1.offset, cstpncpy_#in~src#1.base, cstpncpy_#in~src#1.offset, cstpncpy_#in~n#1 := main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset, main_~nondetString~0#1.base, main_~nondetString~0#1.offset, main_~n~0#1;havoc cstpncpy_#res#1.base, cstpncpy_#res#1.offset;havoc cstpncpy_#t~mem2#1.base, cstpncpy_#t~mem2#1.offset, cstpncpy_#t~mem3#1.base, cstpncpy_#t~mem3#1.offset, cstpncpy_#t~post5#1.base, cstpncpy_#t~post5#1.offset, cstpncpy_#t~post6#1.base, cstpncpy_#t~post6#1.offset, cstpncpy_#t~mem7#1, cstpncpy_#t~post9#1.base, cstpncpy_#t~post9#1.offset, cstpncpy_#t~pre8#1, cstpncpy_#t~pre4#1, cstpncpy_~d~0#1.base, cstpncpy_~d~0#1.offset, cstpncpy_~s~0#1.base, cstpncpy_~s~0#1.offset, cstpncpy_#t~mem10#1.base, cstpncpy_#t~mem10#1.offset, cstpncpy_~#dst#1.base, cstpncpy_~#dst#1.offset, cstpncpy_~src#1.base, cstpncpy_~src#1.offset, cstpncpy_~n#1;call cstpncpy_~#dst#1.base, cstpncpy_~#dst#1.offset := #Ultimate.allocOnStack(4); {3774#true} is VALID [2022-02-20 23:40:47,899 INFO L290 TraceCheckUtils]: 8: Hoare triple {3774#true} SUMMARY for call write~$Pointer$(cstpncpy_#in~dst#1.base, cstpncpy_#in~dst#1.offset, cstpncpy_~#dst#1.base, cstpncpy_~#dst#1.offset, 4); srcloc: L513 {3774#true} is VALID [2022-02-20 23:40:47,899 INFO L290 TraceCheckUtils]: 9: Hoare triple {3774#true} cstpncpy_~src#1.base, cstpncpy_~src#1.offset := cstpncpy_#in~src#1.base, cstpncpy_#in~src#1.offset;cstpncpy_~n#1 := cstpncpy_#in~n#1; {3774#true} is VALID [2022-02-20 23:40:47,899 INFO L290 TraceCheckUtils]: 10: Hoare triple {3774#true} assume 0 != cstpncpy_~n#1 % 4294967296; {3774#true} is VALID [2022-02-20 23:40:47,899 INFO L290 TraceCheckUtils]: 11: Hoare triple {3774#true} SUMMARY for call cstpncpy_#t~mem2#1.base, cstpncpy_#t~mem2#1.offset := read~$Pointer$(cstpncpy_~#dst#1.base, cstpncpy_~#dst#1.offset, 4); srcloc: L517 {3774#true} is VALID [2022-02-20 23:40:47,899 INFO L290 TraceCheckUtils]: 12: Hoare triple {3774#true} cstpncpy_~d~0#1.base, cstpncpy_~d~0#1.offset := cstpncpy_#t~mem2#1.base, cstpncpy_#t~mem2#1.offset;havoc cstpncpy_#t~mem2#1.base, cstpncpy_#t~mem2#1.offset;cstpncpy_~s~0#1.base, cstpncpy_~s~0#1.offset := cstpncpy_~src#1.base, cstpncpy_~src#1.offset; {3774#true} is VALID [2022-02-20 23:40:47,899 INFO L290 TraceCheckUtils]: 13: Hoare triple {3774#true} SUMMARY for call cstpncpy_#t~mem3#1.base, cstpncpy_#t~mem3#1.offset := read~$Pointer$(cstpncpy_~#dst#1.base, cstpncpy_~#dst#1.offset, 4); srcloc: L519 {3774#true} is VALID [2022-02-20 23:40:47,899 INFO L290 TraceCheckUtils]: 14: Hoare triple {3774#true} SUMMARY for call write~$Pointer$(cstpncpy_#t~mem3#1.base, cstpncpy_#t~mem3#1.offset + (if cstpncpy_~n#1 % 4294967296 % 4294967296 <= 2147483647 then cstpncpy_~n#1 % 4294967296 % 4294967296 else cstpncpy_~n#1 % 4294967296 % 4294967296 - 4294967296), cstpncpy_~#dst#1.base, cstpncpy_~#dst#1.offset, 4); srcloc: L519-1 {3774#true} is VALID [2022-02-20 23:40:47,899 INFO L290 TraceCheckUtils]: 15: Hoare triple {3774#true} havoc cstpncpy_#t~mem3#1.base, cstpncpy_#t~mem3#1.offset; {3774#true} is VALID [2022-02-20 23:40:47,900 INFO L290 TraceCheckUtils]: 16: Hoare triple {3774#true} cstpncpy_#t~post5#1.base, cstpncpy_#t~post5#1.offset := cstpncpy_~d~0#1.base, cstpncpy_~d~0#1.offset;cstpncpy_~d~0#1.base, cstpncpy_~d~0#1.offset := cstpncpy_#t~post5#1.base, 1 + cstpncpy_#t~post5#1.offset;cstpncpy_#t~post6#1.base, cstpncpy_#t~post6#1.offset := cstpncpy_~s~0#1.base, cstpncpy_~s~0#1.offset;cstpncpy_~s~0#1.base, cstpncpy_~s~0#1.offset := cstpncpy_#t~post6#1.base, 1 + cstpncpy_#t~post6#1.offset; {3776#(= |ULTIMATE.start_cstpncpy_~d~0#1.base| |ULTIMATE.start_cstpncpy_#t~post5#1.base|)} is VALID [2022-02-20 23:40:47,900 INFO L290 TraceCheckUtils]: 17: Hoare triple {3776#(= |ULTIMATE.start_cstpncpy_~d~0#1.base| |ULTIMATE.start_cstpncpy_#t~post5#1.base|)} SUMMARY for call cstpncpy_#t~mem7#1 := read~int(cstpncpy_#t~post6#1.base, cstpncpy_#t~post6#1.offset, 1); srcloc: L521 {3776#(= |ULTIMATE.start_cstpncpy_~d~0#1.base| |ULTIMATE.start_cstpncpy_#t~post5#1.base|)} is VALID [2022-02-20 23:40:47,901 INFO L290 TraceCheckUtils]: 18: Hoare triple {3776#(= |ULTIMATE.start_cstpncpy_~d~0#1.base| |ULTIMATE.start_cstpncpy_#t~post5#1.base|)} SUMMARY for call write~int(cstpncpy_#t~mem7#1, cstpncpy_#t~post5#1.base, cstpncpy_#t~post5#1.offset, 1); srcloc: L521-1 {3777#(= (select |#valid| |ULTIMATE.start_cstpncpy_~d~0#1.base|) 1)} is VALID [2022-02-20 23:40:47,901 INFO L290 TraceCheckUtils]: 19: Hoare triple {3777#(= (select |#valid| |ULTIMATE.start_cstpncpy_~d~0#1.base|) 1)} assume 0 == cstpncpy_#t~mem7#1;havoc cstpncpy_#t~post5#1.base, cstpncpy_#t~post5#1.offset;havoc cstpncpy_#t~post6#1.base, cstpncpy_#t~post6#1.offset;havoc cstpncpy_#t~mem7#1; {3777#(= (select |#valid| |ULTIMATE.start_cstpncpy_~d~0#1.base|) 1)} is VALID [2022-02-20 23:40:47,901 INFO L290 TraceCheckUtils]: 20: Hoare triple {3777#(= (select |#valid| |ULTIMATE.start_cstpncpy_~d~0#1.base|) 1)} SUMMARY for call write~$Pointer$(cstpncpy_~d~0#1.base, cstpncpy_~d~0#1.offset - 1, cstpncpy_~#dst#1.base, cstpncpy_~#dst#1.offset, 4); srcloc: L522 {3777#(= (select |#valid| |ULTIMATE.start_cstpncpy_~d~0#1.base|) 1)} is VALID [2022-02-20 23:40:47,904 INFO L290 TraceCheckUtils]: 21: Hoare triple {3777#(= (select |#valid| |ULTIMATE.start_cstpncpy_~d~0#1.base|) 1)} cstpncpy_#t~pre8#1 := cstpncpy_~n#1 - 1;cstpncpy_~n#1 := cstpncpy_~n#1 - 1; {3777#(= (select |#valid| |ULTIMATE.start_cstpncpy_~d~0#1.base|) 1)} is VALID [2022-02-20 23:40:47,905 INFO L290 TraceCheckUtils]: 22: Hoare triple {3777#(= (select |#valid| |ULTIMATE.start_cstpncpy_~d~0#1.base|) 1)} assume !!(0 != cstpncpy_#t~pre8#1 % 4294967296);havoc cstpncpy_#t~pre8#1;cstpncpy_#t~post9#1.base, cstpncpy_#t~post9#1.offset := cstpncpy_~d~0#1.base, cstpncpy_~d~0#1.offset;cstpncpy_~d~0#1.base, cstpncpy_~d~0#1.offset := cstpncpy_#t~post9#1.base, 1 + cstpncpy_#t~post9#1.offset; {3778#(= (select |#valid| |ULTIMATE.start_cstpncpy_#t~post9#1.base|) 1)} is VALID [2022-02-20 23:40:47,905 INFO L290 TraceCheckUtils]: 23: Hoare triple {3778#(= (select |#valid| |ULTIMATE.start_cstpncpy_#t~post9#1.base|) 1)} assume !(1 == #valid[cstpncpy_#t~post9#1.base]); {3775#false} is VALID [2022-02-20 23:40:47,905 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:40:47,906 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:40:47,906 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844741639] [2022-02-20 23:40:47,906 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844741639] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:40:47,906 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:40:47,906 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:40:47,906 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596293383] [2022-02-20 23:40:47,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:40:47,907 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2022-02-20 23:40:47,907 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:40:47,907 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 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:40:47,920 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:40:47,921 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:40:47,921 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:40:47,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:40:47,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:40:47,922 INFO L87 Difference]: Start difference. First operand 45 states and 51 transitions. Second operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 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:40:48,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:40:48,037 INFO L93 Difference]: Finished difference Result 44 states and 50 transitions. [2022-02-20 23:40:48,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 23:40:48,037 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2022-02-20 23:40:48,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:40:48,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 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:40:48,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 47 transitions. [2022-02-20 23:40:48,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 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:40:48,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 47 transitions. [2022-02-20 23:40:48,038 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 47 transitions. [2022-02-20 23:40:48,068 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:40:48,068 INFO L225 Difference]: With dead ends: 44 [2022-02-20 23:40:48,068 INFO L226 Difference]: Without dead ends: 44 [2022-02-20 23:40:48,068 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:40:48,069 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 17 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:40:48,069 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 95 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:40:48,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-02-20 23:40:48,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2022-02-20 23:40:48,070 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:40:48,070 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand has 44 states, 40 states have (on average 1.25) internal successors, (50), 43 states have internal predecessors, (50), 0 states have call successors, (0), 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:40:48,070 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand has 44 states, 40 states have (on average 1.25) internal successors, (50), 43 states have internal predecessors, (50), 0 states have call successors, (0), 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:40:48,070 INFO L87 Difference]: Start difference. First operand 44 states. Second operand has 44 states, 40 states have (on average 1.25) internal successors, (50), 43 states have internal predecessors, (50), 0 states have call successors, (0), 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:40:48,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:40:48,071 INFO L93 Difference]: Finished difference Result 44 states and 50 transitions. [2022-02-20 23:40:48,071 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 50 transitions. [2022-02-20 23:40:48,071 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:40:48,071 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:40:48,071 INFO L74 IsIncluded]: Start isIncluded. First operand has 44 states, 40 states have (on average 1.25) internal successors, (50), 43 states have internal predecessors, (50), 0 states have call successors, (0), 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 44 states. [2022-02-20 23:40:48,072 INFO L87 Difference]: Start difference. First operand has 44 states, 40 states have (on average 1.25) internal successors, (50), 43 states have internal predecessors, (50), 0 states have call successors, (0), 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 44 states. [2022-02-20 23:40:48,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:40:48,073 INFO L93 Difference]: Finished difference Result 44 states and 50 transitions. [2022-02-20 23:40:48,073 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 50 transitions. [2022-02-20 23:40:48,073 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:40:48,073 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:40:48,073 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:40:48,073 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:40:48,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 40 states have (on average 1.25) internal successors, (50), 43 states have internal predecessors, (50), 0 states have call successors, (0), 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:40:48,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 50 transitions. [2022-02-20 23:40:48,073 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 50 transitions. Word has length 24 [2022-02-20 23:40:48,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:40:48,074 INFO L470 AbstractCegarLoop]: Abstraction has 44 states and 50 transitions. [2022-02-20 23:40:48,074 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 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:40:48,074 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 50 transitions. [2022-02-20 23:40:48,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-02-20 23:40:48,074 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:40:48,074 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:40:48,074 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-02-20 23:40:48,075 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2022-02-20 23:40:48,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:40:48,075 INFO L85 PathProgramCache]: Analyzing trace with hash 1682807690, now seen corresponding path program 1 times [2022-02-20 23:40:48,075 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:40:48,075 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830793651] [2022-02-20 23:40:48,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:40:48,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:40:48,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:40:48,206 INFO L290 TraceCheckUtils]: 0: Hoare triple {3961#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {3961#true} is VALID [2022-02-20 23:40:48,207 INFO L290 TraceCheckUtils]: 1: Hoare triple {3961#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~nondet12#1, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_#t~nondet16#1, main_#t~post15#1, main_~i~0#1, main_#t~ret17#1.base, main_#t~ret17#1.offset, main_~length~0#1, main_~n~0#1, main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset, main_~nondetString~0#1.base, main_~nondetString~0#1.offset;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~length~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~n~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; {3961#true} is VALID [2022-02-20 23:40:48,207 INFO L290 TraceCheckUtils]: 2: Hoare triple {3961#true} assume main_~length~0#1 < 1;main_~length~0#1 := 1; {3961#true} is VALID [2022-02-20 23:40:48,207 INFO L290 TraceCheckUtils]: 3: Hoare triple {3961#true} assume main_~n~0#1 < 1;main_~n~0#1 := 1; {3963#(and (<= 1 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~n~0#1| 1))} is VALID [2022-02-20 23:40:48,208 INFO L290 TraceCheckUtils]: 4: Hoare triple {3963#(and (<= 1 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~n~0#1| 1))} call main_#t~malloc13#1.base, main_#t~malloc13#1.offset := #Ultimate.allocOnStack(main_~n~0#1);main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset := main_#t~malloc13#1.base, main_#t~malloc13#1.offset;call main_#t~malloc14#1.base, main_#t~malloc14#1.offset := #Ultimate.allocOnStack(main_~length~0#1);main_~nondetString~0#1.base, main_~nondetString~0#1.offset := main_#t~malloc14#1.base, main_#t~malloc14#1.offset;main_~i~0#1 := 0; {3963#(and (<= 1 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~n~0#1| 1))} is VALID [2022-02-20 23:40:48,208 INFO L290 TraceCheckUtils]: 5: Hoare triple {3963#(and (<= 1 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~n~0#1| 1))} assume !(main_~i~0#1 < main_~length~0#1 - 1); {3963#(and (<= 1 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~n~0#1| 1))} is VALID [2022-02-20 23:40:48,208 INFO L290 TraceCheckUtils]: 6: Hoare triple {3963#(and (<= 1 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~n~0#1| 1))} SUMMARY for call write~int(0, main_~nondetString~0#1.base, main_~nondetString~0#1.offset + (main_~length~0#1 - 1), 1); srcloc: L543-4 {3963#(and (<= 1 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~n~0#1| 1))} is VALID [2022-02-20 23:40:48,209 INFO L290 TraceCheckUtils]: 7: Hoare triple {3963#(and (<= 1 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~n~0#1| 1))} assume { :begin_inline_cstpncpy } true;cstpncpy_#in~dst#1.base, cstpncpy_#in~dst#1.offset, cstpncpy_#in~src#1.base, cstpncpy_#in~src#1.offset, cstpncpy_#in~n#1 := main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset, main_~nondetString~0#1.base, main_~nondetString~0#1.offset, main_~n~0#1;havoc cstpncpy_#res#1.base, cstpncpy_#res#1.offset;havoc cstpncpy_#t~mem2#1.base, cstpncpy_#t~mem2#1.offset, cstpncpy_#t~mem3#1.base, cstpncpy_#t~mem3#1.offset, cstpncpy_#t~post5#1.base, cstpncpy_#t~post5#1.offset, cstpncpy_#t~post6#1.base, cstpncpy_#t~post6#1.offset, cstpncpy_#t~mem7#1, cstpncpy_#t~post9#1.base, cstpncpy_#t~post9#1.offset, cstpncpy_#t~pre8#1, cstpncpy_#t~pre4#1, cstpncpy_~d~0#1.base, cstpncpy_~d~0#1.offset, cstpncpy_~s~0#1.base, cstpncpy_~s~0#1.offset, cstpncpy_#t~mem10#1.base, cstpncpy_#t~mem10#1.offset, cstpncpy_~#dst#1.base, cstpncpy_~#dst#1.offset, cstpncpy_~src#1.base, cstpncpy_~src#1.offset, cstpncpy_~n#1;call cstpncpy_~#dst#1.base, cstpncpy_~#dst#1.offset := #Ultimate.allocOnStack(4); {3964#(and (<= |ULTIMATE.start_cstpncpy_#in~n#1| 1) (<= 1 |ULTIMATE.start_cstpncpy_#in~n#1|))} is VALID [2022-02-20 23:40:48,209 INFO L290 TraceCheckUtils]: 8: Hoare triple {3964#(and (<= |ULTIMATE.start_cstpncpy_#in~n#1| 1) (<= 1 |ULTIMATE.start_cstpncpy_#in~n#1|))} SUMMARY for call write~$Pointer$(cstpncpy_#in~dst#1.base, cstpncpy_#in~dst#1.offset, cstpncpy_~#dst#1.base, cstpncpy_~#dst#1.offset, 4); srcloc: L513 {3964#(and (<= |ULTIMATE.start_cstpncpy_#in~n#1| 1) (<= 1 |ULTIMATE.start_cstpncpy_#in~n#1|))} is VALID [2022-02-20 23:40:48,210 INFO L290 TraceCheckUtils]: 9: Hoare triple {3964#(and (<= |ULTIMATE.start_cstpncpy_#in~n#1| 1) (<= 1 |ULTIMATE.start_cstpncpy_#in~n#1|))} cstpncpy_~src#1.base, cstpncpy_~src#1.offset := cstpncpy_#in~src#1.base, cstpncpy_#in~src#1.offset;cstpncpy_~n#1 := cstpncpy_#in~n#1; {3965#(and (<= |ULTIMATE.start_cstpncpy_~n#1| 1) (<= 1 |ULTIMATE.start_cstpncpy_~n#1|))} is VALID [2022-02-20 23:40:48,210 INFO L290 TraceCheckUtils]: 10: Hoare triple {3965#(and (<= |ULTIMATE.start_cstpncpy_~n#1| 1) (<= 1 |ULTIMATE.start_cstpncpy_~n#1|))} assume 0 != cstpncpy_~n#1 % 4294967296; {3965#(and (<= |ULTIMATE.start_cstpncpy_~n#1| 1) (<= 1 |ULTIMATE.start_cstpncpy_~n#1|))} is VALID [2022-02-20 23:40:48,211 INFO L290 TraceCheckUtils]: 11: Hoare triple {3965#(and (<= |ULTIMATE.start_cstpncpy_~n#1| 1) (<= 1 |ULTIMATE.start_cstpncpy_~n#1|))} SUMMARY for call cstpncpy_#t~mem2#1.base, cstpncpy_#t~mem2#1.offset := read~$Pointer$(cstpncpy_~#dst#1.base, cstpncpy_~#dst#1.offset, 4); srcloc: L517 {3965#(and (<= |ULTIMATE.start_cstpncpy_~n#1| 1) (<= 1 |ULTIMATE.start_cstpncpy_~n#1|))} is VALID [2022-02-20 23:40:48,211 INFO L290 TraceCheckUtils]: 12: Hoare triple {3965#(and (<= |ULTIMATE.start_cstpncpy_~n#1| 1) (<= 1 |ULTIMATE.start_cstpncpy_~n#1|))} cstpncpy_~d~0#1.base, cstpncpy_~d~0#1.offset := cstpncpy_#t~mem2#1.base, cstpncpy_#t~mem2#1.offset;havoc cstpncpy_#t~mem2#1.base, cstpncpy_#t~mem2#1.offset;cstpncpy_~s~0#1.base, cstpncpy_~s~0#1.offset := cstpncpy_~src#1.base, cstpncpy_~src#1.offset; {3965#(and (<= |ULTIMATE.start_cstpncpy_~n#1| 1) (<= 1 |ULTIMATE.start_cstpncpy_~n#1|))} is VALID [2022-02-20 23:40:48,211 INFO L290 TraceCheckUtils]: 13: Hoare triple {3965#(and (<= |ULTIMATE.start_cstpncpy_~n#1| 1) (<= 1 |ULTIMATE.start_cstpncpy_~n#1|))} SUMMARY for call cstpncpy_#t~mem3#1.base, cstpncpy_#t~mem3#1.offset := read~$Pointer$(cstpncpy_~#dst#1.base, cstpncpy_~#dst#1.offset, 4); srcloc: L519 {3965#(and (<= |ULTIMATE.start_cstpncpy_~n#1| 1) (<= 1 |ULTIMATE.start_cstpncpy_~n#1|))} is VALID [2022-02-20 23:40:48,212 INFO L290 TraceCheckUtils]: 14: Hoare triple {3965#(and (<= |ULTIMATE.start_cstpncpy_~n#1| 1) (<= 1 |ULTIMATE.start_cstpncpy_~n#1|))} SUMMARY for call write~$Pointer$(cstpncpy_#t~mem3#1.base, cstpncpy_#t~mem3#1.offset + (if cstpncpy_~n#1 % 4294967296 % 4294967296 <= 2147483647 then cstpncpy_~n#1 % 4294967296 % 4294967296 else cstpncpy_~n#1 % 4294967296 % 4294967296 - 4294967296), cstpncpy_~#dst#1.base, cstpncpy_~#dst#1.offset, 4); srcloc: L519-1 {3965#(and (<= |ULTIMATE.start_cstpncpy_~n#1| 1) (<= 1 |ULTIMATE.start_cstpncpy_~n#1|))} is VALID [2022-02-20 23:40:48,212 INFO L290 TraceCheckUtils]: 15: Hoare triple {3965#(and (<= |ULTIMATE.start_cstpncpy_~n#1| 1) (<= 1 |ULTIMATE.start_cstpncpy_~n#1|))} havoc cstpncpy_#t~mem3#1.base, cstpncpy_#t~mem3#1.offset; {3965#(and (<= |ULTIMATE.start_cstpncpy_~n#1| 1) (<= 1 |ULTIMATE.start_cstpncpy_~n#1|))} is VALID [2022-02-20 23:40:48,213 INFO L290 TraceCheckUtils]: 16: Hoare triple {3965#(and (<= |ULTIMATE.start_cstpncpy_~n#1| 1) (<= 1 |ULTIMATE.start_cstpncpy_~n#1|))} cstpncpy_#t~post5#1.base, cstpncpy_#t~post5#1.offset := cstpncpy_~d~0#1.base, cstpncpy_~d~0#1.offset;cstpncpy_~d~0#1.base, cstpncpy_~d~0#1.offset := cstpncpy_#t~post5#1.base, 1 + cstpncpy_#t~post5#1.offset;cstpncpy_#t~post6#1.base, cstpncpy_#t~post6#1.offset := cstpncpy_~s~0#1.base, cstpncpy_~s~0#1.offset;cstpncpy_~s~0#1.base, cstpncpy_~s~0#1.offset := cstpncpy_#t~post6#1.base, 1 + cstpncpy_#t~post6#1.offset; {3965#(and (<= |ULTIMATE.start_cstpncpy_~n#1| 1) (<= 1 |ULTIMATE.start_cstpncpy_~n#1|))} is VALID [2022-02-20 23:40:48,213 INFO L290 TraceCheckUtils]: 17: Hoare triple {3965#(and (<= |ULTIMATE.start_cstpncpy_~n#1| 1) (<= 1 |ULTIMATE.start_cstpncpy_~n#1|))} SUMMARY for call cstpncpy_#t~mem7#1 := read~int(cstpncpy_#t~post6#1.base, cstpncpy_#t~post6#1.offset, 1); srcloc: L521 {3965#(and (<= |ULTIMATE.start_cstpncpy_~n#1| 1) (<= 1 |ULTIMATE.start_cstpncpy_~n#1|))} is VALID [2022-02-20 23:40:48,213 INFO L290 TraceCheckUtils]: 18: Hoare triple {3965#(and (<= |ULTIMATE.start_cstpncpy_~n#1| 1) (<= 1 |ULTIMATE.start_cstpncpy_~n#1|))} SUMMARY for call write~int(cstpncpy_#t~mem7#1, cstpncpy_#t~post5#1.base, cstpncpy_#t~post5#1.offset, 1); srcloc: L521-1 {3965#(and (<= |ULTIMATE.start_cstpncpy_~n#1| 1) (<= 1 |ULTIMATE.start_cstpncpy_~n#1|))} is VALID [2022-02-20 23:40:48,214 INFO L290 TraceCheckUtils]: 19: Hoare triple {3965#(and (<= |ULTIMATE.start_cstpncpy_~n#1| 1) (<= 1 |ULTIMATE.start_cstpncpy_~n#1|))} assume 0 == cstpncpy_#t~mem7#1;havoc cstpncpy_#t~post5#1.base, cstpncpy_#t~post5#1.offset;havoc cstpncpy_#t~post6#1.base, cstpncpy_#t~post6#1.offset;havoc cstpncpy_#t~mem7#1; {3965#(and (<= |ULTIMATE.start_cstpncpy_~n#1| 1) (<= 1 |ULTIMATE.start_cstpncpy_~n#1|))} is VALID [2022-02-20 23:40:48,214 INFO L290 TraceCheckUtils]: 20: Hoare triple {3965#(and (<= |ULTIMATE.start_cstpncpy_~n#1| 1) (<= 1 |ULTIMATE.start_cstpncpy_~n#1|))} SUMMARY for call write~$Pointer$(cstpncpy_~d~0#1.base, cstpncpy_~d~0#1.offset - 1, cstpncpy_~#dst#1.base, cstpncpy_~#dst#1.offset, 4); srcloc: L522 {3965#(and (<= |ULTIMATE.start_cstpncpy_~n#1| 1) (<= 1 |ULTIMATE.start_cstpncpy_~n#1|))} is VALID [2022-02-20 23:40:48,215 INFO L290 TraceCheckUtils]: 21: Hoare triple {3965#(and (<= |ULTIMATE.start_cstpncpy_~n#1| 1) (<= 1 |ULTIMATE.start_cstpncpy_~n#1|))} cstpncpy_#t~pre8#1 := cstpncpy_~n#1 - 1;cstpncpy_~n#1 := cstpncpy_~n#1 - 1; {3966#(<= |ULTIMATE.start_cstpncpy_#t~pre8#1| (* 4294967296 (div |ULTIMATE.start_cstpncpy_#t~pre8#1| 4294967296)))} is VALID [2022-02-20 23:40:48,215 INFO L290 TraceCheckUtils]: 22: Hoare triple {3966#(<= |ULTIMATE.start_cstpncpy_#t~pre8#1| (* 4294967296 (div |ULTIMATE.start_cstpncpy_#t~pre8#1| 4294967296)))} assume !!(0 != cstpncpy_#t~pre8#1 % 4294967296);havoc cstpncpy_#t~pre8#1;cstpncpy_#t~post9#1.base, cstpncpy_#t~post9#1.offset := cstpncpy_~d~0#1.base, cstpncpy_~d~0#1.offset;cstpncpy_~d~0#1.base, cstpncpy_~d~0#1.offset := cstpncpy_#t~post9#1.base, 1 + cstpncpy_#t~post9#1.offset; {3962#false} is VALID [2022-02-20 23:40:48,216 INFO L290 TraceCheckUtils]: 23: Hoare triple {3962#false} assume !(1 + cstpncpy_#t~post9#1.offset <= #length[cstpncpy_#t~post9#1.base] && 0 <= cstpncpy_#t~post9#1.offset); {3962#false} is VALID [2022-02-20 23:40:48,216 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:40:48,216 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:40:48,216 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830793651] [2022-02-20 23:40:48,216 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830793651] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:40:48,216 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:40:48,216 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 23:40:48,218 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199468641] [2022-02-20 23:40:48,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:40:48,218 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2022-02-20 23:40:48,218 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:40:48,219 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 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:40:48,234 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:40:48,234 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 23:40:48,234 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:40:48,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 23:40:48,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:40:48,235 INFO L87 Difference]: Start difference. First operand 44 states and 50 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 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:40:48,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:40:48,435 INFO L93 Difference]: Finished difference Result 88 states and 98 transitions. [2022-02-20 23:40:48,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 23:40:48,435 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2022-02-20 23:40:48,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:40:48,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 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:40:48,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 90 transitions. [2022-02-20 23:40:48,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 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:40:48,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 90 transitions. [2022-02-20 23:40:48,436 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 90 transitions. [2022-02-20 23:40:48,496 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:40:48,496 INFO L225 Difference]: With dead ends: 88 [2022-02-20 23:40:48,496 INFO L226 Difference]: Without dead ends: 88 [2022-02-20 23:40:48,497 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2022-02-20 23:40:48,497 INFO L933 BasicCegarLoop]: 39 mSDtfsCounter, 75 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:40:48,497 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [75 Valid, 199 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:40:48,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-02-20 23:40:48,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 68. [2022-02-20 23:40:48,498 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:40:48,498 INFO L82 GeneralOperation]: Start isEquivalent. First operand 88 states. Second operand has 68 states, 64 states have (on average 1.1875) internal successors, (76), 67 states have internal predecessors, (76), 0 states have call successors, (0), 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:40:48,499 INFO L74 IsIncluded]: Start isIncluded. First operand 88 states. Second operand has 68 states, 64 states have (on average 1.1875) internal successors, (76), 67 states have internal predecessors, (76), 0 states have call successors, (0), 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:40:48,499 INFO L87 Difference]: Start difference. First operand 88 states. Second operand has 68 states, 64 states have (on average 1.1875) internal successors, (76), 67 states have internal predecessors, (76), 0 states have call successors, (0), 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:40:48,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:40:48,500 INFO L93 Difference]: Finished difference Result 88 states and 98 transitions. [2022-02-20 23:40:48,500 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 98 transitions. [2022-02-20 23:40:48,500 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:40:48,500 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:40:48,500 INFO L74 IsIncluded]: Start isIncluded. First operand has 68 states, 64 states have (on average 1.1875) internal successors, (76), 67 states have internal predecessors, (76), 0 states have call successors, (0), 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 88 states. [2022-02-20 23:40:48,500 INFO L87 Difference]: Start difference. First operand has 68 states, 64 states have (on average 1.1875) internal successors, (76), 67 states have internal predecessors, (76), 0 states have call successors, (0), 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 88 states. [2022-02-20 23:40:48,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:40:48,501 INFO L93 Difference]: Finished difference Result 88 states and 98 transitions. [2022-02-20 23:40:48,501 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 98 transitions. [2022-02-20 23:40:48,501 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:40:48,501 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:40:48,501 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:40:48,501 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:40:48,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 64 states have (on average 1.1875) internal successors, (76), 67 states have internal predecessors, (76), 0 states have call successors, (0), 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:40:48,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 76 transitions. [2022-02-20 23:40:48,502 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 76 transitions. Word has length 24 [2022-02-20 23:40:48,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:40:48,502 INFO L470 AbstractCegarLoop]: Abstraction has 68 states and 76 transitions. [2022-02-20 23:40:48,502 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 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:40:48,502 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 76 transitions. [2022-02-20 23:40:48,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-02-20 23:40:48,502 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:40:48,502 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:40:48,503 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-02-20 23:40:48,503 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2022-02-20 23:40:48,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:40:48,503 INFO L85 PathProgramCache]: Analyzing trace with hash 1703829822, now seen corresponding path program 1 times [2022-02-20 23:40:48,503 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:40:48,503 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483866606] [2022-02-20 23:40:48,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:40:48,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:40:48,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:40:48,573 INFO L290 TraceCheckUtils]: 0: Hoare triple {4307#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {4307#true} is VALID [2022-02-20 23:40:48,574 INFO L290 TraceCheckUtils]: 1: Hoare triple {4307#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~nondet12#1, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_#t~nondet16#1, main_#t~post15#1, main_~i~0#1, main_#t~ret17#1.base, main_#t~ret17#1.offset, main_~length~0#1, main_~n~0#1, main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset, main_~nondetString~0#1.base, main_~nondetString~0#1.offset;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~length~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~n~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; {4307#true} is VALID [2022-02-20 23:40:48,574 INFO L290 TraceCheckUtils]: 2: Hoare triple {4307#true} assume main_~length~0#1 < 1;main_~length~0#1 := 1; {4307#true} is VALID [2022-02-20 23:40:48,574 INFO L290 TraceCheckUtils]: 3: Hoare triple {4307#true} assume main_~n~0#1 < 1;main_~n~0#1 := 1; {4309#(and (<= 1 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~n~0#1| 1))} is VALID [2022-02-20 23:40:48,575 INFO L290 TraceCheckUtils]: 4: Hoare triple {4309#(and (<= 1 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~n~0#1| 1))} call main_#t~malloc13#1.base, main_#t~malloc13#1.offset := #Ultimate.allocOnStack(main_~n~0#1);main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset := main_#t~malloc13#1.base, main_#t~malloc13#1.offset;call main_#t~malloc14#1.base, main_#t~malloc14#1.offset := #Ultimate.allocOnStack(main_~length~0#1);main_~nondetString~0#1.base, main_~nondetString~0#1.offset := main_#t~malloc14#1.base, main_#t~malloc14#1.offset;main_~i~0#1 := 0; {4309#(and (<= 1 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~n~0#1| 1))} is VALID [2022-02-20 23:40:48,575 INFO L290 TraceCheckUtils]: 5: Hoare triple {4309#(and (<= 1 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~n~0#1| 1))} assume !(main_~i~0#1 < main_~length~0#1 - 1); {4309#(and (<= 1 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~n~0#1| 1))} is VALID [2022-02-20 23:40:48,576 INFO L290 TraceCheckUtils]: 6: Hoare triple {4309#(and (<= 1 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~n~0#1| 1))} SUMMARY for call write~int(0, main_~nondetString~0#1.base, main_~nondetString~0#1.offset + (main_~length~0#1 - 1), 1); srcloc: L543-4 {4309#(and (<= 1 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~n~0#1| 1))} is VALID [2022-02-20 23:40:48,576 INFO L290 TraceCheckUtils]: 7: Hoare triple {4309#(and (<= 1 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~n~0#1| 1))} assume { :begin_inline_cstpncpy } true;cstpncpy_#in~dst#1.base, cstpncpy_#in~dst#1.offset, cstpncpy_#in~src#1.base, cstpncpy_#in~src#1.offset, cstpncpy_#in~n#1 := main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset, main_~nondetString~0#1.base, main_~nondetString~0#1.offset, main_~n~0#1;havoc cstpncpy_#res#1.base, cstpncpy_#res#1.offset;havoc cstpncpy_#t~mem2#1.base, cstpncpy_#t~mem2#1.offset, cstpncpy_#t~mem3#1.base, cstpncpy_#t~mem3#1.offset, cstpncpy_#t~post5#1.base, cstpncpy_#t~post5#1.offset, cstpncpy_#t~post6#1.base, cstpncpy_#t~post6#1.offset, cstpncpy_#t~mem7#1, cstpncpy_#t~post9#1.base, cstpncpy_#t~post9#1.offset, cstpncpy_#t~pre8#1, cstpncpy_#t~pre4#1, cstpncpy_~d~0#1.base, cstpncpy_~d~0#1.offset, cstpncpy_~s~0#1.base, cstpncpy_~s~0#1.offset, cstpncpy_#t~mem10#1.base, cstpncpy_#t~mem10#1.offset, cstpncpy_~#dst#1.base, cstpncpy_~#dst#1.offset, cstpncpy_~src#1.base, cstpncpy_~src#1.offset, cstpncpy_~n#1;call cstpncpy_~#dst#1.base, cstpncpy_~#dst#1.offset := #Ultimate.allocOnStack(4); {4310#(and (<= |ULTIMATE.start_cstpncpy_#in~n#1| 1) (<= 1 |ULTIMATE.start_cstpncpy_#in~n#1|))} is VALID [2022-02-20 23:40:48,577 INFO L290 TraceCheckUtils]: 8: Hoare triple {4310#(and (<= |ULTIMATE.start_cstpncpy_#in~n#1| 1) (<= 1 |ULTIMATE.start_cstpncpy_#in~n#1|))} SUMMARY for call write~$Pointer$(cstpncpy_#in~dst#1.base, cstpncpy_#in~dst#1.offset, cstpncpy_~#dst#1.base, cstpncpy_~#dst#1.offset, 4); srcloc: L513 {4310#(and (<= |ULTIMATE.start_cstpncpy_#in~n#1| 1) (<= 1 |ULTIMATE.start_cstpncpy_#in~n#1|))} is VALID [2022-02-20 23:40:48,577 INFO L290 TraceCheckUtils]: 9: Hoare triple {4310#(and (<= |ULTIMATE.start_cstpncpy_#in~n#1| 1) (<= 1 |ULTIMATE.start_cstpncpy_#in~n#1|))} cstpncpy_~src#1.base, cstpncpy_~src#1.offset := cstpncpy_#in~src#1.base, cstpncpy_#in~src#1.offset;cstpncpy_~n#1 := cstpncpy_#in~n#1; {4311#(and (<= |ULTIMATE.start_cstpncpy_~n#1| 1) (<= 1 |ULTIMATE.start_cstpncpy_~n#1|))} is VALID [2022-02-20 23:40:48,577 INFO L290 TraceCheckUtils]: 10: Hoare triple {4311#(and (<= |ULTIMATE.start_cstpncpy_~n#1| 1) (<= 1 |ULTIMATE.start_cstpncpy_~n#1|))} assume 0 != cstpncpy_~n#1 % 4294967296; {4311#(and (<= |ULTIMATE.start_cstpncpy_~n#1| 1) (<= 1 |ULTIMATE.start_cstpncpy_~n#1|))} is VALID [2022-02-20 23:40:48,578 INFO L290 TraceCheckUtils]: 11: Hoare triple {4311#(and (<= |ULTIMATE.start_cstpncpy_~n#1| 1) (<= 1 |ULTIMATE.start_cstpncpy_~n#1|))} SUMMARY for call cstpncpy_#t~mem2#1.base, cstpncpy_#t~mem2#1.offset := read~$Pointer$(cstpncpy_~#dst#1.base, cstpncpy_~#dst#1.offset, 4); srcloc: L517 {4311#(and (<= |ULTIMATE.start_cstpncpy_~n#1| 1) (<= 1 |ULTIMATE.start_cstpncpy_~n#1|))} is VALID [2022-02-20 23:40:48,578 INFO L290 TraceCheckUtils]: 12: Hoare triple {4311#(and (<= |ULTIMATE.start_cstpncpy_~n#1| 1) (<= 1 |ULTIMATE.start_cstpncpy_~n#1|))} cstpncpy_~d~0#1.base, cstpncpy_~d~0#1.offset := cstpncpy_#t~mem2#1.base, cstpncpy_#t~mem2#1.offset;havoc cstpncpy_#t~mem2#1.base, cstpncpy_#t~mem2#1.offset;cstpncpy_~s~0#1.base, cstpncpy_~s~0#1.offset := cstpncpy_~src#1.base, cstpncpy_~src#1.offset; {4311#(and (<= |ULTIMATE.start_cstpncpy_~n#1| 1) (<= 1 |ULTIMATE.start_cstpncpy_~n#1|))} is VALID [2022-02-20 23:40:48,578 INFO L290 TraceCheckUtils]: 13: Hoare triple {4311#(and (<= |ULTIMATE.start_cstpncpy_~n#1| 1) (<= 1 |ULTIMATE.start_cstpncpy_~n#1|))} SUMMARY for call cstpncpy_#t~mem3#1.base, cstpncpy_#t~mem3#1.offset := read~$Pointer$(cstpncpy_~#dst#1.base, cstpncpy_~#dst#1.offset, 4); srcloc: L519 {4311#(and (<= |ULTIMATE.start_cstpncpy_~n#1| 1) (<= 1 |ULTIMATE.start_cstpncpy_~n#1|))} is VALID [2022-02-20 23:40:48,579 INFO L290 TraceCheckUtils]: 14: Hoare triple {4311#(and (<= |ULTIMATE.start_cstpncpy_~n#1| 1) (<= 1 |ULTIMATE.start_cstpncpy_~n#1|))} SUMMARY for call write~$Pointer$(cstpncpy_#t~mem3#1.base, cstpncpy_#t~mem3#1.offset + (if cstpncpy_~n#1 % 4294967296 % 4294967296 <= 2147483647 then cstpncpy_~n#1 % 4294967296 % 4294967296 else cstpncpy_~n#1 % 4294967296 % 4294967296 - 4294967296), cstpncpy_~#dst#1.base, cstpncpy_~#dst#1.offset, 4); srcloc: L519-1 {4311#(and (<= |ULTIMATE.start_cstpncpy_~n#1| 1) (<= 1 |ULTIMATE.start_cstpncpy_~n#1|))} is VALID [2022-02-20 23:40:48,579 INFO L290 TraceCheckUtils]: 15: Hoare triple {4311#(and (<= |ULTIMATE.start_cstpncpy_~n#1| 1) (<= 1 |ULTIMATE.start_cstpncpy_~n#1|))} havoc cstpncpy_#t~mem3#1.base, cstpncpy_#t~mem3#1.offset; {4311#(and (<= |ULTIMATE.start_cstpncpy_~n#1| 1) (<= 1 |ULTIMATE.start_cstpncpy_~n#1|))} is VALID [2022-02-20 23:40:48,580 INFO L290 TraceCheckUtils]: 16: Hoare triple {4311#(and (<= |ULTIMATE.start_cstpncpy_~n#1| 1) (<= 1 |ULTIMATE.start_cstpncpy_~n#1|))} cstpncpy_#t~post5#1.base, cstpncpy_#t~post5#1.offset := cstpncpy_~d~0#1.base, cstpncpy_~d~0#1.offset;cstpncpy_~d~0#1.base, cstpncpy_~d~0#1.offset := cstpncpy_#t~post5#1.base, 1 + cstpncpy_#t~post5#1.offset;cstpncpy_#t~post6#1.base, cstpncpy_#t~post6#1.offset := cstpncpy_~s~0#1.base, cstpncpy_~s~0#1.offset;cstpncpy_~s~0#1.base, cstpncpy_~s~0#1.offset := cstpncpy_#t~post6#1.base, 1 + cstpncpy_#t~post6#1.offset; {4311#(and (<= |ULTIMATE.start_cstpncpy_~n#1| 1) (<= 1 |ULTIMATE.start_cstpncpy_~n#1|))} is VALID [2022-02-20 23:40:48,580 INFO L290 TraceCheckUtils]: 17: Hoare triple {4311#(and (<= |ULTIMATE.start_cstpncpy_~n#1| 1) (<= 1 |ULTIMATE.start_cstpncpy_~n#1|))} SUMMARY for call cstpncpy_#t~mem7#1 := read~int(cstpncpy_#t~post6#1.base, cstpncpy_#t~post6#1.offset, 1); srcloc: L521 {4311#(and (<= |ULTIMATE.start_cstpncpy_~n#1| 1) (<= 1 |ULTIMATE.start_cstpncpy_~n#1|))} is VALID [2022-02-20 23:40:48,581 INFO L290 TraceCheckUtils]: 18: Hoare triple {4311#(and (<= |ULTIMATE.start_cstpncpy_~n#1| 1) (<= 1 |ULTIMATE.start_cstpncpy_~n#1|))} SUMMARY for call write~int(cstpncpy_#t~mem7#1, cstpncpy_#t~post5#1.base, cstpncpy_#t~post5#1.offset, 1); srcloc: L521-1 {4311#(and (<= |ULTIMATE.start_cstpncpy_~n#1| 1) (<= 1 |ULTIMATE.start_cstpncpy_~n#1|))} is VALID [2022-02-20 23:40:48,581 INFO L290 TraceCheckUtils]: 19: Hoare triple {4311#(and (<= |ULTIMATE.start_cstpncpy_~n#1| 1) (<= 1 |ULTIMATE.start_cstpncpy_~n#1|))} assume !(0 == cstpncpy_#t~mem7#1);havoc cstpncpy_#t~post5#1.base, cstpncpy_#t~post5#1.offset;havoc cstpncpy_#t~post6#1.base, cstpncpy_#t~post6#1.offset;havoc cstpncpy_#t~mem7#1; {4311#(and (<= |ULTIMATE.start_cstpncpy_~n#1| 1) (<= 1 |ULTIMATE.start_cstpncpy_~n#1|))} is VALID [2022-02-20 23:40:48,583 INFO L290 TraceCheckUtils]: 20: Hoare triple {4311#(and (<= |ULTIMATE.start_cstpncpy_~n#1| 1) (<= 1 |ULTIMATE.start_cstpncpy_~n#1|))} cstpncpy_#t~pre4#1 := cstpncpy_~n#1 - 1;cstpncpy_~n#1 := cstpncpy_~n#1 - 1; {4312#(and (not (<= (+ (div |ULTIMATE.start_cstpncpy_#t~pre4#1| 4294967296) 1) 0)) (<= |ULTIMATE.start_cstpncpy_#t~pre4#1| (* (div |ULTIMATE.start_cstpncpy_#t~pre4#1| 4294967296) 4294967296)))} is VALID [2022-02-20 23:40:48,584 INFO L290 TraceCheckUtils]: 21: Hoare triple {4312#(and (not (<= (+ (div |ULTIMATE.start_cstpncpy_#t~pre4#1| 4294967296) 1) 0)) (<= |ULTIMATE.start_cstpncpy_#t~pre4#1| (* (div |ULTIMATE.start_cstpncpy_#t~pre4#1| 4294967296) 4294967296)))} assume !!(0 != cstpncpy_#t~pre4#1 % 4294967296);havoc cstpncpy_#t~pre4#1; {4308#false} is VALID [2022-02-20 23:40:48,584 INFO L290 TraceCheckUtils]: 22: Hoare triple {4308#false} cstpncpy_#t~post5#1.base, cstpncpy_#t~post5#1.offset := cstpncpy_~d~0#1.base, cstpncpy_~d~0#1.offset;cstpncpy_~d~0#1.base, cstpncpy_~d~0#1.offset := cstpncpy_#t~post5#1.base, 1 + cstpncpy_#t~post5#1.offset;cstpncpy_#t~post6#1.base, cstpncpy_#t~post6#1.offset := cstpncpy_~s~0#1.base, cstpncpy_~s~0#1.offset;cstpncpy_~s~0#1.base, cstpncpy_~s~0#1.offset := cstpncpy_#t~post6#1.base, 1 + cstpncpy_#t~post6#1.offset; {4308#false} is VALID [2022-02-20 23:40:48,584 INFO L290 TraceCheckUtils]: 23: Hoare triple {4308#false} assume !(1 + cstpncpy_#t~post6#1.offset <= #length[cstpncpy_#t~post6#1.base] && 0 <= cstpncpy_#t~post6#1.offset); {4308#false} is VALID [2022-02-20 23:40:48,585 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:40:48,585 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:40:48,585 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483866606] [2022-02-20 23:40:48,585 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483866606] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:40:48,585 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:40:48,585 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 23:40:48,585 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049279390] [2022-02-20 23:40:48,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:40:48,585 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2022-02-20 23:40:48,585 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:40:48,585 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 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:40:48,601 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:40:48,601 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 23:40:48,601 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:40:48,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 23:40:48,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:40:48,601 INFO L87 Difference]: Start difference. First operand 68 states and 76 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 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:40:48,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:40:48,790 INFO L93 Difference]: Finished difference Result 75 states and 82 transitions. [2022-02-20 23:40:48,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 23:40:48,790 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2022-02-20 23:40:48,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:40:48,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 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:40:48,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 74 transitions. [2022-02-20 23:40:48,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 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:40:48,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 74 transitions. [2022-02-20 23:40:48,791 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 74 transitions. [2022-02-20 23:40:48,843 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:40:48,844 INFO L225 Difference]: With dead ends: 75 [2022-02-20 23:40:48,844 INFO L226 Difference]: Without dead ends: 75 [2022-02-20 23:40:48,844 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2022-02-20 23:40:48,844 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 44 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:40:48,844 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 182 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:40:48,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-02-20 23:40:48,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 70. [2022-02-20 23:40:48,845 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:40:48,846 INFO L82 GeneralOperation]: Start isEquivalent. First operand 75 states. Second operand has 70 states, 66 states have (on average 1.1818181818181819) internal successors, (78), 69 states have internal predecessors, (78), 0 states have call successors, (0), 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:40:48,846 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand has 70 states, 66 states have (on average 1.1818181818181819) internal successors, (78), 69 states have internal predecessors, (78), 0 states have call successors, (0), 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:40:48,846 INFO L87 Difference]: Start difference. First operand 75 states. Second operand has 70 states, 66 states have (on average 1.1818181818181819) internal successors, (78), 69 states have internal predecessors, (78), 0 states have call successors, (0), 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:40:48,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:40:48,847 INFO L93 Difference]: Finished difference Result 75 states and 82 transitions. [2022-02-20 23:40:48,847 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 82 transitions. [2022-02-20 23:40:48,847 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:40:48,847 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:40:48,847 INFO L74 IsIncluded]: Start isIncluded. First operand has 70 states, 66 states have (on average 1.1818181818181819) internal successors, (78), 69 states have internal predecessors, (78), 0 states have call successors, (0), 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 75 states. [2022-02-20 23:40:48,847 INFO L87 Difference]: Start difference. First operand has 70 states, 66 states have (on average 1.1818181818181819) internal successors, (78), 69 states have internal predecessors, (78), 0 states have call successors, (0), 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 75 states. [2022-02-20 23:40:48,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:40:48,848 INFO L93 Difference]: Finished difference Result 75 states and 82 transitions. [2022-02-20 23:40:48,848 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 82 transitions. [2022-02-20 23:40:48,848 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:40:48,848 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:40:48,848 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:40:48,848 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:40:48,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 66 states have (on average 1.1818181818181819) internal successors, (78), 69 states have internal predecessors, (78), 0 states have call successors, (0), 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:40:48,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 78 transitions. [2022-02-20 23:40:48,849 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 78 transitions. Word has length 24 [2022-02-20 23:40:48,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:40:48,849 INFO L470 AbstractCegarLoop]: Abstraction has 70 states and 78 transitions. [2022-02-20 23:40:48,849 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 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:40:48,849 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 78 transitions. [2022-02-20 23:40:48,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-02-20 23:40:48,849 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:40:48,849 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:40:48,849 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-02-20 23:40:48,849 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2022-02-20 23:40:48,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:40:48,850 INFO L85 PathProgramCache]: Analyzing trace with hash 2105509516, now seen corresponding path program 1 times [2022-02-20 23:40:48,850 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:40:48,850 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197002706] [2022-02-20 23:40:48,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:40:48,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:40:48,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:40:49,252 INFO L290 TraceCheckUtils]: 0: Hoare triple {4616#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {4616#true} is VALID [2022-02-20 23:40:49,252 INFO L290 TraceCheckUtils]: 1: Hoare triple {4616#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~nondet12#1, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_#t~nondet16#1, main_#t~post15#1, main_~i~0#1, main_#t~ret17#1.base, main_#t~ret17#1.offset, main_~length~0#1, main_~n~0#1, main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset, main_~nondetString~0#1.base, main_~nondetString~0#1.offset;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~length~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~n~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; {4616#true} is VALID [2022-02-20 23:40:49,252 INFO L290 TraceCheckUtils]: 2: Hoare triple {4616#true} assume main_~length~0#1 < 1;main_~length~0#1 := 1; {4616#true} is VALID [2022-02-20 23:40:49,254 INFO L290 TraceCheckUtils]: 3: Hoare triple {4616#true} assume !(main_~n~0#1 < 1); {4618#(<= 1 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 23:40:49,255 INFO L290 TraceCheckUtils]: 4: Hoare triple {4618#(<= 1 |ULTIMATE.start_main_~n~0#1|)} call main_#t~malloc13#1.base, main_#t~malloc13#1.offset := #Ultimate.allocOnStack(main_~n~0#1);main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset := main_#t~malloc13#1.base, main_#t~malloc13#1.offset;call main_#t~malloc14#1.base, main_#t~malloc14#1.offset := #Ultimate.allocOnStack(main_~length~0#1);main_~nondetString~0#1.base, main_~nondetString~0#1.offset := main_#t~malloc14#1.base, main_#t~malloc14#1.offset;main_~i~0#1 := 0; {4619#(and (= |ULTIMATE.start_main_~n~0#1| (select |#length| |ULTIMATE.start_main_~nondetArea~0#1.base|)) (= |ULTIMATE.start_main_~nondetArea~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~n~0#1|))} is VALID [2022-02-20 23:40:49,255 INFO L290 TraceCheckUtils]: 5: Hoare triple {4619#(and (= |ULTIMATE.start_main_~n~0#1| (select |#length| |ULTIMATE.start_main_~nondetArea~0#1.base|)) (= |ULTIMATE.start_main_~nondetArea~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~n~0#1|))} assume !(main_~i~0#1 < main_~length~0#1 - 1); {4619#(and (= |ULTIMATE.start_main_~n~0#1| (select |#length| |ULTIMATE.start_main_~nondetArea~0#1.base|)) (= |ULTIMATE.start_main_~nondetArea~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~n~0#1|))} is VALID [2022-02-20 23:40:49,256 INFO L290 TraceCheckUtils]: 6: Hoare triple {4619#(and (= |ULTIMATE.start_main_~n~0#1| (select |#length| |ULTIMATE.start_main_~nondetArea~0#1.base|)) (= |ULTIMATE.start_main_~nondetArea~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~n~0#1|))} SUMMARY for call write~int(0, main_~nondetString~0#1.base, main_~nondetString~0#1.offset + (main_~length~0#1 - 1), 1); srcloc: L543-4 {4619#(and (= |ULTIMATE.start_main_~n~0#1| (select |#length| |ULTIMATE.start_main_~nondetArea~0#1.base|)) (= |ULTIMATE.start_main_~nondetArea~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~n~0#1|))} is VALID [2022-02-20 23:40:49,257 INFO L290 TraceCheckUtils]: 7: Hoare triple {4619#(and (= |ULTIMATE.start_main_~n~0#1| (select |#length| |ULTIMATE.start_main_~nondetArea~0#1.base|)) (= |ULTIMATE.start_main_~nondetArea~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~n~0#1|))} assume { :begin_inline_cstpncpy } true;cstpncpy_#in~dst#1.base, cstpncpy_#in~dst#1.offset, cstpncpy_#in~src#1.base, cstpncpy_#in~src#1.offset, cstpncpy_#in~n#1 := main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset, main_~nondetString~0#1.base, main_~nondetString~0#1.offset, main_~n~0#1;havoc cstpncpy_#res#1.base, cstpncpy_#res#1.offset;havoc cstpncpy_#t~mem2#1.base, cstpncpy_#t~mem2#1.offset, cstpncpy_#t~mem3#1.base, cstpncpy_#t~mem3#1.offset, cstpncpy_#t~post5#1.base, cstpncpy_#t~post5#1.offset, cstpncpy_#t~post6#1.base, cstpncpy_#t~post6#1.offset, cstpncpy_#t~mem7#1, cstpncpy_#t~post9#1.base, cstpncpy_#t~post9#1.offset, cstpncpy_#t~pre8#1, cstpncpy_#t~pre4#1, cstpncpy_~d~0#1.base, cstpncpy_~d~0#1.offset, cstpncpy_~s~0#1.base, cstpncpy_~s~0#1.offset, cstpncpy_#t~mem10#1.base, cstpncpy_#t~mem10#1.offset, cstpncpy_~#dst#1.base, cstpncpy_~#dst#1.offset, cstpncpy_~src#1.base, cstpncpy_~src#1.offset, cstpncpy_~n#1;call cstpncpy_~#dst#1.base, cstpncpy_~#dst#1.offset := #Ultimate.allocOnStack(4); {4620#(and (or (and (= (select |#length| |ULTIMATE.start_cstpncpy_~#dst#1.base|) 4) (= |ULTIMATE.start_cstpncpy_~#dst#1.base| |ULTIMATE.start_cstpncpy_#in~dst#1.base|)) (and (<= 1 |ULTIMATE.start_cstpncpy_#in~n#1|) (<= |ULTIMATE.start_cstpncpy_#in~n#1| (select |#length| |ULTIMATE.start_cstpncpy_#in~dst#1.base|)))) (= |ULTIMATE.start_cstpncpy_#in~dst#1.offset| 0))} is VALID [2022-02-20 23:40:49,257 INFO L290 TraceCheckUtils]: 8: Hoare triple {4620#(and (or (and (= (select |#length| |ULTIMATE.start_cstpncpy_~#dst#1.base|) 4) (= |ULTIMATE.start_cstpncpy_~#dst#1.base| |ULTIMATE.start_cstpncpy_#in~dst#1.base|)) (and (<= 1 |ULTIMATE.start_cstpncpy_#in~n#1|) (<= |ULTIMATE.start_cstpncpy_#in~n#1| (select |#length| |ULTIMATE.start_cstpncpy_#in~dst#1.base|)))) (= |ULTIMATE.start_cstpncpy_#in~dst#1.offset| 0))} SUMMARY for call write~$Pointer$(cstpncpy_#in~dst#1.base, cstpncpy_#in~dst#1.offset, cstpncpy_~#dst#1.base, cstpncpy_~#dst#1.offset, 4); srcloc: L513 {4621#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_cstpncpy_~#dst#1.base|) |ULTIMATE.start_cstpncpy_~#dst#1.offset|) 0) (or (and (= |ULTIMATE.start_cstpncpy_~#dst#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_cstpncpy_~#dst#1.base|) |ULTIMATE.start_cstpncpy_~#dst#1.offset|)) (= (select |#length| |ULTIMATE.start_cstpncpy_~#dst#1.base|) 4)) (and (<= |ULTIMATE.start_cstpncpy_#in~n#1| (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_cstpncpy_~#dst#1.base|) |ULTIMATE.start_cstpncpy_~#dst#1.offset|))) (<= 1 |ULTIMATE.start_cstpncpy_#in~n#1|))))} is VALID [2022-02-20 23:40:49,258 INFO L290 TraceCheckUtils]: 9: Hoare triple {4621#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_cstpncpy_~#dst#1.base|) |ULTIMATE.start_cstpncpy_~#dst#1.offset|) 0) (or (and (= |ULTIMATE.start_cstpncpy_~#dst#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_cstpncpy_~#dst#1.base|) |ULTIMATE.start_cstpncpy_~#dst#1.offset|)) (= (select |#length| |ULTIMATE.start_cstpncpy_~#dst#1.base|) 4)) (and (<= |ULTIMATE.start_cstpncpy_#in~n#1| (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_cstpncpy_~#dst#1.base|) |ULTIMATE.start_cstpncpy_~#dst#1.offset|))) (<= 1 |ULTIMATE.start_cstpncpy_#in~n#1|))))} cstpncpy_~src#1.base, cstpncpy_~src#1.offset := cstpncpy_#in~src#1.base, cstpncpy_#in~src#1.offset;cstpncpy_~n#1 := cstpncpy_#in~n#1; {4622#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_cstpncpy_~#dst#1.base|) |ULTIMATE.start_cstpncpy_~#dst#1.offset|) 0) (or (and (<= |ULTIMATE.start_cstpncpy_~n#1| (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_cstpncpy_~#dst#1.base|) |ULTIMATE.start_cstpncpy_~#dst#1.offset|))) (<= 1 |ULTIMATE.start_cstpncpy_~n#1|)) (and (= |ULTIMATE.start_cstpncpy_~#dst#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_cstpncpy_~#dst#1.base|) |ULTIMATE.start_cstpncpy_~#dst#1.offset|)) (= (select |#length| |ULTIMATE.start_cstpncpy_~#dst#1.base|) 4))))} is VALID [2022-02-20 23:40:49,259 INFO L290 TraceCheckUtils]: 10: Hoare triple {4622#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_cstpncpy_~#dst#1.base|) |ULTIMATE.start_cstpncpy_~#dst#1.offset|) 0) (or (and (<= |ULTIMATE.start_cstpncpy_~n#1| (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_cstpncpy_~#dst#1.base|) |ULTIMATE.start_cstpncpy_~#dst#1.offset|))) (<= 1 |ULTIMATE.start_cstpncpy_~n#1|)) (and (= |ULTIMATE.start_cstpncpy_~#dst#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_cstpncpy_~#dst#1.base|) |ULTIMATE.start_cstpncpy_~#dst#1.offset|)) (= (select |#length| |ULTIMATE.start_cstpncpy_~#dst#1.base|) 4))))} assume 0 != cstpncpy_~n#1 % 4294967296; {4622#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_cstpncpy_~#dst#1.base|) |ULTIMATE.start_cstpncpy_~#dst#1.offset|) 0) (or (and (<= |ULTIMATE.start_cstpncpy_~n#1| (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_cstpncpy_~#dst#1.base|) |ULTIMATE.start_cstpncpy_~#dst#1.offset|))) (<= 1 |ULTIMATE.start_cstpncpy_~n#1|)) (and (= |ULTIMATE.start_cstpncpy_~#dst#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_cstpncpy_~#dst#1.base|) |ULTIMATE.start_cstpncpy_~#dst#1.offset|)) (= (select |#length| |ULTIMATE.start_cstpncpy_~#dst#1.base|) 4))))} is VALID [2022-02-20 23:40:49,259 INFO L290 TraceCheckUtils]: 11: Hoare triple {4622#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_cstpncpy_~#dst#1.base|) |ULTIMATE.start_cstpncpy_~#dst#1.offset|) 0) (or (and (<= |ULTIMATE.start_cstpncpy_~n#1| (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_cstpncpy_~#dst#1.base|) |ULTIMATE.start_cstpncpy_~#dst#1.offset|))) (<= 1 |ULTIMATE.start_cstpncpy_~n#1|)) (and (= |ULTIMATE.start_cstpncpy_~#dst#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_cstpncpy_~#dst#1.base|) |ULTIMATE.start_cstpncpy_~#dst#1.offset|)) (= (select |#length| |ULTIMATE.start_cstpncpy_~#dst#1.base|) 4))))} SUMMARY for call cstpncpy_#t~mem2#1.base, cstpncpy_#t~mem2#1.offset := read~$Pointer$(cstpncpy_~#dst#1.base, cstpncpy_~#dst#1.offset, 4); srcloc: L517 {4623#(and (or (and (= (select |#length| |ULTIMATE.start_cstpncpy_~#dst#1.base|) 4) (= |ULTIMATE.start_cstpncpy_~#dst#1.base| |ULTIMATE.start_cstpncpy_#t~mem2#1.base|)) (and (<= 1 |ULTIMATE.start_cstpncpy_~n#1|) (<= |ULTIMATE.start_cstpncpy_~n#1| (select |#length| |ULTIMATE.start_cstpncpy_#t~mem2#1.base|)))) (= |ULTIMATE.start_cstpncpy_#t~mem2#1.offset| 0))} is VALID [2022-02-20 23:40:49,260 INFO L290 TraceCheckUtils]: 12: Hoare triple {4623#(and (or (and (= (select |#length| |ULTIMATE.start_cstpncpy_~#dst#1.base|) 4) (= |ULTIMATE.start_cstpncpy_~#dst#1.base| |ULTIMATE.start_cstpncpy_#t~mem2#1.base|)) (and (<= 1 |ULTIMATE.start_cstpncpy_~n#1|) (<= |ULTIMATE.start_cstpncpy_~n#1| (select |#length| |ULTIMATE.start_cstpncpy_#t~mem2#1.base|)))) (= |ULTIMATE.start_cstpncpy_#t~mem2#1.offset| 0))} cstpncpy_~d~0#1.base, cstpncpy_~d~0#1.offset := cstpncpy_#t~mem2#1.base, cstpncpy_#t~mem2#1.offset;havoc cstpncpy_#t~mem2#1.base, cstpncpy_#t~mem2#1.offset;cstpncpy_~s~0#1.base, cstpncpy_~s~0#1.offset := cstpncpy_~src#1.base, cstpncpy_~src#1.offset; {4624#(and (= |ULTIMATE.start_cstpncpy_~d~0#1.offset| 0) (or (and (<= 1 |ULTIMATE.start_cstpncpy_~n#1|) (<= |ULTIMATE.start_cstpncpy_~n#1| (select |#length| |ULTIMATE.start_cstpncpy_~d~0#1.base|))) (and (= (select |#length| |ULTIMATE.start_cstpncpy_~#dst#1.base|) 4) (= |ULTIMATE.start_cstpncpy_~d~0#1.base| |ULTIMATE.start_cstpncpy_~#dst#1.base|))))} is VALID [2022-02-20 23:40:49,261 INFO L290 TraceCheckUtils]: 13: Hoare triple {4624#(and (= |ULTIMATE.start_cstpncpy_~d~0#1.offset| 0) (or (and (<= 1 |ULTIMATE.start_cstpncpy_~n#1|) (<= |ULTIMATE.start_cstpncpy_~n#1| (select |#length| |ULTIMATE.start_cstpncpy_~d~0#1.base|))) (and (= (select |#length| |ULTIMATE.start_cstpncpy_~#dst#1.base|) 4) (= |ULTIMATE.start_cstpncpy_~d~0#1.base| |ULTIMATE.start_cstpncpy_~#dst#1.base|))))} SUMMARY for call cstpncpy_#t~mem3#1.base, cstpncpy_#t~mem3#1.offset := read~$Pointer$(cstpncpy_~#dst#1.base, cstpncpy_~#dst#1.offset, 4); srcloc: L519 {4624#(and (= |ULTIMATE.start_cstpncpy_~d~0#1.offset| 0) (or (and (<= 1 |ULTIMATE.start_cstpncpy_~n#1|) (<= |ULTIMATE.start_cstpncpy_~n#1| (select |#length| |ULTIMATE.start_cstpncpy_~d~0#1.base|))) (and (= (select |#length| |ULTIMATE.start_cstpncpy_~#dst#1.base|) 4) (= |ULTIMATE.start_cstpncpy_~d~0#1.base| |ULTIMATE.start_cstpncpy_~#dst#1.base|))))} is VALID [2022-02-20 23:40:49,262 INFO L290 TraceCheckUtils]: 14: Hoare triple {4624#(and (= |ULTIMATE.start_cstpncpy_~d~0#1.offset| 0) (or (and (<= 1 |ULTIMATE.start_cstpncpy_~n#1|) (<= |ULTIMATE.start_cstpncpy_~n#1| (select |#length| |ULTIMATE.start_cstpncpy_~d~0#1.base|))) (and (= (select |#length| |ULTIMATE.start_cstpncpy_~#dst#1.base|) 4) (= |ULTIMATE.start_cstpncpy_~d~0#1.base| |ULTIMATE.start_cstpncpy_~#dst#1.base|))))} SUMMARY for call write~$Pointer$(cstpncpy_#t~mem3#1.base, cstpncpy_#t~mem3#1.offset + (if cstpncpy_~n#1 % 4294967296 % 4294967296 <= 2147483647 then cstpncpy_~n#1 % 4294967296 % 4294967296 else cstpncpy_~n#1 % 4294967296 % 4294967296 - 4294967296), cstpncpy_~#dst#1.base, cstpncpy_~#dst#1.offset, 4); srcloc: L519-1 {4624#(and (= |ULTIMATE.start_cstpncpy_~d~0#1.offset| 0) (or (and (<= 1 |ULTIMATE.start_cstpncpy_~n#1|) (<= |ULTIMATE.start_cstpncpy_~n#1| (select |#length| |ULTIMATE.start_cstpncpy_~d~0#1.base|))) (and (= (select |#length| |ULTIMATE.start_cstpncpy_~#dst#1.base|) 4) (= |ULTIMATE.start_cstpncpy_~d~0#1.base| |ULTIMATE.start_cstpncpy_~#dst#1.base|))))} is VALID [2022-02-20 23:40:49,262 INFO L290 TraceCheckUtils]: 15: Hoare triple {4624#(and (= |ULTIMATE.start_cstpncpy_~d~0#1.offset| 0) (or (and (<= 1 |ULTIMATE.start_cstpncpy_~n#1|) (<= |ULTIMATE.start_cstpncpy_~n#1| (select |#length| |ULTIMATE.start_cstpncpy_~d~0#1.base|))) (and (= (select |#length| |ULTIMATE.start_cstpncpy_~#dst#1.base|) 4) (= |ULTIMATE.start_cstpncpy_~d~0#1.base| |ULTIMATE.start_cstpncpy_~#dst#1.base|))))} havoc cstpncpy_#t~mem3#1.base, cstpncpy_#t~mem3#1.offset; {4624#(and (= |ULTIMATE.start_cstpncpy_~d~0#1.offset| 0) (or (and (<= 1 |ULTIMATE.start_cstpncpy_~n#1|) (<= |ULTIMATE.start_cstpncpy_~n#1| (select |#length| |ULTIMATE.start_cstpncpy_~d~0#1.base|))) (and (= (select |#length| |ULTIMATE.start_cstpncpy_~#dst#1.base|) 4) (= |ULTIMATE.start_cstpncpy_~d~0#1.base| |ULTIMATE.start_cstpncpy_~#dst#1.base|))))} is VALID [2022-02-20 23:40:49,263 INFO L290 TraceCheckUtils]: 16: Hoare triple {4624#(and (= |ULTIMATE.start_cstpncpy_~d~0#1.offset| 0) (or (and (<= 1 |ULTIMATE.start_cstpncpy_~n#1|) (<= |ULTIMATE.start_cstpncpy_~n#1| (select |#length| |ULTIMATE.start_cstpncpy_~d~0#1.base|))) (and (= (select |#length| |ULTIMATE.start_cstpncpy_~#dst#1.base|) 4) (= |ULTIMATE.start_cstpncpy_~d~0#1.base| |ULTIMATE.start_cstpncpy_~#dst#1.base|))))} cstpncpy_#t~post5#1.base, cstpncpy_#t~post5#1.offset := cstpncpy_~d~0#1.base, cstpncpy_~d~0#1.offset;cstpncpy_~d~0#1.base, cstpncpy_~d~0#1.offset := cstpncpy_#t~post5#1.base, 1 + cstpncpy_#t~post5#1.offset;cstpncpy_#t~post6#1.base, cstpncpy_#t~post6#1.offset := cstpncpy_~s~0#1.base, cstpncpy_~s~0#1.offset;cstpncpy_~s~0#1.base, cstpncpy_~s~0#1.offset := cstpncpy_#t~post6#1.base, 1 + cstpncpy_#t~post6#1.offset; {4625#(and (= |ULTIMATE.start_cstpncpy_#t~post5#1.offset| 0) (or (and (= |ULTIMATE.start_cstpncpy_~#dst#1.base| |ULTIMATE.start_cstpncpy_#t~post5#1.base|) (= (select |#length| |ULTIMATE.start_cstpncpy_~#dst#1.base|) 4) (= |ULTIMATE.start_cstpncpy_~d~0#1.base| |ULTIMATE.start_cstpncpy_~#dst#1.base|) (<= |ULTIMATE.start_cstpncpy_~d~0#1.offset| (+ |ULTIMATE.start_cstpncpy_#t~post5#1.offset| 1))) (and (<= (+ |ULTIMATE.start_cstpncpy_~d~0#1.offset| |ULTIMATE.start_cstpncpy_~n#1|) (+ |ULTIMATE.start_cstpncpy_#t~post5#1.offset| (select |#length| |ULTIMATE.start_cstpncpy_#t~post5#1.base|) 1)) (<= 1 |ULTIMATE.start_cstpncpy_~n#1|) (= |ULTIMATE.start_cstpncpy_~d~0#1.base| |ULTIMATE.start_cstpncpy_#t~post5#1.base|))) (<= (+ |ULTIMATE.start_cstpncpy_#t~post5#1.offset| 1) |ULTIMATE.start_cstpncpy_~d~0#1.offset|))} is VALID [2022-02-20 23:40:49,264 INFO L290 TraceCheckUtils]: 17: Hoare triple {4625#(and (= |ULTIMATE.start_cstpncpy_#t~post5#1.offset| 0) (or (and (= |ULTIMATE.start_cstpncpy_~#dst#1.base| |ULTIMATE.start_cstpncpy_#t~post5#1.base|) (= (select |#length| |ULTIMATE.start_cstpncpy_~#dst#1.base|) 4) (= |ULTIMATE.start_cstpncpy_~d~0#1.base| |ULTIMATE.start_cstpncpy_~#dst#1.base|) (<= |ULTIMATE.start_cstpncpy_~d~0#1.offset| (+ |ULTIMATE.start_cstpncpy_#t~post5#1.offset| 1))) (and (<= (+ |ULTIMATE.start_cstpncpy_~d~0#1.offset| |ULTIMATE.start_cstpncpy_~n#1|) (+ |ULTIMATE.start_cstpncpy_#t~post5#1.offset| (select |#length| |ULTIMATE.start_cstpncpy_#t~post5#1.base|) 1)) (<= 1 |ULTIMATE.start_cstpncpy_~n#1|) (= |ULTIMATE.start_cstpncpy_~d~0#1.base| |ULTIMATE.start_cstpncpy_#t~post5#1.base|))) (<= (+ |ULTIMATE.start_cstpncpy_#t~post5#1.offset| 1) |ULTIMATE.start_cstpncpy_~d~0#1.offset|))} SUMMARY for call cstpncpy_#t~mem7#1 := read~int(cstpncpy_#t~post6#1.base, cstpncpy_#t~post6#1.offset, 1); srcloc: L521 {4625#(and (= |ULTIMATE.start_cstpncpy_#t~post5#1.offset| 0) (or (and (= |ULTIMATE.start_cstpncpy_~#dst#1.base| |ULTIMATE.start_cstpncpy_#t~post5#1.base|) (= (select |#length| |ULTIMATE.start_cstpncpy_~#dst#1.base|) 4) (= |ULTIMATE.start_cstpncpy_~d~0#1.base| |ULTIMATE.start_cstpncpy_~#dst#1.base|) (<= |ULTIMATE.start_cstpncpy_~d~0#1.offset| (+ |ULTIMATE.start_cstpncpy_#t~post5#1.offset| 1))) (and (<= (+ |ULTIMATE.start_cstpncpy_~d~0#1.offset| |ULTIMATE.start_cstpncpy_~n#1|) (+ |ULTIMATE.start_cstpncpy_#t~post5#1.offset| (select |#length| |ULTIMATE.start_cstpncpy_#t~post5#1.base|) 1)) (<= 1 |ULTIMATE.start_cstpncpy_~n#1|) (= |ULTIMATE.start_cstpncpy_~d~0#1.base| |ULTIMATE.start_cstpncpy_#t~post5#1.base|))) (<= (+ |ULTIMATE.start_cstpncpy_#t~post5#1.offset| 1) |ULTIMATE.start_cstpncpy_~d~0#1.offset|))} is VALID [2022-02-20 23:40:49,265 INFO L290 TraceCheckUtils]: 18: Hoare triple {4625#(and (= |ULTIMATE.start_cstpncpy_#t~post5#1.offset| 0) (or (and (= |ULTIMATE.start_cstpncpy_~#dst#1.base| |ULTIMATE.start_cstpncpy_#t~post5#1.base|) (= (select |#length| |ULTIMATE.start_cstpncpy_~#dst#1.base|) 4) (= |ULTIMATE.start_cstpncpy_~d~0#1.base| |ULTIMATE.start_cstpncpy_~#dst#1.base|) (<= |ULTIMATE.start_cstpncpy_~d~0#1.offset| (+ |ULTIMATE.start_cstpncpy_#t~post5#1.offset| 1))) (and (<= (+ |ULTIMATE.start_cstpncpy_~d~0#1.offset| |ULTIMATE.start_cstpncpy_~n#1|) (+ |ULTIMATE.start_cstpncpy_#t~post5#1.offset| (select |#length| |ULTIMATE.start_cstpncpy_#t~post5#1.base|) 1)) (<= 1 |ULTIMATE.start_cstpncpy_~n#1|) (= |ULTIMATE.start_cstpncpy_~d~0#1.base| |ULTIMATE.start_cstpncpy_#t~post5#1.base|))) (<= (+ |ULTIMATE.start_cstpncpy_#t~post5#1.offset| 1) |ULTIMATE.start_cstpncpy_~d~0#1.offset|))} SUMMARY for call write~int(cstpncpy_#t~mem7#1, cstpncpy_#t~post5#1.base, cstpncpy_#t~post5#1.offset, 1); srcloc: L521-1 {4626#(and (<= 1 |ULTIMATE.start_cstpncpy_~d~0#1.offset|) (or (and (= (select |#length| |ULTIMATE.start_cstpncpy_~#dst#1.base|) 4) (= |ULTIMATE.start_cstpncpy_~d~0#1.base| |ULTIMATE.start_cstpncpy_~#dst#1.base|) (<= |ULTIMATE.start_cstpncpy_~d~0#1.offset| 1)) (and (<= 1 |ULTIMATE.start_cstpncpy_~n#1|) (<= (+ |ULTIMATE.start_cstpncpy_~d~0#1.offset| |ULTIMATE.start_cstpncpy_~n#1|) (+ (select |#length| |ULTIMATE.start_cstpncpy_~d~0#1.base|) 1)))))} is VALID [2022-02-20 23:40:49,265 INFO L290 TraceCheckUtils]: 19: Hoare triple {4626#(and (<= 1 |ULTIMATE.start_cstpncpy_~d~0#1.offset|) (or (and (= (select |#length| |ULTIMATE.start_cstpncpy_~#dst#1.base|) 4) (= |ULTIMATE.start_cstpncpy_~d~0#1.base| |ULTIMATE.start_cstpncpy_~#dst#1.base|) (<= |ULTIMATE.start_cstpncpy_~d~0#1.offset| 1)) (and (<= 1 |ULTIMATE.start_cstpncpy_~n#1|) (<= (+ |ULTIMATE.start_cstpncpy_~d~0#1.offset| |ULTIMATE.start_cstpncpy_~n#1|) (+ (select |#length| |ULTIMATE.start_cstpncpy_~d~0#1.base|) 1)))))} assume 0 == cstpncpy_#t~mem7#1;havoc cstpncpy_#t~post5#1.base, cstpncpy_#t~post5#1.offset;havoc cstpncpy_#t~post6#1.base, cstpncpy_#t~post6#1.offset;havoc cstpncpy_#t~mem7#1; {4626#(and (<= 1 |ULTIMATE.start_cstpncpy_~d~0#1.offset|) (or (and (= (select |#length| |ULTIMATE.start_cstpncpy_~#dst#1.base|) 4) (= |ULTIMATE.start_cstpncpy_~d~0#1.base| |ULTIMATE.start_cstpncpy_~#dst#1.base|) (<= |ULTIMATE.start_cstpncpy_~d~0#1.offset| 1)) (and (<= 1 |ULTIMATE.start_cstpncpy_~n#1|) (<= (+ |ULTIMATE.start_cstpncpy_~d~0#1.offset| |ULTIMATE.start_cstpncpy_~n#1|) (+ (select |#length| |ULTIMATE.start_cstpncpy_~d~0#1.base|) 1)))))} is VALID [2022-02-20 23:40:49,266 INFO L290 TraceCheckUtils]: 20: Hoare triple {4626#(and (<= 1 |ULTIMATE.start_cstpncpy_~d~0#1.offset|) (or (and (= (select |#length| |ULTIMATE.start_cstpncpy_~#dst#1.base|) 4) (= |ULTIMATE.start_cstpncpy_~d~0#1.base| |ULTIMATE.start_cstpncpy_~#dst#1.base|) (<= |ULTIMATE.start_cstpncpy_~d~0#1.offset| 1)) (and (<= 1 |ULTIMATE.start_cstpncpy_~n#1|) (<= (+ |ULTIMATE.start_cstpncpy_~d~0#1.offset| |ULTIMATE.start_cstpncpy_~n#1|) (+ (select |#length| |ULTIMATE.start_cstpncpy_~d~0#1.base|) 1)))))} SUMMARY for call write~$Pointer$(cstpncpy_~d~0#1.base, cstpncpy_~d~0#1.offset - 1, cstpncpy_~#dst#1.base, cstpncpy_~#dst#1.offset, 4); srcloc: L522 {4627#(and (<= 1 |ULTIMATE.start_cstpncpy_~d~0#1.offset|) (or (and (= (select |#length| |ULTIMATE.start_cstpncpy_~d~0#1.base|) 4) (<= |ULTIMATE.start_cstpncpy_~d~0#1.offset| 1)) (and (<= 1 |ULTIMATE.start_cstpncpy_~n#1|) (<= (+ |ULTIMATE.start_cstpncpy_~d~0#1.offset| |ULTIMATE.start_cstpncpy_~n#1|) (+ (select |#length| |ULTIMATE.start_cstpncpy_~d~0#1.base|) 1)))))} is VALID [2022-02-20 23:40:49,267 INFO L290 TraceCheckUtils]: 21: Hoare triple {4627#(and (<= 1 |ULTIMATE.start_cstpncpy_~d~0#1.offset|) (or (and (= (select |#length| |ULTIMATE.start_cstpncpy_~d~0#1.base|) 4) (<= |ULTIMATE.start_cstpncpy_~d~0#1.offset| 1)) (and (<= 1 |ULTIMATE.start_cstpncpy_~n#1|) (<= (+ |ULTIMATE.start_cstpncpy_~d~0#1.offset| |ULTIMATE.start_cstpncpy_~n#1|) (+ (select |#length| |ULTIMATE.start_cstpncpy_~d~0#1.base|) 1)))))} cstpncpy_#t~pre8#1 := cstpncpy_~n#1 - 1;cstpncpy_~n#1 := cstpncpy_~n#1 - 1; {4628#(and (or (and (<= 0 |ULTIMATE.start_cstpncpy_#t~pre8#1|) (or (<= |ULTIMATE.start_cstpncpy_#t~pre8#1| (* 4294967296 (div |ULTIMATE.start_cstpncpy_#t~pre8#1| 4294967296))) (<= (+ |ULTIMATE.start_cstpncpy_~d~0#1.offset| |ULTIMATE.start_cstpncpy_#t~pre8#1|) (select |#length| |ULTIMATE.start_cstpncpy_~d~0#1.base|)))) (and (= (select |#length| |ULTIMATE.start_cstpncpy_~d~0#1.base|) 4) (<= |ULTIMATE.start_cstpncpy_~d~0#1.offset| 1))) (<= 1 |ULTIMATE.start_cstpncpy_~d~0#1.offset|))} is VALID [2022-02-20 23:40:49,268 INFO L290 TraceCheckUtils]: 22: Hoare triple {4628#(and (or (and (<= 0 |ULTIMATE.start_cstpncpy_#t~pre8#1|) (or (<= |ULTIMATE.start_cstpncpy_#t~pre8#1| (* 4294967296 (div |ULTIMATE.start_cstpncpy_#t~pre8#1| 4294967296))) (<= (+ |ULTIMATE.start_cstpncpy_~d~0#1.offset| |ULTIMATE.start_cstpncpy_#t~pre8#1|) (select |#length| |ULTIMATE.start_cstpncpy_~d~0#1.base|)))) (and (= (select |#length| |ULTIMATE.start_cstpncpy_~d~0#1.base|) 4) (<= |ULTIMATE.start_cstpncpy_~d~0#1.offset| 1))) (<= 1 |ULTIMATE.start_cstpncpy_~d~0#1.offset|))} assume !!(0 != cstpncpy_#t~pre8#1 % 4294967296);havoc cstpncpy_#t~pre8#1;cstpncpy_#t~post9#1.base, cstpncpy_#t~post9#1.offset := cstpncpy_~d~0#1.base, cstpncpy_~d~0#1.offset;cstpncpy_~d~0#1.base, cstpncpy_~d~0#1.offset := cstpncpy_#t~post9#1.base, 1 + cstpncpy_#t~post9#1.offset; {4629#(and (<= 1 |ULTIMATE.start_cstpncpy_#t~post9#1.offset|) (<= (+ |ULTIMATE.start_cstpncpy_#t~post9#1.offset| 1) (select |#length| |ULTIMATE.start_cstpncpy_#t~post9#1.base|)))} is VALID [2022-02-20 23:40:49,269 INFO L290 TraceCheckUtils]: 23: Hoare triple {4629#(and (<= 1 |ULTIMATE.start_cstpncpy_#t~post9#1.offset|) (<= (+ |ULTIMATE.start_cstpncpy_#t~post9#1.offset| 1) (select |#length| |ULTIMATE.start_cstpncpy_#t~post9#1.base|)))} assume !(1 + cstpncpy_#t~post9#1.offset <= #length[cstpncpy_#t~post9#1.base] && 0 <= cstpncpy_#t~post9#1.offset); {4617#false} is VALID [2022-02-20 23:40:49,269 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:40:49,269 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:40:49,269 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197002706] [2022-02-20 23:40:49,269 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197002706] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:40:49,269 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:40:49,269 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-02-20 23:40:49,269 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689380778] [2022-02-20 23:40:49,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:40:49,270 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 14 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2022-02-20 23:40:49,270 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:40:49,270 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 14 states have internal predecessors, (24), 0 states have call successors, (0), 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:40:49,291 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:40:49,292 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-02-20 23:40:49,292 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:40:49,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-02-20 23:40:49,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2022-02-20 23:40:49,292 INFO L87 Difference]: Start difference. First operand 70 states and 78 transitions. Second operand has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 14 states have internal predecessors, (24), 0 states have call successors, (0), 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:40:50,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:40:50,169 INFO L93 Difference]: Finished difference Result 77 states and 87 transitions. [2022-02-20 23:40:50,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-20 23:40:50,170 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 14 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2022-02-20 23:40:50,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:40:50,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 14 states have internal predecessors, (24), 0 states have call successors, (0), 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:40:50,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 56 transitions. [2022-02-20 23:40:50,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 14 states have internal predecessors, (24), 0 states have call successors, (0), 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:40:50,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 56 transitions. [2022-02-20 23:40:50,171 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 56 transitions. [2022-02-20 23:40:50,225 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:40:50,226 INFO L225 Difference]: With dead ends: 77 [2022-02-20 23:40:50,226 INFO L226 Difference]: Without dead ends: 77 [2022-02-20 23:40:50,226 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=102, Invalid=450, Unknown=0, NotChecked=0, Total=552 [2022-02-20 23:40:50,227 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 90 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:40:50,227 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [90 Valid, 165 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:40:50,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-02-20 23:40:50,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 75. [2022-02-20 23:40:50,229 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:40:50,229 INFO L82 GeneralOperation]: Start isEquivalent. First operand 77 states. Second operand has 75 states, 71 states have (on average 1.1971830985915493) internal successors, (85), 74 states have internal predecessors, (85), 0 states have call successors, (0), 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:40:50,229 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand has 75 states, 71 states have (on average 1.1971830985915493) internal successors, (85), 74 states have internal predecessors, (85), 0 states have call successors, (0), 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:40:50,229 INFO L87 Difference]: Start difference. First operand 77 states. Second operand has 75 states, 71 states have (on average 1.1971830985915493) internal successors, (85), 74 states have internal predecessors, (85), 0 states have call successors, (0), 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:40:50,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:40:50,230 INFO L93 Difference]: Finished difference Result 77 states and 87 transitions. [2022-02-20 23:40:50,230 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 87 transitions. [2022-02-20 23:40:50,230 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:40:50,231 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:40:50,231 INFO L74 IsIncluded]: Start isIncluded. First operand has 75 states, 71 states have (on average 1.1971830985915493) internal successors, (85), 74 states have internal predecessors, (85), 0 states have call successors, (0), 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:40:50,231 INFO L87 Difference]: Start difference. First operand has 75 states, 71 states have (on average 1.1971830985915493) internal successors, (85), 74 states have internal predecessors, (85), 0 states have call successors, (0), 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:40:50,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:40:50,232 INFO L93 Difference]: Finished difference Result 77 states and 87 transitions. [2022-02-20 23:40:50,232 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 87 transitions. [2022-02-20 23:40:50,232 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:40:50,233 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:40:50,233 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:40:50,233 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:40:50,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 71 states have (on average 1.1971830985915493) internal successors, (85), 74 states have internal predecessors, (85), 0 states have call successors, (0), 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:40:50,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 85 transitions. [2022-02-20 23:40:50,234 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 85 transitions. Word has length 24 [2022-02-20 23:40:50,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:40:50,234 INFO L470 AbstractCegarLoop]: Abstraction has 75 states and 85 transitions. [2022-02-20 23:40:50,234 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 14 states have internal predecessors, (24), 0 states have call successors, (0), 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:40:50,234 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 85 transitions. [2022-02-20 23:40:50,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-02-20 23:40:50,235 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:40:50,235 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:40:50,235 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-02-20 23:40:50,235 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2022-02-20 23:40:50,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:40:50,236 INFO L85 PathProgramCache]: Analyzing trace with hash 2126531648, now seen corresponding path program 1 times [2022-02-20 23:40:50,236 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:40:50,236 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355561247] [2022-02-20 23:40:50,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:40:50,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:40:50,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:40:50,387 INFO L290 TraceCheckUtils]: 0: Hoare triple {4958#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {4958#true} is VALID [2022-02-20 23:40:50,387 INFO L290 TraceCheckUtils]: 1: Hoare triple {4958#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~nondet12#1, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_#t~nondet16#1, main_#t~post15#1, main_~i~0#1, main_#t~ret17#1.base, main_#t~ret17#1.offset, main_~length~0#1, main_~n~0#1, main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset, main_~nondetString~0#1.base, main_~nondetString~0#1.offset;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~length~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~n~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; {4958#true} is VALID [2022-02-20 23:40:50,388 INFO L290 TraceCheckUtils]: 2: Hoare triple {4958#true} assume main_~length~0#1 < 1;main_~length~0#1 := 1; {4960#(and (<= |ULTIMATE.start_main_~length~0#1| 1) (<= 1 |ULTIMATE.start_main_~length~0#1|))} is VALID [2022-02-20 23:40:50,388 INFO L290 TraceCheckUtils]: 3: Hoare triple {4960#(and (<= |ULTIMATE.start_main_~length~0#1| 1) (<= 1 |ULTIMATE.start_main_~length~0#1|))} assume !(main_~n~0#1 < 1); {4960#(and (<= |ULTIMATE.start_main_~length~0#1| 1) (<= 1 |ULTIMATE.start_main_~length~0#1|))} is VALID [2022-02-20 23:40:50,389 INFO L290 TraceCheckUtils]: 4: Hoare triple {4960#(and (<= |ULTIMATE.start_main_~length~0#1| 1) (<= 1 |ULTIMATE.start_main_~length~0#1|))} call main_#t~malloc13#1.base, main_#t~malloc13#1.offset := #Ultimate.allocOnStack(main_~n~0#1);main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset := main_#t~malloc13#1.base, main_#t~malloc13#1.offset;call main_#t~malloc14#1.base, main_#t~malloc14#1.offset := #Ultimate.allocOnStack(main_~length~0#1);main_~nondetString~0#1.base, main_~nondetString~0#1.offset := main_#t~malloc14#1.base, main_#t~malloc14#1.offset;main_~i~0#1 := 0; {4961#(and (<= (+ |ULTIMATE.start_main_~length~0#1| |ULTIMATE.start_main_~nondetString~0#1.offset|) 1) (= |ULTIMATE.start_main_~length~0#1| 1) (< 0 (+ |ULTIMATE.start_main_~length~0#1| |ULTIMATE.start_main_~nondetString~0#1.offset|)))} is VALID [2022-02-20 23:40:50,389 INFO L290 TraceCheckUtils]: 5: Hoare triple {4961#(and (<= (+ |ULTIMATE.start_main_~length~0#1| |ULTIMATE.start_main_~nondetString~0#1.offset|) 1) (= |ULTIMATE.start_main_~length~0#1| 1) (< 0 (+ |ULTIMATE.start_main_~length~0#1| |ULTIMATE.start_main_~nondetString~0#1.offset|)))} assume !(main_~i~0#1 < main_~length~0#1 - 1); {4961#(and (<= (+ |ULTIMATE.start_main_~length~0#1| |ULTIMATE.start_main_~nondetString~0#1.offset|) 1) (= |ULTIMATE.start_main_~length~0#1| 1) (< 0 (+ |ULTIMATE.start_main_~length~0#1| |ULTIMATE.start_main_~nondetString~0#1.offset|)))} is VALID [2022-02-20 23:40:50,390 INFO L290 TraceCheckUtils]: 6: Hoare triple {4961#(and (<= (+ |ULTIMATE.start_main_~length~0#1| |ULTIMATE.start_main_~nondetString~0#1.offset|) 1) (= |ULTIMATE.start_main_~length~0#1| 1) (< 0 (+ |ULTIMATE.start_main_~length~0#1| |ULTIMATE.start_main_~nondetString~0#1.offset|)))} SUMMARY for call write~int(0, main_~nondetString~0#1.base, main_~nondetString~0#1.offset + (main_~length~0#1 - 1), 1); srcloc: L543-4 {4962#(and (= |ULTIMATE.start_main_~nondetString~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~nondetString~0#1.base|) 1) (= (select (select |#memory_int| |ULTIMATE.start_main_~nondetString~0#1.base|) |ULTIMATE.start_main_~nondetString~0#1.offset|) 0))} is VALID [2022-02-20 23:40:50,391 INFO L290 TraceCheckUtils]: 7: Hoare triple {4962#(and (= |ULTIMATE.start_main_~nondetString~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~nondetString~0#1.base|) 1) (= (select (select |#memory_int| |ULTIMATE.start_main_~nondetString~0#1.base|) |ULTIMATE.start_main_~nondetString~0#1.offset|) 0))} assume { :begin_inline_cstpncpy } true;cstpncpy_#in~dst#1.base, cstpncpy_#in~dst#1.offset, cstpncpy_#in~src#1.base, cstpncpy_#in~src#1.offset, cstpncpy_#in~n#1 := main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset, main_~nondetString~0#1.base, main_~nondetString~0#1.offset, main_~n~0#1;havoc cstpncpy_#res#1.base, cstpncpy_#res#1.offset;havoc cstpncpy_#t~mem2#1.base, cstpncpy_#t~mem2#1.offset, cstpncpy_#t~mem3#1.base, cstpncpy_#t~mem3#1.offset, cstpncpy_#t~post5#1.base, cstpncpy_#t~post5#1.offset, cstpncpy_#t~post6#1.base, cstpncpy_#t~post6#1.offset, cstpncpy_#t~mem7#1, cstpncpy_#t~post9#1.base, cstpncpy_#t~post9#1.offset, cstpncpy_#t~pre8#1, cstpncpy_#t~pre4#1, cstpncpy_~d~0#1.base, cstpncpy_~d~0#1.offset, cstpncpy_~s~0#1.base, cstpncpy_~s~0#1.offset, cstpncpy_#t~mem10#1.base, cstpncpy_#t~mem10#1.offset, cstpncpy_~#dst#1.base, cstpncpy_~#dst#1.offset, cstpncpy_~src#1.base, cstpncpy_~src#1.offset, cstpncpy_~n#1;call cstpncpy_~#dst#1.base, cstpncpy_~#dst#1.offset := #Ultimate.allocOnStack(4); {4963#(and (= (select (select |#memory_int| |ULTIMATE.start_cstpncpy_#in~src#1.base|) |ULTIMATE.start_cstpncpy_#in~src#1.offset|) 0) (not (= |ULTIMATE.start_cstpncpy_#in~src#1.base| |ULTIMATE.start_cstpncpy_~#dst#1.base|)))} is VALID [2022-02-20 23:40:50,391 INFO L290 TraceCheckUtils]: 8: Hoare triple {4963#(and (= (select (select |#memory_int| |ULTIMATE.start_cstpncpy_#in~src#1.base|) |ULTIMATE.start_cstpncpy_#in~src#1.offset|) 0) (not (= |ULTIMATE.start_cstpncpy_#in~src#1.base| |ULTIMATE.start_cstpncpy_~#dst#1.base|)))} SUMMARY for call write~$Pointer$(cstpncpy_#in~dst#1.base, cstpncpy_#in~dst#1.offset, cstpncpy_~#dst#1.base, cstpncpy_~#dst#1.offset, 4); srcloc: L513 {4963#(and (= (select (select |#memory_int| |ULTIMATE.start_cstpncpy_#in~src#1.base|) |ULTIMATE.start_cstpncpy_#in~src#1.offset|) 0) (not (= |ULTIMATE.start_cstpncpy_#in~src#1.base| |ULTIMATE.start_cstpncpy_~#dst#1.base|)))} is VALID [2022-02-20 23:40:50,392 INFO L290 TraceCheckUtils]: 9: Hoare triple {4963#(and (= (select (select |#memory_int| |ULTIMATE.start_cstpncpy_#in~src#1.base|) |ULTIMATE.start_cstpncpy_#in~src#1.offset|) 0) (not (= |ULTIMATE.start_cstpncpy_#in~src#1.base| |ULTIMATE.start_cstpncpy_~#dst#1.base|)))} cstpncpy_~src#1.base, cstpncpy_~src#1.offset := cstpncpy_#in~src#1.base, cstpncpy_#in~src#1.offset;cstpncpy_~n#1 := cstpncpy_#in~n#1; {4964#(and (not (= |ULTIMATE.start_cstpncpy_~src#1.base| |ULTIMATE.start_cstpncpy_~#dst#1.base|)) (= (select (select |#memory_int| |ULTIMATE.start_cstpncpy_~src#1.base|) |ULTIMATE.start_cstpncpy_~src#1.offset|) 0))} is VALID [2022-02-20 23:40:50,392 INFO L290 TraceCheckUtils]: 10: Hoare triple {4964#(and (not (= |ULTIMATE.start_cstpncpy_~src#1.base| |ULTIMATE.start_cstpncpy_~#dst#1.base|)) (= (select (select |#memory_int| |ULTIMATE.start_cstpncpy_~src#1.base|) |ULTIMATE.start_cstpncpy_~src#1.offset|) 0))} assume 0 != cstpncpy_~n#1 % 4294967296; {4964#(and (not (= |ULTIMATE.start_cstpncpy_~src#1.base| |ULTIMATE.start_cstpncpy_~#dst#1.base|)) (= (select (select |#memory_int| |ULTIMATE.start_cstpncpy_~src#1.base|) |ULTIMATE.start_cstpncpy_~src#1.offset|) 0))} is VALID [2022-02-20 23:40:50,393 INFO L290 TraceCheckUtils]: 11: Hoare triple {4964#(and (not (= |ULTIMATE.start_cstpncpy_~src#1.base| |ULTIMATE.start_cstpncpy_~#dst#1.base|)) (= (select (select |#memory_int| |ULTIMATE.start_cstpncpy_~src#1.base|) |ULTIMATE.start_cstpncpy_~src#1.offset|) 0))} SUMMARY for call cstpncpy_#t~mem2#1.base, cstpncpy_#t~mem2#1.offset := read~$Pointer$(cstpncpy_~#dst#1.base, cstpncpy_~#dst#1.offset, 4); srcloc: L517 {4964#(and (not (= |ULTIMATE.start_cstpncpy_~src#1.base| |ULTIMATE.start_cstpncpy_~#dst#1.base|)) (= (select (select |#memory_int| |ULTIMATE.start_cstpncpy_~src#1.base|) |ULTIMATE.start_cstpncpy_~src#1.offset|) 0))} is VALID [2022-02-20 23:40:50,393 INFO L290 TraceCheckUtils]: 12: Hoare triple {4964#(and (not (= |ULTIMATE.start_cstpncpy_~src#1.base| |ULTIMATE.start_cstpncpy_~#dst#1.base|)) (= (select (select |#memory_int| |ULTIMATE.start_cstpncpy_~src#1.base|) |ULTIMATE.start_cstpncpy_~src#1.offset|) 0))} cstpncpy_~d~0#1.base, cstpncpy_~d~0#1.offset := cstpncpy_#t~mem2#1.base, cstpncpy_#t~mem2#1.offset;havoc cstpncpy_#t~mem2#1.base, cstpncpy_#t~mem2#1.offset;cstpncpy_~s~0#1.base, cstpncpy_~s~0#1.offset := cstpncpy_~src#1.base, cstpncpy_~src#1.offset; {4965#(and (not (= |ULTIMATE.start_cstpncpy_~#dst#1.base| |ULTIMATE.start_cstpncpy_~s~0#1.base|)) (= (select (select |#memory_int| |ULTIMATE.start_cstpncpy_~s~0#1.base|) |ULTIMATE.start_cstpncpy_~s~0#1.offset|) 0))} is VALID [2022-02-20 23:40:50,393 INFO L290 TraceCheckUtils]: 13: Hoare triple {4965#(and (not (= |ULTIMATE.start_cstpncpy_~#dst#1.base| |ULTIMATE.start_cstpncpy_~s~0#1.base|)) (= (select (select |#memory_int| |ULTIMATE.start_cstpncpy_~s~0#1.base|) |ULTIMATE.start_cstpncpy_~s~0#1.offset|) 0))} SUMMARY for call cstpncpy_#t~mem3#1.base, cstpncpy_#t~mem3#1.offset := read~$Pointer$(cstpncpy_~#dst#1.base, cstpncpy_~#dst#1.offset, 4); srcloc: L519 {4965#(and (not (= |ULTIMATE.start_cstpncpy_~#dst#1.base| |ULTIMATE.start_cstpncpy_~s~0#1.base|)) (= (select (select |#memory_int| |ULTIMATE.start_cstpncpy_~s~0#1.base|) |ULTIMATE.start_cstpncpy_~s~0#1.offset|) 0))} is VALID [2022-02-20 23:40:50,394 INFO L290 TraceCheckUtils]: 14: Hoare triple {4965#(and (not (= |ULTIMATE.start_cstpncpy_~#dst#1.base| |ULTIMATE.start_cstpncpy_~s~0#1.base|)) (= (select (select |#memory_int| |ULTIMATE.start_cstpncpy_~s~0#1.base|) |ULTIMATE.start_cstpncpy_~s~0#1.offset|) 0))} SUMMARY for call write~$Pointer$(cstpncpy_#t~mem3#1.base, cstpncpy_#t~mem3#1.offset + (if cstpncpy_~n#1 % 4294967296 % 4294967296 <= 2147483647 then cstpncpy_~n#1 % 4294967296 % 4294967296 else cstpncpy_~n#1 % 4294967296 % 4294967296 - 4294967296), cstpncpy_~#dst#1.base, cstpncpy_~#dst#1.offset, 4); srcloc: L519-1 {4966#(= (select (select |#memory_int| |ULTIMATE.start_cstpncpy_~s~0#1.base|) |ULTIMATE.start_cstpncpy_~s~0#1.offset|) 0)} is VALID [2022-02-20 23:40:50,394 INFO L290 TraceCheckUtils]: 15: Hoare triple {4966#(= (select (select |#memory_int| |ULTIMATE.start_cstpncpy_~s~0#1.base|) |ULTIMATE.start_cstpncpy_~s~0#1.offset|) 0)} havoc cstpncpy_#t~mem3#1.base, cstpncpy_#t~mem3#1.offset; {4966#(= (select (select |#memory_int| |ULTIMATE.start_cstpncpy_~s~0#1.base|) |ULTIMATE.start_cstpncpy_~s~0#1.offset|) 0)} is VALID [2022-02-20 23:40:50,395 INFO L290 TraceCheckUtils]: 16: Hoare triple {4966#(= (select (select |#memory_int| |ULTIMATE.start_cstpncpy_~s~0#1.base|) |ULTIMATE.start_cstpncpy_~s~0#1.offset|) 0)} cstpncpy_#t~post5#1.base, cstpncpy_#t~post5#1.offset := cstpncpy_~d~0#1.base, cstpncpy_~d~0#1.offset;cstpncpy_~d~0#1.base, cstpncpy_~d~0#1.offset := cstpncpy_#t~post5#1.base, 1 + cstpncpy_#t~post5#1.offset;cstpncpy_#t~post6#1.base, cstpncpy_#t~post6#1.offset := cstpncpy_~s~0#1.base, cstpncpy_~s~0#1.offset;cstpncpy_~s~0#1.base, cstpncpy_~s~0#1.offset := cstpncpy_#t~post6#1.base, 1 + cstpncpy_#t~post6#1.offset; {4967#(= 0 (select (select |#memory_int| |ULTIMATE.start_cstpncpy_#t~post6#1.base|) |ULTIMATE.start_cstpncpy_#t~post6#1.offset|))} is VALID [2022-02-20 23:40:50,395 INFO L290 TraceCheckUtils]: 17: Hoare triple {4967#(= 0 (select (select |#memory_int| |ULTIMATE.start_cstpncpy_#t~post6#1.base|) |ULTIMATE.start_cstpncpy_#t~post6#1.offset|))} SUMMARY for call cstpncpy_#t~mem7#1 := read~int(cstpncpy_#t~post6#1.base, cstpncpy_#t~post6#1.offset, 1); srcloc: L521 {4968#(= |ULTIMATE.start_cstpncpy_#t~mem7#1| 0)} is VALID [2022-02-20 23:40:50,396 INFO L290 TraceCheckUtils]: 18: Hoare triple {4968#(= |ULTIMATE.start_cstpncpy_#t~mem7#1| 0)} SUMMARY for call write~int(cstpncpy_#t~mem7#1, cstpncpy_#t~post5#1.base, cstpncpy_#t~post5#1.offset, 1); srcloc: L521-1 {4968#(= |ULTIMATE.start_cstpncpy_#t~mem7#1| 0)} is VALID [2022-02-20 23:40:50,396 INFO L290 TraceCheckUtils]: 19: Hoare triple {4968#(= |ULTIMATE.start_cstpncpy_#t~mem7#1| 0)} assume !(0 == cstpncpy_#t~mem7#1);havoc cstpncpy_#t~post5#1.base, cstpncpy_#t~post5#1.offset;havoc cstpncpy_#t~post6#1.base, cstpncpy_#t~post6#1.offset;havoc cstpncpy_#t~mem7#1; {4959#false} is VALID [2022-02-20 23:40:50,396 INFO L290 TraceCheckUtils]: 20: Hoare triple {4959#false} cstpncpy_#t~pre4#1 := cstpncpy_~n#1 - 1;cstpncpy_~n#1 := cstpncpy_~n#1 - 1; {4959#false} is VALID [2022-02-20 23:40:50,396 INFO L290 TraceCheckUtils]: 21: Hoare triple {4959#false} assume !!(0 != cstpncpy_#t~pre4#1 % 4294967296);havoc cstpncpy_#t~pre4#1; {4959#false} is VALID [2022-02-20 23:40:50,396 INFO L290 TraceCheckUtils]: 22: Hoare triple {4959#false} cstpncpy_#t~post5#1.base, cstpncpy_#t~post5#1.offset := cstpncpy_~d~0#1.base, cstpncpy_~d~0#1.offset;cstpncpy_~d~0#1.base, cstpncpy_~d~0#1.offset := cstpncpy_#t~post5#1.base, 1 + cstpncpy_#t~post5#1.offset;cstpncpy_#t~post6#1.base, cstpncpy_#t~post6#1.offset := cstpncpy_~s~0#1.base, cstpncpy_~s~0#1.offset;cstpncpy_~s~0#1.base, cstpncpy_~s~0#1.offset := cstpncpy_#t~post6#1.base, 1 + cstpncpy_#t~post6#1.offset; {4959#false} is VALID [2022-02-20 23:40:50,396 INFO L290 TraceCheckUtils]: 23: Hoare triple {4959#false} assume !(1 + cstpncpy_#t~post6#1.offset <= #length[cstpncpy_#t~post6#1.base] && 0 <= cstpncpy_#t~post6#1.offset); {4959#false} is VALID [2022-02-20 23:40:50,397 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:40:50,397 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:40:50,397 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355561247] [2022-02-20 23:40:50,397 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355561247] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:40:50,397 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:40:50,397 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-02-20 23:40:50,397 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805150580] [2022-02-20 23:40:50,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:40:50,398 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2022-02-20 23:40:50,398 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:40:50,398 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 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:40:50,414 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:40:50,414 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-20 23:40:50,414 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:40:50,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-20 23:40:50,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-02-20 23:40:50,415 INFO L87 Difference]: Start difference. First operand 75 states and 85 transitions. Second operand has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 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:40:50,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:40:50,918 INFO L93 Difference]: Finished difference Result 120 states and 131 transitions. [2022-02-20 23:40:50,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 23:40:50,919 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2022-02-20 23:40:50,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:40:50,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 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:40:50,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 73 transitions. [2022-02-20 23:40:50,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 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:40:50,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 73 transitions. [2022-02-20 23:40:50,920 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 73 transitions. [2022-02-20 23:40:50,972 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:40:50,973 INFO L225 Difference]: With dead ends: 120 [2022-02-20 23:40:50,973 INFO L226 Difference]: Without dead ends: 120 [2022-02-20 23:40:50,974 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=230, Unknown=0, NotChecked=0, Total=306 [2022-02-20 23:40:50,974 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 61 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:40:50,974 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [61 Valid, 253 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:40:50,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-02-20 23:40:50,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 103. [2022-02-20 23:40:50,976 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:40:50,976 INFO L82 GeneralOperation]: Start isEquivalent. First operand 120 states. Second operand has 103 states, 99 states have (on average 1.1414141414141414) internal successors, (113), 102 states have internal predecessors, (113), 0 states have call successors, (0), 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:40:50,976 INFO L74 IsIncluded]: Start isIncluded. First operand 120 states. Second operand has 103 states, 99 states have (on average 1.1414141414141414) internal successors, (113), 102 states have internal predecessors, (113), 0 states have call successors, (0), 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:40:50,976 INFO L87 Difference]: Start difference. First operand 120 states. Second operand has 103 states, 99 states have (on average 1.1414141414141414) internal successors, (113), 102 states have internal predecessors, (113), 0 states have call successors, (0), 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:40:50,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:40:50,977 INFO L93 Difference]: Finished difference Result 120 states and 131 transitions. [2022-02-20 23:40:50,977 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 131 transitions. [2022-02-20 23:40:50,977 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:40:50,977 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:40:50,977 INFO L74 IsIncluded]: Start isIncluded. First operand has 103 states, 99 states have (on average 1.1414141414141414) internal successors, (113), 102 states have internal predecessors, (113), 0 states have call successors, (0), 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:40:50,978 INFO L87 Difference]: Start difference. First operand has 103 states, 99 states have (on average 1.1414141414141414) internal successors, (113), 102 states have internal predecessors, (113), 0 states have call successors, (0), 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:40:50,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:40:50,982 INFO L93 Difference]: Finished difference Result 120 states and 131 transitions. [2022-02-20 23:40:50,982 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 131 transitions. [2022-02-20 23:40:50,982 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:40:50,982 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:40:50,982 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:40:50,982 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:40:50,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 99 states have (on average 1.1414141414141414) internal successors, (113), 102 states have internal predecessors, (113), 0 states have call successors, (0), 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:40:50,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 113 transitions. [2022-02-20 23:40:50,984 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 113 transitions. Word has length 24 [2022-02-20 23:40:50,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:40:50,984 INFO L470 AbstractCegarLoop]: Abstraction has 103 states and 113 transitions. [2022-02-20 23:40:50,984 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 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:40:50,984 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 113 transitions. [2022-02-20 23:40:50,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-02-20 23:40:50,985 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:40:50,985 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:40:50,985 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-02-20 23:40:50,985 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2022-02-20 23:40:50,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:40:50,985 INFO L85 PathProgramCache]: Analyzing trace with hash -1949580930, now seen corresponding path program 1 times [2022-02-20 23:40:50,985 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:40:50,986 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648526290] [2022-02-20 23:40:50,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:40:50,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:40:51,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:40:51,145 INFO L290 TraceCheckUtils]: 0: Hoare triple {5448#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {5448#true} is VALID [2022-02-20 23:40:51,145 INFO L290 TraceCheckUtils]: 1: Hoare triple {5448#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~nondet12#1, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_#t~nondet16#1, main_#t~post15#1, main_~i~0#1, main_#t~ret17#1.base, main_#t~ret17#1.offset, main_~length~0#1, main_~n~0#1, main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset, main_~nondetString~0#1.base, main_~nondetString~0#1.offset;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~length~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~n~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; {5448#true} is VALID [2022-02-20 23:40:51,145 INFO L290 TraceCheckUtils]: 2: Hoare triple {5448#true} assume !(main_~length~0#1 < 1); {5450#(<= 1 |ULTIMATE.start_main_~length~0#1|)} is VALID [2022-02-20 23:40:51,146 INFO L290 TraceCheckUtils]: 3: Hoare triple {5450#(<= 1 |ULTIMATE.start_main_~length~0#1|)} assume !(main_~n~0#1 < 1); {5450#(<= 1 |ULTIMATE.start_main_~length~0#1|)} is VALID [2022-02-20 23:40:51,146 INFO L290 TraceCheckUtils]: 4: Hoare triple {5450#(<= 1 |ULTIMATE.start_main_~length~0#1|)} call main_#t~malloc13#1.base, main_#t~malloc13#1.offset := #Ultimate.allocOnStack(main_~n~0#1);main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset := main_#t~malloc13#1.base, main_#t~malloc13#1.offset;call main_#t~malloc14#1.base, main_#t~malloc14#1.offset := #Ultimate.allocOnStack(main_~length~0#1);main_~nondetString~0#1.base, main_~nondetString~0#1.offset := main_#t~malloc14#1.base, main_#t~malloc14#1.offset;main_~i~0#1 := 0; {5451#(and (or (= (+ (- 1) |ULTIMATE.start_main_~length~0#1| |ULTIMATE.start_main_~nondetString~0#1.offset|) 0) (and (= |ULTIMATE.start_main_~i~0#1| 0) (not (<= (+ |ULTIMATE.start_main_~length~0#1| |ULTIMATE.start_main_~nondetString~0#1.offset|) 0)))) (= |ULTIMATE.start_main_~nondetString~0#1.offset| 0))} is VALID [2022-02-20 23:40:51,147 INFO L290 TraceCheckUtils]: 5: Hoare triple {5451#(and (or (= (+ (- 1) |ULTIMATE.start_main_~length~0#1| |ULTIMATE.start_main_~nondetString~0#1.offset|) 0) (and (= |ULTIMATE.start_main_~i~0#1| 0) (not (<= (+ |ULTIMATE.start_main_~length~0#1| |ULTIMATE.start_main_~nondetString~0#1.offset|) 0)))) (= |ULTIMATE.start_main_~nondetString~0#1.offset| 0))} assume !(main_~i~0#1 < main_~length~0#1 - 1); {5452#(and (<= (+ |ULTIMATE.start_main_~length~0#1| |ULTIMATE.start_main_~nondetString~0#1.offset|) 1) (= |ULTIMATE.start_main_~length~0#1| 1) (not (<= (+ |ULTIMATE.start_main_~length~0#1| |ULTIMATE.start_main_~nondetString~0#1.offset|) 0)))} is VALID [2022-02-20 23:40:51,148 INFO L290 TraceCheckUtils]: 6: Hoare triple {5452#(and (<= (+ |ULTIMATE.start_main_~length~0#1| |ULTIMATE.start_main_~nondetString~0#1.offset|) 1) (= |ULTIMATE.start_main_~length~0#1| 1) (not (<= (+ |ULTIMATE.start_main_~length~0#1| |ULTIMATE.start_main_~nondetString~0#1.offset|) 0)))} SUMMARY for call write~int(0, main_~nondetString~0#1.base, main_~nondetString~0#1.offset + (main_~length~0#1 - 1), 1); srcloc: L543-4 {5453#(and (= |ULTIMATE.start_main_~nondetString~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~nondetString~0#1.base|) 1) (= (select (select |#memory_int| |ULTIMATE.start_main_~nondetString~0#1.base|) |ULTIMATE.start_main_~nondetString~0#1.offset|) 0))} is VALID [2022-02-20 23:40:51,149 INFO L290 TraceCheckUtils]: 7: Hoare triple {5453#(and (= |ULTIMATE.start_main_~nondetString~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~nondetString~0#1.base|) 1) (= (select (select |#memory_int| |ULTIMATE.start_main_~nondetString~0#1.base|) |ULTIMATE.start_main_~nondetString~0#1.offset|) 0))} assume { :begin_inline_cstpncpy } true;cstpncpy_#in~dst#1.base, cstpncpy_#in~dst#1.offset, cstpncpy_#in~src#1.base, cstpncpy_#in~src#1.offset, cstpncpy_#in~n#1 := main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset, main_~nondetString~0#1.base, main_~nondetString~0#1.offset, main_~n~0#1;havoc cstpncpy_#res#1.base, cstpncpy_#res#1.offset;havoc cstpncpy_#t~mem2#1.base, cstpncpy_#t~mem2#1.offset, cstpncpy_#t~mem3#1.base, cstpncpy_#t~mem3#1.offset, cstpncpy_#t~post5#1.base, cstpncpy_#t~post5#1.offset, cstpncpy_#t~post6#1.base, cstpncpy_#t~post6#1.offset, cstpncpy_#t~mem7#1, cstpncpy_#t~post9#1.base, cstpncpy_#t~post9#1.offset, cstpncpy_#t~pre8#1, cstpncpy_#t~pre4#1, cstpncpy_~d~0#1.base, cstpncpy_~d~0#1.offset, cstpncpy_~s~0#1.base, cstpncpy_~s~0#1.offset, cstpncpy_#t~mem10#1.base, cstpncpy_#t~mem10#1.offset, cstpncpy_~#dst#1.base, cstpncpy_~#dst#1.offset, cstpncpy_~src#1.base, cstpncpy_~src#1.offset, cstpncpy_~n#1;call cstpncpy_~#dst#1.base, cstpncpy_~#dst#1.offset := #Ultimate.allocOnStack(4); {5454#(and (= (select (select |#memory_int| |ULTIMATE.start_cstpncpy_#in~src#1.base|) |ULTIMATE.start_cstpncpy_#in~src#1.offset|) 0) (not (= |ULTIMATE.start_cstpncpy_#in~src#1.base| |ULTIMATE.start_cstpncpy_~#dst#1.base|)))} is VALID [2022-02-20 23:40:51,149 INFO L290 TraceCheckUtils]: 8: Hoare triple {5454#(and (= (select (select |#memory_int| |ULTIMATE.start_cstpncpy_#in~src#1.base|) |ULTIMATE.start_cstpncpy_#in~src#1.offset|) 0) (not (= |ULTIMATE.start_cstpncpy_#in~src#1.base| |ULTIMATE.start_cstpncpy_~#dst#1.base|)))} SUMMARY for call write~$Pointer$(cstpncpy_#in~dst#1.base, cstpncpy_#in~dst#1.offset, cstpncpy_~#dst#1.base, cstpncpy_~#dst#1.offset, 4); srcloc: L513 {5454#(and (= (select (select |#memory_int| |ULTIMATE.start_cstpncpy_#in~src#1.base|) |ULTIMATE.start_cstpncpy_#in~src#1.offset|) 0) (not (= |ULTIMATE.start_cstpncpy_#in~src#1.base| |ULTIMATE.start_cstpncpy_~#dst#1.base|)))} is VALID [2022-02-20 23:40:51,150 INFO L290 TraceCheckUtils]: 9: Hoare triple {5454#(and (= (select (select |#memory_int| |ULTIMATE.start_cstpncpy_#in~src#1.base|) |ULTIMATE.start_cstpncpy_#in~src#1.offset|) 0) (not (= |ULTIMATE.start_cstpncpy_#in~src#1.base| |ULTIMATE.start_cstpncpy_~#dst#1.base|)))} cstpncpy_~src#1.base, cstpncpy_~src#1.offset := cstpncpy_#in~src#1.base, cstpncpy_#in~src#1.offset;cstpncpy_~n#1 := cstpncpy_#in~n#1; {5455#(and (not (= |ULTIMATE.start_cstpncpy_~src#1.base| |ULTIMATE.start_cstpncpy_~#dst#1.base|)) (= (select (select |#memory_int| |ULTIMATE.start_cstpncpy_~src#1.base|) |ULTIMATE.start_cstpncpy_~src#1.offset|) 0))} is VALID [2022-02-20 23:40:51,150 INFO L290 TraceCheckUtils]: 10: Hoare triple {5455#(and (not (= |ULTIMATE.start_cstpncpy_~src#1.base| |ULTIMATE.start_cstpncpy_~#dst#1.base|)) (= (select (select |#memory_int| |ULTIMATE.start_cstpncpy_~src#1.base|) |ULTIMATE.start_cstpncpy_~src#1.offset|) 0))} assume 0 != cstpncpy_~n#1 % 4294967296; {5455#(and (not (= |ULTIMATE.start_cstpncpy_~src#1.base| |ULTIMATE.start_cstpncpy_~#dst#1.base|)) (= (select (select |#memory_int| |ULTIMATE.start_cstpncpy_~src#1.base|) |ULTIMATE.start_cstpncpy_~src#1.offset|) 0))} is VALID [2022-02-20 23:40:51,150 INFO L290 TraceCheckUtils]: 11: Hoare triple {5455#(and (not (= |ULTIMATE.start_cstpncpy_~src#1.base| |ULTIMATE.start_cstpncpy_~#dst#1.base|)) (= (select (select |#memory_int| |ULTIMATE.start_cstpncpy_~src#1.base|) |ULTIMATE.start_cstpncpy_~src#1.offset|) 0))} SUMMARY for call cstpncpy_#t~mem2#1.base, cstpncpy_#t~mem2#1.offset := read~$Pointer$(cstpncpy_~#dst#1.base, cstpncpy_~#dst#1.offset, 4); srcloc: L517 {5455#(and (not (= |ULTIMATE.start_cstpncpy_~src#1.base| |ULTIMATE.start_cstpncpy_~#dst#1.base|)) (= (select (select |#memory_int| |ULTIMATE.start_cstpncpy_~src#1.base|) |ULTIMATE.start_cstpncpy_~src#1.offset|) 0))} is VALID [2022-02-20 23:40:51,151 INFO L290 TraceCheckUtils]: 12: Hoare triple {5455#(and (not (= |ULTIMATE.start_cstpncpy_~src#1.base| |ULTIMATE.start_cstpncpy_~#dst#1.base|)) (= (select (select |#memory_int| |ULTIMATE.start_cstpncpy_~src#1.base|) |ULTIMATE.start_cstpncpy_~src#1.offset|) 0))} cstpncpy_~d~0#1.base, cstpncpy_~d~0#1.offset := cstpncpy_#t~mem2#1.base, cstpncpy_#t~mem2#1.offset;havoc cstpncpy_#t~mem2#1.base, cstpncpy_#t~mem2#1.offset;cstpncpy_~s~0#1.base, cstpncpy_~s~0#1.offset := cstpncpy_~src#1.base, cstpncpy_~src#1.offset; {5456#(and (not (= |ULTIMATE.start_cstpncpy_~#dst#1.base| |ULTIMATE.start_cstpncpy_~s~0#1.base|)) (= (select (select |#memory_int| |ULTIMATE.start_cstpncpy_~s~0#1.base|) |ULTIMATE.start_cstpncpy_~s~0#1.offset|) 0))} is VALID [2022-02-20 23:40:51,151 INFO L290 TraceCheckUtils]: 13: Hoare triple {5456#(and (not (= |ULTIMATE.start_cstpncpy_~#dst#1.base| |ULTIMATE.start_cstpncpy_~s~0#1.base|)) (= (select (select |#memory_int| |ULTIMATE.start_cstpncpy_~s~0#1.base|) |ULTIMATE.start_cstpncpy_~s~0#1.offset|) 0))} SUMMARY for call cstpncpy_#t~mem3#1.base, cstpncpy_#t~mem3#1.offset := read~$Pointer$(cstpncpy_~#dst#1.base, cstpncpy_~#dst#1.offset, 4); srcloc: L519 {5456#(and (not (= |ULTIMATE.start_cstpncpy_~#dst#1.base| |ULTIMATE.start_cstpncpy_~s~0#1.base|)) (= (select (select |#memory_int| |ULTIMATE.start_cstpncpy_~s~0#1.base|) |ULTIMATE.start_cstpncpy_~s~0#1.offset|) 0))} is VALID [2022-02-20 23:40:51,155 INFO L290 TraceCheckUtils]: 14: Hoare triple {5456#(and (not (= |ULTIMATE.start_cstpncpy_~#dst#1.base| |ULTIMATE.start_cstpncpy_~s~0#1.base|)) (= (select (select |#memory_int| |ULTIMATE.start_cstpncpy_~s~0#1.base|) |ULTIMATE.start_cstpncpy_~s~0#1.offset|) 0))} SUMMARY for call write~$Pointer$(cstpncpy_#t~mem3#1.base, cstpncpy_#t~mem3#1.offset + (if cstpncpy_~n#1 % 4294967296 % 4294967296 <= 2147483647 then cstpncpy_~n#1 % 4294967296 % 4294967296 else cstpncpy_~n#1 % 4294967296 % 4294967296 - 4294967296), cstpncpy_~#dst#1.base, cstpncpy_~#dst#1.offset, 4); srcloc: L519-1 {5457#(= (select (select |#memory_int| |ULTIMATE.start_cstpncpy_~s~0#1.base|) |ULTIMATE.start_cstpncpy_~s~0#1.offset|) 0)} is VALID [2022-02-20 23:40:51,156 INFO L290 TraceCheckUtils]: 15: Hoare triple {5457#(= (select (select |#memory_int| |ULTIMATE.start_cstpncpy_~s~0#1.base|) |ULTIMATE.start_cstpncpy_~s~0#1.offset|) 0)} havoc cstpncpy_#t~mem3#1.base, cstpncpy_#t~mem3#1.offset; {5457#(= (select (select |#memory_int| |ULTIMATE.start_cstpncpy_~s~0#1.base|) |ULTIMATE.start_cstpncpy_~s~0#1.offset|) 0)} is VALID [2022-02-20 23:40:51,156 INFO L290 TraceCheckUtils]: 16: Hoare triple {5457#(= (select (select |#memory_int| |ULTIMATE.start_cstpncpy_~s~0#1.base|) |ULTIMATE.start_cstpncpy_~s~0#1.offset|) 0)} cstpncpy_#t~post5#1.base, cstpncpy_#t~post5#1.offset := cstpncpy_~d~0#1.base, cstpncpy_~d~0#1.offset;cstpncpy_~d~0#1.base, cstpncpy_~d~0#1.offset := cstpncpy_#t~post5#1.base, 1 + cstpncpy_#t~post5#1.offset;cstpncpy_#t~post6#1.base, cstpncpy_#t~post6#1.offset := cstpncpy_~s~0#1.base, cstpncpy_~s~0#1.offset;cstpncpy_~s~0#1.base, cstpncpy_~s~0#1.offset := cstpncpy_#t~post6#1.base, 1 + cstpncpy_#t~post6#1.offset; {5458#(= 0 (select (select |#memory_int| |ULTIMATE.start_cstpncpy_#t~post6#1.base|) |ULTIMATE.start_cstpncpy_#t~post6#1.offset|))} is VALID [2022-02-20 23:40:51,157 INFO L290 TraceCheckUtils]: 17: Hoare triple {5458#(= 0 (select (select |#memory_int| |ULTIMATE.start_cstpncpy_#t~post6#1.base|) |ULTIMATE.start_cstpncpy_#t~post6#1.offset|))} SUMMARY for call cstpncpy_#t~mem7#1 := read~int(cstpncpy_#t~post6#1.base, cstpncpy_#t~post6#1.offset, 1); srcloc: L521 {5459#(= |ULTIMATE.start_cstpncpy_#t~mem7#1| 0)} is VALID [2022-02-20 23:40:51,157 INFO L290 TraceCheckUtils]: 18: Hoare triple {5459#(= |ULTIMATE.start_cstpncpy_#t~mem7#1| 0)} SUMMARY for call write~int(cstpncpy_#t~mem7#1, cstpncpy_#t~post5#1.base, cstpncpy_#t~post5#1.offset, 1); srcloc: L521-1 {5459#(= |ULTIMATE.start_cstpncpy_#t~mem7#1| 0)} is VALID [2022-02-20 23:40:51,158 INFO L290 TraceCheckUtils]: 19: Hoare triple {5459#(= |ULTIMATE.start_cstpncpy_#t~mem7#1| 0)} assume !(0 == cstpncpy_#t~mem7#1);havoc cstpncpy_#t~post5#1.base, cstpncpy_#t~post5#1.offset;havoc cstpncpy_#t~post6#1.base, cstpncpy_#t~post6#1.offset;havoc cstpncpy_#t~mem7#1; {5449#false} is VALID [2022-02-20 23:40:51,158 INFO L290 TraceCheckUtils]: 20: Hoare triple {5449#false} cstpncpy_#t~pre4#1 := cstpncpy_~n#1 - 1;cstpncpy_~n#1 := cstpncpy_~n#1 - 1; {5449#false} is VALID [2022-02-20 23:40:51,158 INFO L290 TraceCheckUtils]: 21: Hoare triple {5449#false} assume !!(0 != cstpncpy_#t~pre4#1 % 4294967296);havoc cstpncpy_#t~pre4#1; {5449#false} is VALID [2022-02-20 23:40:51,158 INFO L290 TraceCheckUtils]: 22: Hoare triple {5449#false} cstpncpy_#t~post5#1.base, cstpncpy_#t~post5#1.offset := cstpncpy_~d~0#1.base, cstpncpy_~d~0#1.offset;cstpncpy_~d~0#1.base, cstpncpy_~d~0#1.offset := cstpncpy_#t~post5#1.base, 1 + cstpncpy_#t~post5#1.offset;cstpncpy_#t~post6#1.base, cstpncpy_#t~post6#1.offset := cstpncpy_~s~0#1.base, cstpncpy_~s~0#1.offset;cstpncpy_~s~0#1.base, cstpncpy_~s~0#1.offset := cstpncpy_#t~post6#1.base, 1 + cstpncpy_#t~post6#1.offset; {5449#false} is VALID [2022-02-20 23:40:51,158 INFO L290 TraceCheckUtils]: 23: Hoare triple {5449#false} assume !(1 + cstpncpy_#t~post6#1.offset <= #length[cstpncpy_#t~post6#1.base] && 0 <= cstpncpy_#t~post6#1.offset); {5449#false} is VALID [2022-02-20 23:40:51,158 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:40:51,158 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:40:51,159 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648526290] [2022-02-20 23:40:51,159 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648526290] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:40:51,159 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:40:51,159 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-02-20 23:40:51,159 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429514294] [2022-02-20 23:40:51,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:40:51,159 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.0) internal successors, (24), 12 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2022-02-20 23:40:51,160 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:40:51,160 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 2.0) internal successors, (24), 12 states have internal predecessors, (24), 0 states have call successors, (0), 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:40:51,178 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:40:51,179 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-02-20 23:40:51,179 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:40:51,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-20 23:40:51,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2022-02-20 23:40:51,180 INFO L87 Difference]: Start difference. First operand 103 states and 113 transitions. Second operand has 12 states, 12 states have (on average 2.0) internal successors, (24), 12 states have internal predecessors, (24), 0 states have call successors, (0), 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:40:51,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:40:51,710 INFO L93 Difference]: Finished difference Result 156 states and 169 transitions. [2022-02-20 23:40:51,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-20 23:40:51,711 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.0) internal successors, (24), 12 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2022-02-20 23:40:51,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:40:51,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.0) internal successors, (24), 12 states have internal predecessors, (24), 0 states have call successors, (0), 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:40:51,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 74 transitions. [2022-02-20 23:40:51,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.0) internal successors, (24), 12 states have internal predecessors, (24), 0 states have call successors, (0), 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:40:51,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 74 transitions. [2022-02-20 23:40:51,712 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 74 transitions. [2022-02-20 23:40:51,770 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:40:51,772 INFO L225 Difference]: With dead ends: 156 [2022-02-20 23:40:51,772 INFO L226 Difference]: Without dead ends: 156 [2022-02-20 23:40:51,772 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2022-02-20 23:40:51,772 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 100 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:40:51,773 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [100 Valid, 188 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:40:51,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2022-02-20 23:40:51,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 105. [2022-02-20 23:40:51,774 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:40:51,774 INFO L82 GeneralOperation]: Start isEquivalent. First operand 156 states. Second operand has 105 states, 101 states have (on average 1.1584158415841583) internal successors, (117), 104 states have internal predecessors, (117), 0 states have call successors, (0), 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:40:51,775 INFO L74 IsIncluded]: Start isIncluded. First operand 156 states. Second operand has 105 states, 101 states have (on average 1.1584158415841583) internal successors, (117), 104 states have internal predecessors, (117), 0 states have call successors, (0), 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:40:51,775 INFO L87 Difference]: Start difference. First operand 156 states. Second operand has 105 states, 101 states have (on average 1.1584158415841583) internal successors, (117), 104 states have internal predecessors, (117), 0 states have call successors, (0), 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:40:51,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:40:51,776 INFO L93 Difference]: Finished difference Result 156 states and 169 transitions. [2022-02-20 23:40:51,777 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 169 transitions. [2022-02-20 23:40:51,777 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:40:51,777 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:40:51,777 INFO L74 IsIncluded]: Start isIncluded. First operand has 105 states, 101 states have (on average 1.1584158415841583) internal successors, (117), 104 states have internal predecessors, (117), 0 states have call successors, (0), 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 156 states. [2022-02-20 23:40:51,777 INFO L87 Difference]: Start difference. First operand has 105 states, 101 states have (on average 1.1584158415841583) internal successors, (117), 104 states have internal predecessors, (117), 0 states have call successors, (0), 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 156 states. [2022-02-20 23:40:51,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:40:51,779 INFO L93 Difference]: Finished difference Result 156 states and 169 transitions. [2022-02-20 23:40:51,779 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 169 transitions. [2022-02-20 23:40:51,779 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:40:51,780 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:40:51,780 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:40:51,780 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:40:51,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 101 states have (on average 1.1584158415841583) internal successors, (117), 104 states have internal predecessors, (117), 0 states have call successors, (0), 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:40:51,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 117 transitions. [2022-02-20 23:40:51,781 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 117 transitions. Word has length 24 [2022-02-20 23:40:51,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:40:51,781 INFO L470 AbstractCegarLoop]: Abstraction has 105 states and 117 transitions. [2022-02-20 23:40:51,781 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.0) internal successors, (24), 12 states have internal predecessors, (24), 0 states have call successors, (0), 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:40:51,781 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 117 transitions. [2022-02-20 23:40:51,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-02-20 23:40:51,782 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:40:51,782 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:40:51,782 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-02-20 23:40:51,782 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2022-02-20 23:40:51,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:40:51,783 INFO L85 PathProgramCache]: Analyzing trace with hash 1664467980, now seen corresponding path program 1 times [2022-02-20 23:40:51,783 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:40:51,783 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670159067] [2022-02-20 23:40:51,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:40:51,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:40:51,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:40:51,809 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-02-20 23:40:51,809 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.ArrayInterpolator$WeakPathInfo$WeakPathEnd.addInterpolantClausePathSeg(ArrayInterpolator.java:2041) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.ArrayInterpolator$WeakPathInfo.closeWeakPath(ArrayInterpolator.java:1402) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.ArrayInterpolator$WeakPathInfo.interpolateWeakPathInfo(ArrayInterpolator.java:1070) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.ArrayInterpolator$WeakPathInfo$WeakPathEnd.buildRecursiveInterpolant(ArrayInterpolator.java:2229) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.ArrayInterpolator$WeakPathInfo.interpolateStorePathInfoExt(ArrayInterpolator.java:1206) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.ArrayInterpolator.computeWeakeqExtInterpolants(ArrayInterpolator.java:306) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.ArrayInterpolator.computeInterpolants(ArrayInterpolator.java:197) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.walkLeafNode(Interpolator.java:326) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator$ProofTreeWalker.walk(Interpolator.java:145) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.interpolate(Interpolator.java:250) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.getInterpolants(Interpolator.java:227) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:879) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:803) at de.uni_freiburg.informatik.ultimate.logic.NoopScript.getInterpolants(NoopScript.java:352) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.getInterpolants(WrapperScript.java:337) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.getInterpolants(WrapperScript.java:337) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.getInterpolants(ManagedScript.java:192) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.NestedInterpolantsBuilder.computeCraigInterpolants(NestedInterpolantsBuilder.java:284) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:165) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsRecursive(InterpolatingTraceCheckCraig.java:327) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:229) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:97) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:216) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:129) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:93) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:414) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:304) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:264) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:177) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:156) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-02-20 23:40:51,813 INFO L158 Benchmark]: Toolchain (without parser) took 11415.14ms. Allocated memory was 102.8MB in the beginning and 180.4MB in the end (delta: 77.6MB). Free memory was 79.7MB in the beginning and 114.5MB in the end (delta: -34.8MB). Peak memory consumption was 45.1MB. Max. memory is 16.1GB. [2022-02-20 23:40:51,813 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 81.8MB. Free memory was 58.4MB in the beginning and 58.4MB in the end (delta: 45.2kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 23:40:51,813 INFO L158 Benchmark]: CACSL2BoogieTranslator took 330.35ms. Allocated memory is still 102.8MB. Free memory was 79.7MB in the beginning and 62.5MB in the end (delta: 17.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-02-20 23:40:51,814 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.63ms. Allocated memory is still 102.8MB. Free memory was 62.5MB in the beginning and 60.2MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 23:40:51,814 INFO L158 Benchmark]: Boogie Preprocessor took 19.94ms. Allocated memory is still 102.8MB. Free memory was 60.2MB in the beginning and 58.5MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 23:40:51,814 INFO L158 Benchmark]: RCFGBuilder took 439.39ms. Allocated memory is still 102.8MB. Free memory was 58.3MB in the beginning and 75.2MB in the end (delta: -16.9MB). Peak memory consumption was 22.0MB. Max. memory is 16.1GB. [2022-02-20 23:40:51,814 INFO L158 Benchmark]: TraceAbstraction took 10580.87ms. Allocated memory was 102.8MB in the beginning and 180.4MB in the end (delta: 77.6MB). Free memory was 74.8MB in the beginning and 114.5MB in the end (delta: -39.7MB). Peak memory consumption was 37.8MB. Max. memory is 16.1GB. [2022-02-20 23:40:51,815 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 81.8MB. Free memory was 58.4MB in the beginning and 58.4MB in the end (delta: 45.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 330.35ms. Allocated memory is still 102.8MB. Free memory was 79.7MB in the beginning and 62.5MB in the end (delta: 17.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.63ms. Allocated memory is still 102.8MB. Free memory was 62.5MB in the beginning and 60.2MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 19.94ms. Allocated memory is still 102.8MB. Free memory was 60.2MB in the beginning and 58.5MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 439.39ms. Allocated memory is still 102.8MB. Free memory was 58.3MB in the beginning and 75.2MB in the end (delta: -16.9MB). Peak memory consumption was 22.0MB. Max. memory is 16.1GB. * TraceAbstraction took 10580.87ms. Allocated memory was 102.8MB in the beginning and 180.4MB in the end (delta: 77.6MB). Free memory was 74.8MB in the beginning and 114.5MB in the end (delta: -39.7MB). Peak memory consumption was 37.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: null de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: null: de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.ArrayInterpolator$WeakPathInfo$WeakPathEnd.addInterpolantClausePathSeg(ArrayInterpolator.java:2041) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-02-20 23:40:51,841 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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/openbsd_cstpncpy-alloca-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.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 36c3a12d89778d96e6058a4f11ff4e1483403bd2fab9b14de640491057c7f753 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 23:40:53,456 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 23:40:53,458 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 23:40:53,490 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 23:40:53,491 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 23:40:53,493 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 23:40:53,496 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 23:40:53,500 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 23:40:53,502 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 23:40:53,507 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 23:40:53,508 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 23:40:53,511 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 23:40:53,511 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 23:40:53,513 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 23:40:53,514 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 23:40:53,515 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 23:40:53,516 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 23:40:53,516 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 23:40:53,520 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 23:40:53,522 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 23:40:53,525 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 23:40:53,526 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 23:40:53,526 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 23:40:53,528 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 23:40:53,531 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 23:40:53,531 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 23:40:53,531 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 23:40:53,532 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 23:40:53,533 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 23:40:53,534 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 23:40:53,534 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 23:40:53,534 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 23:40:53,535 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 23:40:53,536 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 23:40:53,537 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 23:40:53,537 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 23:40:53,537 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 23:40:53,537 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 23:40:53,538 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 23:40:53,539 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 23:40:53,539 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 23:40:53,540 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-02-20 23:40:53,566 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 23:40:53,568 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 23:40:53,568 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 23:40:53,568 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 23:40:53,569 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 23:40:53,569 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 23:40:53,570 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 23:40:53,570 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 23:40:53,571 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 23:40:53,571 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 23:40:53,571 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 23:40:53,572 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-20 23:40:53,572 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 23:40:53,572 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 23:40:53,572 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 23:40:53,572 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-02-20 23:40:53,572 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-02-20 23:40:53,572 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-02-20 23:40:53,573 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 23:40:53,573 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 23:40:53,573 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-02-20 23:40:53,573 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-02-20 23:40:53,573 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 23:40:53,573 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 23:40:53,573 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 23:40:53,574 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 23:40:53,574 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 23:40:53,574 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:40:53,574 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 23:40:53,574 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 23:40:53,574 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-02-20 23:40:53,574 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-02-20 23:40:53,575 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-02-20 23:40:53,575 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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 -> 36c3a12d89778d96e6058a4f11ff4e1483403bd2fab9b14de640491057c7f753 [2022-02-20 23:40:53,814 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 23:40:53,834 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 23:40:53,836 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 23:40:53,837 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 23:40:53,839 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 23:40:53,840 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety/openbsd_cstpncpy-alloca-1.i [2022-02-20 23:40:53,891 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb588533c/19b5627786974a79b76b3bb31d9f445f/FLAG97b29eda7 [2022-02-20 23:40:54,299 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 23:40:54,299 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/openbsd_cstpncpy-alloca-1.i [2022-02-20 23:40:54,314 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb588533c/19b5627786974a79b76b3bb31d9f445f/FLAG97b29eda7 [2022-02-20 23:40:54,324 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb588533c/19b5627786974a79b76b3bb31d9f445f [2022-02-20 23:40:54,327 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 23:40:54,329 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 23:40:54,330 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 23:40:54,330 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 23:40:54,332 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 23:40:54,333 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:40:54" (1/1) ... [2022-02-20 23:40:54,334 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26613904 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:40:54, skipping insertion in model container [2022-02-20 23:40:54,334 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:40:54" (1/1) ... [2022-02-20 23:40:54,338 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 23:40:54,372 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 23:40:54,643 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:40:54,652 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 23:40:54,686 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:40:54,704 INFO L208 MainTranslator]: Completed translation [2022-02-20 23:40:54,705 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:40:54 WrapperNode [2022-02-20 23:40:54,705 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 23:40:54,705 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 23:40:54,706 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 23:40:54,706 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 23:40:54,710 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:40:54" (1/1) ... [2022-02-20 23:40:54,720 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:40:54" (1/1) ... [2022-02-20 23:40:54,736 INFO L137 Inliner]: procedures = 120, calls = 23, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 96 [2022-02-20 23:40:54,737 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 23:40:54,737 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 23:40:54,737 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 23:40:54,737 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 23:40:54,743 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:40:54" (1/1) ... [2022-02-20 23:40:54,743 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:40:54" (1/1) ... [2022-02-20 23:40:54,745 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:40:54" (1/1) ... [2022-02-20 23:40:54,746 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:40:54" (1/1) ... [2022-02-20 23:40:54,752 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:40:54" (1/1) ... [2022-02-20 23:40:54,755 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:40:54" (1/1) ... [2022-02-20 23:40:54,756 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:40:54" (1/1) ... [2022-02-20 23:40:54,758 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 23:40:54,759 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 23:40:54,759 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 23:40:54,759 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 23:40:54,760 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:40:54" (1/1) ... [2022-02-20 23:40:54,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:40:54,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:40:54,790 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:40:54,808 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:40:54,832 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2022-02-20 23:40:54,833 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-20 23:40:54,833 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 23:40:54,833 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-20 23:40:54,833 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2022-02-20 23:40:54,833 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 23:40:54,833 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 23:40:54,834 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 23:40:54,947 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 23:40:54,948 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 23:40:55,222 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 23:40:55,227 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 23:40:55,227 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-02-20 23:40:55,229 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:40:55 BoogieIcfgContainer [2022-02-20 23:40:55,229 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 23:40:55,230 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 23:40:55,230 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 23:40:55,232 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 23:40:55,232 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 11:40:54" (1/3) ... [2022-02-20 23:40:55,233 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69e320b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:40:55, skipping insertion in model container [2022-02-20 23:40:55,233 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:40:54" (2/3) ... [2022-02-20 23:40:55,233 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69e320b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:40:55, skipping insertion in model container [2022-02-20 23:40:55,233 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:40:55" (3/3) ... [2022-02-20 23:40:55,234 INFO L111 eAbstractionObserver]: Analyzing ICFG openbsd_cstpncpy-alloca-1.i [2022-02-20 23:40:55,237 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 23:40:55,237 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 23 error locations. [2022-02-20 23:40:55,263 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 23:40:55,268 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:40:55,268 INFO L340 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2022-02-20 23:40:55,278 INFO L276 IsEmpty]: Start isEmpty. Operand has 59 states, 35 states have (on average 1.9428571428571428) internal successors, (68), 58 states have internal predecessors, (68), 0 states have call successors, (0), 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:40:55,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-02-20 23:40:55,281 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:40:55,282 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:40:55,282 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2022-02-20 23:40:55,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:40:55,285 INFO L85 PathProgramCache]: Analyzing trace with hash 1805029043, now seen corresponding path program 1 times [2022-02-20 23:40:55,293 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:40:55,293 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1084194053] [2022-02-20 23:40:55,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:40:55,294 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:40:55,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:40:55,296 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:40:55,297 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-02-20 23:40:55,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:40:55,371 INFO L263 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 23:40:55,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:40:55,389 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:40:55,476 INFO L356 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2022-02-20 23:40:55,477 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 1 case distinctions, treesize of input 9 treesize of output 18 [2022-02-20 23:40:55,511 INFO L290 TraceCheckUtils]: 0: Hoare triple {62#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven; {62#true} is VALID [2022-02-20 23:40:55,511 INFO L290 TraceCheckUtils]: 1: Hoare triple {62#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~nondet12#1, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_#t~nondet16#1, main_#t~post15#1, main_~i~0#1, main_#t~ret17#1.base, main_#t~ret17#1.offset, main_~length~0#1, main_~n~0#1, main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset, main_~nondetString~0#1.base, main_~nondetString~0#1.offset;main_~length~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;main_~n~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; {62#true} is VALID [2022-02-20 23:40:55,512 INFO L290 TraceCheckUtils]: 2: Hoare triple {62#true} assume ~bvslt32(main_~length~0#1, 1bv32);main_~length~0#1 := 1bv32; {62#true} is VALID [2022-02-20 23:40:55,512 INFO L290 TraceCheckUtils]: 3: Hoare triple {62#true} assume ~bvslt32(main_~n~0#1, 1bv32);main_~n~0#1 := 1bv32; {62#true} is VALID [2022-02-20 23:40:55,514 INFO L290 TraceCheckUtils]: 4: Hoare triple {62#true} call main_#t~malloc13#1.base, main_#t~malloc13#1.offset := #Ultimate.allocOnStack(main_~n~0#1);main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset := main_#t~malloc13#1.base, main_#t~malloc13#1.offset;call main_#t~malloc14#1.base, main_#t~malloc14#1.offset := #Ultimate.allocOnStack(main_~length~0#1);main_~nondetString~0#1.base, main_~nondetString~0#1.offset := main_#t~malloc14#1.base, main_#t~malloc14#1.offset;main_~i~0#1 := 0bv32; {79#(= (bvadd (bvneg (select |#valid| |ULTIMATE.start_main_~nondetString~0#1.base|)) (_ bv1 1)) (_ bv0 1))} is VALID [2022-02-20 23:40:55,515 INFO L290 TraceCheckUtils]: 5: Hoare triple {79#(= (bvadd (bvneg (select |#valid| |ULTIMATE.start_main_~nondetString~0#1.base|)) (_ bv1 1)) (_ bv0 1))} assume !~bvslt32(main_~i~0#1, ~bvsub32(main_~length~0#1, 1bv32)); {79#(= (bvadd (bvneg (select |#valid| |ULTIMATE.start_main_~nondetString~0#1.base|)) (_ bv1 1)) (_ bv0 1))} is VALID [2022-02-20 23:40:55,515 INFO L290 TraceCheckUtils]: 6: Hoare triple {79#(= (bvadd (bvneg (select |#valid| |ULTIMATE.start_main_~nondetString~0#1.base|)) (_ bv1 1)) (_ bv0 1))} assume !(1bv1 == #valid[main_~nondetString~0#1.base]); {63#false} is VALID [2022-02-20 23:40:55,516 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:40:55,517 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:40:55,517 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:40:55,517 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1084194053] [2022-02-20 23:40:55,518 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1084194053] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:40:55,518 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:40:55,519 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:40:55,520 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555629728] [2022-02-20 23:40:55,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:40:55,524 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 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 7 [2022-02-20 23:40:55,526 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:40:55,528 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 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:40:55,539 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:40:55,539 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:40:55,539 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:40:55,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:40:55,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:40:55,559 INFO L87 Difference]: Start difference. First operand has 59 states, 35 states have (on average 1.9428571428571428) internal successors, (68), 58 states have internal predecessors, (68), 0 states have call successors, (0), 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 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 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:40:55,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:40:55,774 INFO L93 Difference]: Finished difference Result 57 states and 63 transitions. [2022-02-20 23:40:55,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:40:55,775 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 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 7 [2022-02-20 23:40:55,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:40:55,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 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:40:55,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 68 transitions. [2022-02-20 23:40:55,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 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:40:55,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 68 transitions. [2022-02-20 23:40:55,791 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 68 transitions. [2022-02-20 23:40:55,866 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:40:55,873 INFO L225 Difference]: With dead ends: 57 [2022-02-20 23:40:55,873 INFO L226 Difference]: Without dead ends: 55 [2022-02-20 23:40:55,875 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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:40:55,879 INFO L933 BasicCegarLoop]: 39 mSDtfsCounter, 49 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:40:55,879 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 44 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:40:55,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-02-20 23:40:55,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2022-02-20 23:40:55,903 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:40:55,904 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand has 55 states, 34 states have (on average 1.7941176470588236) internal successors, (61), 54 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:40:55,905 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand has 55 states, 34 states have (on average 1.7941176470588236) internal successors, (61), 54 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:40:55,907 INFO L87 Difference]: Start difference. First operand 55 states. Second operand has 55 states, 34 states have (on average 1.7941176470588236) internal successors, (61), 54 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:40:55,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:40:55,915 INFO L93 Difference]: Finished difference Result 55 states and 61 transitions. [2022-02-20 23:40:55,915 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 61 transitions. [2022-02-20 23:40:55,915 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:40:55,916 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:40:55,916 INFO L74 IsIncluded]: Start isIncluded. First operand has 55 states, 34 states have (on average 1.7941176470588236) internal successors, (61), 54 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 55 states. [2022-02-20 23:40:55,917 INFO L87 Difference]: Start difference. First operand has 55 states, 34 states have (on average 1.7941176470588236) internal successors, (61), 54 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 55 states. [2022-02-20 23:40:55,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:40:55,922 INFO L93 Difference]: Finished difference Result 55 states and 61 transitions. [2022-02-20 23:40:55,922 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 61 transitions. [2022-02-20 23:40:55,923 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:40:55,923 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:40:55,923 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:40:55,923 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:40:55,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 34 states have (on average 1.7941176470588236) internal successors, (61), 54 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:40:55,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 61 transitions. [2022-02-20 23:40:55,928 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 61 transitions. Word has length 7 [2022-02-20 23:40:55,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:40:55,928 INFO L470 AbstractCegarLoop]: Abstraction has 55 states and 61 transitions. [2022-02-20 23:40:55,929 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 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:40:55,929 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 61 transitions. [2022-02-20 23:40:55,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-02-20 23:40:55,930 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:40:55,932 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:40:55,941 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-02-20 23:40:56,138 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:40:56,138 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2022-02-20 23:40:56,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:40:56,139 INFO L85 PathProgramCache]: Analyzing trace with hash 1805029044, now seen corresponding path program 1 times [2022-02-20 23:40:56,139 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:40:56,139 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1544858380] [2022-02-20 23:40:56,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:40:56,139 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:40:56,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:40:56,141 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:40:56,142 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-02-20 23:40:56,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:40:56,220 INFO L263 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-20 23:40:56,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:40:56,227 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:40:56,284 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-02-20 23:40:56,285 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 1 case distinctions, treesize of input 9 treesize of output 15 [2022-02-20 23:40:56,322 INFO L290 TraceCheckUtils]: 0: Hoare triple {307#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven; {307#true} is VALID [2022-02-20 23:40:56,323 INFO L290 TraceCheckUtils]: 1: Hoare triple {307#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~nondet12#1, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_#t~nondet16#1, main_#t~post15#1, main_~i~0#1, main_#t~ret17#1.base, main_#t~ret17#1.offset, main_~length~0#1, main_~n~0#1, main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset, main_~nondetString~0#1.base, main_~nondetString~0#1.offset;main_~length~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;main_~n~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; {307#true} is VALID [2022-02-20 23:40:56,323 INFO L290 TraceCheckUtils]: 2: Hoare triple {307#true} assume ~bvslt32(main_~length~0#1, 1bv32);main_~length~0#1 := 1bv32; {318#(= (_ bv1 32) |ULTIMATE.start_main_~length~0#1|)} is VALID [2022-02-20 23:40:56,324 INFO L290 TraceCheckUtils]: 3: Hoare triple {318#(= (_ bv1 32) |ULTIMATE.start_main_~length~0#1|)} assume ~bvslt32(main_~n~0#1, 1bv32);main_~n~0#1 := 1bv32; {318#(= (_ bv1 32) |ULTIMATE.start_main_~length~0#1|)} is VALID [2022-02-20 23:40:56,325 INFO L290 TraceCheckUtils]: 4: Hoare triple {318#(= (_ bv1 32) |ULTIMATE.start_main_~length~0#1|)} call main_#t~malloc13#1.base, main_#t~malloc13#1.offset := #Ultimate.allocOnStack(main_~n~0#1);main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset := main_#t~malloc13#1.base, main_#t~malloc13#1.offset;call main_#t~malloc14#1.base, main_#t~malloc14#1.offset := #Ultimate.allocOnStack(main_~length~0#1);main_~nondetString~0#1.base, main_~nondetString~0#1.offset := main_#t~malloc14#1.base, main_#t~malloc14#1.offset;main_~i~0#1 := 0bv32; {325#(and (= (select |#length| |ULTIMATE.start_main_~nondetString~0#1.base|) |ULTIMATE.start_main_~length~0#1|) (= (_ bv1 32) |ULTIMATE.start_main_~length~0#1|) (= |ULTIMATE.start_main_~nondetString~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:40:56,326 INFO L290 TraceCheckUtils]: 5: Hoare triple {325#(and (= (select |#length| |ULTIMATE.start_main_~nondetString~0#1.base|) |ULTIMATE.start_main_~length~0#1|) (= (_ bv1 32) |ULTIMATE.start_main_~length~0#1|) (= |ULTIMATE.start_main_~nondetString~0#1.offset| (_ bv0 32)))} assume !~bvslt32(main_~i~0#1, ~bvsub32(main_~length~0#1, 1bv32)); {325#(and (= (select |#length| |ULTIMATE.start_main_~nondetString~0#1.base|) |ULTIMATE.start_main_~length~0#1|) (= (_ bv1 32) |ULTIMATE.start_main_~length~0#1|) (= |ULTIMATE.start_main_~nondetString~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:40:56,327 INFO L290 TraceCheckUtils]: 6: Hoare triple {325#(and (= (select |#length| |ULTIMATE.start_main_~nondetString~0#1.base|) |ULTIMATE.start_main_~length~0#1|) (= (_ bv1 32) |ULTIMATE.start_main_~length~0#1|) (= |ULTIMATE.start_main_~nondetString~0#1.offset| (_ bv0 32)))} assume !((~bvule32(~bvadd32(1bv32, ~bvadd32(main_~nondetString~0#1.offset, ~bvsub32(main_~length~0#1, 1bv32))), #length[main_~nondetString~0#1.base]) && ~bvule32(~bvadd32(main_~nondetString~0#1.offset, ~bvsub32(main_~length~0#1, 1bv32)), ~bvadd32(1bv32, ~bvadd32(main_~nondetString~0#1.offset, ~bvsub32(main_~length~0#1, 1bv32))))) && ~bvule32(0bv32, ~bvadd32(main_~nondetString~0#1.offset, ~bvsub32(main_~length~0#1, 1bv32)))); {308#false} is VALID [2022-02-20 23:40:56,327 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:40:56,327 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:40:56,328 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:40:56,330 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1544858380] [2022-02-20 23:40:56,330 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1544858380] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:40:56,330 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:40:56,330 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:40:56,331 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563033535] [2022-02-20 23:40:56,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:40:56,332 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 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 7 [2022-02-20 23:40:56,332 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:40:56,337 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 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:40:56,345 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:40:56,346 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:40:56,346 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:40:56,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:40:56,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:40:56,346 INFO L87 Difference]: Start difference. First operand 55 states and 61 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 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:40:56,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:40:56,714 INFO L93 Difference]: Finished difference Result 106 states and 117 transitions. [2022-02-20 23:40:56,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 23:40:56,714 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 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 7 [2022-02-20 23:40:56,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:40:56,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 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:40:56,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 118 transitions. [2022-02-20 23:40:56,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 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:40:56,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 118 transitions. [2022-02-20 23:40:56,717 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 118 transitions. [2022-02-20 23:40:56,846 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 118 edges. 118 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:40:56,848 INFO L225 Difference]: With dead ends: 106 [2022-02-20 23:40:56,848 INFO L226 Difference]: Without dead ends: 106 [2022-02-20 23:40:56,849 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 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:40:56,849 INFO L933 BasicCegarLoop]: 54 mSDtfsCounter, 60 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:40:56,849 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [60 Valid, 136 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:40:56,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-02-20 23:40:56,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 62. [2022-02-20 23:40:56,853 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:40:56,853 INFO L82 GeneralOperation]: Start isEquivalent. First operand 106 states. Second operand has 62 states, 41 states have (on average 1.7317073170731707) internal successors, (71), 61 states have internal predecessors, (71), 0 states have call successors, (0), 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:40:56,853 INFO L74 IsIncluded]: Start isIncluded. First operand 106 states. Second operand has 62 states, 41 states have (on average 1.7317073170731707) internal successors, (71), 61 states have internal predecessors, (71), 0 states have call successors, (0), 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:40:56,853 INFO L87 Difference]: Start difference. First operand 106 states. Second operand has 62 states, 41 states have (on average 1.7317073170731707) internal successors, (71), 61 states have internal predecessors, (71), 0 states have call successors, (0), 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:40:56,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:40:56,866 INFO L93 Difference]: Finished difference Result 106 states and 117 transitions. [2022-02-20 23:40:56,867 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 117 transitions. [2022-02-20 23:40:56,868 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:40:56,868 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:40:56,868 INFO L74 IsIncluded]: Start isIncluded. First operand has 62 states, 41 states have (on average 1.7317073170731707) internal successors, (71), 61 states have internal predecessors, (71), 0 states have call successors, (0), 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 106 states. [2022-02-20 23:40:56,869 INFO L87 Difference]: Start difference. First operand has 62 states, 41 states have (on average 1.7317073170731707) internal successors, (71), 61 states have internal predecessors, (71), 0 states have call successors, (0), 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 106 states. [2022-02-20 23:40:56,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:40:56,874 INFO L93 Difference]: Finished difference Result 106 states and 117 transitions. [2022-02-20 23:40:56,874 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 117 transitions. [2022-02-20 23:40:56,878 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:40:56,878 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:40:56,878 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:40:56,879 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:40:56,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 41 states have (on average 1.7317073170731707) internal successors, (71), 61 states have internal predecessors, (71), 0 states have call successors, (0), 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:40:56,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 71 transitions. [2022-02-20 23:40:56,880 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 71 transitions. Word has length 7 [2022-02-20 23:40:56,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:40:56,881 INFO L470 AbstractCegarLoop]: Abstraction has 62 states and 71 transitions. [2022-02-20 23:40:56,881 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 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:40:56,881 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 71 transitions. [2022-02-20 23:40:56,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-02-20 23:40:56,882 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:40:56,882 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:40:56,895 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Ended with exit code 0 [2022-02-20 23:40:57,088 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:40:57,088 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2022-02-20 23:40:57,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:40:57,089 INFO L85 PathProgramCache]: Analyzing trace with hash 1805029097, now seen corresponding path program 1 times [2022-02-20 23:40:57,089 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:40:57,090 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1512043411] [2022-02-20 23:40:57,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:40:57,090 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:40:57,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:40:57,091 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:40:57,092 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-02-20 23:40:57,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:40:57,127 INFO L263 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 23:40:57,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:40:57,132 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:40:57,183 INFO L290 TraceCheckUtils]: 0: Hoare triple {711#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven; {711#true} is VALID [2022-02-20 23:40:57,183 INFO L290 TraceCheckUtils]: 1: Hoare triple {711#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~nondet12#1, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_#t~nondet16#1, main_#t~post15#1, main_~i~0#1, main_#t~ret17#1.base, main_#t~ret17#1.offset, main_~length~0#1, main_~n~0#1, main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset, main_~nondetString~0#1.base, main_~nondetString~0#1.offset;main_~length~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;main_~n~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; {711#true} is VALID [2022-02-20 23:40:57,184 INFO L290 TraceCheckUtils]: 2: Hoare triple {711#true} assume ~bvslt32(main_~length~0#1, 1bv32);main_~length~0#1 := 1bv32; {722#(= (_ bv1 32) |ULTIMATE.start_main_~length~0#1|)} is VALID [2022-02-20 23:40:57,184 INFO L290 TraceCheckUtils]: 3: Hoare triple {722#(= (_ bv1 32) |ULTIMATE.start_main_~length~0#1|)} assume ~bvslt32(main_~n~0#1, 1bv32);main_~n~0#1 := 1bv32; {722#(= (_ bv1 32) |ULTIMATE.start_main_~length~0#1|)} is VALID [2022-02-20 23:40:57,185 INFO L290 TraceCheckUtils]: 4: Hoare triple {722#(= (_ bv1 32) |ULTIMATE.start_main_~length~0#1|)} call main_#t~malloc13#1.base, main_#t~malloc13#1.offset := #Ultimate.allocOnStack(main_~n~0#1);main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset := main_#t~malloc13#1.base, main_#t~malloc13#1.offset;call main_#t~malloc14#1.base, main_#t~malloc14#1.offset := #Ultimate.allocOnStack(main_~length~0#1);main_~nondetString~0#1.base, main_~nondetString~0#1.offset := main_#t~malloc14#1.base, main_#t~malloc14#1.offset;main_~i~0#1 := 0bv32; {729#(and (= (_ bv1 32) |ULTIMATE.start_main_~length~0#1|) (= |ULTIMATE.start_main_~i~0#1| (_ bv0 32)))} is VALID [2022-02-20 23:40:57,185 INFO L290 TraceCheckUtils]: 5: Hoare triple {729#(and (= (_ bv1 32) |ULTIMATE.start_main_~length~0#1|) (= |ULTIMATE.start_main_~i~0#1| (_ bv0 32)))} assume !!~bvslt32(main_~i~0#1, ~bvsub32(main_~length~0#1, 1bv32)); {712#false} is VALID [2022-02-20 23:40:57,186 INFO L290 TraceCheckUtils]: 6: Hoare triple {712#false} assume !((~bvule32(~bvadd32(1bv32, ~bvadd32(main_~nondetString~0#1.offset, main_~i~0#1)), #length[main_~nondetString~0#1.base]) && ~bvule32(~bvadd32(main_~nondetString~0#1.offset, main_~i~0#1), ~bvadd32(1bv32, ~bvadd32(main_~nondetString~0#1.offset, main_~i~0#1)))) && ~bvule32(0bv32, ~bvadd32(main_~nondetString~0#1.offset, main_~i~0#1))); {712#false} is VALID [2022-02-20 23:40:57,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:40:57,186 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:40:57,186 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:40:57,186 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1512043411] [2022-02-20 23:40:57,186 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1512043411] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:40:57,187 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:40:57,187 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:40:57,187 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738376528] [2022-02-20 23:40:57,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:40:57,187 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 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 7 [2022-02-20 23:40:57,187 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:40:57,188 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 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:40:57,196 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:40:57,196 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:40:57,196 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:40:57,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:40:57,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:40:57,197 INFO L87 Difference]: Start difference. First operand 62 states and 71 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 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:40:57,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:40:57,519 INFO L93 Difference]: Finished difference Result 102 states and 112 transitions. [2022-02-20 23:40:57,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 23:40:57,519 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 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 7 [2022-02-20 23:40:57,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:40:57,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 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:40:57,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 113 transitions. [2022-02-20 23:40:57,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 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:40:57,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 113 transitions. [2022-02-20 23:40:57,521 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 113 transitions. [2022-02-20 23:40:57,632 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 113 edges. 113 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:40:57,634 INFO L225 Difference]: With dead ends: 102 [2022-02-20 23:40:57,634 INFO L226 Difference]: Without dead ends: 102 [2022-02-20 23:40:57,634 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 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:40:57,635 INFO L933 BasicCegarLoop]: 58 mSDtfsCounter, 50 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:40:57,635 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [50 Valid, 161 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:40:57,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-02-20 23:40:57,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 59. [2022-02-20 23:40:57,638 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:40:57,638 INFO L82 GeneralOperation]: Start isEquivalent. First operand 102 states. Second operand has 59 states, 38 states have (on average 1.736842105263158) internal successors, (66), 58 states have internal predecessors, (66), 0 states have call successors, (0), 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:40:57,638 INFO L74 IsIncluded]: Start isIncluded. First operand 102 states. Second operand has 59 states, 38 states have (on average 1.736842105263158) internal successors, (66), 58 states have internal predecessors, (66), 0 states have call successors, (0), 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:40:57,638 INFO L87 Difference]: Start difference. First operand 102 states. Second operand has 59 states, 38 states have (on average 1.736842105263158) internal successors, (66), 58 states have internal predecessors, (66), 0 states have call successors, (0), 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:40:57,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:40:57,640 INFO L93 Difference]: Finished difference Result 102 states and 112 transitions. [2022-02-20 23:40:57,640 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 112 transitions. [2022-02-20 23:40:57,640 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:40:57,640 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:40:57,640 INFO L74 IsIncluded]: Start isIncluded. First operand has 59 states, 38 states have (on average 1.736842105263158) internal successors, (66), 58 states have internal predecessors, (66), 0 states have call successors, (0), 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 102 states. [2022-02-20 23:40:57,641 INFO L87 Difference]: Start difference. First operand has 59 states, 38 states have (on average 1.736842105263158) internal successors, (66), 58 states have internal predecessors, (66), 0 states have call successors, (0), 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 102 states. [2022-02-20 23:40:57,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:40:57,643 INFO L93 Difference]: Finished difference Result 102 states and 112 transitions. [2022-02-20 23:40:57,643 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 112 transitions. [2022-02-20 23:40:57,643 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:40:57,643 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:40:57,643 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:40:57,644 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:40:57,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 38 states have (on average 1.736842105263158) internal successors, (66), 58 states have internal predecessors, (66), 0 states have call successors, (0), 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:40:57,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 66 transitions. [2022-02-20 23:40:57,645 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 66 transitions. Word has length 7 [2022-02-20 23:40:57,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:40:57,645 INFO L470 AbstractCegarLoop]: Abstraction has 59 states and 66 transitions. [2022-02-20 23:40:57,645 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 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:40:57,645 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 66 transitions. [2022-02-20 23:40:57,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-02-20 23:40:57,646 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:40:57,646 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:40:57,654 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-02-20 23:40:57,852 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:40:57,852 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2022-02-20 23:40:57,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:40:57,853 INFO L85 PathProgramCache]: Analyzing trace with hash 1806876086, now seen corresponding path program 1 times [2022-02-20 23:40:57,853 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:40:57,854 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1967786200] [2022-02-20 23:40:57,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:40:57,854 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:40:57,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:40:57,855 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:40:57,856 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-02-20 23:40:57,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:40:57,885 INFO L263 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 9 conjunts are in the unsatisfiable core [2022-02-20 23:40:57,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:40:57,891 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:40:57,936 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-02-20 23:40:57,936 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 1 case distinctions, treesize of input 9 treesize of output 15 [2022-02-20 23:40:57,995 INFO L290 TraceCheckUtils]: 0: Hoare triple {1100#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven; {1100#true} is VALID [2022-02-20 23:40:57,995 INFO L290 TraceCheckUtils]: 1: Hoare triple {1100#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~nondet12#1, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_#t~nondet16#1, main_#t~post15#1, main_~i~0#1, main_#t~ret17#1.base, main_#t~ret17#1.offset, main_~length~0#1, main_~n~0#1, main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset, main_~nondetString~0#1.base, main_~nondetString~0#1.offset;main_~length~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;main_~n~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; {1100#true} is VALID [2022-02-20 23:40:57,996 INFO L290 TraceCheckUtils]: 2: Hoare triple {1100#true} assume !~bvslt32(main_~length~0#1, 1bv32); {1111#(not (bvslt |ULTIMATE.start_main_~length~0#1| (_ bv1 32)))} is VALID [2022-02-20 23:40:57,996 INFO L290 TraceCheckUtils]: 3: Hoare triple {1111#(not (bvslt |ULTIMATE.start_main_~length~0#1| (_ bv1 32)))} assume ~bvslt32(main_~n~0#1, 1bv32);main_~n~0#1 := 1bv32; {1111#(not (bvslt |ULTIMATE.start_main_~length~0#1| (_ bv1 32)))} is VALID [2022-02-20 23:40:57,998 INFO L290 TraceCheckUtils]: 4: Hoare triple {1111#(not (bvslt |ULTIMATE.start_main_~length~0#1| (_ bv1 32)))} call main_#t~malloc13#1.base, main_#t~malloc13#1.offset := #Ultimate.allocOnStack(main_~n~0#1);main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset := main_#t~malloc13#1.base, main_#t~malloc13#1.offset;call main_#t~malloc14#1.base, main_#t~malloc14#1.offset := #Ultimate.allocOnStack(main_~length~0#1);main_~nondetString~0#1.base, main_~nondetString~0#1.offset := main_#t~malloc14#1.base, main_#t~malloc14#1.offset;main_~i~0#1 := 0bv32; {1118#(and (= (select |#length| |ULTIMATE.start_main_~nondetString~0#1.base|) |ULTIMATE.start_main_~length~0#1|) (not (bvslt |ULTIMATE.start_main_~length~0#1| (_ bv1 32))) (= |ULTIMATE.start_main_~i~0#1| (_ bv0 32)) (= |ULTIMATE.start_main_~nondetString~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:40:57,999 INFO L290 TraceCheckUtils]: 5: Hoare triple {1118#(and (= (select |#length| |ULTIMATE.start_main_~nondetString~0#1.base|) |ULTIMATE.start_main_~length~0#1|) (not (bvslt |ULTIMATE.start_main_~length~0#1| (_ bv1 32))) (= |ULTIMATE.start_main_~i~0#1| (_ bv0 32)) (= |ULTIMATE.start_main_~nondetString~0#1.offset| (_ bv0 32)))} assume !~bvslt32(main_~i~0#1, ~bvsub32(main_~length~0#1, 1bv32)); {1122#(and (= (select |#length| |ULTIMATE.start_main_~nondetString~0#1.base|) |ULTIMATE.start_main_~length~0#1|) (not (bvslt (_ bv0 32) (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~length~0#1|))) (not (bvslt |ULTIMATE.start_main_~length~0#1| (_ bv1 32))) (= |ULTIMATE.start_main_~nondetString~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:40:58,000 INFO L290 TraceCheckUtils]: 6: Hoare triple {1122#(and (= (select |#length| |ULTIMATE.start_main_~nondetString~0#1.base|) |ULTIMATE.start_main_~length~0#1|) (not (bvslt (_ bv0 32) (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~length~0#1|))) (not (bvslt |ULTIMATE.start_main_~length~0#1| (_ bv1 32))) (= |ULTIMATE.start_main_~nondetString~0#1.offset| (_ bv0 32)))} assume !((~bvule32(~bvadd32(1bv32, ~bvadd32(main_~nondetString~0#1.offset, ~bvsub32(main_~length~0#1, 1bv32))), #length[main_~nondetString~0#1.base]) && ~bvule32(~bvadd32(main_~nondetString~0#1.offset, ~bvsub32(main_~length~0#1, 1bv32)), ~bvadd32(1bv32, ~bvadd32(main_~nondetString~0#1.offset, ~bvsub32(main_~length~0#1, 1bv32))))) && ~bvule32(0bv32, ~bvadd32(main_~nondetString~0#1.offset, ~bvsub32(main_~length~0#1, 1bv32)))); {1101#false} is VALID [2022-02-20 23:40:58,000 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:40:58,000 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:40:58,000 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:40:58,000 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1967786200] [2022-02-20 23:40:58,000 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1967786200] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:40:58,000 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:40:58,001 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:40:58,001 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381974502] [2022-02-20 23:40:58,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:40:58,001 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 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 7 [2022-02-20 23:40:58,001 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:40:58,001 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 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:40:58,011 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:40:58,011 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:40:58,011 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:40:58,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:40:58,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:40:58,012 INFO L87 Difference]: Start difference. First operand 59 states and 66 transitions. Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 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:40:58,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:40:58,553 INFO L93 Difference]: Finished difference Result 65 states and 73 transitions. [2022-02-20 23:40:58,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 23:40:58,553 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 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 7 [2022-02-20 23:40:58,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:40:58,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 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:40:58,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2022-02-20 23:40:58,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 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:40:58,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2022-02-20 23:40:58,555 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 70 transitions. [2022-02-20 23:40:58,633 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:40:58,634 INFO L225 Difference]: With dead ends: 65 [2022-02-20 23:40:58,634 INFO L226 Difference]: Without dead ends: 65 [2022-02-20 23:40:58,634 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:40:58,635 INFO L933 BasicCegarLoop]: 53 mSDtfsCounter, 67 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:40:58,635 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [67 Valid, 114 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:40:58,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-02-20 23:40:58,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 61. [2022-02-20 23:40:58,638 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:40:58,638 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand has 61 states, 40 states have (on average 1.725) internal successors, (69), 60 states have internal predecessors, (69), 0 states have call successors, (0), 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:40:58,638 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand has 61 states, 40 states have (on average 1.725) internal successors, (69), 60 states have internal predecessors, (69), 0 states have call successors, (0), 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:40:58,638 INFO L87 Difference]: Start difference. First operand 65 states. Second operand has 61 states, 40 states have (on average 1.725) internal successors, (69), 60 states have internal predecessors, (69), 0 states have call successors, (0), 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:40:58,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:40:58,639 INFO L93 Difference]: Finished difference Result 65 states and 73 transitions. [2022-02-20 23:40:58,639 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 73 transitions. [2022-02-20 23:40:58,639 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:40:58,639 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:40:58,640 INFO L74 IsIncluded]: Start isIncluded. First operand has 61 states, 40 states have (on average 1.725) internal successors, (69), 60 states have internal predecessors, (69), 0 states have call successors, (0), 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:40:58,640 INFO L87 Difference]: Start difference. First operand has 61 states, 40 states have (on average 1.725) internal successors, (69), 60 states have internal predecessors, (69), 0 states have call successors, (0), 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:40:58,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:40:58,641 INFO L93 Difference]: Finished difference Result 65 states and 73 transitions. [2022-02-20 23:40:58,641 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 73 transitions. [2022-02-20 23:40:58,641 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:40:58,641 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:40:58,641 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:40:58,641 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:40:58,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 40 states have (on average 1.725) internal successors, (69), 60 states have internal predecessors, (69), 0 states have call successors, (0), 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:40:58,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 69 transitions. [2022-02-20 23:40:58,643 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 69 transitions. Word has length 7 [2022-02-20 23:40:58,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:40:58,643 INFO L470 AbstractCegarLoop]: Abstraction has 61 states and 69 transitions. [2022-02-20 23:40:58,643 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 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:40:58,643 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 69 transitions. [2022-02-20 23:40:58,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-02-20 23:40:58,643 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:40:58,643 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:40:58,650 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-02-20 23:40:58,849 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:40:58,850 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2022-02-20 23:40:58,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:40:58,850 INFO L85 PathProgramCache]: Analyzing trace with hash -533877068, now seen corresponding path program 1 times [2022-02-20 23:40:58,850 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:40:58,850 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1526263398] [2022-02-20 23:40:58,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:40:58,851 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:40:58,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:40:58,852 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:40:58,852 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-02-20 23:40:58,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:40:58,895 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 23:40:58,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:40:58,900 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:40:58,919 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:40:58,922 INFO L290 TraceCheckUtils]: 0: Hoare triple {1383#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven; {1383#true} is VALID [2022-02-20 23:40:58,923 INFO L290 TraceCheckUtils]: 1: Hoare triple {1383#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~nondet12#1, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_#t~nondet16#1, main_#t~post15#1, main_~i~0#1, main_#t~ret17#1.base, main_#t~ret17#1.offset, main_~length~0#1, main_~n~0#1, main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset, main_~nondetString~0#1.base, main_~nondetString~0#1.offset;main_~length~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;main_~n~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; {1383#true} is VALID [2022-02-20 23:40:58,923 INFO L290 TraceCheckUtils]: 2: Hoare triple {1383#true} assume ~bvslt32(main_~length~0#1, 1bv32);main_~length~0#1 := 1bv32; {1383#true} is VALID [2022-02-20 23:40:58,923 INFO L290 TraceCheckUtils]: 3: Hoare triple {1383#true} assume ~bvslt32(main_~n~0#1, 1bv32);main_~n~0#1 := 1bv32; {1383#true} is VALID [2022-02-20 23:40:58,923 INFO L290 TraceCheckUtils]: 4: Hoare triple {1383#true} call main_#t~malloc13#1.base, main_#t~malloc13#1.offset := #Ultimate.allocOnStack(main_~n~0#1);main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset := main_#t~malloc13#1.base, main_#t~malloc13#1.offset;call main_#t~malloc14#1.base, main_#t~malloc14#1.offset := #Ultimate.allocOnStack(main_~length~0#1);main_~nondetString~0#1.base, main_~nondetString~0#1.offset := main_#t~malloc14#1.base, main_#t~malloc14#1.offset;main_~i~0#1 := 0bv32; {1383#true} is VALID [2022-02-20 23:40:58,923 INFO L290 TraceCheckUtils]: 5: Hoare triple {1383#true} assume !~bvslt32(main_~i~0#1, ~bvsub32(main_~length~0#1, 1bv32)); {1383#true} is VALID [2022-02-20 23:40:58,923 INFO L290 TraceCheckUtils]: 6: Hoare triple {1383#true} SUMMARY for call write~intINTTYPE1(0bv8, main_~nondetString~0#1.base, ~bvadd32(main_~nondetString~0#1.offset, ~bvsub32(main_~length~0#1, 1bv32)), 1bv32); srcloc: L543-4 {1383#true} is VALID [2022-02-20 23:40:58,925 INFO L290 TraceCheckUtils]: 7: Hoare triple {1383#true} assume { :begin_inline_cstpncpy } true;cstpncpy_#in~dst#1.base, cstpncpy_#in~dst#1.offset, cstpncpy_#in~src#1.base, cstpncpy_#in~src#1.offset, cstpncpy_#in~n#1 := main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset, main_~nondetString~0#1.base, main_~nondetString~0#1.offset, main_~n~0#1;havoc cstpncpy_#res#1.base, cstpncpy_#res#1.offset;havoc cstpncpy_#t~mem2#1.base, cstpncpy_#t~mem2#1.offset, cstpncpy_#t~mem3#1.base, cstpncpy_#t~mem3#1.offset, cstpncpy_#t~post5#1.base, cstpncpy_#t~post5#1.offset, cstpncpy_#t~post6#1.base, cstpncpy_#t~post6#1.offset, cstpncpy_#t~mem7#1, cstpncpy_#t~post9#1.base, cstpncpy_#t~post9#1.offset, cstpncpy_#t~pre8#1, cstpncpy_#t~pre4#1, cstpncpy_~d~0#1.base, cstpncpy_~d~0#1.offset, cstpncpy_~s~0#1.base, cstpncpy_~s~0#1.offset, cstpncpy_#t~mem10#1.base, cstpncpy_#t~mem10#1.offset, cstpncpy_~#dst#1.base, cstpncpy_~#dst#1.offset, cstpncpy_~src#1.base, cstpncpy_~src#1.offset, cstpncpy_~n#1;call cstpncpy_~#dst#1.base, cstpncpy_~#dst#1.offset := #Ultimate.allocOnStack(4bv32); {1409#(= (select |#valid| |ULTIMATE.start_cstpncpy_~#dst#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:40:58,925 INFO L290 TraceCheckUtils]: 8: Hoare triple {1409#(= (select |#valid| |ULTIMATE.start_cstpncpy_~#dst#1.base|) (_ bv1 1))} assume !(1bv1 == #valid[cstpncpy_~#dst#1.base]); {1384#false} is VALID [2022-02-20 23:40:58,925 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:40:58,925 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:40:58,925 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:40:58,926 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1526263398] [2022-02-20 23:40:58,926 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1526263398] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:40:58,926 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:40:58,926 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:40:58,926 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195791781] [2022-02-20 23:40:58,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:40:58,926 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 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:40:58,927 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:40:58,927 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 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:40:58,935 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:40:58,935 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:40:58,935 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:40:58,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:40:58,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:40:58,936 INFO L87 Difference]: Start difference. First operand 61 states and 69 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 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:40:59,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:40:59,113 INFO L93 Difference]: Finished difference Result 55 states and 63 transitions. [2022-02-20 23:40:59,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:40:59,113 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 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:40:59,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:40:59,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 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:40:59,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 61 transitions. [2022-02-20 23:40:59,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 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:40:59,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 61 transitions. [2022-02-20 23:40:59,115 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 61 transitions. [2022-02-20 23:40:59,172 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:40:59,173 INFO L225 Difference]: With dead ends: 55 [2022-02-20 23:40:59,173 INFO L226 Difference]: Without dead ends: 55 [2022-02-20 23:40:59,173 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 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:40:59,174 INFO L933 BasicCegarLoop]: 36 mSDtfsCounter, 36 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:40:59,174 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 46 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:40:59,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-02-20 23:40:59,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2022-02-20 23:40:59,176 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:40:59,176 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand has 55 states, 40 states have (on average 1.575) internal successors, (63), 54 states have internal predecessors, (63), 0 states have call successors, (0), 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:40:59,176 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand has 55 states, 40 states have (on average 1.575) internal successors, (63), 54 states have internal predecessors, (63), 0 states have call successors, (0), 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:40:59,176 INFO L87 Difference]: Start difference. First operand 55 states. Second operand has 55 states, 40 states have (on average 1.575) internal successors, (63), 54 states have internal predecessors, (63), 0 states have call successors, (0), 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:40:59,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:40:59,177 INFO L93 Difference]: Finished difference Result 55 states and 63 transitions. [2022-02-20 23:40:59,177 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2022-02-20 23:40:59,177 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:40:59,177 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:40:59,178 INFO L74 IsIncluded]: Start isIncluded. First operand has 55 states, 40 states have (on average 1.575) internal successors, (63), 54 states have internal predecessors, (63), 0 states have call successors, (0), 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 55 states. [2022-02-20 23:40:59,178 INFO L87 Difference]: Start difference. First operand has 55 states, 40 states have (on average 1.575) internal successors, (63), 54 states have internal predecessors, (63), 0 states have call successors, (0), 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 55 states. [2022-02-20 23:40:59,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:40:59,179 INFO L93 Difference]: Finished difference Result 55 states and 63 transitions. [2022-02-20 23:40:59,179 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2022-02-20 23:40:59,179 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:40:59,179 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:40:59,179 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:40:59,179 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:40:59,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 40 states have (on average 1.575) internal successors, (63), 54 states have internal predecessors, (63), 0 states have call successors, (0), 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:40:59,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 63 transitions. [2022-02-20 23:40:59,180 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 63 transitions. Word has length 9 [2022-02-20 23:40:59,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:40:59,180 INFO L470 AbstractCegarLoop]: Abstraction has 55 states and 63 transitions. [2022-02-20 23:40:59,180 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 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:40:59,181 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2022-02-20 23:40:59,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-02-20 23:40:59,181 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:40:59,181 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:40:59,187 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-02-20 23:40:59,387 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:40:59,387 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2022-02-20 23:40:59,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:40:59,388 INFO L85 PathProgramCache]: Analyzing trace with hash -533877067, now seen corresponding path program 1 times [2022-02-20 23:40:59,388 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:40:59,388 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [534586851] [2022-02-20 23:40:59,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:40:59,388 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:40:59,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:40:59,389 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:40:59,389 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-02-20 23:40:59,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:40:59,430 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 23:40:59,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:40:59,438 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:40:59,464 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:40:59,471 INFO L290 TraceCheckUtils]: 0: Hoare triple {1632#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven; {1632#true} is VALID [2022-02-20 23:40:59,471 INFO L290 TraceCheckUtils]: 1: Hoare triple {1632#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~nondet12#1, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_#t~nondet16#1, main_#t~post15#1, main_~i~0#1, main_#t~ret17#1.base, main_#t~ret17#1.offset, main_~length~0#1, main_~n~0#1, main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset, main_~nondetString~0#1.base, main_~nondetString~0#1.offset;main_~length~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;main_~n~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; {1632#true} is VALID [2022-02-20 23:40:59,471 INFO L290 TraceCheckUtils]: 2: Hoare triple {1632#true} assume ~bvslt32(main_~length~0#1, 1bv32);main_~length~0#1 := 1bv32; {1632#true} is VALID [2022-02-20 23:40:59,471 INFO L290 TraceCheckUtils]: 3: Hoare triple {1632#true} assume ~bvslt32(main_~n~0#1, 1bv32);main_~n~0#1 := 1bv32; {1632#true} is VALID [2022-02-20 23:40:59,472 INFO L290 TraceCheckUtils]: 4: Hoare triple {1632#true} call main_#t~malloc13#1.base, main_#t~malloc13#1.offset := #Ultimate.allocOnStack(main_~n~0#1);main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset := main_#t~malloc13#1.base, main_#t~malloc13#1.offset;call main_#t~malloc14#1.base, main_#t~malloc14#1.offset := #Ultimate.allocOnStack(main_~length~0#1);main_~nondetString~0#1.base, main_~nondetString~0#1.offset := main_#t~malloc14#1.base, main_#t~malloc14#1.offset;main_~i~0#1 := 0bv32; {1632#true} is VALID [2022-02-20 23:40:59,472 INFO L290 TraceCheckUtils]: 5: Hoare triple {1632#true} assume !~bvslt32(main_~i~0#1, ~bvsub32(main_~length~0#1, 1bv32)); {1632#true} is VALID [2022-02-20 23:40:59,472 INFO L290 TraceCheckUtils]: 6: Hoare triple {1632#true} SUMMARY for call write~intINTTYPE1(0bv8, main_~nondetString~0#1.base, ~bvadd32(main_~nondetString~0#1.offset, ~bvsub32(main_~length~0#1, 1bv32)), 1bv32); srcloc: L543-4 {1632#true} is VALID [2022-02-20 23:40:59,473 INFO L290 TraceCheckUtils]: 7: Hoare triple {1632#true} assume { :begin_inline_cstpncpy } true;cstpncpy_#in~dst#1.base, cstpncpy_#in~dst#1.offset, cstpncpy_#in~src#1.base, cstpncpy_#in~src#1.offset, cstpncpy_#in~n#1 := main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset, main_~nondetString~0#1.base, main_~nondetString~0#1.offset, main_~n~0#1;havoc cstpncpy_#res#1.base, cstpncpy_#res#1.offset;havoc cstpncpy_#t~mem2#1.base, cstpncpy_#t~mem2#1.offset, cstpncpy_#t~mem3#1.base, cstpncpy_#t~mem3#1.offset, cstpncpy_#t~post5#1.base, cstpncpy_#t~post5#1.offset, cstpncpy_#t~post6#1.base, cstpncpy_#t~post6#1.offset, cstpncpy_#t~mem7#1, cstpncpy_#t~post9#1.base, cstpncpy_#t~post9#1.offset, cstpncpy_#t~pre8#1, cstpncpy_#t~pre4#1, cstpncpy_~d~0#1.base, cstpncpy_~d~0#1.offset, cstpncpy_~s~0#1.base, cstpncpy_~s~0#1.offset, cstpncpy_#t~mem10#1.base, cstpncpy_#t~mem10#1.offset, cstpncpy_~#dst#1.base, cstpncpy_~#dst#1.offset, cstpncpy_~src#1.base, cstpncpy_~src#1.offset, cstpncpy_~n#1;call cstpncpy_~#dst#1.base, cstpncpy_~#dst#1.offset := #Ultimate.allocOnStack(4bv32); {1658#(and (= |ULTIMATE.start_cstpncpy_~#dst#1.offset| (_ bv0 32)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_cstpncpy_~#dst#1.base|)))} is VALID [2022-02-20 23:40:59,474 INFO L290 TraceCheckUtils]: 8: Hoare triple {1658#(and (= |ULTIMATE.start_cstpncpy_~#dst#1.offset| (_ bv0 32)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_cstpncpy_~#dst#1.base|)))} assume !((~bvule32(~bvadd32(4bv32, cstpncpy_~#dst#1.offset), #length[cstpncpy_~#dst#1.base]) && ~bvule32(cstpncpy_~#dst#1.offset, ~bvadd32(4bv32, cstpncpy_~#dst#1.offset))) && ~bvule32(0bv32, cstpncpy_~#dst#1.offset)); {1633#false} is VALID [2022-02-20 23:40:59,474 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:40:59,474 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:40:59,474 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:40:59,474 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [534586851] [2022-02-20 23:40:59,474 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [534586851] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:40:59,474 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:40:59,475 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:40:59,475 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675063537] [2022-02-20 23:40:59,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:40:59,475 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 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:40:59,475 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:40:59,475 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 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:40:59,485 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:40:59,486 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:40:59,486 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:40:59,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:40:59,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:40:59,487 INFO L87 Difference]: Start difference. First operand 55 states and 63 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 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:40:59,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:40:59,657 INFO L93 Difference]: Finished difference Result 49 states and 57 transitions. [2022-02-20 23:40:59,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:40:59,658 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 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:40:59,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:40:59,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 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:40:59,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2022-02-20 23:40:59,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 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:40:59,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2022-02-20 23:40:59,659 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 55 transitions. [2022-02-20 23:40:59,723 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:40:59,723 INFO L225 Difference]: With dead ends: 49 [2022-02-20 23:40:59,724 INFO L226 Difference]: Without dead ends: 49 [2022-02-20 23:40:59,724 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 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:40:59,725 INFO L933 BasicCegarLoop]: 36 mSDtfsCounter, 30 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:40:59,726 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 48 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:40:59,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-02-20 23:40:59,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2022-02-20 23:40:59,727 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:40:59,728 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand has 49 states, 40 states have (on average 1.425) internal successors, (57), 48 states have internal predecessors, (57), 0 states have call successors, (0), 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:40:59,728 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand has 49 states, 40 states have (on average 1.425) internal successors, (57), 48 states have internal predecessors, (57), 0 states have call successors, (0), 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:40:59,728 INFO L87 Difference]: Start difference. First operand 49 states. Second operand has 49 states, 40 states have (on average 1.425) internal successors, (57), 48 states have internal predecessors, (57), 0 states have call successors, (0), 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:40:59,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:40:59,729 INFO L93 Difference]: Finished difference Result 49 states and 57 transitions. [2022-02-20 23:40:59,729 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 57 transitions. [2022-02-20 23:40:59,729 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:40:59,729 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:40:59,729 INFO L74 IsIncluded]: Start isIncluded. First operand has 49 states, 40 states have (on average 1.425) internal successors, (57), 48 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 49 states. [2022-02-20 23:40:59,729 INFO L87 Difference]: Start difference. First operand has 49 states, 40 states have (on average 1.425) internal successors, (57), 48 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 49 states. [2022-02-20 23:40:59,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:40:59,730 INFO L93 Difference]: Finished difference Result 49 states and 57 transitions. [2022-02-20 23:40:59,730 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 57 transitions. [2022-02-20 23:40:59,731 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:40:59,731 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:40:59,731 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:40:59,731 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:40:59,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 40 states have (on average 1.425) internal successors, (57), 48 states have internal predecessors, (57), 0 states have call successors, (0), 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:40:59,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 57 transitions. [2022-02-20 23:40:59,732 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 57 transitions. Word has length 9 [2022-02-20 23:40:59,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:40:59,732 INFO L470 AbstractCegarLoop]: Abstraction has 49 states and 57 transitions. [2022-02-20 23:40:59,732 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 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:40:59,732 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 57 transitions. [2022-02-20 23:40:59,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-20 23:40:59,733 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:40:59,733 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:40:59,739 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Ended with exit code 0 [2022-02-20 23:40:59,938 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:40:59,939 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2022-02-20 23:40:59,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:40:59,939 INFO L85 PathProgramCache]: Analyzing trace with hash -1226025223, now seen corresponding path program 1 times [2022-02-20 23:40:59,940 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:40:59,940 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [172035605] [2022-02-20 23:40:59,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:40:59,940 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:40:59,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:40:59,941 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:40:59,941 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-02-20 23:40:59,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:40:59,987 INFO L263 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 11 conjunts are in the unsatisfiable core [2022-02-20 23:40:59,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:40:59,995 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:41:00,043 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-02-20 23:41:00,043 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 1 case distinctions, treesize of input 9 treesize of output 15 [2022-02-20 23:41:00,252 INFO L290 TraceCheckUtils]: 0: Hoare triple {1857#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven; {1857#true} is VALID [2022-02-20 23:41:00,252 INFO L290 TraceCheckUtils]: 1: Hoare triple {1857#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~nondet12#1, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_#t~nondet16#1, main_#t~post15#1, main_~i~0#1, main_#t~ret17#1.base, main_#t~ret17#1.offset, main_~length~0#1, main_~n~0#1, main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset, main_~nondetString~0#1.base, main_~nondetString~0#1.offset;main_~length~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;main_~n~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; {1857#true} is VALID [2022-02-20 23:41:00,252 INFO L290 TraceCheckUtils]: 2: Hoare triple {1857#true} assume !~bvslt32(main_~length~0#1, 1bv32); {1868#(not (bvslt |ULTIMATE.start_main_~length~0#1| (_ bv1 32)))} is VALID [2022-02-20 23:41:00,253 INFO L290 TraceCheckUtils]: 3: Hoare triple {1868#(not (bvslt |ULTIMATE.start_main_~length~0#1| (_ bv1 32)))} assume ~bvslt32(main_~n~0#1, 1bv32);main_~n~0#1 := 1bv32; {1868#(not (bvslt |ULTIMATE.start_main_~length~0#1| (_ bv1 32)))} is VALID [2022-02-20 23:41:00,254 INFO L290 TraceCheckUtils]: 4: Hoare triple {1868#(not (bvslt |ULTIMATE.start_main_~length~0#1| (_ bv1 32)))} call main_#t~malloc13#1.base, main_#t~malloc13#1.offset := #Ultimate.allocOnStack(main_~n~0#1);main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset := main_#t~malloc13#1.base, main_#t~malloc13#1.offset;call main_#t~malloc14#1.base, main_#t~malloc14#1.offset := #Ultimate.allocOnStack(main_~length~0#1);main_~nondetString~0#1.base, main_~nondetString~0#1.offset := main_#t~malloc14#1.base, main_#t~malloc14#1.offset;main_~i~0#1 := 0bv32; {1875#(and (= (select |#length| |ULTIMATE.start_main_~nondetString~0#1.base|) |ULTIMATE.start_main_~length~0#1|) (not (bvslt |ULTIMATE.start_main_~length~0#1| (_ bv1 32))) (= |ULTIMATE.start_main_~i~0#1| (_ bv0 32)) (= |ULTIMATE.start_main_~nondetString~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:41:00,257 INFO L290 TraceCheckUtils]: 5: Hoare triple {1875#(and (= (select |#length| |ULTIMATE.start_main_~nondetString~0#1.base|) |ULTIMATE.start_main_~length~0#1|) (not (bvslt |ULTIMATE.start_main_~length~0#1| (_ bv1 32))) (= |ULTIMATE.start_main_~i~0#1| (_ bv0 32)) (= |ULTIMATE.start_main_~nondetString~0#1.offset| (_ bv0 32)))} assume !!~bvslt32(main_~i~0#1, ~bvsub32(main_~length~0#1, 1bv32)); {1879#(and (= (select |#length| |ULTIMATE.start_main_~nondetString~0#1.base|) |ULTIMATE.start_main_~length~0#1|) (not (bvslt |ULTIMATE.start_main_~length~0#1| (_ bv1 32))) (= |ULTIMATE.start_main_~i~0#1| (_ bv0 32)) (bvslt |ULTIMATE.start_main_~i~0#1| (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~length~0#1|)) (= |ULTIMATE.start_main_~nondetString~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:41:00,258 INFO L290 TraceCheckUtils]: 6: Hoare triple {1879#(and (= (select |#length| |ULTIMATE.start_main_~nondetString~0#1.base|) |ULTIMATE.start_main_~length~0#1|) (not (bvslt |ULTIMATE.start_main_~length~0#1| (_ bv1 32))) (= |ULTIMATE.start_main_~i~0#1| (_ bv0 32)) (bvslt |ULTIMATE.start_main_~i~0#1| (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~length~0#1|)) (= |ULTIMATE.start_main_~nondetString~0#1.offset| (_ bv0 32)))} SUMMARY for call write~intINTTYPE1(main_#t~nondet16#1, main_~nondetString~0#1.base, ~bvadd32(main_~nondetString~0#1.offset, main_~i~0#1), 1bv32); srcloc: L545 {1879#(and (= (select |#length| |ULTIMATE.start_main_~nondetString~0#1.base|) |ULTIMATE.start_main_~length~0#1|) (not (bvslt |ULTIMATE.start_main_~length~0#1| (_ bv1 32))) (= |ULTIMATE.start_main_~i~0#1| (_ bv0 32)) (bvslt |ULTIMATE.start_main_~i~0#1| (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~length~0#1|)) (= |ULTIMATE.start_main_~nondetString~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:41:00,258 INFO L290 TraceCheckUtils]: 7: Hoare triple {1879#(and (= (select |#length| |ULTIMATE.start_main_~nondetString~0#1.base|) |ULTIMATE.start_main_~length~0#1|) (not (bvslt |ULTIMATE.start_main_~length~0#1| (_ bv1 32))) (= |ULTIMATE.start_main_~i~0#1| (_ bv0 32)) (bvslt |ULTIMATE.start_main_~i~0#1| (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~length~0#1|)) (= |ULTIMATE.start_main_~nondetString~0#1.offset| (_ bv0 32)))} havoc main_#t~nondet16#1; {1879#(and (= (select |#length| |ULTIMATE.start_main_~nondetString~0#1.base|) |ULTIMATE.start_main_~length~0#1|) (not (bvslt |ULTIMATE.start_main_~length~0#1| (_ bv1 32))) (= |ULTIMATE.start_main_~i~0#1| (_ bv0 32)) (bvslt |ULTIMATE.start_main_~i~0#1| (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~length~0#1|)) (= |ULTIMATE.start_main_~nondetString~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:41:00,259 INFO L290 TraceCheckUtils]: 8: Hoare triple {1879#(and (= (select |#length| |ULTIMATE.start_main_~nondetString~0#1.base|) |ULTIMATE.start_main_~length~0#1|) (not (bvslt |ULTIMATE.start_main_~length~0#1| (_ bv1 32))) (= |ULTIMATE.start_main_~i~0#1| (_ bv0 32)) (bvslt |ULTIMATE.start_main_~i~0#1| (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~length~0#1|)) (= |ULTIMATE.start_main_~nondetString~0#1.offset| (_ bv0 32)))} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := ~bvadd32(1bv32, main_#t~post15#1);havoc main_#t~post15#1; {1889#(and (= (select |#length| |ULTIMATE.start_main_~nondetString~0#1.base|) |ULTIMATE.start_main_~length~0#1|) (not (bvslt |ULTIMATE.start_main_~length~0#1| (_ bv1 32))) (= (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~i~0#1|) (_ bv0 32)) (= |ULTIMATE.start_main_~nondetString~0#1.offset| (_ bv0 32)) (bvslt (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~i~0#1|) (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~length~0#1|)))} is VALID [2022-02-20 23:41:00,260 INFO L290 TraceCheckUtils]: 9: Hoare triple {1889#(and (= (select |#length| |ULTIMATE.start_main_~nondetString~0#1.base|) |ULTIMATE.start_main_~length~0#1|) (not (bvslt |ULTIMATE.start_main_~length~0#1| (_ bv1 32))) (= (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~i~0#1|) (_ bv0 32)) (= |ULTIMATE.start_main_~nondetString~0#1.offset| (_ bv0 32)) (bvslt (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~i~0#1|) (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~length~0#1|)))} assume !~bvslt32(main_~i~0#1, ~bvsub32(main_~length~0#1, 1bv32)); {1893#(and (= (select |#length| |ULTIMATE.start_main_~nondetString~0#1.base|) |ULTIMATE.start_main_~length~0#1|) (bvslt (_ bv0 32) (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~length~0#1|)) (= |ULTIMATE.start_main_~nondetString~0#1.offset| (_ bv0 32)) (not (bvslt (_ bv1 32) (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~length~0#1|))))} is VALID [2022-02-20 23:41:00,263 INFO L290 TraceCheckUtils]: 10: Hoare triple {1893#(and (= (select |#length| |ULTIMATE.start_main_~nondetString~0#1.base|) |ULTIMATE.start_main_~length~0#1|) (bvslt (_ bv0 32) (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~length~0#1|)) (= |ULTIMATE.start_main_~nondetString~0#1.offset| (_ bv0 32)) (not (bvslt (_ bv1 32) (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~length~0#1|))))} assume !((~bvule32(~bvadd32(1bv32, ~bvadd32(main_~nondetString~0#1.offset, ~bvsub32(main_~length~0#1, 1bv32))), #length[main_~nondetString~0#1.base]) && ~bvule32(~bvadd32(main_~nondetString~0#1.offset, ~bvsub32(main_~length~0#1, 1bv32)), ~bvadd32(1bv32, ~bvadd32(main_~nondetString~0#1.offset, ~bvsub32(main_~length~0#1, 1bv32))))) && ~bvule32(0bv32, ~bvadd32(main_~nondetString~0#1.offset, ~bvsub32(main_~length~0#1, 1bv32)))); {1858#false} is VALID [2022-02-20 23:41:00,263 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:41:00,263 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:41:00,697 INFO L290 TraceCheckUtils]: 10: Hoare triple {1897#(and (bvule (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~nondetString~0#1.offset| |ULTIMATE.start_main_~length~0#1|) (bvadd |ULTIMATE.start_main_~nondetString~0#1.offset| |ULTIMATE.start_main_~length~0#1|)) (bvule (bvadd |ULTIMATE.start_main_~nondetString~0#1.offset| |ULTIMATE.start_main_~length~0#1|) (select |#length| |ULTIMATE.start_main_~nondetString~0#1.base|)))} assume !((~bvule32(~bvadd32(1bv32, ~bvadd32(main_~nondetString~0#1.offset, ~bvsub32(main_~length~0#1, 1bv32))), #length[main_~nondetString~0#1.base]) && ~bvule32(~bvadd32(main_~nondetString~0#1.offset, ~bvsub32(main_~length~0#1, 1bv32)), ~bvadd32(1bv32, ~bvadd32(main_~nondetString~0#1.offset, ~bvsub32(main_~length~0#1, 1bv32))))) && ~bvule32(0bv32, ~bvadd32(main_~nondetString~0#1.offset, ~bvsub32(main_~length~0#1, 1bv32)))); {1858#false} is VALID [2022-02-20 23:41:00,699 INFO L290 TraceCheckUtils]: 9: Hoare triple {1901#(or (bvslt |ULTIMATE.start_main_~i~0#1| (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~length~0#1|)) (and (bvule (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~nondetString~0#1.offset| |ULTIMATE.start_main_~length~0#1|) (bvadd |ULTIMATE.start_main_~nondetString~0#1.offset| |ULTIMATE.start_main_~length~0#1|)) (bvule (bvadd |ULTIMATE.start_main_~nondetString~0#1.offset| |ULTIMATE.start_main_~length~0#1|) (select |#length| |ULTIMATE.start_main_~nondetString~0#1.base|))))} assume !~bvslt32(main_~i~0#1, ~bvsub32(main_~length~0#1, 1bv32)); {1897#(and (bvule (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~nondetString~0#1.offset| |ULTIMATE.start_main_~length~0#1|) (bvadd |ULTIMATE.start_main_~nondetString~0#1.offset| |ULTIMATE.start_main_~length~0#1|)) (bvule (bvadd |ULTIMATE.start_main_~nondetString~0#1.offset| |ULTIMATE.start_main_~length~0#1|) (select |#length| |ULTIMATE.start_main_~nondetString~0#1.base|)))} is VALID [2022-02-20 23:41:00,720 INFO L290 TraceCheckUtils]: 8: Hoare triple {1905#(or (bvslt (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv1 32)) (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~length~0#1|)) (and (bvule (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~nondetString~0#1.offset| |ULTIMATE.start_main_~length~0#1|) (bvadd |ULTIMATE.start_main_~nondetString~0#1.offset| |ULTIMATE.start_main_~length~0#1|)) (bvule (bvadd |ULTIMATE.start_main_~nondetString~0#1.offset| |ULTIMATE.start_main_~length~0#1|) (select |#length| |ULTIMATE.start_main_~nondetString~0#1.base|))))} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := ~bvadd32(1bv32, main_#t~post15#1);havoc main_#t~post15#1; {1901#(or (bvslt |ULTIMATE.start_main_~i~0#1| (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~length~0#1|)) (and (bvule (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~nondetString~0#1.offset| |ULTIMATE.start_main_~length~0#1|) (bvadd |ULTIMATE.start_main_~nondetString~0#1.offset| |ULTIMATE.start_main_~length~0#1|)) (bvule (bvadd |ULTIMATE.start_main_~nondetString~0#1.offset| |ULTIMATE.start_main_~length~0#1|) (select |#length| |ULTIMATE.start_main_~nondetString~0#1.base|))))} is VALID [2022-02-20 23:41:00,723 INFO L290 TraceCheckUtils]: 7: Hoare triple {1905#(or (bvslt (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv1 32)) (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~length~0#1|)) (and (bvule (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~nondetString~0#1.offset| |ULTIMATE.start_main_~length~0#1|) (bvadd |ULTIMATE.start_main_~nondetString~0#1.offset| |ULTIMATE.start_main_~length~0#1|)) (bvule (bvadd |ULTIMATE.start_main_~nondetString~0#1.offset| |ULTIMATE.start_main_~length~0#1|) (select |#length| |ULTIMATE.start_main_~nondetString~0#1.base|))))} havoc main_#t~nondet16#1; {1905#(or (bvslt (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv1 32)) (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~length~0#1|)) (and (bvule (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~nondetString~0#1.offset| |ULTIMATE.start_main_~length~0#1|) (bvadd |ULTIMATE.start_main_~nondetString~0#1.offset| |ULTIMATE.start_main_~length~0#1|)) (bvule (bvadd |ULTIMATE.start_main_~nondetString~0#1.offset| |ULTIMATE.start_main_~length~0#1|) (select |#length| |ULTIMATE.start_main_~nondetString~0#1.base|))))} is VALID [2022-02-20 23:41:00,725 INFO L290 TraceCheckUtils]: 6: Hoare triple {1905#(or (bvslt (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv1 32)) (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~length~0#1|)) (and (bvule (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~nondetString~0#1.offset| |ULTIMATE.start_main_~length~0#1|) (bvadd |ULTIMATE.start_main_~nondetString~0#1.offset| |ULTIMATE.start_main_~length~0#1|)) (bvule (bvadd |ULTIMATE.start_main_~nondetString~0#1.offset| |ULTIMATE.start_main_~length~0#1|) (select |#length| |ULTIMATE.start_main_~nondetString~0#1.base|))))} SUMMARY for call write~intINTTYPE1(main_#t~nondet16#1, main_~nondetString~0#1.base, ~bvadd32(main_~nondetString~0#1.offset, main_~i~0#1), 1bv32); srcloc: L545 {1905#(or (bvslt (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv1 32)) (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~length~0#1|)) (and (bvule (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~nondetString~0#1.offset| |ULTIMATE.start_main_~length~0#1|) (bvadd |ULTIMATE.start_main_~nondetString~0#1.offset| |ULTIMATE.start_main_~length~0#1|)) (bvule (bvadd |ULTIMATE.start_main_~nondetString~0#1.offset| |ULTIMATE.start_main_~length~0#1|) (select |#length| |ULTIMATE.start_main_~nondetString~0#1.base|))))} is VALID [2022-02-20 23:41:00,727 INFO L290 TraceCheckUtils]: 5: Hoare triple {1915#(or (bvslt (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv1 32)) (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~length~0#1|)) (and (bvule (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~nondetString~0#1.offset| |ULTIMATE.start_main_~length~0#1|) (bvadd |ULTIMATE.start_main_~nondetString~0#1.offset| |ULTIMATE.start_main_~length~0#1|)) (bvule (bvadd |ULTIMATE.start_main_~nondetString~0#1.offset| |ULTIMATE.start_main_~length~0#1|) (select |#length| |ULTIMATE.start_main_~nondetString~0#1.base|))) (not (bvslt |ULTIMATE.start_main_~i~0#1| (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~length~0#1|))))} assume !!~bvslt32(main_~i~0#1, ~bvsub32(main_~length~0#1, 1bv32)); {1905#(or (bvslt (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv1 32)) (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~length~0#1|)) (and (bvule (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~nondetString~0#1.offset| |ULTIMATE.start_main_~length~0#1|) (bvadd |ULTIMATE.start_main_~nondetString~0#1.offset| |ULTIMATE.start_main_~length~0#1|)) (bvule (bvadd |ULTIMATE.start_main_~nondetString~0#1.offset| |ULTIMATE.start_main_~length~0#1|) (select |#length| |ULTIMATE.start_main_~nondetString~0#1.base|))))} is VALID [2022-02-20 23:41:00,729 INFO L290 TraceCheckUtils]: 4: Hoare triple {1857#true} call main_#t~malloc13#1.base, main_#t~malloc13#1.offset := #Ultimate.allocOnStack(main_~n~0#1);main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset := main_#t~malloc13#1.base, main_#t~malloc13#1.offset;call main_#t~malloc14#1.base, main_#t~malloc14#1.offset := #Ultimate.allocOnStack(main_~length~0#1);main_~nondetString~0#1.base, main_~nondetString~0#1.offset := main_#t~malloc14#1.base, main_#t~malloc14#1.offset;main_~i~0#1 := 0bv32; {1915#(or (bvslt (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv1 32)) (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~length~0#1|)) (and (bvule (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~nondetString~0#1.offset| |ULTIMATE.start_main_~length~0#1|) (bvadd |ULTIMATE.start_main_~nondetString~0#1.offset| |ULTIMATE.start_main_~length~0#1|)) (bvule (bvadd |ULTIMATE.start_main_~nondetString~0#1.offset| |ULTIMATE.start_main_~length~0#1|) (select |#length| |ULTIMATE.start_main_~nondetString~0#1.base|))) (not (bvslt |ULTIMATE.start_main_~i~0#1| (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~length~0#1|))))} is VALID [2022-02-20 23:41:00,730 INFO L290 TraceCheckUtils]: 3: Hoare triple {1857#true} assume ~bvslt32(main_~n~0#1, 1bv32);main_~n~0#1 := 1bv32; {1857#true} is VALID [2022-02-20 23:41:00,730 INFO L290 TraceCheckUtils]: 2: Hoare triple {1857#true} assume !~bvslt32(main_~length~0#1, 1bv32); {1857#true} is VALID [2022-02-20 23:41:00,730 INFO L290 TraceCheckUtils]: 1: Hoare triple {1857#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~nondet12#1, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_#t~nondet16#1, main_#t~post15#1, main_~i~0#1, main_#t~ret17#1.base, main_#t~ret17#1.offset, main_~length~0#1, main_~n~0#1, main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset, main_~nondetString~0#1.base, main_~nondetString~0#1.offset;main_~length~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;main_~n~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; {1857#true} is VALID [2022-02-20 23:41:00,730 INFO L290 TraceCheckUtils]: 0: Hoare triple {1857#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven; {1857#true} is VALID [2022-02-20 23:41:00,730 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:41:00,730 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:41:00,730 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [172035605] [2022-02-20 23:41:00,730 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [172035605] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:41:00,730 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 23:41:00,730 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 10 [2022-02-20 23:41:00,730 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829008208] [2022-02-20 23:41:00,731 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 23:41:00,731 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.0) internal successors, (20), 11 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-02-20 23:41:00,731 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:41:00,731 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 11 states, 10 states have (on average 2.0) internal successors, (20), 11 states have internal predecessors, (20), 0 states have call successors, (0), 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:41:00,771 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:41:00,771 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-20 23:41:00,771 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:41:00,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-20 23:41:00,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2022-02-20 23:41:00,772 INFO L87 Difference]: Start difference. First operand 49 states and 57 transitions. Second operand has 11 states, 10 states have (on average 2.0) internal successors, (20), 11 states have internal predecessors, (20), 0 states have call successors, (0), 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:41:04,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:41:04,095 INFO L93 Difference]: Finished difference Result 117 states and 132 transitions. [2022-02-20 23:41:04,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-20 23:41:04,095 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.0) internal successors, (20), 11 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-02-20 23:41:04,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:41:04,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 2.0) internal successors, (20), 11 states have internal predecessors, (20), 0 states have call successors, (0), 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:41:04,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 131 transitions. [2022-02-20 23:41:04,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 2.0) internal successors, (20), 11 states have internal predecessors, (20), 0 states have call successors, (0), 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:41:04,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 131 transitions. [2022-02-20 23:41:04,098 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 131 transitions. [2022-02-20 23:41:04,321 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 131 edges. 131 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:41:04,322 INFO L225 Difference]: With dead ends: 117 [2022-02-20 23:41:04,322 INFO L226 Difference]: Without dead ends: 117 [2022-02-20 23:41:04,323 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=77, Invalid=105, Unknown=0, NotChecked=0, Total=182 [2022-02-20 23:41:04,323 INFO L933 BasicCegarLoop]: 50 mSDtfsCounter, 243 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-02-20 23:41:04,323 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [243 Valid, 213 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-02-20 23:41:04,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2022-02-20 23:41:04,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 51. [2022-02-20 23:41:04,325 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:41:04,326 INFO L82 GeneralOperation]: Start isEquivalent. First operand 117 states. Second operand has 51 states, 43 states have (on average 1.3953488372093024) internal successors, (60), 50 states have internal predecessors, (60), 0 states have call successors, (0), 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:41:04,326 INFO L74 IsIncluded]: Start isIncluded. First operand 117 states. Second operand has 51 states, 43 states have (on average 1.3953488372093024) internal successors, (60), 50 states have internal predecessors, (60), 0 states have call successors, (0), 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:41:04,326 INFO L87 Difference]: Start difference. First operand 117 states. Second operand has 51 states, 43 states have (on average 1.3953488372093024) internal successors, (60), 50 states have internal predecessors, (60), 0 states have call successors, (0), 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:41:04,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:41:04,328 INFO L93 Difference]: Finished difference Result 117 states and 132 transitions. [2022-02-20 23:41:04,328 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 132 transitions. [2022-02-20 23:41:04,328 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:41:04,328 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:41:04,328 INFO L74 IsIncluded]: Start isIncluded. First operand has 51 states, 43 states have (on average 1.3953488372093024) internal successors, (60), 50 states have internal predecessors, (60), 0 states have call successors, (0), 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 117 states. [2022-02-20 23:41:04,329 INFO L87 Difference]: Start difference. First operand has 51 states, 43 states have (on average 1.3953488372093024) internal successors, (60), 50 states have internal predecessors, (60), 0 states have call successors, (0), 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 117 states. [2022-02-20 23:41:04,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:41:04,330 INFO L93 Difference]: Finished difference Result 117 states and 132 transitions. [2022-02-20 23:41:04,330 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 132 transitions. [2022-02-20 23:41:04,331 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:41:04,331 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:41:04,331 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:41:04,331 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:41:04,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 43 states have (on average 1.3953488372093024) internal successors, (60), 50 states have internal predecessors, (60), 0 states have call successors, (0), 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:41:04,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 60 transitions. [2022-02-20 23:41:04,332 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 60 transitions. Word has length 11 [2022-02-20 23:41:04,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:41:04,332 INFO L470 AbstractCegarLoop]: Abstraction has 51 states and 60 transitions. [2022-02-20 23:41:04,332 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.0) internal successors, (20), 11 states have internal predecessors, (20), 0 states have call successors, (0), 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:41:04,333 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 60 transitions. [2022-02-20 23:41:04,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-02-20 23:41:04,333 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:41:04,333 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:41:04,341 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-02-20 23:41:04,539 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:41:04,539 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2022-02-20 23:41:04,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:41:04,540 INFO L85 PathProgramCache]: Analyzing trace with hash 229648597, now seen corresponding path program 1 times [2022-02-20 23:41:04,540 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:41:04,540 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1709064787] [2022-02-20 23:41:04,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:41:04,540 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:41:04,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:41:04,541 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:41:04,542 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-02-20 23:41:04,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:41:04,592 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 23:41:04,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:41:04,601 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:41:04,650 INFO L290 TraceCheckUtils]: 0: Hoare triple {2338#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven; {2338#true} is VALID [2022-02-20 23:41:04,651 INFO L290 TraceCheckUtils]: 1: Hoare triple {2338#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~nondet12#1, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_#t~nondet16#1, main_#t~post15#1, main_~i~0#1, main_#t~ret17#1.base, main_#t~ret17#1.offset, main_~length~0#1, main_~n~0#1, main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset, main_~nondetString~0#1.base, main_~nondetString~0#1.offset;main_~length~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;main_~n~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; {2338#true} is VALID [2022-02-20 23:41:04,651 INFO L290 TraceCheckUtils]: 2: Hoare triple {2338#true} assume ~bvslt32(main_~length~0#1, 1bv32);main_~length~0#1 := 1bv32; {2338#true} is VALID [2022-02-20 23:41:04,651 INFO L290 TraceCheckUtils]: 3: Hoare triple {2338#true} assume ~bvslt32(main_~n~0#1, 1bv32);main_~n~0#1 := 1bv32; {2352#(= |ULTIMATE.start_main_~n~0#1| (_ bv1 32))} is VALID [2022-02-20 23:41:04,652 INFO L290 TraceCheckUtils]: 4: Hoare triple {2352#(= |ULTIMATE.start_main_~n~0#1| (_ bv1 32))} call main_#t~malloc13#1.base, main_#t~malloc13#1.offset := #Ultimate.allocOnStack(main_~n~0#1);main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset := main_#t~malloc13#1.base, main_#t~malloc13#1.offset;call main_#t~malloc14#1.base, main_#t~malloc14#1.offset := #Ultimate.allocOnStack(main_~length~0#1);main_~nondetString~0#1.base, main_~nondetString~0#1.offset := main_#t~malloc14#1.base, main_#t~malloc14#1.offset;main_~i~0#1 := 0bv32; {2352#(= |ULTIMATE.start_main_~n~0#1| (_ bv1 32))} is VALID [2022-02-20 23:41:04,652 INFO L290 TraceCheckUtils]: 5: Hoare triple {2352#(= |ULTIMATE.start_main_~n~0#1| (_ bv1 32))} assume !~bvslt32(main_~i~0#1, ~bvsub32(main_~length~0#1, 1bv32)); {2352#(= |ULTIMATE.start_main_~n~0#1| (_ bv1 32))} is VALID [2022-02-20 23:41:04,653 INFO L290 TraceCheckUtils]: 6: Hoare triple {2352#(= |ULTIMATE.start_main_~n~0#1| (_ bv1 32))} SUMMARY for call write~intINTTYPE1(0bv8, main_~nondetString~0#1.base, ~bvadd32(main_~nondetString~0#1.offset, ~bvsub32(main_~length~0#1, 1bv32)), 1bv32); srcloc: L543-4 {2352#(= |ULTIMATE.start_main_~n~0#1| (_ bv1 32))} is VALID [2022-02-20 23:41:04,654 INFO L290 TraceCheckUtils]: 7: Hoare triple {2352#(= |ULTIMATE.start_main_~n~0#1| (_ bv1 32))} assume { :begin_inline_cstpncpy } true;cstpncpy_#in~dst#1.base, cstpncpy_#in~dst#1.offset, cstpncpy_#in~src#1.base, cstpncpy_#in~src#1.offset, cstpncpy_#in~n#1 := main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset, main_~nondetString~0#1.base, main_~nondetString~0#1.offset, main_~n~0#1;havoc cstpncpy_#res#1.base, cstpncpy_#res#1.offset;havoc cstpncpy_#t~mem2#1.base, cstpncpy_#t~mem2#1.offset, cstpncpy_#t~mem3#1.base, cstpncpy_#t~mem3#1.offset, cstpncpy_#t~post5#1.base, cstpncpy_#t~post5#1.offset, cstpncpy_#t~post6#1.base, cstpncpy_#t~post6#1.offset, cstpncpy_#t~mem7#1, cstpncpy_#t~post9#1.base, cstpncpy_#t~post9#1.offset, cstpncpy_#t~pre8#1, cstpncpy_#t~pre4#1, cstpncpy_~d~0#1.base, cstpncpy_~d~0#1.offset, cstpncpy_~s~0#1.base, cstpncpy_~s~0#1.offset, cstpncpy_#t~mem10#1.base, cstpncpy_#t~mem10#1.offset, cstpncpy_~#dst#1.base, cstpncpy_~#dst#1.offset, cstpncpy_~src#1.base, cstpncpy_~src#1.offset, cstpncpy_~n#1;call cstpncpy_~#dst#1.base, cstpncpy_~#dst#1.offset := #Ultimate.allocOnStack(4bv32); {2365#(= (_ bv1 32) |ULTIMATE.start_cstpncpy_#in~n#1|)} is VALID [2022-02-20 23:41:04,654 INFO L290 TraceCheckUtils]: 8: Hoare triple {2365#(= (_ bv1 32) |ULTIMATE.start_cstpncpy_#in~n#1|)} SUMMARY for call write~$Pointer$(cstpncpy_#in~dst#1.base, cstpncpy_#in~dst#1.offset, cstpncpy_~#dst#1.base, cstpncpy_~#dst#1.offset, 4bv32); srcloc: L513 {2365#(= (_ bv1 32) |ULTIMATE.start_cstpncpy_#in~n#1|)} is VALID [2022-02-20 23:41:04,655 INFO L290 TraceCheckUtils]: 9: Hoare triple {2365#(= (_ bv1 32) |ULTIMATE.start_cstpncpy_#in~n#1|)} cstpncpy_~src#1.base, cstpncpy_~src#1.offset := cstpncpy_#in~src#1.base, cstpncpy_#in~src#1.offset;cstpncpy_~n#1 := cstpncpy_#in~n#1; {2372#(= |ULTIMATE.start_cstpncpy_~n#1| (_ bv1 32))} is VALID [2022-02-20 23:41:04,655 INFO L290 TraceCheckUtils]: 10: Hoare triple {2372#(= |ULTIMATE.start_cstpncpy_~n#1| (_ bv1 32))} assume !(0bv32 != cstpncpy_~n#1); {2339#false} is VALID [2022-02-20 23:41:04,655 INFO L290 TraceCheckUtils]: 11: Hoare triple {2339#false} SUMMARY for call cstpncpy_#t~mem10#1.base, cstpncpy_#t~mem10#1.offset := read~$Pointer$(cstpncpy_~#dst#1.base, cstpncpy_~#dst#1.offset, 4bv32); srcloc: L516-1 {2339#false} is VALID [2022-02-20 23:41:04,655 INFO L290 TraceCheckUtils]: 12: Hoare triple {2339#false} cstpncpy_#res#1.base, cstpncpy_#res#1.offset := cstpncpy_#t~mem10#1.base, cstpncpy_#t~mem10#1.offset;havoc cstpncpy_#t~mem10#1.base, cstpncpy_#t~mem10#1.offset;call ULTIMATE.dealloc(cstpncpy_~#dst#1.base, cstpncpy_~#dst#1.offset);havoc cstpncpy_~#dst#1.base, cstpncpy_~#dst#1.offset; {2339#false} is VALID [2022-02-20 23:41:04,656 INFO L290 TraceCheckUtils]: 13: Hoare triple {2339#false} main_#t~ret17#1.base, main_#t~ret17#1.offset := cstpncpy_#res#1.base, cstpncpy_#res#1.offset;assume { :end_inline_cstpncpy } true;havoc main_#t~ret17#1.base, main_#t~ret17#1.offset;main_#res#1 := 0bv32;call ULTIMATE.dealloc(main_#t~malloc13#1.base, main_#t~malloc13#1.offset);havoc main_#t~malloc13#1.base, main_#t~malloc13#1.offset;call ULTIMATE.dealloc(main_#t~malloc14#1.base, main_#t~malloc14#1.offset);havoc main_#t~malloc14#1.base, main_#t~malloc14#1.offset; {2339#false} is VALID [2022-02-20 23:41:04,656 INFO L290 TraceCheckUtils]: 14: Hoare triple {2339#false} assume !(#valid == main_old_#valid#1); {2339#false} is VALID [2022-02-20 23:41:04,656 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:41:04,656 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:41:04,656 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:41:04,657 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1709064787] [2022-02-20 23:41:04,657 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1709064787] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:41:04,657 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:41:04,657 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 23:41:04,657 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674378712] [2022-02-20 23:41:04,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:41:04,657 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-02-20 23:41:04,658 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:41:04,658 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:41:04,673 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:41:04,673 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:41:04,673 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:41:04,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:41:04,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:41:04,674 INFO L87 Difference]: Start difference. First operand 51 states and 60 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:41:05,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:41:05,039 INFO L93 Difference]: Finished difference Result 108 states and 123 transitions. [2022-02-20 23:41:05,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 23:41:05,039 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-02-20 23:41:05,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:41:05,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:41:05,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 102 transitions. [2022-02-20 23:41:05,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:41:05,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 102 transitions. [2022-02-20 23:41:05,041 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 102 transitions. [2022-02-20 23:41:05,140 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:41:05,142 INFO L225 Difference]: With dead ends: 108 [2022-02-20 23:41:05,142 INFO L226 Difference]: Without dead ends: 108 [2022-02-20 23:41:05,142 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 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:41:05,143 INFO L933 BasicCegarLoop]: 45 mSDtfsCounter, 105 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:41:05,143 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [105 Valid, 187 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:41:05,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2022-02-20 23:41:05,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 69. [2022-02-20 23:41:05,145 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:41:05,146 INFO L82 GeneralOperation]: Start isEquivalent. First operand 108 states. Second operand has 69 states, 61 states have (on average 1.3442622950819672) internal successors, (82), 68 states have internal predecessors, (82), 0 states have call successors, (0), 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:41:05,146 INFO L74 IsIncluded]: Start isIncluded. First operand 108 states. Second operand has 69 states, 61 states have (on average 1.3442622950819672) internal successors, (82), 68 states have internal predecessors, (82), 0 states have call successors, (0), 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:41:05,146 INFO L87 Difference]: Start difference. First operand 108 states. Second operand has 69 states, 61 states have (on average 1.3442622950819672) internal successors, (82), 68 states have internal predecessors, (82), 0 states have call successors, (0), 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:41:05,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:41:05,148 INFO L93 Difference]: Finished difference Result 108 states and 123 transitions. [2022-02-20 23:41:05,148 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 123 transitions. [2022-02-20 23:41:05,148 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:41:05,148 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:41:05,149 INFO L74 IsIncluded]: Start isIncluded. First operand has 69 states, 61 states have (on average 1.3442622950819672) internal successors, (82), 68 states have internal predecessors, (82), 0 states have call successors, (0), 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 108 states. [2022-02-20 23:41:05,149 INFO L87 Difference]: Start difference. First operand has 69 states, 61 states have (on average 1.3442622950819672) internal successors, (82), 68 states have internal predecessors, (82), 0 states have call successors, (0), 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 108 states. [2022-02-20 23:41:05,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:41:05,150 INFO L93 Difference]: Finished difference Result 108 states and 123 transitions. [2022-02-20 23:41:05,150 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 123 transitions. [2022-02-20 23:41:05,151 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:41:05,151 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:41:05,151 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:41:05,151 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:41:05,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 61 states have (on average 1.3442622950819672) internal successors, (82), 68 states have internal predecessors, (82), 0 states have call successors, (0), 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:41:05,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 82 transitions. [2022-02-20 23:41:05,152 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 82 transitions. Word has length 15 [2022-02-20 23:41:05,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:41:05,152 INFO L470 AbstractCegarLoop]: Abstraction has 69 states and 82 transitions. [2022-02-20 23:41:05,153 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:41:05,153 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 82 transitions. [2022-02-20 23:41:05,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-02-20 23:41:05,153 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:41:05,153 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:41:05,161 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Ended with exit code 0 [2022-02-20 23:41:05,353 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:41:05,354 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2022-02-20 23:41:05,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:41:05,354 INFO L85 PathProgramCache]: Analyzing trace with hash 487814035, now seen corresponding path program 1 times [2022-02-20 23:41:05,355 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:41:05,355 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1060030809] [2022-02-20 23:41:05,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:41:05,355 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:41:05,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:41:05,356 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:41:05,356 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-02-20 23:41:05,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:41:05,406 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 23:41:05,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:41:05,414 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:41:05,456 INFO L290 TraceCheckUtils]: 0: Hoare triple {2784#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven; {2784#true} is VALID [2022-02-20 23:41:05,456 INFO L290 TraceCheckUtils]: 1: Hoare triple {2784#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~nondet12#1, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_#t~nondet16#1, main_#t~post15#1, main_~i~0#1, main_#t~ret17#1.base, main_#t~ret17#1.offset, main_~length~0#1, main_~n~0#1, main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset, main_~nondetString~0#1.base, main_~nondetString~0#1.offset;main_~length~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;main_~n~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; {2784#true} is VALID [2022-02-20 23:41:05,456 INFO L290 TraceCheckUtils]: 2: Hoare triple {2784#true} assume ~bvslt32(main_~length~0#1, 1bv32);main_~length~0#1 := 1bv32; {2784#true} is VALID [2022-02-20 23:41:05,457 INFO L290 TraceCheckUtils]: 3: Hoare triple {2784#true} assume !~bvslt32(main_~n~0#1, 1bv32); {2798#(not (bvslt |ULTIMATE.start_main_~n~0#1| (_ bv1 32)))} is VALID [2022-02-20 23:41:05,457 INFO L290 TraceCheckUtils]: 4: Hoare triple {2798#(not (bvslt |ULTIMATE.start_main_~n~0#1| (_ bv1 32)))} call main_#t~malloc13#1.base, main_#t~malloc13#1.offset := #Ultimate.allocOnStack(main_~n~0#1);main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset := main_#t~malloc13#1.base, main_#t~malloc13#1.offset;call main_#t~malloc14#1.base, main_#t~malloc14#1.offset := #Ultimate.allocOnStack(main_~length~0#1);main_~nondetString~0#1.base, main_~nondetString~0#1.offset := main_#t~malloc14#1.base, main_#t~malloc14#1.offset;main_~i~0#1 := 0bv32; {2798#(not (bvslt |ULTIMATE.start_main_~n~0#1| (_ bv1 32)))} is VALID [2022-02-20 23:41:05,457 INFO L290 TraceCheckUtils]: 5: Hoare triple {2798#(not (bvslt |ULTIMATE.start_main_~n~0#1| (_ bv1 32)))} assume !~bvslt32(main_~i~0#1, ~bvsub32(main_~length~0#1, 1bv32)); {2798#(not (bvslt |ULTIMATE.start_main_~n~0#1| (_ bv1 32)))} is VALID [2022-02-20 23:41:05,459 INFO L290 TraceCheckUtils]: 6: Hoare triple {2798#(not (bvslt |ULTIMATE.start_main_~n~0#1| (_ bv1 32)))} SUMMARY for call write~intINTTYPE1(0bv8, main_~nondetString~0#1.base, ~bvadd32(main_~nondetString~0#1.offset, ~bvsub32(main_~length~0#1, 1bv32)), 1bv32); srcloc: L543-4 {2798#(not (bvslt |ULTIMATE.start_main_~n~0#1| (_ bv1 32)))} is VALID [2022-02-20 23:41:05,459 INFO L290 TraceCheckUtils]: 7: Hoare triple {2798#(not (bvslt |ULTIMATE.start_main_~n~0#1| (_ bv1 32)))} assume { :begin_inline_cstpncpy } true;cstpncpy_#in~dst#1.base, cstpncpy_#in~dst#1.offset, cstpncpy_#in~src#1.base, cstpncpy_#in~src#1.offset, cstpncpy_#in~n#1 := main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset, main_~nondetString~0#1.base, main_~nondetString~0#1.offset, main_~n~0#1;havoc cstpncpy_#res#1.base, cstpncpy_#res#1.offset;havoc cstpncpy_#t~mem2#1.base, cstpncpy_#t~mem2#1.offset, cstpncpy_#t~mem3#1.base, cstpncpy_#t~mem3#1.offset, cstpncpy_#t~post5#1.base, cstpncpy_#t~post5#1.offset, cstpncpy_#t~post6#1.base, cstpncpy_#t~post6#1.offset, cstpncpy_#t~mem7#1, cstpncpy_#t~post9#1.base, cstpncpy_#t~post9#1.offset, cstpncpy_#t~pre8#1, cstpncpy_#t~pre4#1, cstpncpy_~d~0#1.base, cstpncpy_~d~0#1.offset, cstpncpy_~s~0#1.base, cstpncpy_~s~0#1.offset, cstpncpy_#t~mem10#1.base, cstpncpy_#t~mem10#1.offset, cstpncpy_~#dst#1.base, cstpncpy_~#dst#1.offset, cstpncpy_~src#1.base, cstpncpy_~src#1.offset, cstpncpy_~n#1;call cstpncpy_~#dst#1.base, cstpncpy_~#dst#1.offset := #Ultimate.allocOnStack(4bv32); {2811#(not (bvslt |ULTIMATE.start_cstpncpy_#in~n#1| (_ bv1 32)))} is VALID [2022-02-20 23:41:05,459 INFO L290 TraceCheckUtils]: 8: Hoare triple {2811#(not (bvslt |ULTIMATE.start_cstpncpy_#in~n#1| (_ bv1 32)))} SUMMARY for call write~$Pointer$(cstpncpy_#in~dst#1.base, cstpncpy_#in~dst#1.offset, cstpncpy_~#dst#1.base, cstpncpy_~#dst#1.offset, 4bv32); srcloc: L513 {2811#(not (bvslt |ULTIMATE.start_cstpncpy_#in~n#1| (_ bv1 32)))} is VALID [2022-02-20 23:41:05,460 INFO L290 TraceCheckUtils]: 9: Hoare triple {2811#(not (bvslt |ULTIMATE.start_cstpncpy_#in~n#1| (_ bv1 32)))} cstpncpy_~src#1.base, cstpncpy_~src#1.offset := cstpncpy_#in~src#1.base, cstpncpy_#in~src#1.offset;cstpncpy_~n#1 := cstpncpy_#in~n#1; {2818#(not (bvslt |ULTIMATE.start_cstpncpy_~n#1| (_ bv1 32)))} is VALID [2022-02-20 23:41:05,460 INFO L290 TraceCheckUtils]: 10: Hoare triple {2818#(not (bvslt |ULTIMATE.start_cstpncpy_~n#1| (_ bv1 32)))} assume !(0bv32 != cstpncpy_~n#1); {2785#false} is VALID [2022-02-20 23:41:05,460 INFO L290 TraceCheckUtils]: 11: Hoare triple {2785#false} SUMMARY for call cstpncpy_#t~mem10#1.base, cstpncpy_#t~mem10#1.offset := read~$Pointer$(cstpncpy_~#dst#1.base, cstpncpy_~#dst#1.offset, 4bv32); srcloc: L516-1 {2785#false} is VALID [2022-02-20 23:41:05,460 INFO L290 TraceCheckUtils]: 12: Hoare triple {2785#false} cstpncpy_#res#1.base, cstpncpy_#res#1.offset := cstpncpy_#t~mem10#1.base, cstpncpy_#t~mem10#1.offset;havoc cstpncpy_#t~mem10#1.base, cstpncpy_#t~mem10#1.offset;call ULTIMATE.dealloc(cstpncpy_~#dst#1.base, cstpncpy_~#dst#1.offset);havoc cstpncpy_~#dst#1.base, cstpncpy_~#dst#1.offset; {2785#false} is VALID [2022-02-20 23:41:05,460 INFO L290 TraceCheckUtils]: 13: Hoare triple {2785#false} main_#t~ret17#1.base, main_#t~ret17#1.offset := cstpncpy_#res#1.base, cstpncpy_#res#1.offset;assume { :end_inline_cstpncpy } true;havoc main_#t~ret17#1.base, main_#t~ret17#1.offset;main_#res#1 := 0bv32;call ULTIMATE.dealloc(main_#t~malloc13#1.base, main_#t~malloc13#1.offset);havoc main_#t~malloc13#1.base, main_#t~malloc13#1.offset;call ULTIMATE.dealloc(main_#t~malloc14#1.base, main_#t~malloc14#1.offset);havoc main_#t~malloc14#1.base, main_#t~malloc14#1.offset; {2785#false} is VALID [2022-02-20 23:41:05,460 INFO L290 TraceCheckUtils]: 14: Hoare triple {2785#false} assume !(#valid == main_old_#valid#1); {2785#false} is VALID [2022-02-20 23:41:05,461 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:41:05,461 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:41:05,461 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:41:05,461 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1060030809] [2022-02-20 23:41:05,461 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1060030809] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:41:05,461 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:41:05,461 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 23:41:05,461 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607506742] [2022-02-20 23:41:05,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:41:05,462 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-02-20 23:41:05,462 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:41:05,462 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:41:05,484 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:41:05,484 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:41:05,484 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:41:05,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:41:05,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:41:05,485 INFO L87 Difference]: Start difference. First operand 69 states and 82 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:41:05,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:41:05,707 INFO L93 Difference]: Finished difference Result 80 states and 93 transitions. [2022-02-20 23:41:05,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 23:41:05,707 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-02-20 23:41:05,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:41:05,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:41:05,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 60 transitions. [2022-02-20 23:41:05,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:41:05,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 60 transitions. [2022-02-20 23:41:05,715 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 60 transitions. [2022-02-20 23:41:05,785 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:41:05,786 INFO L225 Difference]: With dead ends: 80 [2022-02-20 23:41:05,786 INFO L226 Difference]: Without dead ends: 80 [2022-02-20 23:41:05,786 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 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:41:05,787 INFO L933 BasicCegarLoop]: 40 mSDtfsCounter, 105 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:41:05,787 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [105 Valid, 92 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:41:05,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-02-20 23:41:05,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 51. [2022-02-20 23:41:05,788 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:41:05,789 INFO L82 GeneralOperation]: Start isEquivalent. First operand 80 states. Second operand has 51 states, 43 states have (on average 1.372093023255814) internal successors, (59), 50 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:41:05,789 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand has 51 states, 43 states have (on average 1.372093023255814) internal successors, (59), 50 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:41:05,789 INFO L87 Difference]: Start difference. First operand 80 states. Second operand has 51 states, 43 states have (on average 1.372093023255814) internal successors, (59), 50 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:41:05,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:41:05,790 INFO L93 Difference]: Finished difference Result 80 states and 93 transitions. [2022-02-20 23:41:05,790 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 93 transitions. [2022-02-20 23:41:05,790 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:41:05,790 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:41:05,790 INFO L74 IsIncluded]: Start isIncluded. First operand has 51 states, 43 states have (on average 1.372093023255814) internal successors, (59), 50 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 80 states. [2022-02-20 23:41:05,792 INFO L87 Difference]: Start difference. First operand has 51 states, 43 states have (on average 1.372093023255814) internal successors, (59), 50 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 80 states. [2022-02-20 23:41:05,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:41:05,794 INFO L93 Difference]: Finished difference Result 80 states and 93 transitions. [2022-02-20 23:41:05,795 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 93 transitions. [2022-02-20 23:41:05,795 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:41:05,795 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:41:05,795 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:41:05,795 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:41:05,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 43 states have (on average 1.372093023255814) internal successors, (59), 50 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:41:05,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 59 transitions. [2022-02-20 23:41:05,796 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 59 transitions. Word has length 15 [2022-02-20 23:41:05,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:41:05,796 INFO L470 AbstractCegarLoop]: Abstraction has 51 states and 59 transitions. [2022-02-20 23:41:05,796 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:41:05,796 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2022-02-20 23:41:05,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-02-20 23:41:05,797 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:41:05,797 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-02-20 23:41:05,805 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-02-20 23:41:06,003 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:41:06,004 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2022-02-20 23:41:06,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:41:06,004 INFO L85 PathProgramCache]: Analyzing trace with hash 761370353, now seen corresponding path program 1 times [2022-02-20 23:41:06,004 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:41:06,004 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [430456983] [2022-02-20 23:41:06,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:41:06,004 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:41:06,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:41:06,005 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:41:06,006 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-02-20 23:41:06,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:41:06,058 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 12 conjunts are in the unsatisfiable core [2022-02-20 23:41:06,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:41:06,070 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:41:06,111 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-02-20 23:41:06,111 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 1 case distinctions, treesize of input 9 treesize of output 15 [2022-02-20 23:41:06,340 INFO L290 TraceCheckUtils]: 0: Hoare triple {3128#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven; {3128#true} is VALID [2022-02-20 23:41:06,340 INFO L290 TraceCheckUtils]: 1: Hoare triple {3128#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~nondet12#1, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_#t~nondet16#1, main_#t~post15#1, main_~i~0#1, main_#t~ret17#1.base, main_#t~ret17#1.offset, main_~length~0#1, main_~n~0#1, main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset, main_~nondetString~0#1.base, main_~nondetString~0#1.offset;main_~length~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;main_~n~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; {3128#true} is VALID [2022-02-20 23:41:06,340 INFO L290 TraceCheckUtils]: 2: Hoare triple {3128#true} assume !~bvslt32(main_~length~0#1, 1bv32); {3139#(not (bvslt |ULTIMATE.start_main_~length~0#1| (_ bv1 32)))} is VALID [2022-02-20 23:41:06,341 INFO L290 TraceCheckUtils]: 3: Hoare triple {3139#(not (bvslt |ULTIMATE.start_main_~length~0#1| (_ bv1 32)))} assume ~bvslt32(main_~n~0#1, 1bv32);main_~n~0#1 := 1bv32; {3139#(not (bvslt |ULTIMATE.start_main_~length~0#1| (_ bv1 32)))} is VALID [2022-02-20 23:41:06,342 INFO L290 TraceCheckUtils]: 4: Hoare triple {3139#(not (bvslt |ULTIMATE.start_main_~length~0#1| (_ bv1 32)))} call main_#t~malloc13#1.base, main_#t~malloc13#1.offset := #Ultimate.allocOnStack(main_~n~0#1);main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset := main_#t~malloc13#1.base, main_#t~malloc13#1.offset;call main_#t~malloc14#1.base, main_#t~malloc14#1.offset := #Ultimate.allocOnStack(main_~length~0#1);main_~nondetString~0#1.base, main_~nondetString~0#1.offset := main_#t~malloc14#1.base, main_#t~malloc14#1.offset;main_~i~0#1 := 0bv32; {3146#(and (= (select |#length| |ULTIMATE.start_main_~nondetString~0#1.base|) |ULTIMATE.start_main_~length~0#1|) (not (bvslt |ULTIMATE.start_main_~length~0#1| (_ bv1 32))) (= |ULTIMATE.start_main_~i~0#1| (_ bv0 32)) (= |ULTIMATE.start_main_~nondetString~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:41:06,342 INFO L290 TraceCheckUtils]: 5: Hoare triple {3146#(and (= (select |#length| |ULTIMATE.start_main_~nondetString~0#1.base|) |ULTIMATE.start_main_~length~0#1|) (not (bvslt |ULTIMATE.start_main_~length~0#1| (_ bv1 32))) (= |ULTIMATE.start_main_~i~0#1| (_ bv0 32)) (= |ULTIMATE.start_main_~nondetString~0#1.offset| (_ bv0 32)))} assume !!~bvslt32(main_~i~0#1, ~bvsub32(main_~length~0#1, 1bv32)); {3146#(and (= (select |#length| |ULTIMATE.start_main_~nondetString~0#1.base|) |ULTIMATE.start_main_~length~0#1|) (not (bvslt |ULTIMATE.start_main_~length~0#1| (_ bv1 32))) (= |ULTIMATE.start_main_~i~0#1| (_ bv0 32)) (= |ULTIMATE.start_main_~nondetString~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:41:06,343 INFO L290 TraceCheckUtils]: 6: Hoare triple {3146#(and (= (select |#length| |ULTIMATE.start_main_~nondetString~0#1.base|) |ULTIMATE.start_main_~length~0#1|) (not (bvslt |ULTIMATE.start_main_~length~0#1| (_ bv1 32))) (= |ULTIMATE.start_main_~i~0#1| (_ bv0 32)) (= |ULTIMATE.start_main_~nondetString~0#1.offset| (_ bv0 32)))} SUMMARY for call write~intINTTYPE1(main_#t~nondet16#1, main_~nondetString~0#1.base, ~bvadd32(main_~nondetString~0#1.offset, main_~i~0#1), 1bv32); srcloc: L545 {3146#(and (= (select |#length| |ULTIMATE.start_main_~nondetString~0#1.base|) |ULTIMATE.start_main_~length~0#1|) (not (bvslt |ULTIMATE.start_main_~length~0#1| (_ bv1 32))) (= |ULTIMATE.start_main_~i~0#1| (_ bv0 32)) (= |ULTIMATE.start_main_~nondetString~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:41:06,343 INFO L290 TraceCheckUtils]: 7: Hoare triple {3146#(and (= (select |#length| |ULTIMATE.start_main_~nondetString~0#1.base|) |ULTIMATE.start_main_~length~0#1|) (not (bvslt |ULTIMATE.start_main_~length~0#1| (_ bv1 32))) (= |ULTIMATE.start_main_~i~0#1| (_ bv0 32)) (= |ULTIMATE.start_main_~nondetString~0#1.offset| (_ bv0 32)))} havoc main_#t~nondet16#1; {3146#(and (= (select |#length| |ULTIMATE.start_main_~nondetString~0#1.base|) |ULTIMATE.start_main_~length~0#1|) (not (bvslt |ULTIMATE.start_main_~length~0#1| (_ bv1 32))) (= |ULTIMATE.start_main_~i~0#1| (_ bv0 32)) (= |ULTIMATE.start_main_~nondetString~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:41:06,344 INFO L290 TraceCheckUtils]: 8: Hoare triple {3146#(and (= (select |#length| |ULTIMATE.start_main_~nondetString~0#1.base|) |ULTIMATE.start_main_~length~0#1|) (not (bvslt |ULTIMATE.start_main_~length~0#1| (_ bv1 32))) (= |ULTIMATE.start_main_~i~0#1| (_ bv0 32)) (= |ULTIMATE.start_main_~nondetString~0#1.offset| (_ bv0 32)))} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := ~bvadd32(1bv32, main_#t~post15#1);havoc main_#t~post15#1; {3159#(and (= (select |#length| |ULTIMATE.start_main_~nondetString~0#1.base|) |ULTIMATE.start_main_~length~0#1|) (= |ULTIMATE.start_main_~i~0#1| (_ bv1 32)) (not (bvslt |ULTIMATE.start_main_~length~0#1| (_ bv1 32))) (= |ULTIMATE.start_main_~nondetString~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:41:06,346 INFO L290 TraceCheckUtils]: 9: Hoare triple {3159#(and (= (select |#length| |ULTIMATE.start_main_~nondetString~0#1.base|) |ULTIMATE.start_main_~length~0#1|) (= |ULTIMATE.start_main_~i~0#1| (_ bv1 32)) (not (bvslt |ULTIMATE.start_main_~length~0#1| (_ bv1 32))) (= |ULTIMATE.start_main_~nondetString~0#1.offset| (_ bv0 32)))} assume !!~bvslt32(main_~i~0#1, ~bvsub32(main_~length~0#1, 1bv32)); {3163#(and (= |ULTIMATE.start_main_~i~0#1| (_ bv1 32)) (= |ULTIMATE.start_main_~nondetString~0#1.offset| (_ bv0 32)) (bvslt |ULTIMATE.start_main_~i~0#1| (bvadd (select |#length| |ULTIMATE.start_main_~nondetString~0#1.base|) (_ bv4294967295 32))) (not (bvslt (select |#length| |ULTIMATE.start_main_~nondetString~0#1.base|) (_ bv1 32))))} is VALID [2022-02-20 23:41:06,347 INFO L290 TraceCheckUtils]: 10: Hoare triple {3163#(and (= |ULTIMATE.start_main_~i~0#1| (_ bv1 32)) (= |ULTIMATE.start_main_~nondetString~0#1.offset| (_ bv0 32)) (bvslt |ULTIMATE.start_main_~i~0#1| (bvadd (select |#length| |ULTIMATE.start_main_~nondetString~0#1.base|) (_ bv4294967295 32))) (not (bvslt (select |#length| |ULTIMATE.start_main_~nondetString~0#1.base|) (_ bv1 32))))} SUMMARY for call write~intINTTYPE1(main_#t~nondet16#1, main_~nondetString~0#1.base, ~bvadd32(main_~nondetString~0#1.offset, main_~i~0#1), 1bv32); srcloc: L545 {3163#(and (= |ULTIMATE.start_main_~i~0#1| (_ bv1 32)) (= |ULTIMATE.start_main_~nondetString~0#1.offset| (_ bv0 32)) (bvslt |ULTIMATE.start_main_~i~0#1| (bvadd (select |#length| |ULTIMATE.start_main_~nondetString~0#1.base|) (_ bv4294967295 32))) (not (bvslt (select |#length| |ULTIMATE.start_main_~nondetString~0#1.base|) (_ bv1 32))))} is VALID [2022-02-20 23:41:06,347 INFO L290 TraceCheckUtils]: 11: Hoare triple {3163#(and (= |ULTIMATE.start_main_~i~0#1| (_ bv1 32)) (= |ULTIMATE.start_main_~nondetString~0#1.offset| (_ bv0 32)) (bvslt |ULTIMATE.start_main_~i~0#1| (bvadd (select |#length| |ULTIMATE.start_main_~nondetString~0#1.base|) (_ bv4294967295 32))) (not (bvslt (select |#length| |ULTIMATE.start_main_~nondetString~0#1.base|) (_ bv1 32))))} havoc main_#t~nondet16#1; {3163#(and (= |ULTIMATE.start_main_~i~0#1| (_ bv1 32)) (= |ULTIMATE.start_main_~nondetString~0#1.offset| (_ bv0 32)) (bvslt |ULTIMATE.start_main_~i~0#1| (bvadd (select |#length| |ULTIMATE.start_main_~nondetString~0#1.base|) (_ bv4294967295 32))) (not (bvslt (select |#length| |ULTIMATE.start_main_~nondetString~0#1.base|) (_ bv1 32))))} is VALID [2022-02-20 23:41:06,348 INFO L290 TraceCheckUtils]: 12: Hoare triple {3163#(and (= |ULTIMATE.start_main_~i~0#1| (_ bv1 32)) (= |ULTIMATE.start_main_~nondetString~0#1.offset| (_ bv0 32)) (bvslt |ULTIMATE.start_main_~i~0#1| (bvadd (select |#length| |ULTIMATE.start_main_~nondetString~0#1.base|) (_ bv4294967295 32))) (not (bvslt (select |#length| |ULTIMATE.start_main_~nondetString~0#1.base|) (_ bv1 32))))} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := ~bvadd32(1bv32, main_#t~post15#1);havoc main_#t~post15#1; {3173#(and (bvslt (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~i~0#1|) (bvadd (select |#length| |ULTIMATE.start_main_~nondetString~0#1.base|) (_ bv4294967295 32))) (= (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~i~0#1|) (_ bv1 32)) (= |ULTIMATE.start_main_~nondetString~0#1.offset| (_ bv0 32)) (not (bvslt (select |#length| |ULTIMATE.start_main_~nondetString~0#1.base|) (_ bv1 32))))} is VALID [2022-02-20 23:41:06,348 INFO L290 TraceCheckUtils]: 13: Hoare triple {3173#(and (bvslt (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~i~0#1|) (bvadd (select |#length| |ULTIMATE.start_main_~nondetString~0#1.base|) (_ bv4294967295 32))) (= (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~i~0#1|) (_ bv1 32)) (= |ULTIMATE.start_main_~nondetString~0#1.offset| (_ bv0 32)) (not (bvslt (select |#length| |ULTIMATE.start_main_~nondetString~0#1.base|) (_ bv1 32))))} assume !!~bvslt32(main_~i~0#1, ~bvsub32(main_~length~0#1, 1bv32)); {3173#(and (bvslt (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~i~0#1|) (bvadd (select |#length| |ULTIMATE.start_main_~nondetString~0#1.base|) (_ bv4294967295 32))) (= (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~i~0#1|) (_ bv1 32)) (= |ULTIMATE.start_main_~nondetString~0#1.offset| (_ bv0 32)) (not (bvslt (select |#length| |ULTIMATE.start_main_~nondetString~0#1.base|) (_ bv1 32))))} is VALID [2022-02-20 23:41:06,349 INFO L290 TraceCheckUtils]: 14: Hoare triple {3173#(and (bvslt (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~i~0#1|) (bvadd (select |#length| |ULTIMATE.start_main_~nondetString~0#1.base|) (_ bv4294967295 32))) (= (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~i~0#1|) (_ bv1 32)) (= |ULTIMATE.start_main_~nondetString~0#1.offset| (_ bv0 32)) (not (bvslt (select |#length| |ULTIMATE.start_main_~nondetString~0#1.base|) (_ bv1 32))))} assume !((~bvule32(~bvadd32(1bv32, ~bvadd32(main_~nondetString~0#1.offset, main_~i~0#1)), #length[main_~nondetString~0#1.base]) && ~bvule32(~bvadd32(main_~nondetString~0#1.offset, main_~i~0#1), ~bvadd32(1bv32, ~bvadd32(main_~nondetString~0#1.offset, main_~i~0#1)))) && ~bvule32(0bv32, ~bvadd32(main_~nondetString~0#1.offset, main_~i~0#1))); {3129#false} is VALID [2022-02-20 23:41:06,350 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:41:06,350 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:41:07,086 INFO L290 TraceCheckUtils]: 14: Hoare triple {3180#(and (bvule (bvadd |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~nondetString~0#1.offset|) (bvadd |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~nondetString~0#1.offset| (_ bv1 32))) (bvule (bvadd |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~nondetString~0#1.offset| (_ bv1 32)) (select |#length| |ULTIMATE.start_main_~nondetString~0#1.base|)))} assume !((~bvule32(~bvadd32(1bv32, ~bvadd32(main_~nondetString~0#1.offset, main_~i~0#1)), #length[main_~nondetString~0#1.base]) && ~bvule32(~bvadd32(main_~nondetString~0#1.offset, main_~i~0#1), ~bvadd32(1bv32, ~bvadd32(main_~nondetString~0#1.offset, main_~i~0#1)))) && ~bvule32(0bv32, ~bvadd32(main_~nondetString~0#1.offset, main_~i~0#1))); {3129#false} is VALID [2022-02-20 23:41:07,086 INFO L290 TraceCheckUtils]: 13: Hoare triple {3180#(and (bvule (bvadd |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~nondetString~0#1.offset|) (bvadd |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~nondetString~0#1.offset| (_ bv1 32))) (bvule (bvadd |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~nondetString~0#1.offset| (_ bv1 32)) (select |#length| |ULTIMATE.start_main_~nondetString~0#1.base|)))} assume !!~bvslt32(main_~i~0#1, ~bvsub32(main_~length~0#1, 1bv32)); {3180#(and (bvule (bvadd |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~nondetString~0#1.offset|) (bvadd |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~nondetString~0#1.offset| (_ bv1 32))) (bvule (bvadd |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~nondetString~0#1.offset| (_ bv1 32)) (select |#length| |ULTIMATE.start_main_~nondetString~0#1.base|)))} is VALID [2022-02-20 23:41:07,630 INFO L290 TraceCheckUtils]: 12: Hoare triple {3187#(and (bvule (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv2 32) |ULTIMATE.start_main_~nondetString~0#1.offset|) (select |#length| |ULTIMATE.start_main_~nondetString~0#1.base|)) (bvule (bvadd |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~nondetString~0#1.offset| (_ bv1 32)) (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv2 32) |ULTIMATE.start_main_~nondetString~0#1.offset|)))} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := ~bvadd32(1bv32, main_#t~post15#1);havoc main_#t~post15#1; {3180#(and (bvule (bvadd |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~nondetString~0#1.offset|) (bvadd |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~nondetString~0#1.offset| (_ bv1 32))) (bvule (bvadd |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~nondetString~0#1.offset| (_ bv1 32)) (select |#length| |ULTIMATE.start_main_~nondetString~0#1.base|)))} is VALID [2022-02-20 23:41:07,631 INFO L290 TraceCheckUtils]: 11: Hoare triple {3187#(and (bvule (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv2 32) |ULTIMATE.start_main_~nondetString~0#1.offset|) (select |#length| |ULTIMATE.start_main_~nondetString~0#1.base|)) (bvule (bvadd |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~nondetString~0#1.offset| (_ bv1 32)) (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv2 32) |ULTIMATE.start_main_~nondetString~0#1.offset|)))} havoc main_#t~nondet16#1; {3187#(and (bvule (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv2 32) |ULTIMATE.start_main_~nondetString~0#1.offset|) (select |#length| |ULTIMATE.start_main_~nondetString~0#1.base|)) (bvule (bvadd |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~nondetString~0#1.offset| (_ bv1 32)) (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv2 32) |ULTIMATE.start_main_~nondetString~0#1.offset|)))} is VALID [2022-02-20 23:41:07,632 INFO L290 TraceCheckUtils]: 10: Hoare triple {3194#(or (not (bvule (bvadd |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~nondetString~0#1.offset| (_ bv1 32)) (select |#length| |ULTIMATE.start_main_~nondetString~0#1.base|))) (and (bvule (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv2 32) |ULTIMATE.start_main_~nondetString~0#1.offset|) (select |#length| |ULTIMATE.start_main_~nondetString~0#1.base|)) (bvule (bvadd |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~nondetString~0#1.offset| (_ bv1 32)) (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv2 32) |ULTIMATE.start_main_~nondetString~0#1.offset|))))} SUMMARY for call write~intINTTYPE1(main_#t~nondet16#1, main_~nondetString~0#1.base, ~bvadd32(main_~nondetString~0#1.offset, main_~i~0#1), 1bv32); srcloc: L545 {3187#(and (bvule (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv2 32) |ULTIMATE.start_main_~nondetString~0#1.offset|) (select |#length| |ULTIMATE.start_main_~nondetString~0#1.base|)) (bvule (bvadd |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~nondetString~0#1.offset| (_ bv1 32)) (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv2 32) |ULTIMATE.start_main_~nondetString~0#1.offset|)))} is VALID [2022-02-20 23:41:07,632 INFO L290 TraceCheckUtils]: 9: Hoare triple {3198#(or (not (bvule (bvadd |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~nondetString~0#1.offset| (_ bv1 32)) (select |#length| |ULTIMATE.start_main_~nondetString~0#1.base|))) (and (bvule (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv2 32) |ULTIMATE.start_main_~nondetString~0#1.offset|) (select |#length| |ULTIMATE.start_main_~nondetString~0#1.base|)) (bvule (bvadd |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~nondetString~0#1.offset| (_ bv1 32)) (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv2 32) |ULTIMATE.start_main_~nondetString~0#1.offset|))) (not (bvslt |ULTIMATE.start_main_~i~0#1| (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~length~0#1|))))} assume !!~bvslt32(main_~i~0#1, ~bvsub32(main_~length~0#1, 1bv32)); {3194#(or (not (bvule (bvadd |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~nondetString~0#1.offset| (_ bv1 32)) (select |#length| |ULTIMATE.start_main_~nondetString~0#1.base|))) (and (bvule (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv2 32) |ULTIMATE.start_main_~nondetString~0#1.offset|) (select |#length| |ULTIMATE.start_main_~nondetString~0#1.base|)) (bvule (bvadd |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~nondetString~0#1.offset| (_ bv1 32)) (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv2 32) |ULTIMATE.start_main_~nondetString~0#1.offset|))))} is VALID [2022-02-20 23:41:08,987 INFO L290 TraceCheckUtils]: 8: Hoare triple {3202#(or (not (bvslt (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv1 32)) (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~length~0#1|))) (and (bvule (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv3 32) |ULTIMATE.start_main_~nondetString~0#1.offset|) (select |#length| |ULTIMATE.start_main_~nondetString~0#1.base|)) (bvule (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv2 32) |ULTIMATE.start_main_~nondetString~0#1.offset|) (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv3 32) |ULTIMATE.start_main_~nondetString~0#1.offset|))) (not (bvule (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv2 32) |ULTIMATE.start_main_~nondetString~0#1.offset|) (select |#length| |ULTIMATE.start_main_~nondetString~0#1.base|))))} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := ~bvadd32(1bv32, main_#t~post15#1);havoc main_#t~post15#1; {3198#(or (not (bvule (bvadd |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~nondetString~0#1.offset| (_ bv1 32)) (select |#length| |ULTIMATE.start_main_~nondetString~0#1.base|))) (and (bvule (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv2 32) |ULTIMATE.start_main_~nondetString~0#1.offset|) (select |#length| |ULTIMATE.start_main_~nondetString~0#1.base|)) (bvule (bvadd |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~nondetString~0#1.offset| (_ bv1 32)) (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv2 32) |ULTIMATE.start_main_~nondetString~0#1.offset|))) (not (bvslt |ULTIMATE.start_main_~i~0#1| (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~length~0#1|))))} is VALID [2022-02-20 23:41:08,996 INFO L290 TraceCheckUtils]: 7: Hoare triple {3202#(or (not (bvslt (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv1 32)) (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~length~0#1|))) (and (bvule (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv3 32) |ULTIMATE.start_main_~nondetString~0#1.offset|) (select |#length| |ULTIMATE.start_main_~nondetString~0#1.base|)) (bvule (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv2 32) |ULTIMATE.start_main_~nondetString~0#1.offset|) (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv3 32) |ULTIMATE.start_main_~nondetString~0#1.offset|))) (not (bvule (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv2 32) |ULTIMATE.start_main_~nondetString~0#1.offset|) (select |#length| |ULTIMATE.start_main_~nondetString~0#1.base|))))} havoc main_#t~nondet16#1; {3202#(or (not (bvslt (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv1 32)) (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~length~0#1|))) (and (bvule (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv3 32) |ULTIMATE.start_main_~nondetString~0#1.offset|) (select |#length| |ULTIMATE.start_main_~nondetString~0#1.base|)) (bvule (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv2 32) |ULTIMATE.start_main_~nondetString~0#1.offset|) (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv3 32) |ULTIMATE.start_main_~nondetString~0#1.offset|))) (not (bvule (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv2 32) |ULTIMATE.start_main_~nondetString~0#1.offset|) (select |#length| |ULTIMATE.start_main_~nondetString~0#1.base|))))} is VALID [2022-02-20 23:41:08,999 INFO L290 TraceCheckUtils]: 6: Hoare triple {3202#(or (not (bvslt (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv1 32)) (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~length~0#1|))) (and (bvule (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv3 32) |ULTIMATE.start_main_~nondetString~0#1.offset|) (select |#length| |ULTIMATE.start_main_~nondetString~0#1.base|)) (bvule (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv2 32) |ULTIMATE.start_main_~nondetString~0#1.offset|) (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv3 32) |ULTIMATE.start_main_~nondetString~0#1.offset|))) (not (bvule (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv2 32) |ULTIMATE.start_main_~nondetString~0#1.offset|) (select |#length| |ULTIMATE.start_main_~nondetString~0#1.base|))))} SUMMARY for call write~intINTTYPE1(main_#t~nondet16#1, main_~nondetString~0#1.base, ~bvadd32(main_~nondetString~0#1.offset, main_~i~0#1), 1bv32); srcloc: L545 {3202#(or (not (bvslt (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv1 32)) (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~length~0#1|))) (and (bvule (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv3 32) |ULTIMATE.start_main_~nondetString~0#1.offset|) (select |#length| |ULTIMATE.start_main_~nondetString~0#1.base|)) (bvule (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv2 32) |ULTIMATE.start_main_~nondetString~0#1.offset|) (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv3 32) |ULTIMATE.start_main_~nondetString~0#1.offset|))) (not (bvule (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv2 32) |ULTIMATE.start_main_~nondetString~0#1.offset|) (select |#length| |ULTIMATE.start_main_~nondetString~0#1.base|))))} is VALID [2022-02-20 23:41:09,002 INFO L290 TraceCheckUtils]: 5: Hoare triple {3202#(or (not (bvslt (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv1 32)) (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~length~0#1|))) (and (bvule (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv3 32) |ULTIMATE.start_main_~nondetString~0#1.offset|) (select |#length| |ULTIMATE.start_main_~nondetString~0#1.base|)) (bvule (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv2 32) |ULTIMATE.start_main_~nondetString~0#1.offset|) (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv3 32) |ULTIMATE.start_main_~nondetString~0#1.offset|))) (not (bvule (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv2 32) |ULTIMATE.start_main_~nondetString~0#1.offset|) (select |#length| |ULTIMATE.start_main_~nondetString~0#1.base|))))} assume !!~bvslt32(main_~i~0#1, ~bvsub32(main_~length~0#1, 1bv32)); {3202#(or (not (bvslt (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv1 32)) (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~length~0#1|))) (and (bvule (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv3 32) |ULTIMATE.start_main_~nondetString~0#1.offset|) (select |#length| |ULTIMATE.start_main_~nondetString~0#1.base|)) (bvule (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv2 32) |ULTIMATE.start_main_~nondetString~0#1.offset|) (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv3 32) |ULTIMATE.start_main_~nondetString~0#1.offset|))) (not (bvule (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv2 32) |ULTIMATE.start_main_~nondetString~0#1.offset|) (select |#length| |ULTIMATE.start_main_~nondetString~0#1.base|))))} is VALID [2022-02-20 23:41:09,004 INFO L290 TraceCheckUtils]: 4: Hoare triple {3128#true} call main_#t~malloc13#1.base, main_#t~malloc13#1.offset := #Ultimate.allocOnStack(main_~n~0#1);main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset := main_#t~malloc13#1.base, main_#t~malloc13#1.offset;call main_#t~malloc14#1.base, main_#t~malloc14#1.offset := #Ultimate.allocOnStack(main_~length~0#1);main_~nondetString~0#1.base, main_~nondetString~0#1.offset := main_#t~malloc14#1.base, main_#t~malloc14#1.offset;main_~i~0#1 := 0bv32; {3202#(or (not (bvslt (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv1 32)) (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~length~0#1|))) (and (bvule (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv3 32) |ULTIMATE.start_main_~nondetString~0#1.offset|) (select |#length| |ULTIMATE.start_main_~nondetString~0#1.base|)) (bvule (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv2 32) |ULTIMATE.start_main_~nondetString~0#1.offset|) (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv3 32) |ULTIMATE.start_main_~nondetString~0#1.offset|))) (not (bvule (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv2 32) |ULTIMATE.start_main_~nondetString~0#1.offset|) (select |#length| |ULTIMATE.start_main_~nondetString~0#1.base|))))} is VALID [2022-02-20 23:41:09,004 INFO L290 TraceCheckUtils]: 3: Hoare triple {3128#true} assume ~bvslt32(main_~n~0#1, 1bv32);main_~n~0#1 := 1bv32; {3128#true} is VALID [2022-02-20 23:41:09,004 INFO L290 TraceCheckUtils]: 2: Hoare triple {3128#true} assume !~bvslt32(main_~length~0#1, 1bv32); {3128#true} is VALID [2022-02-20 23:41:09,004 INFO L290 TraceCheckUtils]: 1: Hoare triple {3128#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~nondet12#1, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_#t~nondet16#1, main_#t~post15#1, main_~i~0#1, main_#t~ret17#1.base, main_#t~ret17#1.offset, main_~length~0#1, main_~n~0#1, main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset, main_~nondetString~0#1.base, main_~nondetString~0#1.offset;main_~length~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;main_~n~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; {3128#true} is VALID [2022-02-20 23:41:09,004 INFO L290 TraceCheckUtils]: 0: Hoare triple {3128#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven; {3128#true} is VALID [2022-02-20 23:41:09,004 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:41:09,004 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:41:09,008 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [430456983] [2022-02-20 23:41:09,008 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [430456983] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:41:09,008 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 23:41:09,008 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2022-02-20 23:41:09,008 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909241447] [2022-02-20 23:41:09,008 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 23:41:09,009 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 12 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-02-20 23:41:09,009 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:41:09,009 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 12 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 12 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:41:11,002 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:41:11,002 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-02-20 23:41:11,002 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:41:11,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-20 23:41:11,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-02-20 23:41:11,003 INFO L87 Difference]: Start difference. First operand 51 states and 59 transitions. Second operand has 12 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 12 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:41:17,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:41:17,925 INFO L93 Difference]: Finished difference Result 131 states and 146 transitions. [2022-02-20 23:41:17,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-20 23:41:17,925 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 12 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-02-20 23:41:17,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:41:17,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 12 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:41:17,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 145 transitions. [2022-02-20 23:41:17,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 12 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:41:17,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 145 transitions. [2022-02-20 23:41:17,927 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 145 transitions. [2022-02-20 23:41:18,650 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 145 edges. 145 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:41:18,651 INFO L225 Difference]: With dead ends: 131 [2022-02-20 23:41:18,651 INFO L226 Difference]: Without dead ends: 131 [2022-02-20 23:41:18,652 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=153, Invalid=353, Unknown=0, NotChecked=0, Total=506 [2022-02-20 23:41:18,652 INFO L933 BasicCegarLoop]: 50 mSDtfsCounter, 371 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 371 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-02-20 23:41:18,652 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [371 Valid, 238 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-02-20 23:41:18,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2022-02-20 23:41:18,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 63. [2022-02-20 23:41:18,654 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:41:18,654 INFO L82 GeneralOperation]: Start isEquivalent. First operand 131 states. Second operand has 63 states, 55 states have (on average 1.3454545454545455) internal successors, (74), 62 states have internal predecessors, (74), 0 states have call successors, (0), 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:41:18,655 INFO L74 IsIncluded]: Start isIncluded. First operand 131 states. Second operand has 63 states, 55 states have (on average 1.3454545454545455) internal successors, (74), 62 states have internal predecessors, (74), 0 states have call successors, (0), 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:41:18,655 INFO L87 Difference]: Start difference. First operand 131 states. Second operand has 63 states, 55 states have (on average 1.3454545454545455) internal successors, (74), 62 states have internal predecessors, (74), 0 states have call successors, (0), 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:41:18,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:41:18,656 INFO L93 Difference]: Finished difference Result 131 states and 146 transitions. [2022-02-20 23:41:18,656 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 146 transitions. [2022-02-20 23:41:18,657 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:41:18,657 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:41:18,657 INFO L74 IsIncluded]: Start isIncluded. First operand has 63 states, 55 states have (on average 1.3454545454545455) internal successors, (74), 62 states have internal predecessors, (74), 0 states have call successors, (0), 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 131 states. [2022-02-20 23:41:18,657 INFO L87 Difference]: Start difference. First operand has 63 states, 55 states have (on average 1.3454545454545455) internal successors, (74), 62 states have internal predecessors, (74), 0 states have call successors, (0), 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 131 states. [2022-02-20 23:41:18,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:41:18,658 INFO L93 Difference]: Finished difference Result 131 states and 146 transitions. [2022-02-20 23:41:18,659 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 146 transitions. [2022-02-20 23:41:18,659 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:41:18,659 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:41:18,659 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:41:18,659 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:41:18,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 55 states have (on average 1.3454545454545455) internal successors, (74), 62 states have internal predecessors, (74), 0 states have call successors, (0), 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:41:18,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 74 transitions. [2022-02-20 23:41:18,660 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 74 transitions. Word has length 15 [2022-02-20 23:41:18,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:41:18,660 INFO L470 AbstractCegarLoop]: Abstraction has 63 states and 74 transitions. [2022-02-20 23:41:18,660 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 12 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:41:18,660 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 74 transitions. [2022-02-20 23:41:18,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-20 23:41:18,661 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:41:18,661 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:41:18,671 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-02-20 23:41:18,867 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:41:18,867 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2022-02-20 23:41:18,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:41:18,868 INFO L85 PathProgramCache]: Analyzing trace with hash -994678340, now seen corresponding path program 1 times [2022-02-20 23:41:18,868 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:41:18,868 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1324986663] [2022-02-20 23:41:18,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:41:18,868 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:41:18,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:41:18,869 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:41:18,870 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-02-20 23:41:18,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:41:18,953 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-20 23:41:18,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:41:18,960 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:41:18,979 INFO L356 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2022-02-20 23:41:18,979 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 1 case distinctions, treesize of input 9 treesize of output 18 [2022-02-20 23:41:19,019 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-02-20 23:41:19,019 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 27 [2022-02-20 23:41:19,156 INFO L290 TraceCheckUtils]: 0: Hoare triple {3704#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven; {3704#true} is VALID [2022-02-20 23:41:19,156 INFO L290 TraceCheckUtils]: 1: Hoare triple {3704#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~nondet12#1, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_#t~nondet16#1, main_#t~post15#1, main_~i~0#1, main_#t~ret17#1.base, main_#t~ret17#1.offset, main_~length~0#1, main_~n~0#1, main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset, main_~nondetString~0#1.base, main_~nondetString~0#1.offset;main_~length~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;main_~n~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; {3704#true} is VALID [2022-02-20 23:41:19,156 INFO L290 TraceCheckUtils]: 2: Hoare triple {3704#true} assume ~bvslt32(main_~length~0#1, 1bv32);main_~length~0#1 := 1bv32; {3704#true} is VALID [2022-02-20 23:41:19,156 INFO L290 TraceCheckUtils]: 3: Hoare triple {3704#true} assume ~bvslt32(main_~n~0#1, 1bv32);main_~n~0#1 := 1bv32; {3704#true} is VALID [2022-02-20 23:41:19,158 INFO L290 TraceCheckUtils]: 4: Hoare triple {3704#true} call main_#t~malloc13#1.base, main_#t~malloc13#1.offset := #Ultimate.allocOnStack(main_~n~0#1);main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset := main_#t~malloc13#1.base, main_#t~malloc13#1.offset;call main_#t~malloc14#1.base, main_#t~malloc14#1.offset := #Ultimate.allocOnStack(main_~length~0#1);main_~nondetString~0#1.base, main_~nondetString~0#1.offset := main_#t~malloc14#1.base, main_#t~malloc14#1.offset;main_~i~0#1 := 0bv32; {3721#(= (bvadd (bvneg (select |#valid| |ULTIMATE.start_main_~nondetString~0#1.base|)) (_ bv1 1)) (_ bv0 1))} is VALID [2022-02-20 23:41:19,158 INFO L290 TraceCheckUtils]: 5: Hoare triple {3721#(= (bvadd (bvneg (select |#valid| |ULTIMATE.start_main_~nondetString~0#1.base|)) (_ bv1 1)) (_ bv0 1))} assume !~bvslt32(main_~i~0#1, ~bvsub32(main_~length~0#1, 1bv32)); {3721#(= (bvadd (bvneg (select |#valid| |ULTIMATE.start_main_~nondetString~0#1.base|)) (_ bv1 1)) (_ bv0 1))} is VALID [2022-02-20 23:41:19,159 INFO L290 TraceCheckUtils]: 6: Hoare triple {3721#(= (bvadd (bvneg (select |#valid| |ULTIMATE.start_main_~nondetString~0#1.base|)) (_ bv1 1)) (_ bv0 1))} SUMMARY for call write~intINTTYPE1(0bv8, main_~nondetString~0#1.base, ~bvadd32(main_~nondetString~0#1.offset, ~bvsub32(main_~length~0#1, 1bv32)), 1bv32); srcloc: L543-4 {3721#(= (bvadd (bvneg (select |#valid| |ULTIMATE.start_main_~nondetString~0#1.base|)) (_ bv1 1)) (_ bv0 1))} is VALID [2022-02-20 23:41:19,160 INFO L290 TraceCheckUtils]: 7: Hoare triple {3721#(= (bvadd (bvneg (select |#valid| |ULTIMATE.start_main_~nondetString~0#1.base|)) (_ bv1 1)) (_ bv0 1))} assume { :begin_inline_cstpncpy } true;cstpncpy_#in~dst#1.base, cstpncpy_#in~dst#1.offset, cstpncpy_#in~src#1.base, cstpncpy_#in~src#1.offset, cstpncpy_#in~n#1 := main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset, main_~nondetString~0#1.base, main_~nondetString~0#1.offset, main_~n~0#1;havoc cstpncpy_#res#1.base, cstpncpy_#res#1.offset;havoc cstpncpy_#t~mem2#1.base, cstpncpy_#t~mem2#1.offset, cstpncpy_#t~mem3#1.base, cstpncpy_#t~mem3#1.offset, cstpncpy_#t~post5#1.base, cstpncpy_#t~post5#1.offset, cstpncpy_#t~post6#1.base, cstpncpy_#t~post6#1.offset, cstpncpy_#t~mem7#1, cstpncpy_#t~post9#1.base, cstpncpy_#t~post9#1.offset, cstpncpy_#t~pre8#1, cstpncpy_#t~pre4#1, cstpncpy_~d~0#1.base, cstpncpy_~d~0#1.offset, cstpncpy_~s~0#1.base, cstpncpy_~s~0#1.offset, cstpncpy_#t~mem10#1.base, cstpncpy_#t~mem10#1.offset, cstpncpy_~#dst#1.base, cstpncpy_~#dst#1.offset, cstpncpy_~src#1.base, cstpncpy_~src#1.offset, cstpncpy_~n#1;call cstpncpy_~#dst#1.base, cstpncpy_~#dst#1.offset := #Ultimate.allocOnStack(4bv32); {3731#(exists ((v_arrayElimCell_1 (_ BitVec 1))) (and (= (bvadd (bvneg v_arrayElimCell_1) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_cstpncpy_#in~src#1.base|) (bvneg v_arrayElimCell_1)))))} is VALID [2022-02-20 23:41:19,161 INFO L290 TraceCheckUtils]: 8: Hoare triple {3731#(exists ((v_arrayElimCell_1 (_ BitVec 1))) (and (= (bvadd (bvneg v_arrayElimCell_1) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_cstpncpy_#in~src#1.base|) (bvneg v_arrayElimCell_1)))))} SUMMARY for call write~$Pointer$(cstpncpy_#in~dst#1.base, cstpncpy_#in~dst#1.offset, cstpncpy_~#dst#1.base, cstpncpy_~#dst#1.offset, 4bv32); srcloc: L513 {3731#(exists ((v_arrayElimCell_1 (_ BitVec 1))) (and (= (bvadd (bvneg v_arrayElimCell_1) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_cstpncpy_#in~src#1.base|) (bvneg v_arrayElimCell_1)))))} is VALID [2022-02-20 23:41:19,164 INFO L290 TraceCheckUtils]: 9: Hoare triple {3731#(exists ((v_arrayElimCell_1 (_ BitVec 1))) (and (= (bvadd (bvneg v_arrayElimCell_1) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_cstpncpy_#in~src#1.base|) (bvneg v_arrayElimCell_1)))))} cstpncpy_~src#1.base, cstpncpy_~src#1.offset := cstpncpy_#in~src#1.base, cstpncpy_#in~src#1.offset;cstpncpy_~n#1 := cstpncpy_#in~n#1; {3738#(exists ((v_arrayElimCell_1 (_ BitVec 1))) (and (= (bvadd (bvneg v_arrayElimCell_1) (_ bv1 1)) (_ bv0 1)) (= (bvadd (bvneg v_arrayElimCell_1) (select |#valid| |ULTIMATE.start_cstpncpy_~src#1.base|)) (_ bv0 1))))} is VALID [2022-02-20 23:41:19,165 INFO L290 TraceCheckUtils]: 10: Hoare triple {3738#(exists ((v_arrayElimCell_1 (_ BitVec 1))) (and (= (bvadd (bvneg v_arrayElimCell_1) (_ bv1 1)) (_ bv0 1)) (= (bvadd (bvneg v_arrayElimCell_1) (select |#valid| |ULTIMATE.start_cstpncpy_~src#1.base|)) (_ bv0 1))))} assume 0bv32 != cstpncpy_~n#1; {3738#(exists ((v_arrayElimCell_1 (_ BitVec 1))) (and (= (bvadd (bvneg v_arrayElimCell_1) (_ bv1 1)) (_ bv0 1)) (= (bvadd (bvneg v_arrayElimCell_1) (select |#valid| |ULTIMATE.start_cstpncpy_~src#1.base|)) (_ bv0 1))))} is VALID [2022-02-20 23:41:19,167 INFO L290 TraceCheckUtils]: 11: Hoare triple {3738#(exists ((v_arrayElimCell_1 (_ BitVec 1))) (and (= (bvadd (bvneg v_arrayElimCell_1) (_ bv1 1)) (_ bv0 1)) (= (bvadd (bvneg v_arrayElimCell_1) (select |#valid| |ULTIMATE.start_cstpncpy_~src#1.base|)) (_ bv0 1))))} SUMMARY for call cstpncpy_#t~mem2#1.base, cstpncpy_#t~mem2#1.offset := read~$Pointer$(cstpncpy_~#dst#1.base, cstpncpy_~#dst#1.offset, 4bv32); srcloc: L517 {3738#(exists ((v_arrayElimCell_1 (_ BitVec 1))) (and (= (bvadd (bvneg v_arrayElimCell_1) (_ bv1 1)) (_ bv0 1)) (= (bvadd (bvneg v_arrayElimCell_1) (select |#valid| |ULTIMATE.start_cstpncpy_~src#1.base|)) (_ bv0 1))))} is VALID [2022-02-20 23:41:19,168 INFO L290 TraceCheckUtils]: 12: Hoare triple {3738#(exists ((v_arrayElimCell_1 (_ BitVec 1))) (and (= (bvadd (bvneg v_arrayElimCell_1) (_ bv1 1)) (_ bv0 1)) (= (bvadd (bvneg v_arrayElimCell_1) (select |#valid| |ULTIMATE.start_cstpncpy_~src#1.base|)) (_ bv0 1))))} cstpncpy_~d~0#1.base, cstpncpy_~d~0#1.offset := cstpncpy_#t~mem2#1.base, cstpncpy_#t~mem2#1.offset;havoc cstpncpy_#t~mem2#1.base, cstpncpy_#t~mem2#1.offset;cstpncpy_~s~0#1.base, cstpncpy_~s~0#1.offset := cstpncpy_~src#1.base, cstpncpy_~src#1.offset; {3748#(exists ((v_arrayElimCell_1 (_ BitVec 1))) (and (= (bvadd (bvneg v_arrayElimCell_1) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (bvneg v_arrayElimCell_1) (select |#valid| |ULTIMATE.start_cstpncpy_~s~0#1.base|)))))} is VALID [2022-02-20 23:41:19,169 INFO L290 TraceCheckUtils]: 13: Hoare triple {3748#(exists ((v_arrayElimCell_1 (_ BitVec 1))) (and (= (bvadd (bvneg v_arrayElimCell_1) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (bvneg v_arrayElimCell_1) (select |#valid| |ULTIMATE.start_cstpncpy_~s~0#1.base|)))))} SUMMARY for call cstpncpy_#t~mem3#1.base, cstpncpy_#t~mem3#1.offset := read~$Pointer$(cstpncpy_~#dst#1.base, cstpncpy_~#dst#1.offset, 4bv32); srcloc: L519 {3748#(exists ((v_arrayElimCell_1 (_ BitVec 1))) (and (= (bvadd (bvneg v_arrayElimCell_1) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (bvneg v_arrayElimCell_1) (select |#valid| |ULTIMATE.start_cstpncpy_~s~0#1.base|)))))} is VALID [2022-02-20 23:41:19,169 INFO L290 TraceCheckUtils]: 14: Hoare triple {3748#(exists ((v_arrayElimCell_1 (_ BitVec 1))) (and (= (bvadd (bvneg v_arrayElimCell_1) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (bvneg v_arrayElimCell_1) (select |#valid| |ULTIMATE.start_cstpncpy_~s~0#1.base|)))))} SUMMARY for call write~$Pointer$(cstpncpy_#t~mem3#1.base, ~bvadd32(cstpncpy_#t~mem3#1.offset, cstpncpy_~n#1), cstpncpy_~#dst#1.base, cstpncpy_~#dst#1.offset, 4bv32); srcloc: L519-1 {3748#(exists ((v_arrayElimCell_1 (_ BitVec 1))) (and (= (bvadd (bvneg v_arrayElimCell_1) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (bvneg v_arrayElimCell_1) (select |#valid| |ULTIMATE.start_cstpncpy_~s~0#1.base|)))))} is VALID [2022-02-20 23:41:19,169 INFO L290 TraceCheckUtils]: 15: Hoare triple {3748#(exists ((v_arrayElimCell_1 (_ BitVec 1))) (and (= (bvadd (bvneg v_arrayElimCell_1) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (bvneg v_arrayElimCell_1) (select |#valid| |ULTIMATE.start_cstpncpy_~s~0#1.base|)))))} havoc cstpncpy_#t~mem3#1.base, cstpncpy_#t~mem3#1.offset; {3748#(exists ((v_arrayElimCell_1 (_ BitVec 1))) (and (= (bvadd (bvneg v_arrayElimCell_1) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (bvneg v_arrayElimCell_1) (select |#valid| |ULTIMATE.start_cstpncpy_~s~0#1.base|)))))} is VALID [2022-02-20 23:41:19,172 INFO L290 TraceCheckUtils]: 16: Hoare triple {3748#(exists ((v_arrayElimCell_1 (_ BitVec 1))) (and (= (bvadd (bvneg v_arrayElimCell_1) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (bvneg v_arrayElimCell_1) (select |#valid| |ULTIMATE.start_cstpncpy_~s~0#1.base|)))))} cstpncpy_#t~post5#1.base, cstpncpy_#t~post5#1.offset := cstpncpy_~d~0#1.base, cstpncpy_~d~0#1.offset;cstpncpy_~d~0#1.base, cstpncpy_~d~0#1.offset := cstpncpy_#t~post5#1.base, ~bvadd32(1bv32, cstpncpy_#t~post5#1.offset);cstpncpy_#t~post6#1.base, cstpncpy_#t~post6#1.offset := cstpncpy_~s~0#1.base, cstpncpy_~s~0#1.offset;cstpncpy_~s~0#1.base, cstpncpy_~s~0#1.offset := cstpncpy_#t~post6#1.base, ~bvadd32(1bv32, cstpncpy_#t~post6#1.offset); {3761#(exists ((v_arrayElimCell_1 (_ BitVec 1))) (and (= (bvadd (bvneg v_arrayElimCell_1) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (bvneg v_arrayElimCell_1) (select |#valid| |ULTIMATE.start_cstpncpy_#t~post6#1.base|)))))} is VALID [2022-02-20 23:41:19,173 INFO L290 TraceCheckUtils]: 17: Hoare triple {3761#(exists ((v_arrayElimCell_1 (_ BitVec 1))) (and (= (bvadd (bvneg v_arrayElimCell_1) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (bvneg v_arrayElimCell_1) (select |#valid| |ULTIMATE.start_cstpncpy_#t~post6#1.base|)))))} assume !(1bv1 == #valid[cstpncpy_#t~post6#1.base]); {3705#false} is VALID [2022-02-20 23:41:19,173 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:41:19,173 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:41:19,173 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:41:19,173 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1324986663] [2022-02-20 23:41:19,173 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1324986663] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:41:19,173 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:41:19,173 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 23:41:19,173 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005088777] [2022-02-20 23:41:19,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:41:19,174 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 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 18 [2022-02-20 23:41:19,174 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:41:19,174 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 3.0) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 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:41:19,215 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:41:19,215 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 23:41:19,215 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:41:19,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 23:41:19,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:41:19,216 INFO L87 Difference]: Start difference. First operand 63 states and 74 transitions. Second operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 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:41:19,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:41:19,439 INFO L93 Difference]: Finished difference Result 65 states and 77 transitions. [2022-02-20 23:41:19,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 23:41:19,439 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 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 18 [2022-02-20 23:41:19,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:41:19,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 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:41:19,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 51 transitions. [2022-02-20 23:41:19,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 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:41:19,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 51 transitions. [2022-02-20 23:41:19,440 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 51 transitions. [2022-02-20 23:41:19,511 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:41:19,512 INFO L225 Difference]: With dead ends: 65 [2022-02-20 23:41:19,512 INFO L226 Difference]: Without dead ends: 65 [2022-02-20 23:41:19,512 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-02-20 23:41:19,513 INFO L933 BasicCegarLoop]: 34 mSDtfsCounter, 5 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 78 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:41:19,513 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 131 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 78 Unchecked, 0.0s Time] [2022-02-20 23:41:19,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-02-20 23:41:19,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2022-02-20 23:41:19,514 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:41:19,514 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand has 65 states, 57 states have (on average 1.3508771929824561) internal successors, (77), 64 states have internal predecessors, (77), 0 states have call successors, (0), 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:41:19,514 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand has 65 states, 57 states have (on average 1.3508771929824561) internal successors, (77), 64 states have internal predecessors, (77), 0 states have call successors, (0), 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:41:19,515 INFO L87 Difference]: Start difference. First operand 65 states. Second operand has 65 states, 57 states have (on average 1.3508771929824561) internal successors, (77), 64 states have internal predecessors, (77), 0 states have call successors, (0), 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:41:19,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:41:19,515 INFO L93 Difference]: Finished difference Result 65 states and 77 transitions. [2022-02-20 23:41:19,515 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 77 transitions. [2022-02-20 23:41:19,515 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:41:19,515 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:41:19,516 INFO L74 IsIncluded]: Start isIncluded. First operand has 65 states, 57 states have (on average 1.3508771929824561) internal successors, (77), 64 states have internal predecessors, (77), 0 states have call successors, (0), 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:41:19,516 INFO L87 Difference]: Start difference. First operand has 65 states, 57 states have (on average 1.3508771929824561) internal successors, (77), 64 states have internal predecessors, (77), 0 states have call successors, (0), 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:41:19,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:41:19,517 INFO L93 Difference]: Finished difference Result 65 states and 77 transitions. [2022-02-20 23:41:19,517 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 77 transitions. [2022-02-20 23:41:19,517 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:41:19,517 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:41:19,517 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:41:19,517 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:41:19,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 57 states have (on average 1.3508771929824561) internal successors, (77), 64 states have internal predecessors, (77), 0 states have call successors, (0), 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:41:19,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 77 transitions. [2022-02-20 23:41:19,518 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 77 transitions. Word has length 18 [2022-02-20 23:41:19,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:41:19,518 INFO L470 AbstractCegarLoop]: Abstraction has 65 states and 77 transitions. [2022-02-20 23:41:19,519 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 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:41:19,519 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 77 transitions. [2022-02-20 23:41:19,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-20 23:41:19,519 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:41:19,519 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:41:19,530 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-02-20 23:41:19,719 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:41:19,720 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2022-02-20 23:41:19,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:41:19,720 INFO L85 PathProgramCache]: Analyzing trace with hash -994678339, now seen corresponding path program 1 times [2022-02-20 23:41:19,720 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:41:19,720 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [215289823] [2022-02-20 23:41:19,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:41:19,720 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:41:19,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:41:19,721 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:41:19,722 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-02-20 23:41:19,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:41:19,794 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 19 conjunts are in the unsatisfiable core [2022-02-20 23:41:19,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:41:19,803 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:41:19,841 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-02-20 23:41:19,841 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 1 case distinctions, treesize of input 9 treesize of output 15 [2022-02-20 23:41:19,855 INFO L356 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2022-02-20 23:41:19,856 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 1 case distinctions, treesize of input 9 treesize of output 18 [2022-02-20 23:41:19,912 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:41:19,913 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-02-20 23:41:19,920 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-20 23:41:19,921 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-02-20 23:41:20,028 INFO L290 TraceCheckUtils]: 0: Hoare triple {4026#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven; {4026#true} is VALID [2022-02-20 23:41:20,028 INFO L290 TraceCheckUtils]: 1: Hoare triple {4026#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~nondet12#1, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_#t~nondet16#1, main_#t~post15#1, main_~i~0#1, main_#t~ret17#1.base, main_#t~ret17#1.offset, main_~length~0#1, main_~n~0#1, main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset, main_~nondetString~0#1.base, main_~nondetString~0#1.offset;main_~length~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;main_~n~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; {4026#true} is VALID [2022-02-20 23:41:20,028 INFO L290 TraceCheckUtils]: 2: Hoare triple {4026#true} assume ~bvslt32(main_~length~0#1, 1bv32);main_~length~0#1 := 1bv32; {4037#(= (_ bv1 32) |ULTIMATE.start_main_~length~0#1|)} is VALID [2022-02-20 23:41:20,029 INFO L290 TraceCheckUtils]: 3: Hoare triple {4037#(= (_ bv1 32) |ULTIMATE.start_main_~length~0#1|)} assume ~bvslt32(main_~n~0#1, 1bv32);main_~n~0#1 := 1bv32; {4037#(= (_ bv1 32) |ULTIMATE.start_main_~length~0#1|)} is VALID [2022-02-20 23:41:20,030 INFO L290 TraceCheckUtils]: 4: Hoare triple {4037#(= (_ bv1 32) |ULTIMATE.start_main_~length~0#1|)} call main_#t~malloc13#1.base, main_#t~malloc13#1.offset := #Ultimate.allocOnStack(main_~n~0#1);main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset := main_#t~malloc13#1.base, main_#t~malloc13#1.offset;call main_#t~malloc14#1.base, main_#t~malloc14#1.offset := #Ultimate.allocOnStack(main_~length~0#1);main_~nondetString~0#1.base, main_~nondetString~0#1.offset := main_#t~malloc14#1.base, main_#t~malloc14#1.offset;main_~i~0#1 := 0bv32; {4044#(and (= (select |#length| |ULTIMATE.start_main_~nondetString~0#1.base|) (_ bv1 32)) (= |ULTIMATE.start_main_~nondetString~0#1.offset| (_ bv0 32)) (= (select |#valid| |ULTIMATE.start_main_~nondetString~0#1.base|) (_ bv1 1)))} is VALID [2022-02-20 23:41:20,031 INFO L290 TraceCheckUtils]: 5: Hoare triple {4044#(and (= (select |#length| |ULTIMATE.start_main_~nondetString~0#1.base|) (_ bv1 32)) (= |ULTIMATE.start_main_~nondetString~0#1.offset| (_ bv0 32)) (= (select |#valid| |ULTIMATE.start_main_~nondetString~0#1.base|) (_ bv1 1)))} assume !~bvslt32(main_~i~0#1, ~bvsub32(main_~length~0#1, 1bv32)); {4044#(and (= (select |#length| |ULTIMATE.start_main_~nondetString~0#1.base|) (_ bv1 32)) (= |ULTIMATE.start_main_~nondetString~0#1.offset| (_ bv0 32)) (= (select |#valid| |ULTIMATE.start_main_~nondetString~0#1.base|) (_ bv1 1)))} is VALID [2022-02-20 23:41:20,031 INFO L290 TraceCheckUtils]: 6: Hoare triple {4044#(and (= (select |#length| |ULTIMATE.start_main_~nondetString~0#1.base|) (_ bv1 32)) (= |ULTIMATE.start_main_~nondetString~0#1.offset| (_ bv0 32)) (= (select |#valid| |ULTIMATE.start_main_~nondetString~0#1.base|) (_ bv1 1)))} SUMMARY for call write~intINTTYPE1(0bv8, main_~nondetString~0#1.base, ~bvadd32(main_~nondetString~0#1.offset, ~bvsub32(main_~length~0#1, 1bv32)), 1bv32); srcloc: L543-4 {4044#(and (= (select |#length| |ULTIMATE.start_main_~nondetString~0#1.base|) (_ bv1 32)) (= |ULTIMATE.start_main_~nondetString~0#1.offset| (_ bv0 32)) (= (select |#valid| |ULTIMATE.start_main_~nondetString~0#1.base|) (_ bv1 1)))} is VALID [2022-02-20 23:41:20,033 INFO L290 TraceCheckUtils]: 7: Hoare triple {4044#(and (= (select |#length| |ULTIMATE.start_main_~nondetString~0#1.base|) (_ bv1 32)) (= |ULTIMATE.start_main_~nondetString~0#1.offset| (_ bv0 32)) (= (select |#valid| |ULTIMATE.start_main_~nondetString~0#1.base|) (_ bv1 1)))} assume { :begin_inline_cstpncpy } true;cstpncpy_#in~dst#1.base, cstpncpy_#in~dst#1.offset, cstpncpy_#in~src#1.base, cstpncpy_#in~src#1.offset, cstpncpy_#in~n#1 := main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset, main_~nondetString~0#1.base, main_~nondetString~0#1.offset, main_~n~0#1;havoc cstpncpy_#res#1.base, cstpncpy_#res#1.offset;havoc cstpncpy_#t~mem2#1.base, cstpncpy_#t~mem2#1.offset, cstpncpy_#t~mem3#1.base, cstpncpy_#t~mem3#1.offset, cstpncpy_#t~post5#1.base, cstpncpy_#t~post5#1.offset, cstpncpy_#t~post6#1.base, cstpncpy_#t~post6#1.offset, cstpncpy_#t~mem7#1, cstpncpy_#t~post9#1.base, cstpncpy_#t~post9#1.offset, cstpncpy_#t~pre8#1, cstpncpy_#t~pre4#1, cstpncpy_~d~0#1.base, cstpncpy_~d~0#1.offset, cstpncpy_~s~0#1.base, cstpncpy_~s~0#1.offset, cstpncpy_#t~mem10#1.base, cstpncpy_#t~mem10#1.offset, cstpncpy_~#dst#1.base, cstpncpy_~#dst#1.offset, cstpncpy_~src#1.base, cstpncpy_~src#1.offset, cstpncpy_~n#1;call cstpncpy_~#dst#1.base, cstpncpy_~#dst#1.offset := #Ultimate.allocOnStack(4bv32); {4054#(and (= |ULTIMATE.start_cstpncpy_#in~src#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_cstpncpy_#in~src#1.base|) (_ bv1 32)))} is VALID [2022-02-20 23:41:20,033 INFO L290 TraceCheckUtils]: 8: Hoare triple {4054#(and (= |ULTIMATE.start_cstpncpy_#in~src#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_cstpncpy_#in~src#1.base|) (_ bv1 32)))} SUMMARY for call write~$Pointer$(cstpncpy_#in~dst#1.base, cstpncpy_#in~dst#1.offset, cstpncpy_~#dst#1.base, cstpncpy_~#dst#1.offset, 4bv32); srcloc: L513 {4054#(and (= |ULTIMATE.start_cstpncpy_#in~src#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_cstpncpy_#in~src#1.base|) (_ bv1 32)))} is VALID [2022-02-20 23:41:20,034 INFO L290 TraceCheckUtils]: 9: Hoare triple {4054#(and (= |ULTIMATE.start_cstpncpy_#in~src#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_cstpncpy_#in~src#1.base|) (_ bv1 32)))} cstpncpy_~src#1.base, cstpncpy_~src#1.offset := cstpncpy_#in~src#1.base, cstpncpy_#in~src#1.offset;cstpncpy_~n#1 := cstpncpy_#in~n#1; {4061#(and (= (_ bv0 32) |ULTIMATE.start_cstpncpy_~src#1.offset|) (= (select |#length| |ULTIMATE.start_cstpncpy_~src#1.base|) (_ bv1 32)))} is VALID [2022-02-20 23:41:20,034 INFO L290 TraceCheckUtils]: 10: Hoare triple {4061#(and (= (_ bv0 32) |ULTIMATE.start_cstpncpy_~src#1.offset|) (= (select |#length| |ULTIMATE.start_cstpncpy_~src#1.base|) (_ bv1 32)))} assume 0bv32 != cstpncpy_~n#1; {4061#(and (= (_ bv0 32) |ULTIMATE.start_cstpncpy_~src#1.offset|) (= (select |#length| |ULTIMATE.start_cstpncpy_~src#1.base|) (_ bv1 32)))} is VALID [2022-02-20 23:41:20,034 INFO L290 TraceCheckUtils]: 11: Hoare triple {4061#(and (= (_ bv0 32) |ULTIMATE.start_cstpncpy_~src#1.offset|) (= (select |#length| |ULTIMATE.start_cstpncpy_~src#1.base|) (_ bv1 32)))} SUMMARY for call cstpncpy_#t~mem2#1.base, cstpncpy_#t~mem2#1.offset := read~$Pointer$(cstpncpy_~#dst#1.base, cstpncpy_~#dst#1.offset, 4bv32); srcloc: L517 {4061#(and (= (_ bv0 32) |ULTIMATE.start_cstpncpy_~src#1.offset|) (= (select |#length| |ULTIMATE.start_cstpncpy_~src#1.base|) (_ bv1 32)))} is VALID [2022-02-20 23:41:20,035 INFO L290 TraceCheckUtils]: 12: Hoare triple {4061#(and (= (_ bv0 32) |ULTIMATE.start_cstpncpy_~src#1.offset|) (= (select |#length| |ULTIMATE.start_cstpncpy_~src#1.base|) (_ bv1 32)))} cstpncpy_~d~0#1.base, cstpncpy_~d~0#1.offset := cstpncpy_#t~mem2#1.base, cstpncpy_#t~mem2#1.offset;havoc cstpncpy_#t~mem2#1.base, cstpncpy_#t~mem2#1.offset;cstpncpy_~s~0#1.base, cstpncpy_~s~0#1.offset := cstpncpy_~src#1.base, cstpncpy_~src#1.offset; {4071#(and (= (select |#length| |ULTIMATE.start_cstpncpy_~s~0#1.base|) (_ bv1 32)) (= |ULTIMATE.start_cstpncpy_~s~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:41:20,035 INFO L290 TraceCheckUtils]: 13: Hoare triple {4071#(and (= (select |#length| |ULTIMATE.start_cstpncpy_~s~0#1.base|) (_ bv1 32)) (= |ULTIMATE.start_cstpncpy_~s~0#1.offset| (_ bv0 32)))} SUMMARY for call cstpncpy_#t~mem3#1.base, cstpncpy_#t~mem3#1.offset := read~$Pointer$(cstpncpy_~#dst#1.base, cstpncpy_~#dst#1.offset, 4bv32); srcloc: L519 {4071#(and (= (select |#length| |ULTIMATE.start_cstpncpy_~s~0#1.base|) (_ bv1 32)) (= |ULTIMATE.start_cstpncpy_~s~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:41:20,036 INFO L290 TraceCheckUtils]: 14: Hoare triple {4071#(and (= (select |#length| |ULTIMATE.start_cstpncpy_~s~0#1.base|) (_ bv1 32)) (= |ULTIMATE.start_cstpncpy_~s~0#1.offset| (_ bv0 32)))} SUMMARY for call write~$Pointer$(cstpncpy_#t~mem3#1.base, ~bvadd32(cstpncpy_#t~mem3#1.offset, cstpncpy_~n#1), cstpncpy_~#dst#1.base, cstpncpy_~#dst#1.offset, 4bv32); srcloc: L519-1 {4071#(and (= (select |#length| |ULTIMATE.start_cstpncpy_~s~0#1.base|) (_ bv1 32)) (= |ULTIMATE.start_cstpncpy_~s~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:41:20,036 INFO L290 TraceCheckUtils]: 15: Hoare triple {4071#(and (= (select |#length| |ULTIMATE.start_cstpncpy_~s~0#1.base|) (_ bv1 32)) (= |ULTIMATE.start_cstpncpy_~s~0#1.offset| (_ bv0 32)))} havoc cstpncpy_#t~mem3#1.base, cstpncpy_#t~mem3#1.offset; {4071#(and (= (select |#length| |ULTIMATE.start_cstpncpy_~s~0#1.base|) (_ bv1 32)) (= |ULTIMATE.start_cstpncpy_~s~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:41:20,037 INFO L290 TraceCheckUtils]: 16: Hoare triple {4071#(and (= (select |#length| |ULTIMATE.start_cstpncpy_~s~0#1.base|) (_ bv1 32)) (= |ULTIMATE.start_cstpncpy_~s~0#1.offset| (_ bv0 32)))} cstpncpy_#t~post5#1.base, cstpncpy_#t~post5#1.offset := cstpncpy_~d~0#1.base, cstpncpy_~d~0#1.offset;cstpncpy_~d~0#1.base, cstpncpy_~d~0#1.offset := cstpncpy_#t~post5#1.base, ~bvadd32(1bv32, cstpncpy_#t~post5#1.offset);cstpncpy_#t~post6#1.base, cstpncpy_#t~post6#1.offset := cstpncpy_~s~0#1.base, cstpncpy_~s~0#1.offset;cstpncpy_~s~0#1.base, cstpncpy_~s~0#1.offset := cstpncpy_#t~post6#1.base, ~bvadd32(1bv32, cstpncpy_#t~post6#1.offset); {4084#(and (= |ULTIMATE.start_cstpncpy_#t~post6#1.offset| (_ bv0 32)) (= (_ bv1 32) (select |#length| |ULTIMATE.start_cstpncpy_#t~post6#1.base|)))} is VALID [2022-02-20 23:41:20,037 INFO L290 TraceCheckUtils]: 17: Hoare triple {4084#(and (= |ULTIMATE.start_cstpncpy_#t~post6#1.offset| (_ bv0 32)) (= (_ bv1 32) (select |#length| |ULTIMATE.start_cstpncpy_#t~post6#1.base|)))} assume !((~bvule32(~bvadd32(1bv32, cstpncpy_#t~post6#1.offset), #length[cstpncpy_#t~post6#1.base]) && ~bvule32(cstpncpy_#t~post6#1.offset, ~bvadd32(1bv32, cstpncpy_#t~post6#1.offset))) && ~bvule32(0bv32, cstpncpy_#t~post6#1.offset)); {4027#false} is VALID [2022-02-20 23:41:20,037 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:41:20,037 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:41:20,038 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:41:20,038 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [215289823] [2022-02-20 23:41:20,038 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [215289823] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:41:20,038 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:41:20,038 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 23:41:20,038 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655201444] [2022-02-20 23:41:20,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:41:20,038 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 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 18 [2022-02-20 23:41:20,038 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:41:20,038 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 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:41:20,059 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:41:20,059 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 23:41:20,059 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:41:20,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 23:41:20,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-02-20 23:41:20,060 INFO L87 Difference]: Start difference. First operand 65 states and 77 transitions. Second operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 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:41:21,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:41:21,251 INFO L93 Difference]: Finished difference Result 103 states and 118 transitions. [2022-02-20 23:41:21,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-20 23:41:21,251 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 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 18 [2022-02-20 23:41:21,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:41:21,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 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:41:21,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 93 transitions. [2022-02-20 23:41:21,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 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:41:21,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 93 transitions. [2022-02-20 23:41:21,252 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 93 transitions. [2022-02-20 23:41:21,365 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:41:21,366 INFO L225 Difference]: With dead ends: 103 [2022-02-20 23:41:21,366 INFO L226 Difference]: Without dead ends: 103 [2022-02-20 23:41:21,367 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2022-02-20 23:41:21,367 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 149 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 23:41:21,367 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [149 Valid, 185 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 23:41:21,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-02-20 23:41:21,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 77. [2022-02-20 23:41:21,369 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:41:21,369 INFO L82 GeneralOperation]: Start isEquivalent. First operand 103 states. Second operand has 77 states, 69 states have (on average 1.289855072463768) internal successors, (89), 76 states have internal predecessors, (89), 0 states have call successors, (0), 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:41:21,369 INFO L74 IsIncluded]: Start isIncluded. First operand 103 states. Second operand has 77 states, 69 states have (on average 1.289855072463768) internal successors, (89), 76 states have internal predecessors, (89), 0 states have call successors, (0), 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:41:21,369 INFO L87 Difference]: Start difference. First operand 103 states. Second operand has 77 states, 69 states have (on average 1.289855072463768) internal successors, (89), 76 states have internal predecessors, (89), 0 states have call successors, (0), 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:41:21,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:41:21,371 INFO L93 Difference]: Finished difference Result 103 states and 118 transitions. [2022-02-20 23:41:21,371 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 118 transitions. [2022-02-20 23:41:21,371 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:41:21,371 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:41:21,371 INFO L74 IsIncluded]: Start isIncluded. First operand has 77 states, 69 states have (on average 1.289855072463768) internal successors, (89), 76 states have internal predecessors, (89), 0 states have call successors, (0), 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 103 states. [2022-02-20 23:41:21,371 INFO L87 Difference]: Start difference. First operand has 77 states, 69 states have (on average 1.289855072463768) internal successors, (89), 76 states have internal predecessors, (89), 0 states have call successors, (0), 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 103 states. [2022-02-20 23:41:21,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:41:21,373 INFO L93 Difference]: Finished difference Result 103 states and 118 transitions. [2022-02-20 23:41:21,373 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 118 transitions. [2022-02-20 23:41:21,373 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:41:21,373 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:41:21,373 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:41:21,373 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:41:21,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 69 states have (on average 1.289855072463768) internal successors, (89), 76 states have internal predecessors, (89), 0 states have call successors, (0), 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:41:21,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 89 transitions. [2022-02-20 23:41:21,374 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 89 transitions. Word has length 18 [2022-02-20 23:41:21,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:41:21,374 INFO L470 AbstractCegarLoop]: Abstraction has 77 states and 89 transitions. [2022-02-20 23:41:21,374 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 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:41:21,375 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 89 transitions. [2022-02-20 23:41:21,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-20 23:41:21,375 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:41:21,375 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:41:21,382 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2022-02-20 23:41:21,582 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:41:21,582 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2022-02-20 23:41:21,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:41:21,582 INFO L85 PathProgramCache]: Analyzing trace with hash -2015746693, now seen corresponding path program 1 times [2022-02-20 23:41:21,582 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:41:21,583 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2147182420] [2022-02-20 23:41:21,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:41:21,583 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:41:21,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:41:21,584 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:41:21,584 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-02-20 23:41:21,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:41:21,656 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 21 conjunts are in the unsatisfiable core [2022-02-20 23:41:21,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:41:21,670 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:41:21,720 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-02-20 23:41:21,721 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 1 case distinctions, treesize of input 9 treesize of output 15 [2022-02-20 23:41:21,738 INFO L356 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2022-02-20 23:41:21,738 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 1 case distinctions, treesize of input 9 treesize of output 18 [2022-02-20 23:41:21,842 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:41:21,842 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2022-02-20 23:41:21,852 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-20 23:41:21,853 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-02-20 23:41:22,053 INFO L290 TraceCheckUtils]: 0: Hoare triple {4485#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven; {4485#true} is VALID [2022-02-20 23:41:22,053 INFO L290 TraceCheckUtils]: 1: Hoare triple {4485#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~nondet12#1, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_#t~nondet16#1, main_#t~post15#1, main_~i~0#1, main_#t~ret17#1.base, main_#t~ret17#1.offset, main_~length~0#1, main_~n~0#1, main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset, main_~nondetString~0#1.base, main_~nondetString~0#1.offset;main_~length~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;main_~n~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; {4485#true} is VALID [2022-02-20 23:41:22,053 INFO L290 TraceCheckUtils]: 2: Hoare triple {4485#true} assume !~bvslt32(main_~length~0#1, 1bv32); {4496#(not (bvslt |ULTIMATE.start_main_~length~0#1| (_ bv1 32)))} is VALID [2022-02-20 23:41:22,054 INFO L290 TraceCheckUtils]: 3: Hoare triple {4496#(not (bvslt |ULTIMATE.start_main_~length~0#1| (_ bv1 32)))} assume ~bvslt32(main_~n~0#1, 1bv32);main_~n~0#1 := 1bv32; {4496#(not (bvslt |ULTIMATE.start_main_~length~0#1| (_ bv1 32)))} is VALID [2022-02-20 23:41:22,055 INFO L290 TraceCheckUtils]: 4: Hoare triple {4496#(not (bvslt |ULTIMATE.start_main_~length~0#1| (_ bv1 32)))} call main_#t~malloc13#1.base, main_#t~malloc13#1.offset := #Ultimate.allocOnStack(main_~n~0#1);main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset := main_#t~malloc13#1.base, main_#t~malloc13#1.offset;call main_#t~malloc14#1.base, main_#t~malloc14#1.offset := #Ultimate.allocOnStack(main_~length~0#1);main_~nondetString~0#1.base, main_~nondetString~0#1.offset := main_#t~malloc14#1.base, main_#t~malloc14#1.offset;main_~i~0#1 := 0bv32; {4503#(and (= (select |#length| |ULTIMATE.start_main_~nondetString~0#1.base|) |ULTIMATE.start_main_~length~0#1|) (not (bvslt |ULTIMATE.start_main_~length~0#1| (_ bv1 32))) (= |ULTIMATE.start_main_~i~0#1| (_ bv0 32)) (= |ULTIMATE.start_main_~nondetString~0#1.offset| (_ bv0 32)) (= (select |#valid| |ULTIMATE.start_main_~nondetString~0#1.base|) (_ bv1 1)))} is VALID [2022-02-20 23:41:22,056 INFO L290 TraceCheckUtils]: 5: Hoare triple {4503#(and (= (select |#length| |ULTIMATE.start_main_~nondetString~0#1.base|) |ULTIMATE.start_main_~length~0#1|) (not (bvslt |ULTIMATE.start_main_~length~0#1| (_ bv1 32))) (= |ULTIMATE.start_main_~i~0#1| (_ bv0 32)) (= |ULTIMATE.start_main_~nondetString~0#1.offset| (_ bv0 32)) (= (select |#valid| |ULTIMATE.start_main_~nondetString~0#1.base|) (_ bv1 1)))} assume !~bvslt32(main_~i~0#1, ~bvsub32(main_~length~0#1, 1bv32)); {4507#(and (not (bvslt (_ bv0 32) (bvadd (select |#length| |ULTIMATE.start_main_~nondetString~0#1.base|) (_ bv4294967295 32)))) (= |ULTIMATE.start_main_~nondetString~0#1.offset| (_ bv0 32)) (not (bvslt (select |#length| |ULTIMATE.start_main_~nondetString~0#1.base|) (_ bv1 32))) (= (select |#valid| |ULTIMATE.start_main_~nondetString~0#1.base|) (_ bv1 1)))} is VALID [2022-02-20 23:41:22,056 INFO L290 TraceCheckUtils]: 6: Hoare triple {4507#(and (not (bvslt (_ bv0 32) (bvadd (select |#length| |ULTIMATE.start_main_~nondetString~0#1.base|) (_ bv4294967295 32)))) (= |ULTIMATE.start_main_~nondetString~0#1.offset| (_ bv0 32)) (not (bvslt (select |#length| |ULTIMATE.start_main_~nondetString~0#1.base|) (_ bv1 32))) (= (select |#valid| |ULTIMATE.start_main_~nondetString~0#1.base|) (_ bv1 1)))} SUMMARY for call write~intINTTYPE1(0bv8, main_~nondetString~0#1.base, ~bvadd32(main_~nondetString~0#1.offset, ~bvsub32(main_~length~0#1, 1bv32)), 1bv32); srcloc: L543-4 {4507#(and (not (bvslt (_ bv0 32) (bvadd (select |#length| |ULTIMATE.start_main_~nondetString~0#1.base|) (_ bv4294967295 32)))) (= |ULTIMATE.start_main_~nondetString~0#1.offset| (_ bv0 32)) (not (bvslt (select |#length| |ULTIMATE.start_main_~nondetString~0#1.base|) (_ bv1 32))) (= (select |#valid| |ULTIMATE.start_main_~nondetString~0#1.base|) (_ bv1 1)))} is VALID [2022-02-20 23:41:22,060 INFO L290 TraceCheckUtils]: 7: Hoare triple {4507#(and (not (bvslt (_ bv0 32) (bvadd (select |#length| |ULTIMATE.start_main_~nondetString~0#1.base|) (_ bv4294967295 32)))) (= |ULTIMATE.start_main_~nondetString~0#1.offset| (_ bv0 32)) (not (bvslt (select |#length| |ULTIMATE.start_main_~nondetString~0#1.base|) (_ bv1 32))) (= (select |#valid| |ULTIMATE.start_main_~nondetString~0#1.base|) (_ bv1 1)))} assume { :begin_inline_cstpncpy } true;cstpncpy_#in~dst#1.base, cstpncpy_#in~dst#1.offset, cstpncpy_#in~src#1.base, cstpncpy_#in~src#1.offset, cstpncpy_#in~n#1 := main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset, main_~nondetString~0#1.base, main_~nondetString~0#1.offset, main_~n~0#1;havoc cstpncpy_#res#1.base, cstpncpy_#res#1.offset;havoc cstpncpy_#t~mem2#1.base, cstpncpy_#t~mem2#1.offset, cstpncpy_#t~mem3#1.base, cstpncpy_#t~mem3#1.offset, cstpncpy_#t~post5#1.base, cstpncpy_#t~post5#1.offset, cstpncpy_#t~post6#1.base, cstpncpy_#t~post6#1.offset, cstpncpy_#t~mem7#1, cstpncpy_#t~post9#1.base, cstpncpy_#t~post9#1.offset, cstpncpy_#t~pre8#1, cstpncpy_#t~pre4#1, cstpncpy_~d~0#1.base, cstpncpy_~d~0#1.offset, cstpncpy_~s~0#1.base, cstpncpy_~s~0#1.offset, cstpncpy_#t~mem10#1.base, cstpncpy_#t~mem10#1.offset, cstpncpy_~#dst#1.base, cstpncpy_~#dst#1.offset, cstpncpy_~src#1.base, cstpncpy_~src#1.offset, cstpncpy_~n#1;call cstpncpy_~#dst#1.base, cstpncpy_~#dst#1.offset := #Ultimate.allocOnStack(4bv32); {4514#(and (= |ULTIMATE.start_cstpncpy_#in~src#1.offset| (_ bv0 32)) (not (bvslt (select |#length| |ULTIMATE.start_cstpncpy_#in~src#1.base|) (_ bv1 32))) (not (bvslt (_ bv0 32) (bvadd (select |#length| |ULTIMATE.start_cstpncpy_#in~src#1.base|) (_ bv4294967295 32)))))} is VALID [2022-02-20 23:41:22,061 INFO L290 TraceCheckUtils]: 8: Hoare triple {4514#(and (= |ULTIMATE.start_cstpncpy_#in~src#1.offset| (_ bv0 32)) (not (bvslt (select |#length| |ULTIMATE.start_cstpncpy_#in~src#1.base|) (_ bv1 32))) (not (bvslt (_ bv0 32) (bvadd (select |#length| |ULTIMATE.start_cstpncpy_#in~src#1.base|) (_ bv4294967295 32)))))} SUMMARY for call write~$Pointer$(cstpncpy_#in~dst#1.base, cstpncpy_#in~dst#1.offset, cstpncpy_~#dst#1.base, cstpncpy_~#dst#1.offset, 4bv32); srcloc: L513 {4514#(and (= |ULTIMATE.start_cstpncpy_#in~src#1.offset| (_ bv0 32)) (not (bvslt (select |#length| |ULTIMATE.start_cstpncpy_#in~src#1.base|) (_ bv1 32))) (not (bvslt (_ bv0 32) (bvadd (select |#length| |ULTIMATE.start_cstpncpy_#in~src#1.base|) (_ bv4294967295 32)))))} is VALID [2022-02-20 23:41:22,061 INFO L290 TraceCheckUtils]: 9: Hoare triple {4514#(and (= |ULTIMATE.start_cstpncpy_#in~src#1.offset| (_ bv0 32)) (not (bvslt (select |#length| |ULTIMATE.start_cstpncpy_#in~src#1.base|) (_ bv1 32))) (not (bvslt (_ bv0 32) (bvadd (select |#length| |ULTIMATE.start_cstpncpy_#in~src#1.base|) (_ bv4294967295 32)))))} cstpncpy_~src#1.base, cstpncpy_~src#1.offset := cstpncpy_#in~src#1.base, cstpncpy_#in~src#1.offset;cstpncpy_~n#1 := cstpncpy_#in~n#1; {4521#(and (= (_ bv0 32) |ULTIMATE.start_cstpncpy_~src#1.offset|) (not (bvslt (_ bv0 32) (bvadd (select |#length| |ULTIMATE.start_cstpncpy_~src#1.base|) (_ bv4294967295 32)))) (not (bvslt (select |#length| |ULTIMATE.start_cstpncpy_~src#1.base|) (_ bv1 32))))} is VALID [2022-02-20 23:41:22,062 INFO L290 TraceCheckUtils]: 10: Hoare triple {4521#(and (= (_ bv0 32) |ULTIMATE.start_cstpncpy_~src#1.offset|) (not (bvslt (_ bv0 32) (bvadd (select |#length| |ULTIMATE.start_cstpncpy_~src#1.base|) (_ bv4294967295 32)))) (not (bvslt (select |#length| |ULTIMATE.start_cstpncpy_~src#1.base|) (_ bv1 32))))} assume 0bv32 != cstpncpy_~n#1; {4521#(and (= (_ bv0 32) |ULTIMATE.start_cstpncpy_~src#1.offset|) (not (bvslt (_ bv0 32) (bvadd (select |#length| |ULTIMATE.start_cstpncpy_~src#1.base|) (_ bv4294967295 32)))) (not (bvslt (select |#length| |ULTIMATE.start_cstpncpy_~src#1.base|) (_ bv1 32))))} is VALID [2022-02-20 23:41:22,062 INFO L290 TraceCheckUtils]: 11: Hoare triple {4521#(and (= (_ bv0 32) |ULTIMATE.start_cstpncpy_~src#1.offset|) (not (bvslt (_ bv0 32) (bvadd (select |#length| |ULTIMATE.start_cstpncpy_~src#1.base|) (_ bv4294967295 32)))) (not (bvslt (select |#length| |ULTIMATE.start_cstpncpy_~src#1.base|) (_ bv1 32))))} SUMMARY for call cstpncpy_#t~mem2#1.base, cstpncpy_#t~mem2#1.offset := read~$Pointer$(cstpncpy_~#dst#1.base, cstpncpy_~#dst#1.offset, 4bv32); srcloc: L517 {4521#(and (= (_ bv0 32) |ULTIMATE.start_cstpncpy_~src#1.offset|) (not (bvslt (_ bv0 32) (bvadd (select |#length| |ULTIMATE.start_cstpncpy_~src#1.base|) (_ bv4294967295 32)))) (not (bvslt (select |#length| |ULTIMATE.start_cstpncpy_~src#1.base|) (_ bv1 32))))} is VALID [2022-02-20 23:41:22,063 INFO L290 TraceCheckUtils]: 12: Hoare triple {4521#(and (= (_ bv0 32) |ULTIMATE.start_cstpncpy_~src#1.offset|) (not (bvslt (_ bv0 32) (bvadd (select |#length| |ULTIMATE.start_cstpncpy_~src#1.base|) (_ bv4294967295 32)))) (not (bvslt (select |#length| |ULTIMATE.start_cstpncpy_~src#1.base|) (_ bv1 32))))} cstpncpy_~d~0#1.base, cstpncpy_~d~0#1.offset := cstpncpy_#t~mem2#1.base, cstpncpy_#t~mem2#1.offset;havoc cstpncpy_#t~mem2#1.base, cstpncpy_#t~mem2#1.offset;cstpncpy_~s~0#1.base, cstpncpy_~s~0#1.offset := cstpncpy_~src#1.base, cstpncpy_~src#1.offset; {4531#(and (not (bvslt (select |#length| |ULTIMATE.start_cstpncpy_~s~0#1.base|) (_ bv1 32))) (not (bvslt (_ bv0 32) (bvadd (select |#length| |ULTIMATE.start_cstpncpy_~s~0#1.base|) (_ bv4294967295 32)))) (= |ULTIMATE.start_cstpncpy_~s~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:41:22,063 INFO L290 TraceCheckUtils]: 13: Hoare triple {4531#(and (not (bvslt (select |#length| |ULTIMATE.start_cstpncpy_~s~0#1.base|) (_ bv1 32))) (not (bvslt (_ bv0 32) (bvadd (select |#length| |ULTIMATE.start_cstpncpy_~s~0#1.base|) (_ bv4294967295 32)))) (= |ULTIMATE.start_cstpncpy_~s~0#1.offset| (_ bv0 32)))} SUMMARY for call cstpncpy_#t~mem3#1.base, cstpncpy_#t~mem3#1.offset := read~$Pointer$(cstpncpy_~#dst#1.base, cstpncpy_~#dst#1.offset, 4bv32); srcloc: L519 {4531#(and (not (bvslt (select |#length| |ULTIMATE.start_cstpncpy_~s~0#1.base|) (_ bv1 32))) (not (bvslt (_ bv0 32) (bvadd (select |#length| |ULTIMATE.start_cstpncpy_~s~0#1.base|) (_ bv4294967295 32)))) (= |ULTIMATE.start_cstpncpy_~s~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:41:22,064 INFO L290 TraceCheckUtils]: 14: Hoare triple {4531#(and (not (bvslt (select |#length| |ULTIMATE.start_cstpncpy_~s~0#1.base|) (_ bv1 32))) (not (bvslt (_ bv0 32) (bvadd (select |#length| |ULTIMATE.start_cstpncpy_~s~0#1.base|) (_ bv4294967295 32)))) (= |ULTIMATE.start_cstpncpy_~s~0#1.offset| (_ bv0 32)))} SUMMARY for call write~$Pointer$(cstpncpy_#t~mem3#1.base, ~bvadd32(cstpncpy_#t~mem3#1.offset, cstpncpy_~n#1), cstpncpy_~#dst#1.base, cstpncpy_~#dst#1.offset, 4bv32); srcloc: L519-1 {4531#(and (not (bvslt (select |#length| |ULTIMATE.start_cstpncpy_~s~0#1.base|) (_ bv1 32))) (not (bvslt (_ bv0 32) (bvadd (select |#length| |ULTIMATE.start_cstpncpy_~s~0#1.base|) (_ bv4294967295 32)))) (= |ULTIMATE.start_cstpncpy_~s~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:41:22,065 INFO L290 TraceCheckUtils]: 15: Hoare triple {4531#(and (not (bvslt (select |#length| |ULTIMATE.start_cstpncpy_~s~0#1.base|) (_ bv1 32))) (not (bvslt (_ bv0 32) (bvadd (select |#length| |ULTIMATE.start_cstpncpy_~s~0#1.base|) (_ bv4294967295 32)))) (= |ULTIMATE.start_cstpncpy_~s~0#1.offset| (_ bv0 32)))} havoc cstpncpy_#t~mem3#1.base, cstpncpy_#t~mem3#1.offset; {4531#(and (not (bvslt (select |#length| |ULTIMATE.start_cstpncpy_~s~0#1.base|) (_ bv1 32))) (not (bvslt (_ bv0 32) (bvadd (select |#length| |ULTIMATE.start_cstpncpy_~s~0#1.base|) (_ bv4294967295 32)))) (= |ULTIMATE.start_cstpncpy_~s~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:41:22,065 INFO L290 TraceCheckUtils]: 16: Hoare triple {4531#(and (not (bvslt (select |#length| |ULTIMATE.start_cstpncpy_~s~0#1.base|) (_ bv1 32))) (not (bvslt (_ bv0 32) (bvadd (select |#length| |ULTIMATE.start_cstpncpy_~s~0#1.base|) (_ bv4294967295 32)))) (= |ULTIMATE.start_cstpncpy_~s~0#1.offset| (_ bv0 32)))} cstpncpy_#t~post5#1.base, cstpncpy_#t~post5#1.offset := cstpncpy_~d~0#1.base, cstpncpy_~d~0#1.offset;cstpncpy_~d~0#1.base, cstpncpy_~d~0#1.offset := cstpncpy_#t~post5#1.base, ~bvadd32(1bv32, cstpncpy_#t~post5#1.offset);cstpncpy_#t~post6#1.base, cstpncpy_#t~post6#1.offset := cstpncpy_~s~0#1.base, cstpncpy_~s~0#1.offset;cstpncpy_~s~0#1.base, cstpncpy_~s~0#1.offset := cstpncpy_#t~post6#1.base, ~bvadd32(1bv32, cstpncpy_#t~post6#1.offset); {4544#(and (not (bvslt (_ bv0 32) (bvadd (_ bv4294967295 32) (select |#length| |ULTIMATE.start_cstpncpy_#t~post6#1.base|)))) (= |ULTIMATE.start_cstpncpy_#t~post6#1.offset| (_ bv0 32)) (not (bvslt (select |#length| |ULTIMATE.start_cstpncpy_#t~post6#1.base|) (_ bv1 32))))} is VALID [2022-02-20 23:41:22,066 INFO L290 TraceCheckUtils]: 17: Hoare triple {4544#(and (not (bvslt (_ bv0 32) (bvadd (_ bv4294967295 32) (select |#length| |ULTIMATE.start_cstpncpy_#t~post6#1.base|)))) (= |ULTIMATE.start_cstpncpy_#t~post6#1.offset| (_ bv0 32)) (not (bvslt (select |#length| |ULTIMATE.start_cstpncpy_#t~post6#1.base|) (_ bv1 32))))} assume !((~bvule32(~bvadd32(1bv32, cstpncpy_#t~post6#1.offset), #length[cstpncpy_#t~post6#1.base]) && ~bvule32(cstpncpy_#t~post6#1.offset, ~bvadd32(1bv32, cstpncpy_#t~post6#1.offset))) && ~bvule32(0bv32, cstpncpy_#t~post6#1.offset)); {4486#false} is VALID [2022-02-20 23:41:22,066 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:41:22,067 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:41:22,067 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:41:22,067 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2147182420] [2022-02-20 23:41:22,067 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2147182420] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:41:22,067 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:41:22,067 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 23:41:22,067 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909565153] [2022-02-20 23:41:22,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:41:22,068 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 9 states have internal predecessors, (18), 0 states have call successors, (0), 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 18 [2022-02-20 23:41:22,068 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:41:22,068 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 2.25) internal successors, (18), 9 states have internal predecessors, (18), 0 states have call successors, (0), 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:41:22,097 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:41:22,097 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 23:41:22,097 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:41:22,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 23:41:22,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-02-20 23:41:22,098 INFO L87 Difference]: Start difference. First operand 77 states and 89 transitions. Second operand has 9 states, 8 states have (on average 2.25) internal successors, (18), 9 states have internal predecessors, (18), 0 states have call successors, (0), 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:41:24,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:41:24,251 INFO L93 Difference]: Finished difference Result 115 states and 130 transitions. [2022-02-20 23:41:24,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 23:41:24,251 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 9 states have internal predecessors, (18), 0 states have call successors, (0), 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 18 [2022-02-20 23:41:24,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:41:24,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.25) internal successors, (18), 9 states have internal predecessors, (18), 0 states have call successors, (0), 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:41:24,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 94 transitions. [2022-02-20 23:41:24,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.25) internal successors, (18), 9 states have internal predecessors, (18), 0 states have call successors, (0), 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:41:24,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 94 transitions. [2022-02-20 23:41:24,253 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 94 transitions. [2022-02-20 23:41:24,411 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:41:24,412 INFO L225 Difference]: With dead ends: 115 [2022-02-20 23:41:24,412 INFO L226 Difference]: Without dead ends: 115 [2022-02-20 23:41:24,412 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2022-02-20 23:41:24,413 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 192 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-02-20 23:41:24,413 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [192 Valid, 149 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-02-20 23:41:24,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2022-02-20 23:41:24,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 77. [2022-02-20 23:41:24,415 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:41:24,415 INFO L82 GeneralOperation]: Start isEquivalent. First operand 115 states. Second operand has 77 states, 69 states have (on average 1.289855072463768) internal successors, (89), 76 states have internal predecessors, (89), 0 states have call successors, (0), 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:41:24,416 INFO L74 IsIncluded]: Start isIncluded. First operand 115 states. Second operand has 77 states, 69 states have (on average 1.289855072463768) internal successors, (89), 76 states have internal predecessors, (89), 0 states have call successors, (0), 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:41:24,416 INFO L87 Difference]: Start difference. First operand 115 states. Second operand has 77 states, 69 states have (on average 1.289855072463768) internal successors, (89), 76 states have internal predecessors, (89), 0 states have call successors, (0), 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:41:24,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:41:24,417 INFO L93 Difference]: Finished difference Result 115 states and 130 transitions. [2022-02-20 23:41:24,418 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 130 transitions. [2022-02-20 23:41:24,418 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:41:24,418 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:41:24,418 INFO L74 IsIncluded]: Start isIncluded. First operand has 77 states, 69 states have (on average 1.289855072463768) internal successors, (89), 76 states have internal predecessors, (89), 0 states have call successors, (0), 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 115 states. [2022-02-20 23:41:24,419 INFO L87 Difference]: Start difference. First operand has 77 states, 69 states have (on average 1.289855072463768) internal successors, (89), 76 states have internal predecessors, (89), 0 states have call successors, (0), 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 115 states. [2022-02-20 23:41:24,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:41:24,420 INFO L93 Difference]: Finished difference Result 115 states and 130 transitions. [2022-02-20 23:41:24,420 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 130 transitions. [2022-02-20 23:41:24,420 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:41:24,420 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:41:24,420 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:41:24,420 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:41:24,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 69 states have (on average 1.289855072463768) internal successors, (89), 76 states have internal predecessors, (89), 0 states have call successors, (0), 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:41:24,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 89 transitions. [2022-02-20 23:41:24,421 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 89 transitions. Word has length 18 [2022-02-20 23:41:24,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:41:24,422 INFO L470 AbstractCegarLoop]: Abstraction has 77 states and 89 transitions. [2022-02-20 23:41:24,422 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 9 states have internal predecessors, (18), 0 states have call successors, (0), 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:41:24,422 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 89 transitions. [2022-02-20 23:41:24,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-02-20 23:41:24,422 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:41:24,422 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:41:24,431 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2022-02-20 23:41:24,629 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:41:24,629 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2022-02-20 23:41:24,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:41:24,629 INFO L85 PathProgramCache]: Analyzing trace with hash -770257435, now seen corresponding path program 1 times [2022-02-20 23:41:24,630 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:41:24,630 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [177938290] [2022-02-20 23:41:24,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:41:24,630 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:41:24,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:41:24,631 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:41:24,631 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2022-02-20 23:41:24,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:41:24,708 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 26 conjunts are in the unsatisfiable core [2022-02-20 23:41:24,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:41:24,722 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:41:24,758 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:41:24,758 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-02-20 23:41:24,763 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-02-20 23:41:24,807 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-02-20 23:41:24,808 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-02-20 23:41:24,841 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2022-02-20 23:41:24,846 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2022-02-20 23:41:24,910 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-02-20 23:41:24,913 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-02-20 23:41:25,113 INFO L290 TraceCheckUtils]: 0: Hoare triple {4981#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven; {4981#true} is VALID [2022-02-20 23:41:25,113 INFO L290 TraceCheckUtils]: 1: Hoare triple {4981#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~nondet12#1, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_#t~nondet16#1, main_#t~post15#1, main_~i~0#1, main_#t~ret17#1.base, main_#t~ret17#1.offset, main_~length~0#1, main_~n~0#1, main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset, main_~nondetString~0#1.base, main_~nondetString~0#1.offset;main_~length~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;main_~n~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; {4981#true} is VALID [2022-02-20 23:41:25,113 INFO L290 TraceCheckUtils]: 2: Hoare triple {4981#true} assume ~bvslt32(main_~length~0#1, 1bv32);main_~length~0#1 := 1bv32; {4981#true} is VALID [2022-02-20 23:41:25,114 INFO L290 TraceCheckUtils]: 3: Hoare triple {4981#true} assume ~bvslt32(main_~n~0#1, 1bv32);main_~n~0#1 := 1bv32; {4995#(= |ULTIMATE.start_main_~n~0#1| (_ bv1 32))} is VALID [2022-02-20 23:41:25,115 INFO L290 TraceCheckUtils]: 4: Hoare triple {4995#(= |ULTIMATE.start_main_~n~0#1| (_ bv1 32))} call main_#t~malloc13#1.base, main_#t~malloc13#1.offset := #Ultimate.allocOnStack(main_~n~0#1);main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset := main_#t~malloc13#1.base, main_#t~malloc13#1.offset;call main_#t~malloc14#1.base, main_#t~malloc14#1.offset := #Ultimate.allocOnStack(main_~length~0#1);main_~nondetString~0#1.base, main_~nondetString~0#1.offset := main_#t~malloc14#1.base, main_#t~malloc14#1.offset;main_~i~0#1 := 0bv32; {4999#(and (= |ULTIMATE.start_main_~nondetArea~0#1.offset| (_ bv0 32)) (= (_ bv1 32) (select |#length| |ULTIMATE.start_main_~nondetArea~0#1.base|)))} is VALID [2022-02-20 23:41:25,115 INFO L290 TraceCheckUtils]: 5: Hoare triple {4999#(and (= |ULTIMATE.start_main_~nondetArea~0#1.offset| (_ bv0 32)) (= (_ bv1 32) (select |#length| |ULTIMATE.start_main_~nondetArea~0#1.base|)))} assume !~bvslt32(main_~i~0#1, ~bvsub32(main_~length~0#1, 1bv32)); {4999#(and (= |ULTIMATE.start_main_~nondetArea~0#1.offset| (_ bv0 32)) (= (_ bv1 32) (select |#length| |ULTIMATE.start_main_~nondetArea~0#1.base|)))} is VALID [2022-02-20 23:41:25,116 INFO L290 TraceCheckUtils]: 6: Hoare triple {4999#(and (= |ULTIMATE.start_main_~nondetArea~0#1.offset| (_ bv0 32)) (= (_ bv1 32) (select |#length| |ULTIMATE.start_main_~nondetArea~0#1.base|)))} SUMMARY for call write~intINTTYPE1(0bv8, main_~nondetString~0#1.base, ~bvadd32(main_~nondetString~0#1.offset, ~bvsub32(main_~length~0#1, 1bv32)), 1bv32); srcloc: L543-4 {4999#(and (= |ULTIMATE.start_main_~nondetArea~0#1.offset| (_ bv0 32)) (= (_ bv1 32) (select |#length| |ULTIMATE.start_main_~nondetArea~0#1.base|)))} is VALID [2022-02-20 23:41:25,117 INFO L290 TraceCheckUtils]: 7: Hoare triple {4999#(and (= |ULTIMATE.start_main_~nondetArea~0#1.offset| (_ bv0 32)) (= (_ bv1 32) (select |#length| |ULTIMATE.start_main_~nondetArea~0#1.base|)))} assume { :begin_inline_cstpncpy } true;cstpncpy_#in~dst#1.base, cstpncpy_#in~dst#1.offset, cstpncpy_#in~src#1.base, cstpncpy_#in~src#1.offset, cstpncpy_#in~n#1 := main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset, main_~nondetString~0#1.base, main_~nondetString~0#1.offset, main_~n~0#1;havoc cstpncpy_#res#1.base, cstpncpy_#res#1.offset;havoc cstpncpy_#t~mem2#1.base, cstpncpy_#t~mem2#1.offset, cstpncpy_#t~mem3#1.base, cstpncpy_#t~mem3#1.offset, cstpncpy_#t~post5#1.base, cstpncpy_#t~post5#1.offset, cstpncpy_#t~post6#1.base, cstpncpy_#t~post6#1.offset, cstpncpy_#t~mem7#1, cstpncpy_#t~post9#1.base, cstpncpy_#t~post9#1.offset, cstpncpy_#t~pre8#1, cstpncpy_#t~pre4#1, cstpncpy_~d~0#1.base, cstpncpy_~d~0#1.offset, cstpncpy_~s~0#1.base, cstpncpy_~s~0#1.offset, cstpncpy_#t~mem10#1.base, cstpncpy_#t~mem10#1.offset, cstpncpy_~#dst#1.base, cstpncpy_~#dst#1.offset, cstpncpy_~src#1.base, cstpncpy_~src#1.offset, cstpncpy_~n#1;call cstpncpy_~#dst#1.base, cstpncpy_~#dst#1.offset := #Ultimate.allocOnStack(4bv32); {5009#(and (or (= |ULTIMATE.start_cstpncpy_#in~dst#1.base| |ULTIMATE.start_cstpncpy_~#dst#1.base|) (= (_ bv1 32) (select |#length| |ULTIMATE.start_cstpncpy_#in~dst#1.base|))) (= |ULTIMATE.start_cstpncpy_#in~dst#1.offset| (_ bv0 32)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_cstpncpy_~#dst#1.base|)))} is VALID [2022-02-20 23:41:25,118 INFO L290 TraceCheckUtils]: 8: Hoare triple {5009#(and (or (= |ULTIMATE.start_cstpncpy_#in~dst#1.base| |ULTIMATE.start_cstpncpy_~#dst#1.base|) (= (_ bv1 32) (select |#length| |ULTIMATE.start_cstpncpy_#in~dst#1.base|))) (= |ULTIMATE.start_cstpncpy_#in~dst#1.offset| (_ bv0 32)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_cstpncpy_~#dst#1.base|)))} SUMMARY for call write~$Pointer$(cstpncpy_#in~dst#1.base, cstpncpy_#in~dst#1.offset, cstpncpy_~#dst#1.base, cstpncpy_~#dst#1.offset, 4bv32); srcloc: L513 {5013#(and (or (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_cstpncpy_~#dst#1.base|) |ULTIMATE.start_cstpncpy_~#dst#1.offset|)) (_ bv1 32)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_cstpncpy_~#dst#1.base|) |ULTIMATE.start_cstpncpy_~#dst#1.offset|) |ULTIMATE.start_cstpncpy_~#dst#1.base|)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_cstpncpy_~#dst#1.base|) |ULTIMATE.start_cstpncpy_~#dst#1.offset|)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_cstpncpy_~#dst#1.base|)))} is VALID [2022-02-20 23:41:25,119 INFO L290 TraceCheckUtils]: 9: Hoare triple {5013#(and (or (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_cstpncpy_~#dst#1.base|) |ULTIMATE.start_cstpncpy_~#dst#1.offset|)) (_ bv1 32)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_cstpncpy_~#dst#1.base|) |ULTIMATE.start_cstpncpy_~#dst#1.offset|) |ULTIMATE.start_cstpncpy_~#dst#1.base|)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_cstpncpy_~#dst#1.base|) |ULTIMATE.start_cstpncpy_~#dst#1.offset|)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_cstpncpy_~#dst#1.base|)))} cstpncpy_~src#1.base, cstpncpy_~src#1.offset := cstpncpy_#in~src#1.base, cstpncpy_#in~src#1.offset;cstpncpy_~n#1 := cstpncpy_#in~n#1; {5013#(and (or (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_cstpncpy_~#dst#1.base|) |ULTIMATE.start_cstpncpy_~#dst#1.offset|)) (_ bv1 32)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_cstpncpy_~#dst#1.base|) |ULTIMATE.start_cstpncpy_~#dst#1.offset|) |ULTIMATE.start_cstpncpy_~#dst#1.base|)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_cstpncpy_~#dst#1.base|) |ULTIMATE.start_cstpncpy_~#dst#1.offset|)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_cstpncpy_~#dst#1.base|)))} is VALID [2022-02-20 23:41:25,120 INFO L290 TraceCheckUtils]: 10: Hoare triple {5013#(and (or (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_cstpncpy_~#dst#1.base|) |ULTIMATE.start_cstpncpy_~#dst#1.offset|)) (_ bv1 32)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_cstpncpy_~#dst#1.base|) |ULTIMATE.start_cstpncpy_~#dst#1.offset|) |ULTIMATE.start_cstpncpy_~#dst#1.base|)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_cstpncpy_~#dst#1.base|) |ULTIMATE.start_cstpncpy_~#dst#1.offset|)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_cstpncpy_~#dst#1.base|)))} assume 0bv32 != cstpncpy_~n#1; {5013#(and (or (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_cstpncpy_~#dst#1.base|) |ULTIMATE.start_cstpncpy_~#dst#1.offset|)) (_ bv1 32)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_cstpncpy_~#dst#1.base|) |ULTIMATE.start_cstpncpy_~#dst#1.offset|) |ULTIMATE.start_cstpncpy_~#dst#1.base|)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_cstpncpy_~#dst#1.base|) |ULTIMATE.start_cstpncpy_~#dst#1.offset|)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_cstpncpy_~#dst#1.base|)))} is VALID [2022-02-20 23:41:25,121 INFO L290 TraceCheckUtils]: 11: Hoare triple {5013#(and (or (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_cstpncpy_~#dst#1.base|) |ULTIMATE.start_cstpncpy_~#dst#1.offset|)) (_ bv1 32)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_cstpncpy_~#dst#1.base|) |ULTIMATE.start_cstpncpy_~#dst#1.offset|) |ULTIMATE.start_cstpncpy_~#dst#1.base|)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_cstpncpy_~#dst#1.base|) |ULTIMATE.start_cstpncpy_~#dst#1.offset|)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_cstpncpy_~#dst#1.base|)))} SUMMARY for call cstpncpy_#t~mem2#1.base, cstpncpy_#t~mem2#1.offset := read~$Pointer$(cstpncpy_~#dst#1.base, cstpncpy_~#dst#1.offset, 4bv32); srcloc: L517 {5023#(and (= |ULTIMATE.start_cstpncpy_#t~mem2#1.offset| (_ bv0 32)) (exists ((|ULTIMATE.start_cstpncpy_~#dst#1.base| (_ BitVec 32))) (and (= (_ bv4 32) (select |#length| |ULTIMATE.start_cstpncpy_~#dst#1.base|)) (or (= |ULTIMATE.start_cstpncpy_#t~mem2#1.base| |ULTIMATE.start_cstpncpy_~#dst#1.base|) (= (select |#length| |ULTIMATE.start_cstpncpy_#t~mem2#1.base|) (_ bv1 32))))))} is VALID [2022-02-20 23:41:25,122 INFO L290 TraceCheckUtils]: 12: Hoare triple {5023#(and (= |ULTIMATE.start_cstpncpy_#t~mem2#1.offset| (_ bv0 32)) (exists ((|ULTIMATE.start_cstpncpy_~#dst#1.base| (_ BitVec 32))) (and (= (_ bv4 32) (select |#length| |ULTIMATE.start_cstpncpy_~#dst#1.base|)) (or (= |ULTIMATE.start_cstpncpy_#t~mem2#1.base| |ULTIMATE.start_cstpncpy_~#dst#1.base|) (= (select |#length| |ULTIMATE.start_cstpncpy_#t~mem2#1.base|) (_ bv1 32))))))} cstpncpy_~d~0#1.base, cstpncpy_~d~0#1.offset := cstpncpy_#t~mem2#1.base, cstpncpy_#t~mem2#1.offset;havoc cstpncpy_#t~mem2#1.base, cstpncpy_#t~mem2#1.offset;cstpncpy_~s~0#1.base, cstpncpy_~s~0#1.offset := cstpncpy_~src#1.base, cstpncpy_~src#1.offset; {5027#(and (= |ULTIMATE.start_cstpncpy_~d~0#1.offset| (_ bv0 32)) (exists ((|ULTIMATE.start_cstpncpy_~#dst#1.base| (_ BitVec 32))) (and (= (_ bv4 32) (select |#length| |ULTIMATE.start_cstpncpy_~#dst#1.base|)) (or (= (select |#length| |ULTIMATE.start_cstpncpy_~d~0#1.base|) (_ bv1 32)) (= |ULTIMATE.start_cstpncpy_~d~0#1.base| |ULTIMATE.start_cstpncpy_~#dst#1.base|)))))} is VALID [2022-02-20 23:41:25,123 INFO L290 TraceCheckUtils]: 13: Hoare triple {5027#(and (= |ULTIMATE.start_cstpncpy_~d~0#1.offset| (_ bv0 32)) (exists ((|ULTIMATE.start_cstpncpy_~#dst#1.base| (_ BitVec 32))) (and (= (_ bv4 32) (select |#length| |ULTIMATE.start_cstpncpy_~#dst#1.base|)) (or (= (select |#length| |ULTIMATE.start_cstpncpy_~d~0#1.base|) (_ bv1 32)) (= |ULTIMATE.start_cstpncpy_~d~0#1.base| |ULTIMATE.start_cstpncpy_~#dst#1.base|)))))} SUMMARY for call cstpncpy_#t~mem3#1.base, cstpncpy_#t~mem3#1.offset := read~$Pointer$(cstpncpy_~#dst#1.base, cstpncpy_~#dst#1.offset, 4bv32); srcloc: L519 {5027#(and (= |ULTIMATE.start_cstpncpy_~d~0#1.offset| (_ bv0 32)) (exists ((|ULTIMATE.start_cstpncpy_~#dst#1.base| (_ BitVec 32))) (and (= (_ bv4 32) (select |#length| |ULTIMATE.start_cstpncpy_~#dst#1.base|)) (or (= (select |#length| |ULTIMATE.start_cstpncpy_~d~0#1.base|) (_ bv1 32)) (= |ULTIMATE.start_cstpncpy_~d~0#1.base| |ULTIMATE.start_cstpncpy_~#dst#1.base|)))))} is VALID [2022-02-20 23:41:25,124 INFO L290 TraceCheckUtils]: 14: Hoare triple {5027#(and (= |ULTIMATE.start_cstpncpy_~d~0#1.offset| (_ bv0 32)) (exists ((|ULTIMATE.start_cstpncpy_~#dst#1.base| (_ BitVec 32))) (and (= (_ bv4 32) (select |#length| |ULTIMATE.start_cstpncpy_~#dst#1.base|)) (or (= (select |#length| |ULTIMATE.start_cstpncpy_~d~0#1.base|) (_ bv1 32)) (= |ULTIMATE.start_cstpncpy_~d~0#1.base| |ULTIMATE.start_cstpncpy_~#dst#1.base|)))))} SUMMARY for call write~$Pointer$(cstpncpy_#t~mem3#1.base, ~bvadd32(cstpncpy_#t~mem3#1.offset, cstpncpy_~n#1), cstpncpy_~#dst#1.base, cstpncpy_~#dst#1.offset, 4bv32); srcloc: L519-1 {5027#(and (= |ULTIMATE.start_cstpncpy_~d~0#1.offset| (_ bv0 32)) (exists ((|ULTIMATE.start_cstpncpy_~#dst#1.base| (_ BitVec 32))) (and (= (_ bv4 32) (select |#length| |ULTIMATE.start_cstpncpy_~#dst#1.base|)) (or (= (select |#length| |ULTIMATE.start_cstpncpy_~d~0#1.base|) (_ bv1 32)) (= |ULTIMATE.start_cstpncpy_~d~0#1.base| |ULTIMATE.start_cstpncpy_~#dst#1.base|)))))} is VALID [2022-02-20 23:41:25,125 INFO L290 TraceCheckUtils]: 15: Hoare triple {5027#(and (= |ULTIMATE.start_cstpncpy_~d~0#1.offset| (_ bv0 32)) (exists ((|ULTIMATE.start_cstpncpy_~#dst#1.base| (_ BitVec 32))) (and (= (_ bv4 32) (select |#length| |ULTIMATE.start_cstpncpy_~#dst#1.base|)) (or (= (select |#length| |ULTIMATE.start_cstpncpy_~d~0#1.base|) (_ bv1 32)) (= |ULTIMATE.start_cstpncpy_~d~0#1.base| |ULTIMATE.start_cstpncpy_~#dst#1.base|)))))} havoc cstpncpy_#t~mem3#1.base, cstpncpy_#t~mem3#1.offset; {5027#(and (= |ULTIMATE.start_cstpncpy_~d~0#1.offset| (_ bv0 32)) (exists ((|ULTIMATE.start_cstpncpy_~#dst#1.base| (_ BitVec 32))) (and (= (_ bv4 32) (select |#length| |ULTIMATE.start_cstpncpy_~#dst#1.base|)) (or (= (select |#length| |ULTIMATE.start_cstpncpy_~d~0#1.base|) (_ bv1 32)) (= |ULTIMATE.start_cstpncpy_~d~0#1.base| |ULTIMATE.start_cstpncpy_~#dst#1.base|)))))} is VALID [2022-02-20 23:41:25,126 INFO L290 TraceCheckUtils]: 16: Hoare triple {5027#(and (= |ULTIMATE.start_cstpncpy_~d~0#1.offset| (_ bv0 32)) (exists ((|ULTIMATE.start_cstpncpy_~#dst#1.base| (_ BitVec 32))) (and (= (_ bv4 32) (select |#length| |ULTIMATE.start_cstpncpy_~#dst#1.base|)) (or (= (select |#length| |ULTIMATE.start_cstpncpy_~d~0#1.base|) (_ bv1 32)) (= |ULTIMATE.start_cstpncpy_~d~0#1.base| |ULTIMATE.start_cstpncpy_~#dst#1.base|)))))} cstpncpy_#t~post5#1.base, cstpncpy_#t~post5#1.offset := cstpncpy_~d~0#1.base, cstpncpy_~d~0#1.offset;cstpncpy_~d~0#1.base, cstpncpy_~d~0#1.offset := cstpncpy_#t~post5#1.base, ~bvadd32(1bv32, cstpncpy_#t~post5#1.offset);cstpncpy_#t~post6#1.base, cstpncpy_#t~post6#1.offset := cstpncpy_~s~0#1.base, cstpncpy_~s~0#1.offset;cstpncpy_~s~0#1.base, cstpncpy_~s~0#1.offset := cstpncpy_#t~post6#1.base, ~bvadd32(1bv32, cstpncpy_#t~post6#1.offset); {5040#(and (exists ((|ULTIMATE.start_cstpncpy_~#dst#1.base| (_ BitVec 32))) (and (or (= (select |#length| |ULTIMATE.start_cstpncpy_#t~post5#1.base|) (_ bv1 32)) (= |ULTIMATE.start_cstpncpy_#t~post5#1.base| |ULTIMATE.start_cstpncpy_~#dst#1.base|)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_cstpncpy_~#dst#1.base|)))) (= (_ bv0 32) |ULTIMATE.start_cstpncpy_#t~post5#1.offset|))} is VALID [2022-02-20 23:41:25,127 INFO L290 TraceCheckUtils]: 17: Hoare triple {5040#(and (exists ((|ULTIMATE.start_cstpncpy_~#dst#1.base| (_ BitVec 32))) (and (or (= (select |#length| |ULTIMATE.start_cstpncpy_#t~post5#1.base|) (_ bv1 32)) (= |ULTIMATE.start_cstpncpy_#t~post5#1.base| |ULTIMATE.start_cstpncpy_~#dst#1.base|)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_cstpncpy_~#dst#1.base|)))) (= (_ bv0 32) |ULTIMATE.start_cstpncpy_#t~post5#1.offset|))} SUMMARY for call cstpncpy_#t~mem7#1 := read~intINTTYPE1(cstpncpy_#t~post6#1.base, cstpncpy_#t~post6#1.offset, 1bv32); srcloc: L521 {5040#(and (exists ((|ULTIMATE.start_cstpncpy_~#dst#1.base| (_ BitVec 32))) (and (or (= (select |#length| |ULTIMATE.start_cstpncpy_#t~post5#1.base|) (_ bv1 32)) (= |ULTIMATE.start_cstpncpy_#t~post5#1.base| |ULTIMATE.start_cstpncpy_~#dst#1.base|)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_cstpncpy_~#dst#1.base|)))) (= (_ bv0 32) |ULTIMATE.start_cstpncpy_#t~post5#1.offset|))} is VALID [2022-02-20 23:41:25,128 INFO L290 TraceCheckUtils]: 18: Hoare triple {5040#(and (exists ((|ULTIMATE.start_cstpncpy_~#dst#1.base| (_ BitVec 32))) (and (or (= (select |#length| |ULTIMATE.start_cstpncpy_#t~post5#1.base|) (_ bv1 32)) (= |ULTIMATE.start_cstpncpy_#t~post5#1.base| |ULTIMATE.start_cstpncpy_~#dst#1.base|)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_cstpncpy_~#dst#1.base|)))) (= (_ bv0 32) |ULTIMATE.start_cstpncpy_#t~post5#1.offset|))} assume !((~bvule32(~bvadd32(1bv32, cstpncpy_#t~post5#1.offset), #length[cstpncpy_#t~post5#1.base]) && ~bvule32(cstpncpy_#t~post5#1.offset, ~bvadd32(1bv32, cstpncpy_#t~post5#1.offset))) && ~bvule32(0bv32, cstpncpy_#t~post5#1.offset)); {4982#false} is VALID [2022-02-20 23:41:25,128 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:41:25,129 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:41:25,129 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:41:25,129 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [177938290] [2022-02-20 23:41:25,129 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [177938290] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:41:25,129 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:41:25,129 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 23:41:25,129 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018996727] [2022-02-20 23:41:25,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:41:25,130 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 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 19 [2022-02-20 23:41:25,130 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:41:25,130 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 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:41:25,152 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:41:25,152 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 23:41:25,153 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:41:25,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 23:41:25,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-02-20 23:41:25,153 INFO L87 Difference]: Start difference. First operand 77 states and 89 transitions. Second operand has 9 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 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:41:25,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:41:25,769 INFO L93 Difference]: Finished difference Result 128 states and 148 transitions. [2022-02-20 23:41:25,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-20 23:41:25,769 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 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 19 [2022-02-20 23:41:25,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:41:25,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 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:41:25,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 70 transitions. [2022-02-20 23:41:25,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 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:41:25,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 70 transitions. [2022-02-20 23:41:25,775 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 70 transitions. [2022-02-20 23:41:25,851 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:41:25,852 INFO L225 Difference]: With dead ends: 128 [2022-02-20 23:41:25,852 INFO L226 Difference]: Without dead ends: 128 [2022-02-20 23:41:25,852 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2022-02-20 23:41:25,856 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 22 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 67 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:41:25,856 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 222 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 67 Unchecked, 0.2s Time] [2022-02-20 23:41:25,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2022-02-20 23:41:25,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 127. [2022-02-20 23:41:25,860 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:41:25,860 INFO L82 GeneralOperation]: Start isEquivalent. First operand 128 states. Second operand has 127 states, 119 states have (on average 1.2436974789915967) internal successors, (148), 126 states have internal predecessors, (148), 0 states have call successors, (0), 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:41:25,863 INFO L74 IsIncluded]: Start isIncluded. First operand 128 states. Second operand has 127 states, 119 states have (on average 1.2436974789915967) internal successors, (148), 126 states have internal predecessors, (148), 0 states have call successors, (0), 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:41:25,863 INFO L87 Difference]: Start difference. First operand 128 states. Second operand has 127 states, 119 states have (on average 1.2436974789915967) internal successors, (148), 126 states have internal predecessors, (148), 0 states have call successors, (0), 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:41:25,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:41:25,865 INFO L93 Difference]: Finished difference Result 128 states and 148 transitions. [2022-02-20 23:41:25,865 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 148 transitions. [2022-02-20 23:41:25,865 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:41:25,865 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:41:25,866 INFO L74 IsIncluded]: Start isIncluded. First operand has 127 states, 119 states have (on average 1.2436974789915967) internal successors, (148), 126 states have internal predecessors, (148), 0 states have call successors, (0), 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 128 states. [2022-02-20 23:41:25,866 INFO L87 Difference]: Start difference. First operand has 127 states, 119 states have (on average 1.2436974789915967) internal successors, (148), 126 states have internal predecessors, (148), 0 states have call successors, (0), 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 128 states. [2022-02-20 23:41:25,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:41:25,867 INFO L93 Difference]: Finished difference Result 128 states and 148 transitions. [2022-02-20 23:41:25,867 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 148 transitions. [2022-02-20 23:41:25,868 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:41:25,868 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:41:25,868 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:41:25,868 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:41:25,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 119 states have (on average 1.2436974789915967) internal successors, (148), 126 states have internal predecessors, (148), 0 states have call successors, (0), 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:41:25,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 148 transitions. [2022-02-20 23:41:25,869 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 148 transitions. Word has length 19 [2022-02-20 23:41:25,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:41:25,870 INFO L470 AbstractCegarLoop]: Abstraction has 127 states and 148 transitions. [2022-02-20 23:41:25,870 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 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:41:25,870 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 148 transitions. [2022-02-20 23:41:25,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-02-20 23:41:25,870 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:41:25,870 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:41:25,879 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2022-02-20 23:41:26,076 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:41:26,077 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2022-02-20 23:41:26,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:41:26,077 INFO L85 PathProgramCache]: Analyzing trace with hash -770257436, now seen corresponding path program 1 times [2022-02-20 23:41:26,077 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:41:26,077 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2007592281] [2022-02-20 23:41:26,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:41:26,077 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:41:26,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:41:26,078 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:41:26,079 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2022-02-20 23:41:26,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:41:26,154 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 15 conjunts are in the unsatisfiable core [2022-02-20 23:41:26,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:41:26,163 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:41:26,189 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-02-20 23:41:26,190 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 21 [2022-02-20 23:41:26,224 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-02-20 23:41:26,224 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 20 [2022-02-20 23:41:26,251 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2022-02-20 23:41:26,305 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2022-02-20 23:41:26,388 INFO L290 TraceCheckUtils]: 0: Hoare triple {5565#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven; {5565#true} is VALID [2022-02-20 23:41:26,388 INFO L290 TraceCheckUtils]: 1: Hoare triple {5565#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~nondet12#1, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_#t~nondet16#1, main_#t~post15#1, main_~i~0#1, main_#t~ret17#1.base, main_#t~ret17#1.offset, main_~length~0#1, main_~n~0#1, main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset, main_~nondetString~0#1.base, main_~nondetString~0#1.offset;main_~length~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;main_~n~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; {5565#true} is VALID [2022-02-20 23:41:26,388 INFO L290 TraceCheckUtils]: 2: Hoare triple {5565#true} assume ~bvslt32(main_~length~0#1, 1bv32);main_~length~0#1 := 1bv32; {5565#true} is VALID [2022-02-20 23:41:26,388 INFO L290 TraceCheckUtils]: 3: Hoare triple {5565#true} assume ~bvslt32(main_~n~0#1, 1bv32);main_~n~0#1 := 1bv32; {5565#true} is VALID [2022-02-20 23:41:26,390 INFO L290 TraceCheckUtils]: 4: Hoare triple {5565#true} call main_#t~malloc13#1.base, main_#t~malloc13#1.offset := #Ultimate.allocOnStack(main_~n~0#1);main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset := main_#t~malloc13#1.base, main_#t~malloc13#1.offset;call main_#t~malloc14#1.base, main_#t~malloc14#1.offset := #Ultimate.allocOnStack(main_~length~0#1);main_~nondetString~0#1.base, main_~nondetString~0#1.offset := main_#t~malloc14#1.base, main_#t~malloc14#1.offset;main_~i~0#1 := 0bv32; {5582#(= (bvadd (bvneg (select |#valid| |ULTIMATE.start_main_~nondetArea~0#1.base|)) (_ bv1 1)) (_ bv0 1))} is VALID [2022-02-20 23:41:26,390 INFO L290 TraceCheckUtils]: 5: Hoare triple {5582#(= (bvadd (bvneg (select |#valid| |ULTIMATE.start_main_~nondetArea~0#1.base|)) (_ bv1 1)) (_ bv0 1))} assume !~bvslt32(main_~i~0#1, ~bvsub32(main_~length~0#1, 1bv32)); {5582#(= (bvadd (bvneg (select |#valid| |ULTIMATE.start_main_~nondetArea~0#1.base|)) (_ bv1 1)) (_ bv0 1))} is VALID [2022-02-20 23:41:26,391 INFO L290 TraceCheckUtils]: 6: Hoare triple {5582#(= (bvadd (bvneg (select |#valid| |ULTIMATE.start_main_~nondetArea~0#1.base|)) (_ bv1 1)) (_ bv0 1))} SUMMARY for call write~intINTTYPE1(0bv8, main_~nondetString~0#1.base, ~bvadd32(main_~nondetString~0#1.offset, ~bvsub32(main_~length~0#1, 1bv32)), 1bv32); srcloc: L543-4 {5582#(= (bvadd (bvneg (select |#valid| |ULTIMATE.start_main_~nondetArea~0#1.base|)) (_ bv1 1)) (_ bv0 1))} is VALID [2022-02-20 23:41:26,393 INFO L290 TraceCheckUtils]: 7: Hoare triple {5582#(= (bvadd (bvneg (select |#valid| |ULTIMATE.start_main_~nondetArea~0#1.base|)) (_ bv1 1)) (_ bv0 1))} assume { :begin_inline_cstpncpy } true;cstpncpy_#in~dst#1.base, cstpncpy_#in~dst#1.offset, cstpncpy_#in~src#1.base, cstpncpy_#in~src#1.offset, cstpncpy_#in~n#1 := main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset, main_~nondetString~0#1.base, main_~nondetString~0#1.offset, main_~n~0#1;havoc cstpncpy_#res#1.base, cstpncpy_#res#1.offset;havoc cstpncpy_#t~mem2#1.base, cstpncpy_#t~mem2#1.offset, cstpncpy_#t~mem3#1.base, cstpncpy_#t~mem3#1.offset, cstpncpy_#t~post5#1.base, cstpncpy_#t~post5#1.offset, cstpncpy_#t~post6#1.base, cstpncpy_#t~post6#1.offset, cstpncpy_#t~mem7#1, cstpncpy_#t~post9#1.base, cstpncpy_#t~post9#1.offset, cstpncpy_#t~pre8#1, cstpncpy_#t~pre4#1, cstpncpy_~d~0#1.base, cstpncpy_~d~0#1.offset, cstpncpy_~s~0#1.base, cstpncpy_~s~0#1.offset, cstpncpy_#t~mem10#1.base, cstpncpy_#t~mem10#1.offset, cstpncpy_~#dst#1.base, cstpncpy_~#dst#1.offset, cstpncpy_~src#1.base, cstpncpy_~src#1.offset, cstpncpy_~n#1;call cstpncpy_~#dst#1.base, cstpncpy_~#dst#1.offset := #Ultimate.allocOnStack(4bv32); {5592#(and (= (select |#valid| |ULTIMATE.start_cstpncpy_~#dst#1.base|) (_ bv1 1)) (exists ((v_arrayElimCell_14 (_ BitVec 1))) (and (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg v_arrayElimCell_14))) (= (bvadd (select |#valid| |ULTIMATE.start_cstpncpy_#in~dst#1.base|) (bvneg v_arrayElimCell_14)) (_ bv0 1)))))} is VALID [2022-02-20 23:41:26,398 INFO L290 TraceCheckUtils]: 8: Hoare triple {5592#(and (= (select |#valid| |ULTIMATE.start_cstpncpy_~#dst#1.base|) (_ bv1 1)) (exists ((v_arrayElimCell_14 (_ BitVec 1))) (and (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg v_arrayElimCell_14))) (= (bvadd (select |#valid| |ULTIMATE.start_cstpncpy_#in~dst#1.base|) (bvneg v_arrayElimCell_14)) (_ bv0 1)))))} SUMMARY for call write~$Pointer$(cstpncpy_#in~dst#1.base, cstpncpy_#in~dst#1.offset, cstpncpy_~#dst#1.base, cstpncpy_~#dst#1.offset, 4bv32); srcloc: L513 {5596#(and (= (select |#valid| |ULTIMATE.start_cstpncpy_~#dst#1.base|) (_ bv1 1)) (exists ((v_arrayElimCell_14 (_ BitVec 1))) (and (= (_ bv0 1) (bvadd (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_cstpncpy_~#dst#1.base|) |ULTIMATE.start_cstpncpy_~#dst#1.offset|)) (bvneg v_arrayElimCell_14))) (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg v_arrayElimCell_14))))))} is VALID [2022-02-20 23:41:26,400 INFO L290 TraceCheckUtils]: 9: Hoare triple {5596#(and (= (select |#valid| |ULTIMATE.start_cstpncpy_~#dst#1.base|) (_ bv1 1)) (exists ((v_arrayElimCell_14 (_ BitVec 1))) (and (= (_ bv0 1) (bvadd (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_cstpncpy_~#dst#1.base|) |ULTIMATE.start_cstpncpy_~#dst#1.offset|)) (bvneg v_arrayElimCell_14))) (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg v_arrayElimCell_14))))))} cstpncpy_~src#1.base, cstpncpy_~src#1.offset := cstpncpy_#in~src#1.base, cstpncpy_#in~src#1.offset;cstpncpy_~n#1 := cstpncpy_#in~n#1; {5596#(and (= (select |#valid| |ULTIMATE.start_cstpncpy_~#dst#1.base|) (_ bv1 1)) (exists ((v_arrayElimCell_14 (_ BitVec 1))) (and (= (_ bv0 1) (bvadd (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_cstpncpy_~#dst#1.base|) |ULTIMATE.start_cstpncpy_~#dst#1.offset|)) (bvneg v_arrayElimCell_14))) (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg v_arrayElimCell_14))))))} is VALID [2022-02-20 23:41:26,401 INFO L290 TraceCheckUtils]: 10: Hoare triple {5596#(and (= (select |#valid| |ULTIMATE.start_cstpncpy_~#dst#1.base|) (_ bv1 1)) (exists ((v_arrayElimCell_14 (_ BitVec 1))) (and (= (_ bv0 1) (bvadd (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_cstpncpy_~#dst#1.base|) |ULTIMATE.start_cstpncpy_~#dst#1.offset|)) (bvneg v_arrayElimCell_14))) (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg v_arrayElimCell_14))))))} assume 0bv32 != cstpncpy_~n#1; {5596#(and (= (select |#valid| |ULTIMATE.start_cstpncpy_~#dst#1.base|) (_ bv1 1)) (exists ((v_arrayElimCell_14 (_ BitVec 1))) (and (= (_ bv0 1) (bvadd (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_cstpncpy_~#dst#1.base|) |ULTIMATE.start_cstpncpy_~#dst#1.offset|)) (bvneg v_arrayElimCell_14))) (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg v_arrayElimCell_14))))))} is VALID [2022-02-20 23:41:26,402 INFO L290 TraceCheckUtils]: 11: Hoare triple {5596#(and (= (select |#valid| |ULTIMATE.start_cstpncpy_~#dst#1.base|) (_ bv1 1)) (exists ((v_arrayElimCell_14 (_ BitVec 1))) (and (= (_ bv0 1) (bvadd (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_cstpncpy_~#dst#1.base|) |ULTIMATE.start_cstpncpy_~#dst#1.offset|)) (bvneg v_arrayElimCell_14))) (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg v_arrayElimCell_14))))))} SUMMARY for call cstpncpy_#t~mem2#1.base, cstpncpy_#t~mem2#1.offset := read~$Pointer$(cstpncpy_~#dst#1.base, cstpncpy_~#dst#1.offset, 4bv32); srcloc: L517 {5606#(exists ((v_arrayElimCell_14 (_ BitVec 1))) (and (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg v_arrayElimCell_14))) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_cstpncpy_#t~mem2#1.base|) (bvneg v_arrayElimCell_14)))))} is VALID [2022-02-20 23:41:26,404 INFO L290 TraceCheckUtils]: 12: Hoare triple {5606#(exists ((v_arrayElimCell_14 (_ BitVec 1))) (and (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg v_arrayElimCell_14))) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_cstpncpy_#t~mem2#1.base|) (bvneg v_arrayElimCell_14)))))} cstpncpy_~d~0#1.base, cstpncpy_~d~0#1.offset := cstpncpy_#t~mem2#1.base, cstpncpy_#t~mem2#1.offset;havoc cstpncpy_#t~mem2#1.base, cstpncpy_#t~mem2#1.offset;cstpncpy_~s~0#1.base, cstpncpy_~s~0#1.offset := cstpncpy_~src#1.base, cstpncpy_~src#1.offset; {5610#(exists ((v_arrayElimCell_14 (_ BitVec 1))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_cstpncpy_~d~0#1.base|) (bvneg v_arrayElimCell_14))) (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg v_arrayElimCell_14)))))} is VALID [2022-02-20 23:41:26,406 INFO L290 TraceCheckUtils]: 13: Hoare triple {5610#(exists ((v_arrayElimCell_14 (_ BitVec 1))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_cstpncpy_~d~0#1.base|) (bvneg v_arrayElimCell_14))) (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg v_arrayElimCell_14)))))} SUMMARY for call cstpncpy_#t~mem3#1.base, cstpncpy_#t~mem3#1.offset := read~$Pointer$(cstpncpy_~#dst#1.base, cstpncpy_~#dst#1.offset, 4bv32); srcloc: L519 {5610#(exists ((v_arrayElimCell_14 (_ BitVec 1))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_cstpncpy_~d~0#1.base|) (bvneg v_arrayElimCell_14))) (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg v_arrayElimCell_14)))))} is VALID [2022-02-20 23:41:26,412 INFO L290 TraceCheckUtils]: 14: Hoare triple {5610#(exists ((v_arrayElimCell_14 (_ BitVec 1))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_cstpncpy_~d~0#1.base|) (bvneg v_arrayElimCell_14))) (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg v_arrayElimCell_14)))))} SUMMARY for call write~$Pointer$(cstpncpy_#t~mem3#1.base, ~bvadd32(cstpncpy_#t~mem3#1.offset, cstpncpy_~n#1), cstpncpy_~#dst#1.base, cstpncpy_~#dst#1.offset, 4bv32); srcloc: L519-1 {5610#(exists ((v_arrayElimCell_14 (_ BitVec 1))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_cstpncpy_~d~0#1.base|) (bvneg v_arrayElimCell_14))) (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg v_arrayElimCell_14)))))} is VALID [2022-02-20 23:41:26,413 INFO L290 TraceCheckUtils]: 15: Hoare triple {5610#(exists ((v_arrayElimCell_14 (_ BitVec 1))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_cstpncpy_~d~0#1.base|) (bvneg v_arrayElimCell_14))) (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg v_arrayElimCell_14)))))} havoc cstpncpy_#t~mem3#1.base, cstpncpy_#t~mem3#1.offset; {5610#(exists ((v_arrayElimCell_14 (_ BitVec 1))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_cstpncpy_~d~0#1.base|) (bvneg v_arrayElimCell_14))) (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg v_arrayElimCell_14)))))} is VALID [2022-02-20 23:41:26,416 INFO L290 TraceCheckUtils]: 16: Hoare triple {5610#(exists ((v_arrayElimCell_14 (_ BitVec 1))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_cstpncpy_~d~0#1.base|) (bvneg v_arrayElimCell_14))) (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg v_arrayElimCell_14)))))} cstpncpy_#t~post5#1.base, cstpncpy_#t~post5#1.offset := cstpncpy_~d~0#1.base, cstpncpy_~d~0#1.offset;cstpncpy_~d~0#1.base, cstpncpy_~d~0#1.offset := cstpncpy_#t~post5#1.base, ~bvadd32(1bv32, cstpncpy_#t~post5#1.offset);cstpncpy_#t~post6#1.base, cstpncpy_#t~post6#1.offset := cstpncpy_~s~0#1.base, cstpncpy_~s~0#1.offset;cstpncpy_~s~0#1.base, cstpncpy_~s~0#1.offset := cstpncpy_#t~post6#1.base, ~bvadd32(1bv32, cstpncpy_#t~post6#1.offset); {5623#(exists ((v_arrayElimCell_14 (_ BitVec 1))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_cstpncpy_#t~post5#1.base|) (bvneg v_arrayElimCell_14))) (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg v_arrayElimCell_14)))))} is VALID [2022-02-20 23:41:26,416 INFO L290 TraceCheckUtils]: 17: Hoare triple {5623#(exists ((v_arrayElimCell_14 (_ BitVec 1))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_cstpncpy_#t~post5#1.base|) (bvneg v_arrayElimCell_14))) (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg v_arrayElimCell_14)))))} SUMMARY for call cstpncpy_#t~mem7#1 := read~intINTTYPE1(cstpncpy_#t~post6#1.base, cstpncpy_#t~post6#1.offset, 1bv32); srcloc: L521 {5623#(exists ((v_arrayElimCell_14 (_ BitVec 1))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_cstpncpy_#t~post5#1.base|) (bvneg v_arrayElimCell_14))) (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg v_arrayElimCell_14)))))} is VALID [2022-02-20 23:41:26,417 INFO L290 TraceCheckUtils]: 18: Hoare triple {5623#(exists ((v_arrayElimCell_14 (_ BitVec 1))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_cstpncpy_#t~post5#1.base|) (bvneg v_arrayElimCell_14))) (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg v_arrayElimCell_14)))))} assume !(1bv1 == #valid[cstpncpy_#t~post5#1.base]); {5566#false} is VALID [2022-02-20 23:41:26,417 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:41:26,417 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:41:26,417 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:41:26,417 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2007592281] [2022-02-20 23:41:26,417 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2007592281] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:41:26,417 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:41:26,417 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 23:41:26,417 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520724725] [2022-02-20 23:41:26,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:41:26,418 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 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 19 [2022-02-20 23:41:26,418 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:41:26,418 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 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:41:26,457 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:41:26,457 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 23:41:26,457 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:41:26,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 23:41:26,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-02-20 23:41:26,457 INFO L87 Difference]: Start difference. First operand 127 states and 148 transitions. Second operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 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:41:26,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:41:26,730 INFO L93 Difference]: Finished difference Result 129 states and 149 transitions. [2022-02-20 23:41:26,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 23:41:26,730 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 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 19 [2022-02-20 23:41:26,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:41:26,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 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:41:26,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 53 transitions. [2022-02-20 23:41:26,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 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:41:26,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 53 transitions. [2022-02-20 23:41:26,731 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 53 transitions. [2022-02-20 23:41:26,817 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:41:26,818 INFO L225 Difference]: With dead ends: 129 [2022-02-20 23:41:26,818 INFO L226 Difference]: Without dead ends: 129 [2022-02-20 23:41:26,818 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-02-20 23:41:26,818 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 6 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 86 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:41:26,818 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 162 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 86 Unchecked, 0.0s Time] [2022-02-20 23:41:26,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-02-20 23:41:26,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 128. [2022-02-20 23:41:26,820 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:41:26,820 INFO L82 GeneralOperation]: Start isEquivalent. First operand 129 states. Second operand has 128 states, 120 states have (on average 1.2416666666666667) internal successors, (149), 127 states have internal predecessors, (149), 0 states have call successors, (0), 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:41:26,820 INFO L74 IsIncluded]: Start isIncluded. First operand 129 states. Second operand has 128 states, 120 states have (on average 1.2416666666666667) internal successors, (149), 127 states have internal predecessors, (149), 0 states have call successors, (0), 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:41:26,820 INFO L87 Difference]: Start difference. First operand 129 states. Second operand has 128 states, 120 states have (on average 1.2416666666666667) internal successors, (149), 127 states have internal predecessors, (149), 0 states have call successors, (0), 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:41:26,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:41:26,822 INFO L93 Difference]: Finished difference Result 129 states and 149 transitions. [2022-02-20 23:41:26,822 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 149 transitions. [2022-02-20 23:41:26,822 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:41:26,822 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:41:26,822 INFO L74 IsIncluded]: Start isIncluded. First operand has 128 states, 120 states have (on average 1.2416666666666667) internal successors, (149), 127 states have internal predecessors, (149), 0 states have call successors, (0), 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 129 states. [2022-02-20 23:41:26,822 INFO L87 Difference]: Start difference. First operand has 128 states, 120 states have (on average 1.2416666666666667) internal successors, (149), 127 states have internal predecessors, (149), 0 states have call successors, (0), 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 129 states. [2022-02-20 23:41:26,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:41:26,824 INFO L93 Difference]: Finished difference Result 129 states and 149 transitions. [2022-02-20 23:41:26,824 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 149 transitions. [2022-02-20 23:41:26,824 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:41:26,824 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:41:26,824 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:41:26,824 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:41:26,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 120 states have (on average 1.2416666666666667) internal successors, (149), 127 states have internal predecessors, (149), 0 states have call successors, (0), 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:41:26,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 149 transitions. [2022-02-20 23:41:26,826 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 149 transitions. Word has length 19 [2022-02-20 23:41:26,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:41:26,826 INFO L470 AbstractCegarLoop]: Abstraction has 128 states and 149 transitions. [2022-02-20 23:41:26,826 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 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:41:26,826 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 149 transitions. [2022-02-20 23:41:26,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-02-20 23:41:26,827 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:41:26,827 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:41:26,837 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2022-02-20 23:41:27,031 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:41:27,031 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2022-02-20 23:41:27,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:41:27,032 INFO L85 PathProgramCache]: Analyzing trace with hash -1791325789, now seen corresponding path program 1 times [2022-02-20 23:41:27,032 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:41:27,032 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [882909975] [2022-02-20 23:41:27,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:41:27,032 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:41:27,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:41:27,033 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:41:27,035 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2022-02-20 23:41:27,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:41:27,106 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 26 conjunts are in the unsatisfiable core [2022-02-20 23:41:27,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:41:27,119 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:41:27,142 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:41:27,143 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-02-20 23:41:27,146 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-02-20 23:41:27,191 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-02-20 23:41:27,191 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 19 [2022-02-20 23:41:27,224 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2022-02-20 23:41:27,230 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2022-02-20 23:41:27,289 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2022-02-20 23:41:27,293 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-02-20 23:41:27,403 INFO L290 TraceCheckUtils]: 0: Hoare triple {6146#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven; {6146#true} is VALID [2022-02-20 23:41:27,403 INFO L290 TraceCheckUtils]: 1: Hoare triple {6146#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~nondet12#1, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_#t~nondet16#1, main_#t~post15#1, main_~i~0#1, main_#t~ret17#1.base, main_#t~ret17#1.offset, main_~length~0#1, main_~n~0#1, main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset, main_~nondetString~0#1.base, main_~nondetString~0#1.offset;main_~length~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;main_~n~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; {6146#true} is VALID [2022-02-20 23:41:27,403 INFO L290 TraceCheckUtils]: 2: Hoare triple {6146#true} assume ~bvslt32(main_~length~0#1, 1bv32);main_~length~0#1 := 1bv32; {6146#true} is VALID [2022-02-20 23:41:27,403 INFO L290 TraceCheckUtils]: 3: Hoare triple {6146#true} assume !~bvslt32(main_~n~0#1, 1bv32); {6160#(not (bvslt |ULTIMATE.start_main_~n~0#1| (_ bv1 32)))} is VALID [2022-02-20 23:41:27,405 INFO L290 TraceCheckUtils]: 4: Hoare triple {6160#(not (bvslt |ULTIMATE.start_main_~n~0#1| (_ bv1 32)))} call main_#t~malloc13#1.base, main_#t~malloc13#1.offset := #Ultimate.allocOnStack(main_~n~0#1);main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset := main_#t~malloc13#1.base, main_#t~malloc13#1.offset;call main_#t~malloc14#1.base, main_#t~malloc14#1.offset := #Ultimate.allocOnStack(main_~length~0#1);main_~nondetString~0#1.base, main_~nondetString~0#1.offset := main_#t~malloc14#1.base, main_#t~malloc14#1.offset;main_~i~0#1 := 0bv32; {6164#(and (= |ULTIMATE.start_main_~nondetArea~0#1.offset| (_ bv0 32)) (not (bvslt (select |#length| |ULTIMATE.start_main_~nondetArea~0#1.base|) (_ bv1 32))))} is VALID [2022-02-20 23:41:27,405 INFO L290 TraceCheckUtils]: 5: Hoare triple {6164#(and (= |ULTIMATE.start_main_~nondetArea~0#1.offset| (_ bv0 32)) (not (bvslt (select |#length| |ULTIMATE.start_main_~nondetArea~0#1.base|) (_ bv1 32))))} assume !~bvslt32(main_~i~0#1, ~bvsub32(main_~length~0#1, 1bv32)); {6164#(and (= |ULTIMATE.start_main_~nondetArea~0#1.offset| (_ bv0 32)) (not (bvslt (select |#length| |ULTIMATE.start_main_~nondetArea~0#1.base|) (_ bv1 32))))} is VALID [2022-02-20 23:41:27,406 INFO L290 TraceCheckUtils]: 6: Hoare triple {6164#(and (= |ULTIMATE.start_main_~nondetArea~0#1.offset| (_ bv0 32)) (not (bvslt (select |#length| |ULTIMATE.start_main_~nondetArea~0#1.base|) (_ bv1 32))))} SUMMARY for call write~intINTTYPE1(0bv8, main_~nondetString~0#1.base, ~bvadd32(main_~nondetString~0#1.offset, ~bvsub32(main_~length~0#1, 1bv32)), 1bv32); srcloc: L543-4 {6164#(and (= |ULTIMATE.start_main_~nondetArea~0#1.offset| (_ bv0 32)) (not (bvslt (select |#length| |ULTIMATE.start_main_~nondetArea~0#1.base|) (_ bv1 32))))} is VALID [2022-02-20 23:41:27,407 INFO L290 TraceCheckUtils]: 7: Hoare triple {6164#(and (= |ULTIMATE.start_main_~nondetArea~0#1.offset| (_ bv0 32)) (not (bvslt (select |#length| |ULTIMATE.start_main_~nondetArea~0#1.base|) (_ bv1 32))))} assume { :begin_inline_cstpncpy } true;cstpncpy_#in~dst#1.base, cstpncpy_#in~dst#1.offset, cstpncpy_#in~src#1.base, cstpncpy_#in~src#1.offset, cstpncpy_#in~n#1 := main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset, main_~nondetString~0#1.base, main_~nondetString~0#1.offset, main_~n~0#1;havoc cstpncpy_#res#1.base, cstpncpy_#res#1.offset;havoc cstpncpy_#t~mem2#1.base, cstpncpy_#t~mem2#1.offset, cstpncpy_#t~mem3#1.base, cstpncpy_#t~mem3#1.offset, cstpncpy_#t~post5#1.base, cstpncpy_#t~post5#1.offset, cstpncpy_#t~post6#1.base, cstpncpy_#t~post6#1.offset, cstpncpy_#t~mem7#1, cstpncpy_#t~post9#1.base, cstpncpy_#t~post9#1.offset, cstpncpy_#t~pre8#1, cstpncpy_#t~pre4#1, cstpncpy_~d~0#1.base, cstpncpy_~d~0#1.offset, cstpncpy_~s~0#1.base, cstpncpy_~s~0#1.offset, cstpncpy_#t~mem10#1.base, cstpncpy_#t~mem10#1.offset, cstpncpy_~#dst#1.base, cstpncpy_~#dst#1.offset, cstpncpy_~src#1.base, cstpncpy_~src#1.offset, cstpncpy_~n#1;call cstpncpy_~#dst#1.base, cstpncpy_~#dst#1.offset := #Ultimate.allocOnStack(4bv32); {6174#(and (not (bvslt (select |#length| |ULTIMATE.start_cstpncpy_#in~dst#1.base|) (_ bv1 32))) (= |ULTIMATE.start_cstpncpy_#in~dst#1.offset| (_ bv0 32)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_cstpncpy_~#dst#1.base|)))} is VALID [2022-02-20 23:41:27,409 INFO L290 TraceCheckUtils]: 8: Hoare triple {6174#(and (not (bvslt (select |#length| |ULTIMATE.start_cstpncpy_#in~dst#1.base|) (_ bv1 32))) (= |ULTIMATE.start_cstpncpy_#in~dst#1.offset| (_ bv0 32)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_cstpncpy_~#dst#1.base|)))} SUMMARY for call write~$Pointer$(cstpncpy_#in~dst#1.base, cstpncpy_#in~dst#1.offset, cstpncpy_~#dst#1.base, cstpncpy_~#dst#1.offset, 4bv32); srcloc: L513 {6178#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_cstpncpy_~#dst#1.base|) |ULTIMATE.start_cstpncpy_~#dst#1.offset|)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_cstpncpy_~#dst#1.base|)) (not (bvslt (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_cstpncpy_~#dst#1.base|) |ULTIMATE.start_cstpncpy_~#dst#1.offset|)) (_ bv1 32))))} is VALID [2022-02-20 23:41:27,409 INFO L290 TraceCheckUtils]: 9: Hoare triple {6178#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_cstpncpy_~#dst#1.base|) |ULTIMATE.start_cstpncpy_~#dst#1.offset|)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_cstpncpy_~#dst#1.base|)) (not (bvslt (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_cstpncpy_~#dst#1.base|) |ULTIMATE.start_cstpncpy_~#dst#1.offset|)) (_ bv1 32))))} cstpncpy_~src#1.base, cstpncpy_~src#1.offset := cstpncpy_#in~src#1.base, cstpncpy_#in~src#1.offset;cstpncpy_~n#1 := cstpncpy_#in~n#1; {6178#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_cstpncpy_~#dst#1.base|) |ULTIMATE.start_cstpncpy_~#dst#1.offset|)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_cstpncpy_~#dst#1.base|)) (not (bvslt (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_cstpncpy_~#dst#1.base|) |ULTIMATE.start_cstpncpy_~#dst#1.offset|)) (_ bv1 32))))} is VALID [2022-02-20 23:41:27,409 INFO L290 TraceCheckUtils]: 10: Hoare triple {6178#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_cstpncpy_~#dst#1.base|) |ULTIMATE.start_cstpncpy_~#dst#1.offset|)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_cstpncpy_~#dst#1.base|)) (not (bvslt (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_cstpncpy_~#dst#1.base|) |ULTIMATE.start_cstpncpy_~#dst#1.offset|)) (_ bv1 32))))} assume 0bv32 != cstpncpy_~n#1; {6178#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_cstpncpy_~#dst#1.base|) |ULTIMATE.start_cstpncpy_~#dst#1.offset|)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_cstpncpy_~#dst#1.base|)) (not (bvslt (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_cstpncpy_~#dst#1.base|) |ULTIMATE.start_cstpncpy_~#dst#1.offset|)) (_ bv1 32))))} is VALID [2022-02-20 23:41:27,411 INFO L290 TraceCheckUtils]: 11: Hoare triple {6178#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_cstpncpy_~#dst#1.base|) |ULTIMATE.start_cstpncpy_~#dst#1.offset|)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_cstpncpy_~#dst#1.base|)) (not (bvslt (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_cstpncpy_~#dst#1.base|) |ULTIMATE.start_cstpncpy_~#dst#1.offset|)) (_ bv1 32))))} SUMMARY for call cstpncpy_#t~mem2#1.base, cstpncpy_#t~mem2#1.offset := read~$Pointer$(cstpncpy_~#dst#1.base, cstpncpy_~#dst#1.offset, 4bv32); srcloc: L517 {6188#(and (exists ((|ULTIMATE.start_cstpncpy_~#dst#1.base| (_ BitVec 32))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_cstpncpy_~#dst#1.base|))) (= |ULTIMATE.start_cstpncpy_#t~mem2#1.offset| (_ bv0 32)) (not (bvslt (select |#length| |ULTIMATE.start_cstpncpy_#t~mem2#1.base|) (_ bv1 32))))} is VALID [2022-02-20 23:41:27,411 INFO L290 TraceCheckUtils]: 12: Hoare triple {6188#(and (exists ((|ULTIMATE.start_cstpncpy_~#dst#1.base| (_ BitVec 32))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_cstpncpy_~#dst#1.base|))) (= |ULTIMATE.start_cstpncpy_#t~mem2#1.offset| (_ bv0 32)) (not (bvslt (select |#length| |ULTIMATE.start_cstpncpy_#t~mem2#1.base|) (_ bv1 32))))} cstpncpy_~d~0#1.base, cstpncpy_~d~0#1.offset := cstpncpy_#t~mem2#1.base, cstpncpy_#t~mem2#1.offset;havoc cstpncpy_#t~mem2#1.base, cstpncpy_#t~mem2#1.offset;cstpncpy_~s~0#1.base, cstpncpy_~s~0#1.offset := cstpncpy_~src#1.base, cstpncpy_~src#1.offset; {6192#(and (exists ((|ULTIMATE.start_cstpncpy_~#dst#1.base| (_ BitVec 32))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_cstpncpy_~#dst#1.base|))) (= |ULTIMATE.start_cstpncpy_~d~0#1.offset| (_ bv0 32)) (not (bvslt (select |#length| |ULTIMATE.start_cstpncpy_~d~0#1.base|) (_ bv1 32))))} is VALID [2022-02-20 23:41:27,412 INFO L290 TraceCheckUtils]: 13: Hoare triple {6192#(and (exists ((|ULTIMATE.start_cstpncpy_~#dst#1.base| (_ BitVec 32))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_cstpncpy_~#dst#1.base|))) (= |ULTIMATE.start_cstpncpy_~d~0#1.offset| (_ bv0 32)) (not (bvslt (select |#length| |ULTIMATE.start_cstpncpy_~d~0#1.base|) (_ bv1 32))))} SUMMARY for call cstpncpy_#t~mem3#1.base, cstpncpy_#t~mem3#1.offset := read~$Pointer$(cstpncpy_~#dst#1.base, cstpncpy_~#dst#1.offset, 4bv32); srcloc: L519 {6192#(and (exists ((|ULTIMATE.start_cstpncpy_~#dst#1.base| (_ BitVec 32))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_cstpncpy_~#dst#1.base|))) (= |ULTIMATE.start_cstpncpy_~d~0#1.offset| (_ bv0 32)) (not (bvslt (select |#length| |ULTIMATE.start_cstpncpy_~d~0#1.base|) (_ bv1 32))))} is VALID [2022-02-20 23:41:27,412 INFO L290 TraceCheckUtils]: 14: Hoare triple {6192#(and (exists ((|ULTIMATE.start_cstpncpy_~#dst#1.base| (_ BitVec 32))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_cstpncpy_~#dst#1.base|))) (= |ULTIMATE.start_cstpncpy_~d~0#1.offset| (_ bv0 32)) (not (bvslt (select |#length| |ULTIMATE.start_cstpncpy_~d~0#1.base|) (_ bv1 32))))} SUMMARY for call write~$Pointer$(cstpncpy_#t~mem3#1.base, ~bvadd32(cstpncpy_#t~mem3#1.offset, cstpncpy_~n#1), cstpncpy_~#dst#1.base, cstpncpy_~#dst#1.offset, 4bv32); srcloc: L519-1 {6192#(and (exists ((|ULTIMATE.start_cstpncpy_~#dst#1.base| (_ BitVec 32))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_cstpncpy_~#dst#1.base|))) (= |ULTIMATE.start_cstpncpy_~d~0#1.offset| (_ bv0 32)) (not (bvslt (select |#length| |ULTIMATE.start_cstpncpy_~d~0#1.base|) (_ bv1 32))))} is VALID [2022-02-20 23:41:27,413 INFO L290 TraceCheckUtils]: 15: Hoare triple {6192#(and (exists ((|ULTIMATE.start_cstpncpy_~#dst#1.base| (_ BitVec 32))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_cstpncpy_~#dst#1.base|))) (= |ULTIMATE.start_cstpncpy_~d~0#1.offset| (_ bv0 32)) (not (bvslt (select |#length| |ULTIMATE.start_cstpncpy_~d~0#1.base|) (_ bv1 32))))} havoc cstpncpy_#t~mem3#1.base, cstpncpy_#t~mem3#1.offset; {6192#(and (exists ((|ULTIMATE.start_cstpncpy_~#dst#1.base| (_ BitVec 32))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_cstpncpy_~#dst#1.base|))) (= |ULTIMATE.start_cstpncpy_~d~0#1.offset| (_ bv0 32)) (not (bvslt (select |#length| |ULTIMATE.start_cstpncpy_~d~0#1.base|) (_ bv1 32))))} is VALID [2022-02-20 23:41:27,414 INFO L290 TraceCheckUtils]: 16: Hoare triple {6192#(and (exists ((|ULTIMATE.start_cstpncpy_~#dst#1.base| (_ BitVec 32))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_cstpncpy_~#dst#1.base|))) (= |ULTIMATE.start_cstpncpy_~d~0#1.offset| (_ bv0 32)) (not (bvslt (select |#length| |ULTIMATE.start_cstpncpy_~d~0#1.base|) (_ bv1 32))))} cstpncpy_#t~post5#1.base, cstpncpy_#t~post5#1.offset := cstpncpy_~d~0#1.base, cstpncpy_~d~0#1.offset;cstpncpy_~d~0#1.base, cstpncpy_~d~0#1.offset := cstpncpy_#t~post5#1.base, ~bvadd32(1bv32, cstpncpy_#t~post5#1.offset);cstpncpy_#t~post6#1.base, cstpncpy_#t~post6#1.offset := cstpncpy_~s~0#1.base, cstpncpy_~s~0#1.offset;cstpncpy_~s~0#1.base, cstpncpy_~s~0#1.offset := cstpncpy_#t~post6#1.base, ~bvadd32(1bv32, cstpncpy_#t~post6#1.offset); {6205#(and (exists ((|ULTIMATE.start_cstpncpy_~#dst#1.base| (_ BitVec 32))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_cstpncpy_~#dst#1.base|))) (= (_ bv0 32) |ULTIMATE.start_cstpncpy_#t~post5#1.offset|) (not (bvslt (select |#length| |ULTIMATE.start_cstpncpy_#t~post5#1.base|) (_ bv1 32))))} is VALID [2022-02-20 23:41:27,414 INFO L290 TraceCheckUtils]: 17: Hoare triple {6205#(and (exists ((|ULTIMATE.start_cstpncpy_~#dst#1.base| (_ BitVec 32))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_cstpncpy_~#dst#1.base|))) (= (_ bv0 32) |ULTIMATE.start_cstpncpy_#t~post5#1.offset|) (not (bvslt (select |#length| |ULTIMATE.start_cstpncpy_#t~post5#1.base|) (_ bv1 32))))} SUMMARY for call cstpncpy_#t~mem7#1 := read~intINTTYPE1(cstpncpy_#t~post6#1.base, cstpncpy_#t~post6#1.offset, 1bv32); srcloc: L521 {6205#(and (exists ((|ULTIMATE.start_cstpncpy_~#dst#1.base| (_ BitVec 32))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_cstpncpy_~#dst#1.base|))) (= (_ bv0 32) |ULTIMATE.start_cstpncpy_#t~post5#1.offset|) (not (bvslt (select |#length| |ULTIMATE.start_cstpncpy_#t~post5#1.base|) (_ bv1 32))))} is VALID [2022-02-20 23:41:27,415 INFO L290 TraceCheckUtils]: 18: Hoare triple {6205#(and (exists ((|ULTIMATE.start_cstpncpy_~#dst#1.base| (_ BitVec 32))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_cstpncpy_~#dst#1.base|))) (= (_ bv0 32) |ULTIMATE.start_cstpncpy_#t~post5#1.offset|) (not (bvslt (select |#length| |ULTIMATE.start_cstpncpy_#t~post5#1.base|) (_ bv1 32))))} assume !((~bvule32(~bvadd32(1bv32, cstpncpy_#t~post5#1.offset), #length[cstpncpy_#t~post5#1.base]) && ~bvule32(cstpncpy_#t~post5#1.offset, ~bvadd32(1bv32, cstpncpy_#t~post5#1.offset))) && ~bvule32(0bv32, cstpncpy_#t~post5#1.offset)); {6147#false} is VALID [2022-02-20 23:41:27,415 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:41:27,415 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:41:27,416 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:41:27,416 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [882909975] [2022-02-20 23:41:27,416 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [882909975] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:41:27,416 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:41:27,416 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 23:41:27,416 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306802043] [2022-02-20 23:41:27,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:41:27,417 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 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 19 [2022-02-20 23:41:27,417 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:41:27,417 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 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:41:27,442 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:41:27,442 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 23:41:27,442 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:41:27,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 23:41:27,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-02-20 23:41:27,443 INFO L87 Difference]: Start difference. First operand 128 states and 149 transitions. Second operand has 9 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 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:41:28,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:41:28,235 INFO L93 Difference]: Finished difference Result 130 states and 150 transitions. [2022-02-20 23:41:28,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 23:41:28,235 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 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 19 [2022-02-20 23:41:28,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:41:28,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 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:41:28,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 54 transitions. [2022-02-20 23:41:28,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 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:41:28,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 54 transitions. [2022-02-20 23:41:28,236 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 54 transitions. [2022-02-20 23:41:28,312 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:41:28,313 INFO L225 Difference]: With dead ends: 130 [2022-02-20 23:41:28,313 INFO L226 Difference]: Without dead ends: 130 [2022-02-20 23:41:28,314 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2022-02-20 23:41:28,314 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 117 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 60 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:41:28,314 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [117 Valid, 148 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 43 Invalid, 0 Unknown, 60 Unchecked, 0.2s Time] [2022-02-20 23:41:28,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-02-20 23:41:28,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 78. [2022-02-20 23:41:28,316 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:41:28,316 INFO L82 GeneralOperation]: Start isEquivalent. First operand 130 states. Second operand has 78 states, 70 states have (on average 1.2857142857142858) internal successors, (90), 77 states have internal predecessors, (90), 0 states have call successors, (0), 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:41:28,316 INFO L74 IsIncluded]: Start isIncluded. First operand 130 states. Second operand has 78 states, 70 states have (on average 1.2857142857142858) internal successors, (90), 77 states have internal predecessors, (90), 0 states have call successors, (0), 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:41:28,316 INFO L87 Difference]: Start difference. First operand 130 states. Second operand has 78 states, 70 states have (on average 1.2857142857142858) internal successors, (90), 77 states have internal predecessors, (90), 0 states have call successors, (0), 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:41:28,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:41:28,317 INFO L93 Difference]: Finished difference Result 130 states and 150 transitions. [2022-02-20 23:41:28,317 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 150 transitions. [2022-02-20 23:41:28,317 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:41:28,317 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:41:28,318 INFO L74 IsIncluded]: Start isIncluded. First operand has 78 states, 70 states have (on average 1.2857142857142858) internal successors, (90), 77 states have internal predecessors, (90), 0 states have call successors, (0), 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 130 states. [2022-02-20 23:41:28,318 INFO L87 Difference]: Start difference. First operand has 78 states, 70 states have (on average 1.2857142857142858) internal successors, (90), 77 states have internal predecessors, (90), 0 states have call successors, (0), 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 130 states. [2022-02-20 23:41:28,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:41:28,319 INFO L93 Difference]: Finished difference Result 130 states and 150 transitions. [2022-02-20 23:41:28,319 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 150 transitions. [2022-02-20 23:41:28,319 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:41:28,319 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:41:28,319 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:41:28,319 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:41:28,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 70 states have (on average 1.2857142857142858) internal successors, (90), 77 states have internal predecessors, (90), 0 states have call successors, (0), 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:41:28,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 90 transitions. [2022-02-20 23:41:28,321 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 90 transitions. Word has length 19 [2022-02-20 23:41:28,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:41:28,321 INFO L470 AbstractCegarLoop]: Abstraction has 78 states and 90 transitions. [2022-02-20 23:41:28,321 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 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:41:28,321 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 90 transitions. [2022-02-20 23:41:28,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-02-20 23:41:28,321 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:41:28,321 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:41:28,330 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2022-02-20 23:41:28,528 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:41:28,528 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2022-02-20 23:41:28,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:41:28,529 INFO L85 PathProgramCache]: Analyzing trace with hash 1582642264, now seen corresponding path program 1 times [2022-02-20 23:41:28,529 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:41:28,529 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1377888735] [2022-02-20 23:41:28,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:41:28,529 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:41:28,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:41:28,530 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:41:28,532 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2022-02-20 23:41:28,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:41:28,615 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 21 conjunts are in the unsatisfiable core [2022-02-20 23:41:28,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:41:28,626 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:41:28,664 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-02-20 23:41:28,664 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 1 case distinctions, treesize of input 9 treesize of output 15 [2022-02-20 23:41:28,679 INFO L356 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2022-02-20 23:41:28,679 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 1 case distinctions, treesize of input 9 treesize of output 18 [2022-02-20 23:41:28,786 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:41:28,787 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-02-20 23:41:28,794 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-20 23:41:28,795 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2022-02-20 23:41:28,899 INFO L290 TraceCheckUtils]: 0: Hoare triple {6693#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven; {6693#true} is VALID [2022-02-20 23:41:28,899 INFO L290 TraceCheckUtils]: 1: Hoare triple {6693#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~nondet12#1, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_#t~nondet16#1, main_#t~post15#1, main_~i~0#1, main_#t~ret17#1.base, main_#t~ret17#1.offset, main_~length~0#1, main_~n~0#1, main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset, main_~nondetString~0#1.base, main_~nondetString~0#1.offset;main_~length~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;main_~n~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; {6693#true} is VALID [2022-02-20 23:41:28,900 INFO L290 TraceCheckUtils]: 2: Hoare triple {6693#true} assume !~bvslt32(main_~length~0#1, 1bv32); {6704#(not (bvslt |ULTIMATE.start_main_~length~0#1| (_ bv1 32)))} is VALID [2022-02-20 23:41:28,900 INFO L290 TraceCheckUtils]: 3: Hoare triple {6704#(not (bvslt |ULTIMATE.start_main_~length~0#1| (_ bv1 32)))} assume ~bvslt32(main_~n~0#1, 1bv32);main_~n~0#1 := 1bv32; {6704#(not (bvslt |ULTIMATE.start_main_~length~0#1| (_ bv1 32)))} is VALID [2022-02-20 23:41:28,906 INFO L290 TraceCheckUtils]: 4: Hoare triple {6704#(not (bvslt |ULTIMATE.start_main_~length~0#1| (_ bv1 32)))} call main_#t~malloc13#1.base, main_#t~malloc13#1.offset := #Ultimate.allocOnStack(main_~n~0#1);main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset := main_#t~malloc13#1.base, main_#t~malloc13#1.offset;call main_#t~malloc14#1.base, main_#t~malloc14#1.offset := #Ultimate.allocOnStack(main_~length~0#1);main_~nondetString~0#1.base, main_~nondetString~0#1.offset := main_#t~malloc14#1.base, main_#t~malloc14#1.offset;main_~i~0#1 := 0bv32; {6711#(and (= |ULTIMATE.start_main_~i~0#1| (_ bv0 32)) (= |ULTIMATE.start_main_~nondetString~0#1.offset| (_ bv0 32)) (not (bvslt (select |#length| |ULTIMATE.start_main_~nondetString~0#1.base|) (_ bv1 32))) (= (select |#valid| |ULTIMATE.start_main_~nondetString~0#1.base|) (_ bv1 1)))} is VALID [2022-02-20 23:41:28,907 INFO L290 TraceCheckUtils]: 5: Hoare triple {6711#(and (= |ULTIMATE.start_main_~i~0#1| (_ bv0 32)) (= |ULTIMATE.start_main_~nondetString~0#1.offset| (_ bv0 32)) (not (bvslt (select |#length| |ULTIMATE.start_main_~nondetString~0#1.base|) (_ bv1 32))) (= (select |#valid| |ULTIMATE.start_main_~nondetString~0#1.base|) (_ bv1 1)))} assume !!~bvslt32(main_~i~0#1, ~bvsub32(main_~length~0#1, 1bv32)); {6711#(and (= |ULTIMATE.start_main_~i~0#1| (_ bv0 32)) (= |ULTIMATE.start_main_~nondetString~0#1.offset| (_ bv0 32)) (not (bvslt (select |#length| |ULTIMATE.start_main_~nondetString~0#1.base|) (_ bv1 32))) (= (select |#valid| |ULTIMATE.start_main_~nondetString~0#1.base|) (_ bv1 1)))} is VALID [2022-02-20 23:41:28,907 INFO L290 TraceCheckUtils]: 6: Hoare triple {6711#(and (= |ULTIMATE.start_main_~i~0#1| (_ bv0 32)) (= |ULTIMATE.start_main_~nondetString~0#1.offset| (_ bv0 32)) (not (bvslt (select |#length| |ULTIMATE.start_main_~nondetString~0#1.base|) (_ bv1 32))) (= (select |#valid| |ULTIMATE.start_main_~nondetString~0#1.base|) (_ bv1 1)))} SUMMARY for call write~intINTTYPE1(main_#t~nondet16#1, main_~nondetString~0#1.base, ~bvadd32(main_~nondetString~0#1.offset, main_~i~0#1), 1bv32); srcloc: L545 {6718#(and (= (bvadd (bvneg (select |#valid| |ULTIMATE.start_main_~nondetString~0#1.base|)) (_ bv1 1)) (_ bv0 1)) (= |ULTIMATE.start_main_~nondetString~0#1.offset| (_ bv0 32)) (not (bvslt (select |#length| |ULTIMATE.start_main_~nondetString~0#1.base|) (_ bv1 32))))} is VALID [2022-02-20 23:41:28,908 INFO L290 TraceCheckUtils]: 7: Hoare triple {6718#(and (= (bvadd (bvneg (select |#valid| |ULTIMATE.start_main_~nondetString~0#1.base|)) (_ bv1 1)) (_ bv0 1)) (= |ULTIMATE.start_main_~nondetString~0#1.offset| (_ bv0 32)) (not (bvslt (select |#length| |ULTIMATE.start_main_~nondetString~0#1.base|) (_ bv1 32))))} havoc main_#t~nondet16#1; {6718#(and (= (bvadd (bvneg (select |#valid| |ULTIMATE.start_main_~nondetString~0#1.base|)) (_ bv1 1)) (_ bv0 1)) (= |ULTIMATE.start_main_~nondetString~0#1.offset| (_ bv0 32)) (not (bvslt (select |#length| |ULTIMATE.start_main_~nondetString~0#1.base|) (_ bv1 32))))} is VALID [2022-02-20 23:41:28,908 INFO L290 TraceCheckUtils]: 8: Hoare triple {6718#(and (= (bvadd (bvneg (select |#valid| |ULTIMATE.start_main_~nondetString~0#1.base|)) (_ bv1 1)) (_ bv0 1)) (= |ULTIMATE.start_main_~nondetString~0#1.offset| (_ bv0 32)) (not (bvslt (select |#length| |ULTIMATE.start_main_~nondetString~0#1.base|) (_ bv1 32))))} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := ~bvadd32(1bv32, main_#t~post15#1);havoc main_#t~post15#1; {6718#(and (= (bvadd (bvneg (select |#valid| |ULTIMATE.start_main_~nondetString~0#1.base|)) (_ bv1 1)) (_ bv0 1)) (= |ULTIMATE.start_main_~nondetString~0#1.offset| (_ bv0 32)) (not (bvslt (select |#length| |ULTIMATE.start_main_~nondetString~0#1.base|) (_ bv1 32))))} is VALID [2022-02-20 23:41:28,909 INFO L290 TraceCheckUtils]: 9: Hoare triple {6718#(and (= (bvadd (bvneg (select |#valid| |ULTIMATE.start_main_~nondetString~0#1.base|)) (_ bv1 1)) (_ bv0 1)) (= |ULTIMATE.start_main_~nondetString~0#1.offset| (_ bv0 32)) (not (bvslt (select |#length| |ULTIMATE.start_main_~nondetString~0#1.base|) (_ bv1 32))))} assume !~bvslt32(main_~i~0#1, ~bvsub32(main_~length~0#1, 1bv32)); {6718#(and (= (bvadd (bvneg (select |#valid| |ULTIMATE.start_main_~nondetString~0#1.base|)) (_ bv1 1)) (_ bv0 1)) (= |ULTIMATE.start_main_~nondetString~0#1.offset| (_ bv0 32)) (not (bvslt (select |#length| |ULTIMATE.start_main_~nondetString~0#1.base|) (_ bv1 32))))} is VALID [2022-02-20 23:41:28,909 INFO L290 TraceCheckUtils]: 10: Hoare triple {6718#(and (= (bvadd (bvneg (select |#valid| |ULTIMATE.start_main_~nondetString~0#1.base|)) (_ bv1 1)) (_ bv0 1)) (= |ULTIMATE.start_main_~nondetString~0#1.offset| (_ bv0 32)) (not (bvslt (select |#length| |ULTIMATE.start_main_~nondetString~0#1.base|) (_ bv1 32))))} SUMMARY for call write~intINTTYPE1(0bv8, main_~nondetString~0#1.base, ~bvadd32(main_~nondetString~0#1.offset, ~bvsub32(main_~length~0#1, 1bv32)), 1bv32); srcloc: L543-4 {6718#(and (= (bvadd (bvneg (select |#valid| |ULTIMATE.start_main_~nondetString~0#1.base|)) (_ bv1 1)) (_ bv0 1)) (= |ULTIMATE.start_main_~nondetString~0#1.offset| (_ bv0 32)) (not (bvslt (select |#length| |ULTIMATE.start_main_~nondetString~0#1.base|) (_ bv1 32))))} is VALID [2022-02-20 23:41:28,911 INFO L290 TraceCheckUtils]: 11: Hoare triple {6718#(and (= (bvadd (bvneg (select |#valid| |ULTIMATE.start_main_~nondetString~0#1.base|)) (_ bv1 1)) (_ bv0 1)) (= |ULTIMATE.start_main_~nondetString~0#1.offset| (_ bv0 32)) (not (bvslt (select |#length| |ULTIMATE.start_main_~nondetString~0#1.base|) (_ bv1 32))))} assume { :begin_inline_cstpncpy } true;cstpncpy_#in~dst#1.base, cstpncpy_#in~dst#1.offset, cstpncpy_#in~src#1.base, cstpncpy_#in~src#1.offset, cstpncpy_#in~n#1 := main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset, main_~nondetString~0#1.base, main_~nondetString~0#1.offset, main_~n~0#1;havoc cstpncpy_#res#1.base, cstpncpy_#res#1.offset;havoc cstpncpy_#t~mem2#1.base, cstpncpy_#t~mem2#1.offset, cstpncpy_#t~mem3#1.base, cstpncpy_#t~mem3#1.offset, cstpncpy_#t~post5#1.base, cstpncpy_#t~post5#1.offset, cstpncpy_#t~post6#1.base, cstpncpy_#t~post6#1.offset, cstpncpy_#t~mem7#1, cstpncpy_#t~post9#1.base, cstpncpy_#t~post9#1.offset, cstpncpy_#t~pre8#1, cstpncpy_#t~pre4#1, cstpncpy_~d~0#1.base, cstpncpy_~d~0#1.offset, cstpncpy_~s~0#1.base, cstpncpy_~s~0#1.offset, cstpncpy_#t~mem10#1.base, cstpncpy_#t~mem10#1.offset, cstpncpy_~#dst#1.base, cstpncpy_~#dst#1.offset, cstpncpy_~src#1.base, cstpncpy_~src#1.offset, cstpncpy_~n#1;call cstpncpy_~#dst#1.base, cstpncpy_~#dst#1.offset := #Ultimate.allocOnStack(4bv32); {6734#(and (= |ULTIMATE.start_cstpncpy_#in~src#1.offset| (_ bv0 32)) (not (bvslt (select |#length| |ULTIMATE.start_cstpncpy_#in~src#1.base|) (_ bv1 32))))} is VALID [2022-02-20 23:41:28,912 INFO L290 TraceCheckUtils]: 12: Hoare triple {6734#(and (= |ULTIMATE.start_cstpncpy_#in~src#1.offset| (_ bv0 32)) (not (bvslt (select |#length| |ULTIMATE.start_cstpncpy_#in~src#1.base|) (_ bv1 32))))} SUMMARY for call write~$Pointer$(cstpncpy_#in~dst#1.base, cstpncpy_#in~dst#1.offset, cstpncpy_~#dst#1.base, cstpncpy_~#dst#1.offset, 4bv32); srcloc: L513 {6734#(and (= |ULTIMATE.start_cstpncpy_#in~src#1.offset| (_ bv0 32)) (not (bvslt (select |#length| |ULTIMATE.start_cstpncpy_#in~src#1.base|) (_ bv1 32))))} is VALID [2022-02-20 23:41:28,912 INFO L290 TraceCheckUtils]: 13: Hoare triple {6734#(and (= |ULTIMATE.start_cstpncpy_#in~src#1.offset| (_ bv0 32)) (not (bvslt (select |#length| |ULTIMATE.start_cstpncpy_#in~src#1.base|) (_ bv1 32))))} cstpncpy_~src#1.base, cstpncpy_~src#1.offset := cstpncpy_#in~src#1.base, cstpncpy_#in~src#1.offset;cstpncpy_~n#1 := cstpncpy_#in~n#1; {6741#(and (= (_ bv0 32) |ULTIMATE.start_cstpncpy_~src#1.offset|) (not (bvslt (select |#length| |ULTIMATE.start_cstpncpy_~src#1.base|) (_ bv1 32))))} is VALID [2022-02-20 23:41:28,912 INFO L290 TraceCheckUtils]: 14: Hoare triple {6741#(and (= (_ bv0 32) |ULTIMATE.start_cstpncpy_~src#1.offset|) (not (bvslt (select |#length| |ULTIMATE.start_cstpncpy_~src#1.base|) (_ bv1 32))))} assume 0bv32 != cstpncpy_~n#1; {6741#(and (= (_ bv0 32) |ULTIMATE.start_cstpncpy_~src#1.offset|) (not (bvslt (select |#length| |ULTIMATE.start_cstpncpy_~src#1.base|) (_ bv1 32))))} is VALID [2022-02-20 23:41:28,913 INFO L290 TraceCheckUtils]: 15: Hoare triple {6741#(and (= (_ bv0 32) |ULTIMATE.start_cstpncpy_~src#1.offset|) (not (bvslt (select |#length| |ULTIMATE.start_cstpncpy_~src#1.base|) (_ bv1 32))))} SUMMARY for call cstpncpy_#t~mem2#1.base, cstpncpy_#t~mem2#1.offset := read~$Pointer$(cstpncpy_~#dst#1.base, cstpncpy_~#dst#1.offset, 4bv32); srcloc: L517 {6741#(and (= (_ bv0 32) |ULTIMATE.start_cstpncpy_~src#1.offset|) (not (bvslt (select |#length| |ULTIMATE.start_cstpncpy_~src#1.base|) (_ bv1 32))))} is VALID [2022-02-20 23:41:28,913 INFO L290 TraceCheckUtils]: 16: Hoare triple {6741#(and (= (_ bv0 32) |ULTIMATE.start_cstpncpy_~src#1.offset|) (not (bvslt (select |#length| |ULTIMATE.start_cstpncpy_~src#1.base|) (_ bv1 32))))} cstpncpy_~d~0#1.base, cstpncpy_~d~0#1.offset := cstpncpy_#t~mem2#1.base, cstpncpy_#t~mem2#1.offset;havoc cstpncpy_#t~mem2#1.base, cstpncpy_#t~mem2#1.offset;cstpncpy_~s~0#1.base, cstpncpy_~s~0#1.offset := cstpncpy_~src#1.base, cstpncpy_~src#1.offset; {6751#(and (not (bvslt (select |#length| |ULTIMATE.start_cstpncpy_~s~0#1.base|) (_ bv1 32))) (= |ULTIMATE.start_cstpncpy_~s~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:41:28,914 INFO L290 TraceCheckUtils]: 17: Hoare triple {6751#(and (not (bvslt (select |#length| |ULTIMATE.start_cstpncpy_~s~0#1.base|) (_ bv1 32))) (= |ULTIMATE.start_cstpncpy_~s~0#1.offset| (_ bv0 32)))} SUMMARY for call cstpncpy_#t~mem3#1.base, cstpncpy_#t~mem3#1.offset := read~$Pointer$(cstpncpy_~#dst#1.base, cstpncpy_~#dst#1.offset, 4bv32); srcloc: L519 {6751#(and (not (bvslt (select |#length| |ULTIMATE.start_cstpncpy_~s~0#1.base|) (_ bv1 32))) (= |ULTIMATE.start_cstpncpy_~s~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:41:28,914 INFO L290 TraceCheckUtils]: 18: Hoare triple {6751#(and (not (bvslt (select |#length| |ULTIMATE.start_cstpncpy_~s~0#1.base|) (_ bv1 32))) (= |ULTIMATE.start_cstpncpy_~s~0#1.offset| (_ bv0 32)))} SUMMARY for call write~$Pointer$(cstpncpy_#t~mem3#1.base, ~bvadd32(cstpncpy_#t~mem3#1.offset, cstpncpy_~n#1), cstpncpy_~#dst#1.base, cstpncpy_~#dst#1.offset, 4bv32); srcloc: L519-1 {6751#(and (not (bvslt (select |#length| |ULTIMATE.start_cstpncpy_~s~0#1.base|) (_ bv1 32))) (= |ULTIMATE.start_cstpncpy_~s~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:41:28,915 INFO L290 TraceCheckUtils]: 19: Hoare triple {6751#(and (not (bvslt (select |#length| |ULTIMATE.start_cstpncpy_~s~0#1.base|) (_ bv1 32))) (= |ULTIMATE.start_cstpncpy_~s~0#1.offset| (_ bv0 32)))} havoc cstpncpy_#t~mem3#1.base, cstpncpy_#t~mem3#1.offset; {6751#(and (not (bvslt (select |#length| |ULTIMATE.start_cstpncpy_~s~0#1.base|) (_ bv1 32))) (= |ULTIMATE.start_cstpncpy_~s~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:41:28,915 INFO L290 TraceCheckUtils]: 20: Hoare triple {6751#(and (not (bvslt (select |#length| |ULTIMATE.start_cstpncpy_~s~0#1.base|) (_ bv1 32))) (= |ULTIMATE.start_cstpncpy_~s~0#1.offset| (_ bv0 32)))} cstpncpy_#t~post5#1.base, cstpncpy_#t~post5#1.offset := cstpncpy_~d~0#1.base, cstpncpy_~d~0#1.offset;cstpncpy_~d~0#1.base, cstpncpy_~d~0#1.offset := cstpncpy_#t~post5#1.base, ~bvadd32(1bv32, cstpncpy_#t~post5#1.offset);cstpncpy_#t~post6#1.base, cstpncpy_#t~post6#1.offset := cstpncpy_~s~0#1.base, cstpncpy_~s~0#1.offset;cstpncpy_~s~0#1.base, cstpncpy_~s~0#1.offset := cstpncpy_#t~post6#1.base, ~bvadd32(1bv32, cstpncpy_#t~post6#1.offset); {6764#(and (= |ULTIMATE.start_cstpncpy_#t~post6#1.offset| (_ bv0 32)) (not (bvslt (select |#length| |ULTIMATE.start_cstpncpy_#t~post6#1.base|) (_ bv1 32))))} is VALID [2022-02-20 23:41:28,916 INFO L290 TraceCheckUtils]: 21: Hoare triple {6764#(and (= |ULTIMATE.start_cstpncpy_#t~post6#1.offset| (_ bv0 32)) (not (bvslt (select |#length| |ULTIMATE.start_cstpncpy_#t~post6#1.base|) (_ bv1 32))))} assume !((~bvule32(~bvadd32(1bv32, cstpncpy_#t~post6#1.offset), #length[cstpncpy_#t~post6#1.base]) && ~bvule32(cstpncpy_#t~post6#1.offset, ~bvadd32(1bv32, cstpncpy_#t~post6#1.offset))) && ~bvule32(0bv32, cstpncpy_#t~post6#1.offset)); {6694#false} is VALID [2022-02-20 23:41:28,916 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:41:28,916 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:41:29,630 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-20 23:41:29,637 INFO L290 TraceCheckUtils]: 21: Hoare triple {6768#(and (bvule (bvadd |ULTIMATE.start_cstpncpy_#t~post6#1.offset| (_ bv1 32)) (select |#length| |ULTIMATE.start_cstpncpy_#t~post6#1.base|)) (bvule |ULTIMATE.start_cstpncpy_#t~post6#1.offset| (bvadd |ULTIMATE.start_cstpncpy_#t~post6#1.offset| (_ bv1 32))))} assume !((~bvule32(~bvadd32(1bv32, cstpncpy_#t~post6#1.offset), #length[cstpncpy_#t~post6#1.base]) && ~bvule32(cstpncpy_#t~post6#1.offset, ~bvadd32(1bv32, cstpncpy_#t~post6#1.offset))) && ~bvule32(0bv32, cstpncpy_#t~post6#1.offset)); {6694#false} is VALID [2022-02-20 23:41:29,656 INFO L290 TraceCheckUtils]: 20: Hoare triple {6772#(and (bvule (bvadd |ULTIMATE.start_cstpncpy_~s~0#1.offset| (_ bv1 32)) (select |#length| |ULTIMATE.start_cstpncpy_~s~0#1.base|)) (bvule |ULTIMATE.start_cstpncpy_~s~0#1.offset| (bvadd |ULTIMATE.start_cstpncpy_~s~0#1.offset| (_ bv1 32))))} cstpncpy_#t~post5#1.base, cstpncpy_#t~post5#1.offset := cstpncpy_~d~0#1.base, cstpncpy_~d~0#1.offset;cstpncpy_~d~0#1.base, cstpncpy_~d~0#1.offset := cstpncpy_#t~post5#1.base, ~bvadd32(1bv32, cstpncpy_#t~post5#1.offset);cstpncpy_#t~post6#1.base, cstpncpy_#t~post6#1.offset := cstpncpy_~s~0#1.base, cstpncpy_~s~0#1.offset;cstpncpy_~s~0#1.base, cstpncpy_~s~0#1.offset := cstpncpy_#t~post6#1.base, ~bvadd32(1bv32, cstpncpy_#t~post6#1.offset); {6768#(and (bvule (bvadd |ULTIMATE.start_cstpncpy_#t~post6#1.offset| (_ bv1 32)) (select |#length| |ULTIMATE.start_cstpncpy_#t~post6#1.base|)) (bvule |ULTIMATE.start_cstpncpy_#t~post6#1.offset| (bvadd |ULTIMATE.start_cstpncpy_#t~post6#1.offset| (_ bv1 32))))} is VALID [2022-02-20 23:41:29,656 INFO L290 TraceCheckUtils]: 19: Hoare triple {6772#(and (bvule (bvadd |ULTIMATE.start_cstpncpy_~s~0#1.offset| (_ bv1 32)) (select |#length| |ULTIMATE.start_cstpncpy_~s~0#1.base|)) (bvule |ULTIMATE.start_cstpncpy_~s~0#1.offset| (bvadd |ULTIMATE.start_cstpncpy_~s~0#1.offset| (_ bv1 32))))} havoc cstpncpy_#t~mem3#1.base, cstpncpy_#t~mem3#1.offset; {6772#(and (bvule (bvadd |ULTIMATE.start_cstpncpy_~s~0#1.offset| (_ bv1 32)) (select |#length| |ULTIMATE.start_cstpncpy_~s~0#1.base|)) (bvule |ULTIMATE.start_cstpncpy_~s~0#1.offset| (bvadd |ULTIMATE.start_cstpncpy_~s~0#1.offset| (_ bv1 32))))} is VALID [2022-02-20 23:41:29,657 INFO L290 TraceCheckUtils]: 18: Hoare triple {6772#(and (bvule (bvadd |ULTIMATE.start_cstpncpy_~s~0#1.offset| (_ bv1 32)) (select |#length| |ULTIMATE.start_cstpncpy_~s~0#1.base|)) (bvule |ULTIMATE.start_cstpncpy_~s~0#1.offset| (bvadd |ULTIMATE.start_cstpncpy_~s~0#1.offset| (_ bv1 32))))} SUMMARY for call write~$Pointer$(cstpncpy_#t~mem3#1.base, ~bvadd32(cstpncpy_#t~mem3#1.offset, cstpncpy_~n#1), cstpncpy_~#dst#1.base, cstpncpy_~#dst#1.offset, 4bv32); srcloc: L519-1 {6772#(and (bvule (bvadd |ULTIMATE.start_cstpncpy_~s~0#1.offset| (_ bv1 32)) (select |#length| |ULTIMATE.start_cstpncpy_~s~0#1.base|)) (bvule |ULTIMATE.start_cstpncpy_~s~0#1.offset| (bvadd |ULTIMATE.start_cstpncpy_~s~0#1.offset| (_ bv1 32))))} is VALID [2022-02-20 23:41:29,657 INFO L290 TraceCheckUtils]: 17: Hoare triple {6772#(and (bvule (bvadd |ULTIMATE.start_cstpncpy_~s~0#1.offset| (_ bv1 32)) (select |#length| |ULTIMATE.start_cstpncpy_~s~0#1.base|)) (bvule |ULTIMATE.start_cstpncpy_~s~0#1.offset| (bvadd |ULTIMATE.start_cstpncpy_~s~0#1.offset| (_ bv1 32))))} SUMMARY for call cstpncpy_#t~mem3#1.base, cstpncpy_#t~mem3#1.offset := read~$Pointer$(cstpncpy_~#dst#1.base, cstpncpy_~#dst#1.offset, 4bv32); srcloc: L519 {6772#(and (bvule (bvadd |ULTIMATE.start_cstpncpy_~s~0#1.offset| (_ bv1 32)) (select |#length| |ULTIMATE.start_cstpncpy_~s~0#1.base|)) (bvule |ULTIMATE.start_cstpncpy_~s~0#1.offset| (bvadd |ULTIMATE.start_cstpncpy_~s~0#1.offset| (_ bv1 32))))} is VALID [2022-02-20 23:41:29,658 INFO L290 TraceCheckUtils]: 16: Hoare triple {6785#(and (bvule (bvadd (_ bv1 32) |ULTIMATE.start_cstpncpy_~src#1.offset|) (select |#length| |ULTIMATE.start_cstpncpy_~src#1.base|)) (bvule |ULTIMATE.start_cstpncpy_~src#1.offset| (bvadd (_ bv1 32) |ULTIMATE.start_cstpncpy_~src#1.offset|)))} cstpncpy_~d~0#1.base, cstpncpy_~d~0#1.offset := cstpncpy_#t~mem2#1.base, cstpncpy_#t~mem2#1.offset;havoc cstpncpy_#t~mem2#1.base, cstpncpy_#t~mem2#1.offset;cstpncpy_~s~0#1.base, cstpncpy_~s~0#1.offset := cstpncpy_~src#1.base, cstpncpy_~src#1.offset; {6772#(and (bvule (bvadd |ULTIMATE.start_cstpncpy_~s~0#1.offset| (_ bv1 32)) (select |#length| |ULTIMATE.start_cstpncpy_~s~0#1.base|)) (bvule |ULTIMATE.start_cstpncpy_~s~0#1.offset| (bvadd |ULTIMATE.start_cstpncpy_~s~0#1.offset| (_ bv1 32))))} is VALID [2022-02-20 23:41:29,658 INFO L290 TraceCheckUtils]: 15: Hoare triple {6785#(and (bvule (bvadd (_ bv1 32) |ULTIMATE.start_cstpncpy_~src#1.offset|) (select |#length| |ULTIMATE.start_cstpncpy_~src#1.base|)) (bvule |ULTIMATE.start_cstpncpy_~src#1.offset| (bvadd (_ bv1 32) |ULTIMATE.start_cstpncpy_~src#1.offset|)))} SUMMARY for call cstpncpy_#t~mem2#1.base, cstpncpy_#t~mem2#1.offset := read~$Pointer$(cstpncpy_~#dst#1.base, cstpncpy_~#dst#1.offset, 4bv32); srcloc: L517 {6785#(and (bvule (bvadd (_ bv1 32) |ULTIMATE.start_cstpncpy_~src#1.offset|) (select |#length| |ULTIMATE.start_cstpncpy_~src#1.base|)) (bvule |ULTIMATE.start_cstpncpy_~src#1.offset| (bvadd (_ bv1 32) |ULTIMATE.start_cstpncpy_~src#1.offset|)))} is VALID [2022-02-20 23:41:29,659 INFO L290 TraceCheckUtils]: 14: Hoare triple {6785#(and (bvule (bvadd (_ bv1 32) |ULTIMATE.start_cstpncpy_~src#1.offset|) (select |#length| |ULTIMATE.start_cstpncpy_~src#1.base|)) (bvule |ULTIMATE.start_cstpncpy_~src#1.offset| (bvadd (_ bv1 32) |ULTIMATE.start_cstpncpy_~src#1.offset|)))} assume 0bv32 != cstpncpy_~n#1; {6785#(and (bvule (bvadd (_ bv1 32) |ULTIMATE.start_cstpncpy_~src#1.offset|) (select |#length| |ULTIMATE.start_cstpncpy_~src#1.base|)) (bvule |ULTIMATE.start_cstpncpy_~src#1.offset| (bvadd (_ bv1 32) |ULTIMATE.start_cstpncpy_~src#1.offset|)))} is VALID [2022-02-20 23:41:29,659 INFO L290 TraceCheckUtils]: 13: Hoare triple {6795#(and (bvule (bvadd |ULTIMATE.start_cstpncpy_#in~src#1.offset| (_ bv1 32)) (select |#length| |ULTIMATE.start_cstpncpy_#in~src#1.base|)) (bvule |ULTIMATE.start_cstpncpy_#in~src#1.offset| (bvadd |ULTIMATE.start_cstpncpy_#in~src#1.offset| (_ bv1 32))))} cstpncpy_~src#1.base, cstpncpy_~src#1.offset := cstpncpy_#in~src#1.base, cstpncpy_#in~src#1.offset;cstpncpy_~n#1 := cstpncpy_#in~n#1; {6785#(and (bvule (bvadd (_ bv1 32) |ULTIMATE.start_cstpncpy_~src#1.offset|) (select |#length| |ULTIMATE.start_cstpncpy_~src#1.base|)) (bvule |ULTIMATE.start_cstpncpy_~src#1.offset| (bvadd (_ bv1 32) |ULTIMATE.start_cstpncpy_~src#1.offset|)))} is VALID [2022-02-20 23:41:29,660 INFO L290 TraceCheckUtils]: 12: Hoare triple {6795#(and (bvule (bvadd |ULTIMATE.start_cstpncpy_#in~src#1.offset| (_ bv1 32)) (select |#length| |ULTIMATE.start_cstpncpy_#in~src#1.base|)) (bvule |ULTIMATE.start_cstpncpy_#in~src#1.offset| (bvadd |ULTIMATE.start_cstpncpy_#in~src#1.offset| (_ bv1 32))))} SUMMARY for call write~$Pointer$(cstpncpy_#in~dst#1.base, cstpncpy_#in~dst#1.offset, cstpncpy_~#dst#1.base, cstpncpy_~#dst#1.offset, 4bv32); srcloc: L513 {6795#(and (bvule (bvadd |ULTIMATE.start_cstpncpy_#in~src#1.offset| (_ bv1 32)) (select |#length| |ULTIMATE.start_cstpncpy_#in~src#1.base|)) (bvule |ULTIMATE.start_cstpncpy_#in~src#1.offset| (bvadd |ULTIMATE.start_cstpncpy_#in~src#1.offset| (_ bv1 32))))} is VALID [2022-02-20 23:41:29,669 INFO L290 TraceCheckUtils]: 11: Hoare triple {6802#(forall ((|v_ULTIMATE.start_cstpncpy_~#dst#1.base_23| (_ BitVec 32))) (or (and (bvule |ULTIMATE.start_main_~nondetString~0#1.offset| (bvadd |ULTIMATE.start_main_~nondetString~0#1.offset| (_ bv1 32))) (forall ((v_ArrVal_353 (_ BitVec 32))) (bvule (bvadd |ULTIMATE.start_main_~nondetString~0#1.offset| (_ bv1 32)) (select (store |#length| |v_ULTIMATE.start_cstpncpy_~#dst#1.base_23| v_ArrVal_353) |ULTIMATE.start_main_~nondetString~0#1.base|)))) (not (= (select |#valid| |v_ULTIMATE.start_cstpncpy_~#dst#1.base_23|) (_ bv0 1)))))} assume { :begin_inline_cstpncpy } true;cstpncpy_#in~dst#1.base, cstpncpy_#in~dst#1.offset, cstpncpy_#in~src#1.base, cstpncpy_#in~src#1.offset, cstpncpy_#in~n#1 := main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset, main_~nondetString~0#1.base, main_~nondetString~0#1.offset, main_~n~0#1;havoc cstpncpy_#res#1.base, cstpncpy_#res#1.offset;havoc cstpncpy_#t~mem2#1.base, cstpncpy_#t~mem2#1.offset, cstpncpy_#t~mem3#1.base, cstpncpy_#t~mem3#1.offset, cstpncpy_#t~post5#1.base, cstpncpy_#t~post5#1.offset, cstpncpy_#t~post6#1.base, cstpncpy_#t~post6#1.offset, cstpncpy_#t~mem7#1, cstpncpy_#t~post9#1.base, cstpncpy_#t~post9#1.offset, cstpncpy_#t~pre8#1, cstpncpy_#t~pre4#1, cstpncpy_~d~0#1.base, cstpncpy_~d~0#1.offset, cstpncpy_~s~0#1.base, cstpncpy_~s~0#1.offset, cstpncpy_#t~mem10#1.base, cstpncpy_#t~mem10#1.offset, cstpncpy_~#dst#1.base, cstpncpy_~#dst#1.offset, cstpncpy_~src#1.base, cstpncpy_~src#1.offset, cstpncpy_~n#1;call cstpncpy_~#dst#1.base, cstpncpy_~#dst#1.offset := #Ultimate.allocOnStack(4bv32); {6795#(and (bvule (bvadd |ULTIMATE.start_cstpncpy_#in~src#1.offset| (_ bv1 32)) (select |#length| |ULTIMATE.start_cstpncpy_#in~src#1.base|)) (bvule |ULTIMATE.start_cstpncpy_#in~src#1.offset| (bvadd |ULTIMATE.start_cstpncpy_#in~src#1.offset| (_ bv1 32))))} is VALID [2022-02-20 23:41:29,670 INFO L290 TraceCheckUtils]: 10: Hoare triple {6802#(forall ((|v_ULTIMATE.start_cstpncpy_~#dst#1.base_23| (_ BitVec 32))) (or (and (bvule |ULTIMATE.start_main_~nondetString~0#1.offset| (bvadd |ULTIMATE.start_main_~nondetString~0#1.offset| (_ bv1 32))) (forall ((v_ArrVal_353 (_ BitVec 32))) (bvule (bvadd |ULTIMATE.start_main_~nondetString~0#1.offset| (_ bv1 32)) (select (store |#length| |v_ULTIMATE.start_cstpncpy_~#dst#1.base_23| v_ArrVal_353) |ULTIMATE.start_main_~nondetString~0#1.base|)))) (not (= (select |#valid| |v_ULTIMATE.start_cstpncpy_~#dst#1.base_23|) (_ bv0 1)))))} SUMMARY for call write~intINTTYPE1(0bv8, main_~nondetString~0#1.base, ~bvadd32(main_~nondetString~0#1.offset, ~bvsub32(main_~length~0#1, 1bv32)), 1bv32); srcloc: L543-4 {6802#(forall ((|v_ULTIMATE.start_cstpncpy_~#dst#1.base_23| (_ BitVec 32))) (or (and (bvule |ULTIMATE.start_main_~nondetString~0#1.offset| (bvadd |ULTIMATE.start_main_~nondetString~0#1.offset| (_ bv1 32))) (forall ((v_ArrVal_353 (_ BitVec 32))) (bvule (bvadd |ULTIMATE.start_main_~nondetString~0#1.offset| (_ bv1 32)) (select (store |#length| |v_ULTIMATE.start_cstpncpy_~#dst#1.base_23| v_ArrVal_353) |ULTIMATE.start_main_~nondetString~0#1.base|)))) (not (= (select |#valid| |v_ULTIMATE.start_cstpncpy_~#dst#1.base_23|) (_ bv0 1)))))} is VALID [2022-02-20 23:41:29,670 INFO L290 TraceCheckUtils]: 9: Hoare triple {6802#(forall ((|v_ULTIMATE.start_cstpncpy_~#dst#1.base_23| (_ BitVec 32))) (or (and (bvule |ULTIMATE.start_main_~nondetString~0#1.offset| (bvadd |ULTIMATE.start_main_~nondetString~0#1.offset| (_ bv1 32))) (forall ((v_ArrVal_353 (_ BitVec 32))) (bvule (bvadd |ULTIMATE.start_main_~nondetString~0#1.offset| (_ bv1 32)) (select (store |#length| |v_ULTIMATE.start_cstpncpy_~#dst#1.base_23| v_ArrVal_353) |ULTIMATE.start_main_~nondetString~0#1.base|)))) (not (= (select |#valid| |v_ULTIMATE.start_cstpncpy_~#dst#1.base_23|) (_ bv0 1)))))} assume !~bvslt32(main_~i~0#1, ~bvsub32(main_~length~0#1, 1bv32)); {6802#(forall ((|v_ULTIMATE.start_cstpncpy_~#dst#1.base_23| (_ BitVec 32))) (or (and (bvule |ULTIMATE.start_main_~nondetString~0#1.offset| (bvadd |ULTIMATE.start_main_~nondetString~0#1.offset| (_ bv1 32))) (forall ((v_ArrVal_353 (_ BitVec 32))) (bvule (bvadd |ULTIMATE.start_main_~nondetString~0#1.offset| (_ bv1 32)) (select (store |#length| |v_ULTIMATE.start_cstpncpy_~#dst#1.base_23| v_ArrVal_353) |ULTIMATE.start_main_~nondetString~0#1.base|)))) (not (= (select |#valid| |v_ULTIMATE.start_cstpncpy_~#dst#1.base_23|) (_ bv0 1)))))} is VALID [2022-02-20 23:41:29,671 INFO L290 TraceCheckUtils]: 8: Hoare triple {6802#(forall ((|v_ULTIMATE.start_cstpncpy_~#dst#1.base_23| (_ BitVec 32))) (or (and (bvule |ULTIMATE.start_main_~nondetString~0#1.offset| (bvadd |ULTIMATE.start_main_~nondetString~0#1.offset| (_ bv1 32))) (forall ((v_ArrVal_353 (_ BitVec 32))) (bvule (bvadd |ULTIMATE.start_main_~nondetString~0#1.offset| (_ bv1 32)) (select (store |#length| |v_ULTIMATE.start_cstpncpy_~#dst#1.base_23| v_ArrVal_353) |ULTIMATE.start_main_~nondetString~0#1.base|)))) (not (= (select |#valid| |v_ULTIMATE.start_cstpncpy_~#dst#1.base_23|) (_ bv0 1)))))} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := ~bvadd32(1bv32, main_#t~post15#1);havoc main_#t~post15#1; {6802#(forall ((|v_ULTIMATE.start_cstpncpy_~#dst#1.base_23| (_ BitVec 32))) (or (and (bvule |ULTIMATE.start_main_~nondetString~0#1.offset| (bvadd |ULTIMATE.start_main_~nondetString~0#1.offset| (_ bv1 32))) (forall ((v_ArrVal_353 (_ BitVec 32))) (bvule (bvadd |ULTIMATE.start_main_~nondetString~0#1.offset| (_ bv1 32)) (select (store |#length| |v_ULTIMATE.start_cstpncpy_~#dst#1.base_23| v_ArrVal_353) |ULTIMATE.start_main_~nondetString~0#1.base|)))) (not (= (select |#valid| |v_ULTIMATE.start_cstpncpy_~#dst#1.base_23|) (_ bv0 1)))))} is VALID [2022-02-20 23:41:29,671 INFO L290 TraceCheckUtils]: 7: Hoare triple {6802#(forall ((|v_ULTIMATE.start_cstpncpy_~#dst#1.base_23| (_ BitVec 32))) (or (and (bvule |ULTIMATE.start_main_~nondetString~0#1.offset| (bvadd |ULTIMATE.start_main_~nondetString~0#1.offset| (_ bv1 32))) (forall ((v_ArrVal_353 (_ BitVec 32))) (bvule (bvadd |ULTIMATE.start_main_~nondetString~0#1.offset| (_ bv1 32)) (select (store |#length| |v_ULTIMATE.start_cstpncpy_~#dst#1.base_23| v_ArrVal_353) |ULTIMATE.start_main_~nondetString~0#1.base|)))) (not (= (select |#valid| |v_ULTIMATE.start_cstpncpy_~#dst#1.base_23|) (_ bv0 1)))))} havoc main_#t~nondet16#1; {6802#(forall ((|v_ULTIMATE.start_cstpncpy_~#dst#1.base_23| (_ BitVec 32))) (or (and (bvule |ULTIMATE.start_main_~nondetString~0#1.offset| (bvadd |ULTIMATE.start_main_~nondetString~0#1.offset| (_ bv1 32))) (forall ((v_ArrVal_353 (_ BitVec 32))) (bvule (bvadd |ULTIMATE.start_main_~nondetString~0#1.offset| (_ bv1 32)) (select (store |#length| |v_ULTIMATE.start_cstpncpy_~#dst#1.base_23| v_ArrVal_353) |ULTIMATE.start_main_~nondetString~0#1.base|)))) (not (= (select |#valid| |v_ULTIMATE.start_cstpncpy_~#dst#1.base_23|) (_ bv0 1)))))} is VALID [2022-02-20 23:41:29,672 INFO L290 TraceCheckUtils]: 6: Hoare triple {6818#(or (forall ((|v_ULTIMATE.start_cstpncpy_~#dst#1.base_23| (_ BitVec 32))) (or (and (bvule |ULTIMATE.start_main_~nondetString~0#1.offset| (bvadd |ULTIMATE.start_main_~nondetString~0#1.offset| (_ bv1 32))) (forall ((v_ArrVal_353 (_ BitVec 32))) (bvule (bvadd |ULTIMATE.start_main_~nondetString~0#1.offset| (_ bv1 32)) (select (store |#length| |v_ULTIMATE.start_cstpncpy_~#dst#1.base_23| v_ArrVal_353) |ULTIMATE.start_main_~nondetString~0#1.base|)))) (not (= (select |#valid| |v_ULTIMATE.start_cstpncpy_~#dst#1.base_23|) (_ bv0 1))))) (not (bvule (bvadd |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~nondetString~0#1.offset| (_ bv1 32)) (select |#length| |ULTIMATE.start_main_~nondetString~0#1.base|))))} SUMMARY for call write~intINTTYPE1(main_#t~nondet16#1, main_~nondetString~0#1.base, ~bvadd32(main_~nondetString~0#1.offset, main_~i~0#1), 1bv32); srcloc: L545 {6802#(forall ((|v_ULTIMATE.start_cstpncpy_~#dst#1.base_23| (_ BitVec 32))) (or (and (bvule |ULTIMATE.start_main_~nondetString~0#1.offset| (bvadd |ULTIMATE.start_main_~nondetString~0#1.offset| (_ bv1 32))) (forall ((v_ArrVal_353 (_ BitVec 32))) (bvule (bvadd |ULTIMATE.start_main_~nondetString~0#1.offset| (_ bv1 32)) (select (store |#length| |v_ULTIMATE.start_cstpncpy_~#dst#1.base_23| v_ArrVal_353) |ULTIMATE.start_main_~nondetString~0#1.base|)))) (not (= (select |#valid| |v_ULTIMATE.start_cstpncpy_~#dst#1.base_23|) (_ bv0 1)))))} is VALID [2022-02-20 23:41:29,673 INFO L290 TraceCheckUtils]: 5: Hoare triple {6818#(or (forall ((|v_ULTIMATE.start_cstpncpy_~#dst#1.base_23| (_ BitVec 32))) (or (and (bvule |ULTIMATE.start_main_~nondetString~0#1.offset| (bvadd |ULTIMATE.start_main_~nondetString~0#1.offset| (_ bv1 32))) (forall ((v_ArrVal_353 (_ BitVec 32))) (bvule (bvadd |ULTIMATE.start_main_~nondetString~0#1.offset| (_ bv1 32)) (select (store |#length| |v_ULTIMATE.start_cstpncpy_~#dst#1.base_23| v_ArrVal_353) |ULTIMATE.start_main_~nondetString~0#1.base|)))) (not (= (select |#valid| |v_ULTIMATE.start_cstpncpy_~#dst#1.base_23|) (_ bv0 1))))) (not (bvule (bvadd |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~nondetString~0#1.offset| (_ bv1 32)) (select |#length| |ULTIMATE.start_main_~nondetString~0#1.base|))))} assume !!~bvslt32(main_~i~0#1, ~bvsub32(main_~length~0#1, 1bv32)); {6818#(or (forall ((|v_ULTIMATE.start_cstpncpy_~#dst#1.base_23| (_ BitVec 32))) (or (and (bvule |ULTIMATE.start_main_~nondetString~0#1.offset| (bvadd |ULTIMATE.start_main_~nondetString~0#1.offset| (_ bv1 32))) (forall ((v_ArrVal_353 (_ BitVec 32))) (bvule (bvadd |ULTIMATE.start_main_~nondetString~0#1.offset| (_ bv1 32)) (select (store |#length| |v_ULTIMATE.start_cstpncpy_~#dst#1.base_23| v_ArrVal_353) |ULTIMATE.start_main_~nondetString~0#1.base|)))) (not (= (select |#valid| |v_ULTIMATE.start_cstpncpy_~#dst#1.base_23|) (_ bv0 1))))) (not (bvule (bvadd |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~nondetString~0#1.offset| (_ bv1 32)) (select |#length| |ULTIMATE.start_main_~nondetString~0#1.base|))))} is VALID [2022-02-20 23:41:29,675 INFO L290 TraceCheckUtils]: 4: Hoare triple {6693#true} call main_#t~malloc13#1.base, main_#t~malloc13#1.offset := #Ultimate.allocOnStack(main_~n~0#1);main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset := main_#t~malloc13#1.base, main_#t~malloc13#1.offset;call main_#t~malloc14#1.base, main_#t~malloc14#1.offset := #Ultimate.allocOnStack(main_~length~0#1);main_~nondetString~0#1.base, main_~nondetString~0#1.offset := main_#t~malloc14#1.base, main_#t~malloc14#1.offset;main_~i~0#1 := 0bv32; {6818#(or (forall ((|v_ULTIMATE.start_cstpncpy_~#dst#1.base_23| (_ BitVec 32))) (or (and (bvule |ULTIMATE.start_main_~nondetString~0#1.offset| (bvadd |ULTIMATE.start_main_~nondetString~0#1.offset| (_ bv1 32))) (forall ((v_ArrVal_353 (_ BitVec 32))) (bvule (bvadd |ULTIMATE.start_main_~nondetString~0#1.offset| (_ bv1 32)) (select (store |#length| |v_ULTIMATE.start_cstpncpy_~#dst#1.base_23| v_ArrVal_353) |ULTIMATE.start_main_~nondetString~0#1.base|)))) (not (= (select |#valid| |v_ULTIMATE.start_cstpncpy_~#dst#1.base_23|) (_ bv0 1))))) (not (bvule (bvadd |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~nondetString~0#1.offset| (_ bv1 32)) (select |#length| |ULTIMATE.start_main_~nondetString~0#1.base|))))} is VALID [2022-02-20 23:41:29,675 INFO L290 TraceCheckUtils]: 3: Hoare triple {6693#true} assume ~bvslt32(main_~n~0#1, 1bv32);main_~n~0#1 := 1bv32; {6693#true} is VALID [2022-02-20 23:41:29,675 INFO L290 TraceCheckUtils]: 2: Hoare triple {6693#true} assume !~bvslt32(main_~length~0#1, 1bv32); {6693#true} is VALID [2022-02-20 23:41:29,675 INFO L290 TraceCheckUtils]: 1: Hoare triple {6693#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~nondet12#1, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_#t~nondet16#1, main_#t~post15#1, main_~i~0#1, main_#t~ret17#1.base, main_#t~ret17#1.offset, main_~length~0#1, main_~n~0#1, main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset, main_~nondetString~0#1.base, main_~nondetString~0#1.offset;main_~length~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;main_~n~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; {6693#true} is VALID [2022-02-20 23:41:29,675 INFO L290 TraceCheckUtils]: 0: Hoare triple {6693#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven; {6693#true} is VALID [2022-02-20 23:41:29,675 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:41:29,675 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:41:29,675 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1377888735] [2022-02-20 23:41:29,675 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1377888735] provided 1 perfect and 1 imperfect interpolant sequences [2022-02-20 23:41:29,675 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-20 23:41:29,675 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 14 [2022-02-20 23:41:29,676 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788990742] [2022-02-20 23:41:29,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:41:29,676 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 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 22 [2022-02-20 23:41:29,676 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:41:29,676 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 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:41:29,714 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:41:29,714 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 23:41:29,714 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:41:29,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 23:41:29,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2022-02-20 23:41:29,715 INFO L87 Difference]: Start difference. First operand 78 states and 90 transitions. Second operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 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:41:31,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:41:31,673 INFO L93 Difference]: Finished difference Result 101 states and 114 transitions. [2022-02-20 23:41:31,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-20 23:41:31,673 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 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 22 [2022-02-20 23:41:31,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:41:31,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 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:41:31,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 86 transitions. [2022-02-20 23:41:31,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 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:41:31,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 86 transitions. [2022-02-20 23:41:31,675 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 86 transitions. [2022-02-20 23:41:31,829 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:41:31,830 INFO L225 Difference]: With dead ends: 101 [2022-02-20 23:41:31,830 INFO L226 Difference]: Without dead ends: 101 [2022-02-20 23:41:31,830 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2022-02-20 23:41:31,830 INFO L933 BasicCegarLoop]: 58 mSDtfsCounter, 66 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 55 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-20 23:41:31,830 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [66 Valid, 219 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 111 Invalid, 0 Unknown, 55 Unchecked, 0.5s Time] [2022-02-20 23:41:31,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-02-20 23:41:31,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 66. [2022-02-20 23:41:31,831 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:41:31,831 INFO L82 GeneralOperation]: Start isEquivalent. First operand 101 states. Second operand has 66 states, 58 states have (on average 1.3275862068965518) internal successors, (77), 65 states have internal predecessors, (77), 0 states have call successors, (0), 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:41:31,832 INFO L74 IsIncluded]: Start isIncluded. First operand 101 states. Second operand has 66 states, 58 states have (on average 1.3275862068965518) internal successors, (77), 65 states have internal predecessors, (77), 0 states have call successors, (0), 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:41:31,832 INFO L87 Difference]: Start difference. First operand 101 states. Second operand has 66 states, 58 states have (on average 1.3275862068965518) internal successors, (77), 65 states have internal predecessors, (77), 0 states have call successors, (0), 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:41:31,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:41:31,833 INFO L93 Difference]: Finished difference Result 101 states and 114 transitions. [2022-02-20 23:41:31,833 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 114 transitions. [2022-02-20 23:41:31,833 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:41:31,833 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:41:31,833 INFO L74 IsIncluded]: Start isIncluded. First operand has 66 states, 58 states have (on average 1.3275862068965518) internal successors, (77), 65 states have internal predecessors, (77), 0 states have call successors, (0), 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 101 states. [2022-02-20 23:41:31,833 INFO L87 Difference]: Start difference. First operand has 66 states, 58 states have (on average 1.3275862068965518) internal successors, (77), 65 states have internal predecessors, (77), 0 states have call successors, (0), 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 101 states. [2022-02-20 23:41:31,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:41:31,834 INFO L93 Difference]: Finished difference Result 101 states and 114 transitions. [2022-02-20 23:41:31,835 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 114 transitions. [2022-02-20 23:41:31,835 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:41:31,835 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:41:31,835 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:41:31,835 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:41:31,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 58 states have (on average 1.3275862068965518) internal successors, (77), 65 states have internal predecessors, (77), 0 states have call successors, (0), 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:41:31,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 77 transitions. [2022-02-20 23:41:31,836 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 77 transitions. Word has length 22 [2022-02-20 23:41:31,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:41:31,836 INFO L470 AbstractCegarLoop]: Abstraction has 66 states and 77 transitions. [2022-02-20 23:41:31,836 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 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:41:31,836 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 77 transitions. [2022-02-20 23:41:31,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-02-20 23:41:31,837 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:41:31,837 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:41:31,844 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2022-02-20 23:41:32,044 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:41:32,044 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2022-02-20 23:41:32,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:41:32,045 INFO L85 PathProgramCache]: Analyzing trace with hash 1682807689, now seen corresponding path program 1 times [2022-02-20 23:41:32,045 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:41:32,045 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2039450282] [2022-02-20 23:41:32,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:41:32,045 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:41:32,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:41:32,046 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:41:32,046 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2022-02-20 23:41:32,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:41:32,128 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-20 23:41:32,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:41:32,139 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:41:32,218 INFO L290 TraceCheckUtils]: 0: Hoare triple {7211#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven; {7211#true} is VALID [2022-02-20 23:41:32,218 INFO L290 TraceCheckUtils]: 1: Hoare triple {7211#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~nondet12#1, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_#t~nondet16#1, main_#t~post15#1, main_~i~0#1, main_#t~ret17#1.base, main_#t~ret17#1.offset, main_~length~0#1, main_~n~0#1, main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset, main_~nondetString~0#1.base, main_~nondetString~0#1.offset;main_~length~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;main_~n~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; {7211#true} is VALID [2022-02-20 23:41:32,219 INFO L290 TraceCheckUtils]: 2: Hoare triple {7211#true} assume ~bvslt32(main_~length~0#1, 1bv32);main_~length~0#1 := 1bv32; {7211#true} is VALID [2022-02-20 23:41:32,219 INFO L290 TraceCheckUtils]: 3: Hoare triple {7211#true} assume ~bvslt32(main_~n~0#1, 1bv32);main_~n~0#1 := 1bv32; {7225#(= |ULTIMATE.start_main_~n~0#1| (_ bv1 32))} is VALID [2022-02-20 23:41:32,219 INFO L290 TraceCheckUtils]: 4: Hoare triple {7225#(= |ULTIMATE.start_main_~n~0#1| (_ bv1 32))} call main_#t~malloc13#1.base, main_#t~malloc13#1.offset := #Ultimate.allocOnStack(main_~n~0#1);main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset := main_#t~malloc13#1.base, main_#t~malloc13#1.offset;call main_#t~malloc14#1.base, main_#t~malloc14#1.offset := #Ultimate.allocOnStack(main_~length~0#1);main_~nondetString~0#1.base, main_~nondetString~0#1.offset := main_#t~malloc14#1.base, main_#t~malloc14#1.offset;main_~i~0#1 := 0bv32; {7225#(= |ULTIMATE.start_main_~n~0#1| (_ bv1 32))} is VALID [2022-02-20 23:41:32,220 INFO L290 TraceCheckUtils]: 5: Hoare triple {7225#(= |ULTIMATE.start_main_~n~0#1| (_ bv1 32))} assume !~bvslt32(main_~i~0#1, ~bvsub32(main_~length~0#1, 1bv32)); {7225#(= |ULTIMATE.start_main_~n~0#1| (_ bv1 32))} is VALID [2022-02-20 23:41:32,220 INFO L290 TraceCheckUtils]: 6: Hoare triple {7225#(= |ULTIMATE.start_main_~n~0#1| (_ bv1 32))} SUMMARY for call write~intINTTYPE1(0bv8, main_~nondetString~0#1.base, ~bvadd32(main_~nondetString~0#1.offset, ~bvsub32(main_~length~0#1, 1bv32)), 1bv32); srcloc: L543-4 {7225#(= |ULTIMATE.start_main_~n~0#1| (_ bv1 32))} is VALID [2022-02-20 23:41:32,221 INFO L290 TraceCheckUtils]: 7: Hoare triple {7225#(= |ULTIMATE.start_main_~n~0#1| (_ bv1 32))} assume { :begin_inline_cstpncpy } true;cstpncpy_#in~dst#1.base, cstpncpy_#in~dst#1.offset, cstpncpy_#in~src#1.base, cstpncpy_#in~src#1.offset, cstpncpy_#in~n#1 := main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset, main_~nondetString~0#1.base, main_~nondetString~0#1.offset, main_~n~0#1;havoc cstpncpy_#res#1.base, cstpncpy_#res#1.offset;havoc cstpncpy_#t~mem2#1.base, cstpncpy_#t~mem2#1.offset, cstpncpy_#t~mem3#1.base, cstpncpy_#t~mem3#1.offset, cstpncpy_#t~post5#1.base, cstpncpy_#t~post5#1.offset, cstpncpy_#t~post6#1.base, cstpncpy_#t~post6#1.offset, cstpncpy_#t~mem7#1, cstpncpy_#t~post9#1.base, cstpncpy_#t~post9#1.offset, cstpncpy_#t~pre8#1, cstpncpy_#t~pre4#1, cstpncpy_~d~0#1.base, cstpncpy_~d~0#1.offset, cstpncpy_~s~0#1.base, cstpncpy_~s~0#1.offset, cstpncpy_#t~mem10#1.base, cstpncpy_#t~mem10#1.offset, cstpncpy_~#dst#1.base, cstpncpy_~#dst#1.offset, cstpncpy_~src#1.base, cstpncpy_~src#1.offset, cstpncpy_~n#1;call cstpncpy_~#dst#1.base, cstpncpy_~#dst#1.offset := #Ultimate.allocOnStack(4bv32); {7238#(= (_ bv1 32) |ULTIMATE.start_cstpncpy_#in~n#1|)} is VALID [2022-02-20 23:41:32,221 INFO L290 TraceCheckUtils]: 8: Hoare triple {7238#(= (_ bv1 32) |ULTIMATE.start_cstpncpy_#in~n#1|)} SUMMARY for call write~$Pointer$(cstpncpy_#in~dst#1.base, cstpncpy_#in~dst#1.offset, cstpncpy_~#dst#1.base, cstpncpy_~#dst#1.offset, 4bv32); srcloc: L513 {7238#(= (_ bv1 32) |ULTIMATE.start_cstpncpy_#in~n#1|)} is VALID [2022-02-20 23:41:32,221 INFO L290 TraceCheckUtils]: 9: Hoare triple {7238#(= (_ bv1 32) |ULTIMATE.start_cstpncpy_#in~n#1|)} cstpncpy_~src#1.base, cstpncpy_~src#1.offset := cstpncpy_#in~src#1.base, cstpncpy_#in~src#1.offset;cstpncpy_~n#1 := cstpncpy_#in~n#1; {7245#(= |ULTIMATE.start_cstpncpy_~n#1| (_ bv1 32))} is VALID [2022-02-20 23:41:32,222 INFO L290 TraceCheckUtils]: 10: Hoare triple {7245#(= |ULTIMATE.start_cstpncpy_~n#1| (_ bv1 32))} assume 0bv32 != cstpncpy_~n#1; {7245#(= |ULTIMATE.start_cstpncpy_~n#1| (_ bv1 32))} is VALID [2022-02-20 23:41:32,222 INFO L290 TraceCheckUtils]: 11: Hoare triple {7245#(= |ULTIMATE.start_cstpncpy_~n#1| (_ bv1 32))} SUMMARY for call cstpncpy_#t~mem2#1.base, cstpncpy_#t~mem2#1.offset := read~$Pointer$(cstpncpy_~#dst#1.base, cstpncpy_~#dst#1.offset, 4bv32); srcloc: L517 {7245#(= |ULTIMATE.start_cstpncpy_~n#1| (_ bv1 32))} is VALID [2022-02-20 23:41:32,222 INFO L290 TraceCheckUtils]: 12: Hoare triple {7245#(= |ULTIMATE.start_cstpncpy_~n#1| (_ bv1 32))} cstpncpy_~d~0#1.base, cstpncpy_~d~0#1.offset := cstpncpy_#t~mem2#1.base, cstpncpy_#t~mem2#1.offset;havoc cstpncpy_#t~mem2#1.base, cstpncpy_#t~mem2#1.offset;cstpncpy_~s~0#1.base, cstpncpy_~s~0#1.offset := cstpncpy_~src#1.base, cstpncpy_~src#1.offset; {7245#(= |ULTIMATE.start_cstpncpy_~n#1| (_ bv1 32))} is VALID [2022-02-20 23:41:32,222 INFO L290 TraceCheckUtils]: 13: Hoare triple {7245#(= |ULTIMATE.start_cstpncpy_~n#1| (_ bv1 32))} SUMMARY for call cstpncpy_#t~mem3#1.base, cstpncpy_#t~mem3#1.offset := read~$Pointer$(cstpncpy_~#dst#1.base, cstpncpy_~#dst#1.offset, 4bv32); srcloc: L519 {7245#(= |ULTIMATE.start_cstpncpy_~n#1| (_ bv1 32))} is VALID [2022-02-20 23:41:32,223 INFO L290 TraceCheckUtils]: 14: Hoare triple {7245#(= |ULTIMATE.start_cstpncpy_~n#1| (_ bv1 32))} SUMMARY for call write~$Pointer$(cstpncpy_#t~mem3#1.base, ~bvadd32(cstpncpy_#t~mem3#1.offset, cstpncpy_~n#1), cstpncpy_~#dst#1.base, cstpncpy_~#dst#1.offset, 4bv32); srcloc: L519-1 {7245#(= |ULTIMATE.start_cstpncpy_~n#1| (_ bv1 32))} is VALID [2022-02-20 23:41:32,223 INFO L290 TraceCheckUtils]: 15: Hoare triple {7245#(= |ULTIMATE.start_cstpncpy_~n#1| (_ bv1 32))} havoc cstpncpy_#t~mem3#1.base, cstpncpy_#t~mem3#1.offset; {7245#(= |ULTIMATE.start_cstpncpy_~n#1| (_ bv1 32))} is VALID [2022-02-20 23:41:32,223 INFO L290 TraceCheckUtils]: 16: Hoare triple {7245#(= |ULTIMATE.start_cstpncpy_~n#1| (_ bv1 32))} cstpncpy_#t~post5#1.base, cstpncpy_#t~post5#1.offset := cstpncpy_~d~0#1.base, cstpncpy_~d~0#1.offset;cstpncpy_~d~0#1.base, cstpncpy_~d~0#1.offset := cstpncpy_#t~post5#1.base, ~bvadd32(1bv32, cstpncpy_#t~post5#1.offset);cstpncpy_#t~post6#1.base, cstpncpy_#t~post6#1.offset := cstpncpy_~s~0#1.base, cstpncpy_~s~0#1.offset;cstpncpy_~s~0#1.base, cstpncpy_~s~0#1.offset := cstpncpy_#t~post6#1.base, ~bvadd32(1bv32, cstpncpy_#t~post6#1.offset); {7245#(= |ULTIMATE.start_cstpncpy_~n#1| (_ bv1 32))} is VALID [2022-02-20 23:41:32,223 INFO L290 TraceCheckUtils]: 17: Hoare triple {7245#(= |ULTIMATE.start_cstpncpy_~n#1| (_ bv1 32))} SUMMARY for call cstpncpy_#t~mem7#1 := read~intINTTYPE1(cstpncpy_#t~post6#1.base, cstpncpy_#t~post6#1.offset, 1bv32); srcloc: L521 {7245#(= |ULTIMATE.start_cstpncpy_~n#1| (_ bv1 32))} is VALID [2022-02-20 23:41:32,224 INFO L290 TraceCheckUtils]: 18: Hoare triple {7245#(= |ULTIMATE.start_cstpncpy_~n#1| (_ bv1 32))} SUMMARY for call write~intINTTYPE1(cstpncpy_#t~mem7#1, cstpncpy_#t~post5#1.base, cstpncpy_#t~post5#1.offset, 1bv32); srcloc: L521-1 {7245#(= |ULTIMATE.start_cstpncpy_~n#1| (_ bv1 32))} is VALID [2022-02-20 23:41:32,226 INFO L290 TraceCheckUtils]: 19: Hoare triple {7245#(= |ULTIMATE.start_cstpncpy_~n#1| (_ bv1 32))} assume 0bv32 == ~sign_extendFrom8To32(cstpncpy_#t~mem7#1);havoc cstpncpy_#t~post5#1.base, cstpncpy_#t~post5#1.offset;havoc cstpncpy_#t~post6#1.base, cstpncpy_#t~post6#1.offset;havoc cstpncpy_#t~mem7#1; {7245#(= |ULTIMATE.start_cstpncpy_~n#1| (_ bv1 32))} is VALID [2022-02-20 23:41:32,227 INFO L290 TraceCheckUtils]: 20: Hoare triple {7245#(= |ULTIMATE.start_cstpncpy_~n#1| (_ bv1 32))} SUMMARY for call write~$Pointer$(cstpncpy_~d~0#1.base, ~bvsub32(cstpncpy_~d~0#1.offset, 1bv32), cstpncpy_~#dst#1.base, cstpncpy_~#dst#1.offset, 4bv32); srcloc: L522 {7245#(= |ULTIMATE.start_cstpncpy_~n#1| (_ bv1 32))} is VALID [2022-02-20 23:41:32,227 INFO L290 TraceCheckUtils]: 21: Hoare triple {7245#(= |ULTIMATE.start_cstpncpy_~n#1| (_ bv1 32))} cstpncpy_#t~pre8#1 := ~bvsub32(cstpncpy_~n#1, 1bv32);cstpncpy_~n#1 := ~bvsub32(cstpncpy_~n#1, 1bv32); {7282#(= (bvadd |ULTIMATE.start_cstpncpy_#t~pre8#1| (_ bv1 32)) (_ bv1 32))} is VALID [2022-02-20 23:41:32,227 INFO L290 TraceCheckUtils]: 22: Hoare triple {7282#(= (bvadd |ULTIMATE.start_cstpncpy_#t~pre8#1| (_ bv1 32)) (_ bv1 32))} assume !!(0bv32 != cstpncpy_#t~pre8#1);havoc cstpncpy_#t~pre8#1;cstpncpy_#t~post9#1.base, cstpncpy_#t~post9#1.offset := cstpncpy_~d~0#1.base, cstpncpy_~d~0#1.offset;cstpncpy_~d~0#1.base, cstpncpy_~d~0#1.offset := cstpncpy_#t~post9#1.base, ~bvadd32(1bv32, cstpncpy_#t~post9#1.offset); {7212#false} is VALID [2022-02-20 23:41:32,228 INFO L290 TraceCheckUtils]: 23: Hoare triple {7212#false} assume !(1bv1 == #valid[cstpncpy_#t~post9#1.base]); {7212#false} is VALID [2022-02-20 23:41:32,228 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:41:32,228 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:41:32,228 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:41:32,228 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2039450282] [2022-02-20 23:41:32,228 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2039450282] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:41:32,228 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:41:32,228 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 23:41:32,228 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47402956] [2022-02-20 23:41:32,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:41:32,229 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2022-02-20 23:41:32,229 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:41:32,229 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 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:41:32,254 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:41:32,254 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 23:41:32,254 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:41:32,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 23:41:32,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:41:32,255 INFO L87 Difference]: Start difference. First operand 66 states and 77 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 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:41:32,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:41:32,749 INFO L93 Difference]: Finished difference Result 132 states and 152 transitions. [2022-02-20 23:41:32,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 23:41:32,750 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2022-02-20 23:41:32,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:41:32,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 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:41:32,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 98 transitions. [2022-02-20 23:41:32,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 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:41:32,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 98 transitions. [2022-02-20 23:41:32,751 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 98 transitions. [2022-02-20 23:41:32,861 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:41:32,862 INFO L225 Difference]: With dead ends: 132 [2022-02-20 23:41:32,862 INFO L226 Difference]: Without dead ends: 132 [2022-02-20 23:41:32,862 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2022-02-20 23:41:32,863 INFO L933 BasicCegarLoop]: 44 mSDtfsCounter, 82 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:41:32,863 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [82 Valid, 222 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:41:32,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-02-20 23:41:32,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 108. [2022-02-20 23:41:32,864 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:41:32,864 INFO L82 GeneralOperation]: Start isEquivalent. First operand 132 states. Second operand has 108 states, 100 states have (on average 1.27) internal successors, (127), 107 states have internal predecessors, (127), 0 states have call successors, (0), 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:41:32,865 INFO L74 IsIncluded]: Start isIncluded. First operand 132 states. Second operand has 108 states, 100 states have (on average 1.27) internal successors, (127), 107 states have internal predecessors, (127), 0 states have call successors, (0), 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:41:32,865 INFO L87 Difference]: Start difference. First operand 132 states. Second operand has 108 states, 100 states have (on average 1.27) internal successors, (127), 107 states have internal predecessors, (127), 0 states have call successors, (0), 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:41:32,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:41:32,866 INFO L93 Difference]: Finished difference Result 132 states and 152 transitions. [2022-02-20 23:41:32,866 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 152 transitions. [2022-02-20 23:41:32,866 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:41:32,866 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:41:32,866 INFO L74 IsIncluded]: Start isIncluded. First operand has 108 states, 100 states have (on average 1.27) internal successors, (127), 107 states have internal predecessors, (127), 0 states have call successors, (0), 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 132 states. [2022-02-20 23:41:32,867 INFO L87 Difference]: Start difference. First operand has 108 states, 100 states have (on average 1.27) internal successors, (127), 107 states have internal predecessors, (127), 0 states have call successors, (0), 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 132 states. [2022-02-20 23:41:32,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:41:32,868 INFO L93 Difference]: Finished difference Result 132 states and 152 transitions. [2022-02-20 23:41:32,868 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 152 transitions. [2022-02-20 23:41:32,869 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:41:32,869 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:41:32,869 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:41:32,869 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:41:32,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 100 states have (on average 1.27) internal successors, (127), 107 states have internal predecessors, (127), 0 states have call successors, (0), 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:41:32,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 127 transitions. [2022-02-20 23:41:32,870 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 127 transitions. Word has length 24 [2022-02-20 23:41:32,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:41:32,870 INFO L470 AbstractCegarLoop]: Abstraction has 108 states and 127 transitions. [2022-02-20 23:41:32,870 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 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:41:32,870 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 127 transitions. [2022-02-20 23:41:32,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-02-20 23:41:32,871 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:41:32,871 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:41:32,878 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Ended with exit code 0 [2022-02-20 23:41:33,075 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:41:33,075 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2022-02-20 23:41:33,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:41:33,076 INFO L85 PathProgramCache]: Analyzing trace with hash 1703829821, now seen corresponding path program 1 times [2022-02-20 23:41:33,076 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:41:33,076 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [954889225] [2022-02-20 23:41:33,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:41:33,076 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:41:33,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:41:33,077 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:41:33,080 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2022-02-20 23:41:33,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:41:33,154 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-20 23:41:33,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:41:33,164 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:41:33,241 INFO L290 TraceCheckUtils]: 0: Hoare triple {7798#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven; {7798#true} is VALID [2022-02-20 23:41:33,241 INFO L290 TraceCheckUtils]: 1: Hoare triple {7798#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~nondet12#1, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_#t~nondet16#1, main_#t~post15#1, main_~i~0#1, main_#t~ret17#1.base, main_#t~ret17#1.offset, main_~length~0#1, main_~n~0#1, main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset, main_~nondetString~0#1.base, main_~nondetString~0#1.offset;main_~length~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;main_~n~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; {7798#true} is VALID [2022-02-20 23:41:33,241 INFO L290 TraceCheckUtils]: 2: Hoare triple {7798#true} assume ~bvslt32(main_~length~0#1, 1bv32);main_~length~0#1 := 1bv32; {7798#true} is VALID [2022-02-20 23:41:33,241 INFO L290 TraceCheckUtils]: 3: Hoare triple {7798#true} assume ~bvslt32(main_~n~0#1, 1bv32);main_~n~0#1 := 1bv32; {7812#(= |ULTIMATE.start_main_~n~0#1| (_ bv1 32))} is VALID [2022-02-20 23:41:33,242 INFO L290 TraceCheckUtils]: 4: Hoare triple {7812#(= |ULTIMATE.start_main_~n~0#1| (_ bv1 32))} call main_#t~malloc13#1.base, main_#t~malloc13#1.offset := #Ultimate.allocOnStack(main_~n~0#1);main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset := main_#t~malloc13#1.base, main_#t~malloc13#1.offset;call main_#t~malloc14#1.base, main_#t~malloc14#1.offset := #Ultimate.allocOnStack(main_~length~0#1);main_~nondetString~0#1.base, main_~nondetString~0#1.offset := main_#t~malloc14#1.base, main_#t~malloc14#1.offset;main_~i~0#1 := 0bv32; {7812#(= |ULTIMATE.start_main_~n~0#1| (_ bv1 32))} is VALID [2022-02-20 23:41:33,242 INFO L290 TraceCheckUtils]: 5: Hoare triple {7812#(= |ULTIMATE.start_main_~n~0#1| (_ bv1 32))} assume !~bvslt32(main_~i~0#1, ~bvsub32(main_~length~0#1, 1bv32)); {7812#(= |ULTIMATE.start_main_~n~0#1| (_ bv1 32))} is VALID [2022-02-20 23:41:33,243 INFO L290 TraceCheckUtils]: 6: Hoare triple {7812#(= |ULTIMATE.start_main_~n~0#1| (_ bv1 32))} SUMMARY for call write~intINTTYPE1(0bv8, main_~nondetString~0#1.base, ~bvadd32(main_~nondetString~0#1.offset, ~bvsub32(main_~length~0#1, 1bv32)), 1bv32); srcloc: L543-4 {7812#(= |ULTIMATE.start_main_~n~0#1| (_ bv1 32))} is VALID [2022-02-20 23:41:33,243 INFO L290 TraceCheckUtils]: 7: Hoare triple {7812#(= |ULTIMATE.start_main_~n~0#1| (_ bv1 32))} assume { :begin_inline_cstpncpy } true;cstpncpy_#in~dst#1.base, cstpncpy_#in~dst#1.offset, cstpncpy_#in~src#1.base, cstpncpy_#in~src#1.offset, cstpncpy_#in~n#1 := main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset, main_~nondetString~0#1.base, main_~nondetString~0#1.offset, main_~n~0#1;havoc cstpncpy_#res#1.base, cstpncpy_#res#1.offset;havoc cstpncpy_#t~mem2#1.base, cstpncpy_#t~mem2#1.offset, cstpncpy_#t~mem3#1.base, cstpncpy_#t~mem3#1.offset, cstpncpy_#t~post5#1.base, cstpncpy_#t~post5#1.offset, cstpncpy_#t~post6#1.base, cstpncpy_#t~post6#1.offset, cstpncpy_#t~mem7#1, cstpncpy_#t~post9#1.base, cstpncpy_#t~post9#1.offset, cstpncpy_#t~pre8#1, cstpncpy_#t~pre4#1, cstpncpy_~d~0#1.base, cstpncpy_~d~0#1.offset, cstpncpy_~s~0#1.base, cstpncpy_~s~0#1.offset, cstpncpy_#t~mem10#1.base, cstpncpy_#t~mem10#1.offset, cstpncpy_~#dst#1.base, cstpncpy_~#dst#1.offset, cstpncpy_~src#1.base, cstpncpy_~src#1.offset, cstpncpy_~n#1;call cstpncpy_~#dst#1.base, cstpncpy_~#dst#1.offset := #Ultimate.allocOnStack(4bv32); {7825#(= (_ bv1 32) |ULTIMATE.start_cstpncpy_#in~n#1|)} is VALID [2022-02-20 23:41:33,243 INFO L290 TraceCheckUtils]: 8: Hoare triple {7825#(= (_ bv1 32) |ULTIMATE.start_cstpncpy_#in~n#1|)} SUMMARY for call write~$Pointer$(cstpncpy_#in~dst#1.base, cstpncpy_#in~dst#1.offset, cstpncpy_~#dst#1.base, cstpncpy_~#dst#1.offset, 4bv32); srcloc: L513 {7825#(= (_ bv1 32) |ULTIMATE.start_cstpncpy_#in~n#1|)} is VALID [2022-02-20 23:41:33,244 INFO L290 TraceCheckUtils]: 9: Hoare triple {7825#(= (_ bv1 32) |ULTIMATE.start_cstpncpy_#in~n#1|)} cstpncpy_~src#1.base, cstpncpy_~src#1.offset := cstpncpy_#in~src#1.base, cstpncpy_#in~src#1.offset;cstpncpy_~n#1 := cstpncpy_#in~n#1; {7832#(= |ULTIMATE.start_cstpncpy_~n#1| (_ bv1 32))} is VALID [2022-02-20 23:41:33,244 INFO L290 TraceCheckUtils]: 10: Hoare triple {7832#(= |ULTIMATE.start_cstpncpy_~n#1| (_ bv1 32))} assume 0bv32 != cstpncpy_~n#1; {7832#(= |ULTIMATE.start_cstpncpy_~n#1| (_ bv1 32))} is VALID [2022-02-20 23:41:33,244 INFO L290 TraceCheckUtils]: 11: Hoare triple {7832#(= |ULTIMATE.start_cstpncpy_~n#1| (_ bv1 32))} SUMMARY for call cstpncpy_#t~mem2#1.base, cstpncpy_#t~mem2#1.offset := read~$Pointer$(cstpncpy_~#dst#1.base, cstpncpy_~#dst#1.offset, 4bv32); srcloc: L517 {7832#(= |ULTIMATE.start_cstpncpy_~n#1| (_ bv1 32))} is VALID [2022-02-20 23:41:33,245 INFO L290 TraceCheckUtils]: 12: Hoare triple {7832#(= |ULTIMATE.start_cstpncpy_~n#1| (_ bv1 32))} cstpncpy_~d~0#1.base, cstpncpy_~d~0#1.offset := cstpncpy_#t~mem2#1.base, cstpncpy_#t~mem2#1.offset;havoc cstpncpy_#t~mem2#1.base, cstpncpy_#t~mem2#1.offset;cstpncpy_~s~0#1.base, cstpncpy_~s~0#1.offset := cstpncpy_~src#1.base, cstpncpy_~src#1.offset; {7832#(= |ULTIMATE.start_cstpncpy_~n#1| (_ bv1 32))} is VALID [2022-02-20 23:41:33,245 INFO L290 TraceCheckUtils]: 13: Hoare triple {7832#(= |ULTIMATE.start_cstpncpy_~n#1| (_ bv1 32))} SUMMARY for call cstpncpy_#t~mem3#1.base, cstpncpy_#t~mem3#1.offset := read~$Pointer$(cstpncpy_~#dst#1.base, cstpncpy_~#dst#1.offset, 4bv32); srcloc: L519 {7832#(= |ULTIMATE.start_cstpncpy_~n#1| (_ bv1 32))} is VALID [2022-02-20 23:41:33,245 INFO L290 TraceCheckUtils]: 14: Hoare triple {7832#(= |ULTIMATE.start_cstpncpy_~n#1| (_ bv1 32))} SUMMARY for call write~$Pointer$(cstpncpy_#t~mem3#1.base, ~bvadd32(cstpncpy_#t~mem3#1.offset, cstpncpy_~n#1), cstpncpy_~#dst#1.base, cstpncpy_~#dst#1.offset, 4bv32); srcloc: L519-1 {7832#(= |ULTIMATE.start_cstpncpy_~n#1| (_ bv1 32))} is VALID [2022-02-20 23:41:33,245 INFO L290 TraceCheckUtils]: 15: Hoare triple {7832#(= |ULTIMATE.start_cstpncpy_~n#1| (_ bv1 32))} havoc cstpncpy_#t~mem3#1.base, cstpncpy_#t~mem3#1.offset; {7832#(= |ULTIMATE.start_cstpncpy_~n#1| (_ bv1 32))} is VALID [2022-02-20 23:41:33,246 INFO L290 TraceCheckUtils]: 16: Hoare triple {7832#(= |ULTIMATE.start_cstpncpy_~n#1| (_ bv1 32))} cstpncpy_#t~post5#1.base, cstpncpy_#t~post5#1.offset := cstpncpy_~d~0#1.base, cstpncpy_~d~0#1.offset;cstpncpy_~d~0#1.base, cstpncpy_~d~0#1.offset := cstpncpy_#t~post5#1.base, ~bvadd32(1bv32, cstpncpy_#t~post5#1.offset);cstpncpy_#t~post6#1.base, cstpncpy_#t~post6#1.offset := cstpncpy_~s~0#1.base, cstpncpy_~s~0#1.offset;cstpncpy_~s~0#1.base, cstpncpy_~s~0#1.offset := cstpncpy_#t~post6#1.base, ~bvadd32(1bv32, cstpncpy_#t~post6#1.offset); {7832#(= |ULTIMATE.start_cstpncpy_~n#1| (_ bv1 32))} is VALID [2022-02-20 23:41:33,246 INFO L290 TraceCheckUtils]: 17: Hoare triple {7832#(= |ULTIMATE.start_cstpncpy_~n#1| (_ bv1 32))} SUMMARY for call cstpncpy_#t~mem7#1 := read~intINTTYPE1(cstpncpy_#t~post6#1.base, cstpncpy_#t~post6#1.offset, 1bv32); srcloc: L521 {7832#(= |ULTIMATE.start_cstpncpy_~n#1| (_ bv1 32))} is VALID [2022-02-20 23:41:33,246 INFO L290 TraceCheckUtils]: 18: Hoare triple {7832#(= |ULTIMATE.start_cstpncpy_~n#1| (_ bv1 32))} SUMMARY for call write~intINTTYPE1(cstpncpy_#t~mem7#1, cstpncpy_#t~post5#1.base, cstpncpy_#t~post5#1.offset, 1bv32); srcloc: L521-1 {7832#(= |ULTIMATE.start_cstpncpy_~n#1| (_ bv1 32))} is VALID [2022-02-20 23:41:33,246 INFO L290 TraceCheckUtils]: 19: Hoare triple {7832#(= |ULTIMATE.start_cstpncpy_~n#1| (_ bv1 32))} assume !(0bv32 == ~sign_extendFrom8To32(cstpncpy_#t~mem7#1));havoc cstpncpy_#t~post5#1.base, cstpncpy_#t~post5#1.offset;havoc cstpncpy_#t~post6#1.base, cstpncpy_#t~post6#1.offset;havoc cstpncpy_#t~mem7#1; {7832#(= |ULTIMATE.start_cstpncpy_~n#1| (_ bv1 32))} is VALID [2022-02-20 23:41:33,247 INFO L290 TraceCheckUtils]: 20: Hoare triple {7832#(= |ULTIMATE.start_cstpncpy_~n#1| (_ bv1 32))} cstpncpy_#t~pre4#1 := ~bvsub32(cstpncpy_~n#1, 1bv32);cstpncpy_~n#1 := ~bvsub32(cstpncpy_~n#1, 1bv32); {7866#(= (_ bv1 32) (bvadd |ULTIMATE.start_cstpncpy_#t~pre4#1| (_ bv1 32)))} is VALID [2022-02-20 23:41:33,247 INFO L290 TraceCheckUtils]: 21: Hoare triple {7866#(= (_ bv1 32) (bvadd |ULTIMATE.start_cstpncpy_#t~pre4#1| (_ bv1 32)))} assume !!(0bv32 != cstpncpy_#t~pre4#1);havoc cstpncpy_#t~pre4#1; {7799#false} is VALID [2022-02-20 23:41:33,247 INFO L290 TraceCheckUtils]: 22: Hoare triple {7799#false} cstpncpy_#t~post5#1.base, cstpncpy_#t~post5#1.offset := cstpncpy_~d~0#1.base, cstpncpy_~d~0#1.offset;cstpncpy_~d~0#1.base, cstpncpy_~d~0#1.offset := cstpncpy_#t~post5#1.base, ~bvadd32(1bv32, cstpncpy_#t~post5#1.offset);cstpncpy_#t~post6#1.base, cstpncpy_#t~post6#1.offset := cstpncpy_~s~0#1.base, cstpncpy_~s~0#1.offset;cstpncpy_~s~0#1.base, cstpncpy_~s~0#1.offset := cstpncpy_#t~post6#1.base, ~bvadd32(1bv32, cstpncpy_#t~post6#1.offset); {7799#false} is VALID [2022-02-20 23:41:33,247 INFO L290 TraceCheckUtils]: 23: Hoare triple {7799#false} assume !(1bv1 == #valid[cstpncpy_#t~post6#1.base]); {7799#false} is VALID [2022-02-20 23:41:33,248 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:41:33,248 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:41:33,248 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:41:33,248 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [954889225] [2022-02-20 23:41:33,248 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [954889225] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:41:33,248 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:41:33,248 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 23:41:33,248 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894273716] [2022-02-20 23:41:33,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:41:33,248 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2022-02-20 23:41:33,248 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:41:33,249 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 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:41:33,272 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:41:33,272 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 23:41:33,272 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:41:33,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 23:41:33,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:41:33,273 INFO L87 Difference]: Start difference. First operand 108 states and 127 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 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:41:33,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:41:33,728 INFO L93 Difference]: Finished difference Result 116 states and 133 transitions. [2022-02-20 23:41:33,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 23:41:33,729 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2022-02-20 23:41:33,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:41:33,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 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:41:33,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 79 transitions. [2022-02-20 23:41:33,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 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:41:33,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 79 transitions. [2022-02-20 23:41:33,730 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 79 transitions. [2022-02-20 23:41:33,803 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:41:33,804 INFO L225 Difference]: With dead ends: 116 [2022-02-20 23:41:33,804 INFO L226 Difference]: Without dead ends: 116 [2022-02-20 23:41:33,805 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2022-02-20 23:41:33,805 INFO L933 BasicCegarLoop]: 39 mSDtfsCounter, 45 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:41:33,805 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [45 Valid, 202 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:41:33,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-02-20 23:41:33,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 110. [2022-02-20 23:41:33,807 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:41:33,808 INFO L82 GeneralOperation]: Start isEquivalent. First operand 116 states. Second operand has 110 states, 102 states have (on average 1.2647058823529411) internal successors, (129), 109 states have internal predecessors, (129), 0 states have call successors, (0), 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:41:33,808 INFO L74 IsIncluded]: Start isIncluded. First operand 116 states. Second operand has 110 states, 102 states have (on average 1.2647058823529411) internal successors, (129), 109 states have internal predecessors, (129), 0 states have call successors, (0), 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:41:33,808 INFO L87 Difference]: Start difference. First operand 116 states. Second operand has 110 states, 102 states have (on average 1.2647058823529411) internal successors, (129), 109 states have internal predecessors, (129), 0 states have call successors, (0), 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:41:33,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:41:33,809 INFO L93 Difference]: Finished difference Result 116 states and 133 transitions. [2022-02-20 23:41:33,809 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 133 transitions. [2022-02-20 23:41:33,809 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:41:33,809 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:41:33,810 INFO L74 IsIncluded]: Start isIncluded. First operand has 110 states, 102 states have (on average 1.2647058823529411) internal successors, (129), 109 states have internal predecessors, (129), 0 states have call successors, (0), 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 116 states. [2022-02-20 23:41:33,810 INFO L87 Difference]: Start difference. First operand has 110 states, 102 states have (on average 1.2647058823529411) internal successors, (129), 109 states have internal predecessors, (129), 0 states have call successors, (0), 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 116 states. [2022-02-20 23:41:33,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:41:33,811 INFO L93 Difference]: Finished difference Result 116 states and 133 transitions. [2022-02-20 23:41:33,811 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 133 transitions. [2022-02-20 23:41:33,811 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:41:33,811 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:41:33,811 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:41:33,811 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:41:33,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 102 states have (on average 1.2647058823529411) internal successors, (129), 109 states have internal predecessors, (129), 0 states have call successors, (0), 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:41:33,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 129 transitions. [2022-02-20 23:41:33,813 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 129 transitions. Word has length 24 [2022-02-20 23:41:33,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:41:33,813 INFO L470 AbstractCegarLoop]: Abstraction has 110 states and 129 transitions. [2022-02-20 23:41:33,813 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 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:41:33,813 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 129 transitions. [2022-02-20 23:41:33,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-02-20 23:41:33,813 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:41:33,814 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:41:33,832 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Ended with exit code 0 [2022-02-20 23:41:34,020 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:41:34,021 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2022-02-20 23:41:34,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:41:34,021 INFO L85 PathProgramCache]: Analyzing trace with hash 2105509515, now seen corresponding path program 1 times [2022-02-20 23:41:34,021 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:41:34,021 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1335389377] [2022-02-20 23:41:34,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:41:34,021 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:41:34,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:41:34,022 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:41:34,023 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2022-02-20 23:41:34,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:41:34,097 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 23:41:34,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:41:34,107 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:41:34,156 INFO L290 TraceCheckUtils]: 0: Hoare triple {8339#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven; {8339#true} is VALID [2022-02-20 23:41:34,156 INFO L290 TraceCheckUtils]: 1: Hoare triple {8339#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~nondet12#1, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_#t~nondet16#1, main_#t~post15#1, main_~i~0#1, main_#t~ret17#1.base, main_#t~ret17#1.offset, main_~length~0#1, main_~n~0#1, main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset, main_~nondetString~0#1.base, main_~nondetString~0#1.offset;main_~length~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;main_~n~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; {8339#true} is VALID [2022-02-20 23:41:34,157 INFO L290 TraceCheckUtils]: 2: Hoare triple {8339#true} assume ~bvslt32(main_~length~0#1, 1bv32);main_~length~0#1 := 1bv32; {8339#true} is VALID [2022-02-20 23:41:34,157 INFO L290 TraceCheckUtils]: 3: Hoare triple {8339#true} assume !~bvslt32(main_~n~0#1, 1bv32); {8339#true} is VALID [2022-02-20 23:41:34,157 INFO L290 TraceCheckUtils]: 4: Hoare triple {8339#true} call main_#t~malloc13#1.base, main_#t~malloc13#1.offset := #Ultimate.allocOnStack(main_~n~0#1);main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset := main_#t~malloc13#1.base, main_#t~malloc13#1.offset;call main_#t~malloc14#1.base, main_#t~malloc14#1.offset := #Ultimate.allocOnStack(main_~length~0#1);main_~nondetString~0#1.base, main_~nondetString~0#1.offset := main_#t~malloc14#1.base, main_#t~malloc14#1.offset;main_~i~0#1 := 0bv32; {8339#true} is VALID [2022-02-20 23:41:34,157 INFO L290 TraceCheckUtils]: 5: Hoare triple {8339#true} assume !~bvslt32(main_~i~0#1, ~bvsub32(main_~length~0#1, 1bv32)); {8339#true} is VALID [2022-02-20 23:41:34,157 INFO L290 TraceCheckUtils]: 6: Hoare triple {8339#true} SUMMARY for call write~intINTTYPE1(0bv8, main_~nondetString~0#1.base, ~bvadd32(main_~nondetString~0#1.offset, ~bvsub32(main_~length~0#1, 1bv32)), 1bv32); srcloc: L543-4 {8339#true} is VALID [2022-02-20 23:41:34,157 INFO L290 TraceCheckUtils]: 7: Hoare triple {8339#true} assume { :begin_inline_cstpncpy } true;cstpncpy_#in~dst#1.base, cstpncpy_#in~dst#1.offset, cstpncpy_#in~src#1.base, cstpncpy_#in~src#1.offset, cstpncpy_#in~n#1 := main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset, main_~nondetString~0#1.base, main_~nondetString~0#1.offset, main_~n~0#1;havoc cstpncpy_#res#1.base, cstpncpy_#res#1.offset;havoc cstpncpy_#t~mem2#1.base, cstpncpy_#t~mem2#1.offset, cstpncpy_#t~mem3#1.base, cstpncpy_#t~mem3#1.offset, cstpncpy_#t~post5#1.base, cstpncpy_#t~post5#1.offset, cstpncpy_#t~post6#1.base, cstpncpy_#t~post6#1.offset, cstpncpy_#t~mem7#1, cstpncpy_#t~post9#1.base, cstpncpy_#t~post9#1.offset, cstpncpy_#t~pre8#1, cstpncpy_#t~pre4#1, cstpncpy_~d~0#1.base, cstpncpy_~d~0#1.offset, cstpncpy_~s~0#1.base, cstpncpy_~s~0#1.offset, cstpncpy_#t~mem10#1.base, cstpncpy_#t~mem10#1.offset, cstpncpy_~#dst#1.base, cstpncpy_~#dst#1.offset, cstpncpy_~src#1.base, cstpncpy_~src#1.offset, cstpncpy_~n#1;call cstpncpy_~#dst#1.base, cstpncpy_~#dst#1.offset := #Ultimate.allocOnStack(4bv32); {8339#true} is VALID [2022-02-20 23:41:34,157 INFO L290 TraceCheckUtils]: 8: Hoare triple {8339#true} SUMMARY for call write~$Pointer$(cstpncpy_#in~dst#1.base, cstpncpy_#in~dst#1.offset, cstpncpy_~#dst#1.base, cstpncpy_~#dst#1.offset, 4bv32); srcloc: L513 {8339#true} is VALID [2022-02-20 23:41:34,157 INFO L290 TraceCheckUtils]: 9: Hoare triple {8339#true} cstpncpy_~src#1.base, cstpncpy_~src#1.offset := cstpncpy_#in~src#1.base, cstpncpy_#in~src#1.offset;cstpncpy_~n#1 := cstpncpy_#in~n#1; {8339#true} is VALID [2022-02-20 23:41:34,158 INFO L290 TraceCheckUtils]: 10: Hoare triple {8339#true} assume 0bv32 != cstpncpy_~n#1; {8339#true} is VALID [2022-02-20 23:41:34,158 INFO L290 TraceCheckUtils]: 11: Hoare triple {8339#true} SUMMARY for call cstpncpy_#t~mem2#1.base, cstpncpy_#t~mem2#1.offset := read~$Pointer$(cstpncpy_~#dst#1.base, cstpncpy_~#dst#1.offset, 4bv32); srcloc: L517 {8339#true} is VALID [2022-02-20 23:41:34,158 INFO L290 TraceCheckUtils]: 12: Hoare triple {8339#true} cstpncpy_~d~0#1.base, cstpncpy_~d~0#1.offset := cstpncpy_#t~mem2#1.base, cstpncpy_#t~mem2#1.offset;havoc cstpncpy_#t~mem2#1.base, cstpncpy_#t~mem2#1.offset;cstpncpy_~s~0#1.base, cstpncpy_~s~0#1.offset := cstpncpy_~src#1.base, cstpncpy_~src#1.offset; {8339#true} is VALID [2022-02-20 23:41:34,158 INFO L290 TraceCheckUtils]: 13: Hoare triple {8339#true} SUMMARY for call cstpncpy_#t~mem3#1.base, cstpncpy_#t~mem3#1.offset := read~$Pointer$(cstpncpy_~#dst#1.base, cstpncpy_~#dst#1.offset, 4bv32); srcloc: L519 {8339#true} is VALID [2022-02-20 23:41:34,158 INFO L290 TraceCheckUtils]: 14: Hoare triple {8339#true} SUMMARY for call write~$Pointer$(cstpncpy_#t~mem3#1.base, ~bvadd32(cstpncpy_#t~mem3#1.offset, cstpncpy_~n#1), cstpncpy_~#dst#1.base, cstpncpy_~#dst#1.offset, 4bv32); srcloc: L519-1 {8339#true} is VALID [2022-02-20 23:41:34,158 INFO L290 TraceCheckUtils]: 15: Hoare triple {8339#true} havoc cstpncpy_#t~mem3#1.base, cstpncpy_#t~mem3#1.offset; {8339#true} is VALID [2022-02-20 23:41:34,159 INFO L290 TraceCheckUtils]: 16: Hoare triple {8339#true} cstpncpy_#t~post5#1.base, cstpncpy_#t~post5#1.offset := cstpncpy_~d~0#1.base, cstpncpy_~d~0#1.offset;cstpncpy_~d~0#1.base, cstpncpy_~d~0#1.offset := cstpncpy_#t~post5#1.base, ~bvadd32(1bv32, cstpncpy_#t~post5#1.offset);cstpncpy_#t~post6#1.base, cstpncpy_#t~post6#1.offset := cstpncpy_~s~0#1.base, cstpncpy_~s~0#1.offset;cstpncpy_~s~0#1.base, cstpncpy_~s~0#1.offset := cstpncpy_#t~post6#1.base, ~bvadd32(1bv32, cstpncpy_#t~post6#1.offset); {8392#(= |ULTIMATE.start_cstpncpy_#t~post5#1.base| |ULTIMATE.start_cstpncpy_~d~0#1.base|)} is VALID [2022-02-20 23:41:34,160 INFO L290 TraceCheckUtils]: 17: Hoare triple {8392#(= |ULTIMATE.start_cstpncpy_#t~post5#1.base| |ULTIMATE.start_cstpncpy_~d~0#1.base|)} SUMMARY for call cstpncpy_#t~mem7#1 := read~intINTTYPE1(cstpncpy_#t~post6#1.base, cstpncpy_#t~post6#1.offset, 1bv32); srcloc: L521 {8392#(= |ULTIMATE.start_cstpncpy_#t~post5#1.base| |ULTIMATE.start_cstpncpy_~d~0#1.base|)} is VALID [2022-02-20 23:41:34,160 INFO L290 TraceCheckUtils]: 18: Hoare triple {8392#(= |ULTIMATE.start_cstpncpy_#t~post5#1.base| |ULTIMATE.start_cstpncpy_~d~0#1.base|)} SUMMARY for call write~intINTTYPE1(cstpncpy_#t~mem7#1, cstpncpy_#t~post5#1.base, cstpncpy_#t~post5#1.offset, 1bv32); srcloc: L521-1 {8399#(= (select |#valid| |ULTIMATE.start_cstpncpy_~d~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:41:34,161 INFO L290 TraceCheckUtils]: 19: Hoare triple {8399#(= (select |#valid| |ULTIMATE.start_cstpncpy_~d~0#1.base|) (_ bv1 1))} assume 0bv32 == ~sign_extendFrom8To32(cstpncpy_#t~mem7#1);havoc cstpncpy_#t~post5#1.base, cstpncpy_#t~post5#1.offset;havoc cstpncpy_#t~post6#1.base, cstpncpy_#t~post6#1.offset;havoc cstpncpy_#t~mem7#1; {8399#(= (select |#valid| |ULTIMATE.start_cstpncpy_~d~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:41:34,161 INFO L290 TraceCheckUtils]: 20: Hoare triple {8399#(= (select |#valid| |ULTIMATE.start_cstpncpy_~d~0#1.base|) (_ bv1 1))} SUMMARY for call write~$Pointer$(cstpncpy_~d~0#1.base, ~bvsub32(cstpncpy_~d~0#1.offset, 1bv32), cstpncpy_~#dst#1.base, cstpncpy_~#dst#1.offset, 4bv32); srcloc: L522 {8399#(= (select |#valid| |ULTIMATE.start_cstpncpy_~d~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:41:34,161 INFO L290 TraceCheckUtils]: 21: Hoare triple {8399#(= (select |#valid| |ULTIMATE.start_cstpncpy_~d~0#1.base|) (_ bv1 1))} cstpncpy_#t~pre8#1 := ~bvsub32(cstpncpy_~n#1, 1bv32);cstpncpy_~n#1 := ~bvsub32(cstpncpy_~n#1, 1bv32); {8399#(= (select |#valid| |ULTIMATE.start_cstpncpy_~d~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:41:34,161 INFO L290 TraceCheckUtils]: 22: Hoare triple {8399#(= (select |#valid| |ULTIMATE.start_cstpncpy_~d~0#1.base|) (_ bv1 1))} assume !!(0bv32 != cstpncpy_#t~pre8#1);havoc cstpncpy_#t~pre8#1;cstpncpy_#t~post9#1.base, cstpncpy_#t~post9#1.offset := cstpncpy_~d~0#1.base, cstpncpy_~d~0#1.offset;cstpncpy_~d~0#1.base, cstpncpy_~d~0#1.offset := cstpncpy_#t~post9#1.base, ~bvadd32(1bv32, cstpncpy_#t~post9#1.offset); {8412#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_cstpncpy_#t~post9#1.base|))} is VALID [2022-02-20 23:41:34,162 INFO L290 TraceCheckUtils]: 23: Hoare triple {8412#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_cstpncpy_#t~post9#1.base|))} assume !(1bv1 == #valid[cstpncpy_#t~post9#1.base]); {8340#false} is VALID [2022-02-20 23:41:34,162 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:41:34,162 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:41:34,162 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:41:34,162 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1335389377] [2022-02-20 23:41:34,162 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1335389377] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:41:34,162 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:41:34,162 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:41:34,162 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693066080] [2022-02-20 23:41:34,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:41:34,163 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2022-02-20 23:41:34,163 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:41:34,163 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 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:41:34,185 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:41:34,185 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:41:34,185 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:41:34,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:41:34,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:41:34,185 INFO L87 Difference]: Start difference. First operand 110 states and 129 transitions. Second operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 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:41:34,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:41:34,613 INFO L93 Difference]: Finished difference Result 108 states and 127 transitions. [2022-02-20 23:41:34,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 23:41:34,614 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2022-02-20 23:41:34,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:41:34,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 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:41:34,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 50 transitions. [2022-02-20 23:41:34,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 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:41:34,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 50 transitions. [2022-02-20 23:41:34,615 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 50 transitions. [2022-02-20 23:41:34,666 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:41:34,667 INFO L225 Difference]: With dead ends: 108 [2022-02-20 23:41:34,667 INFO L226 Difference]: Without dead ends: 108 [2022-02-20 23:41:34,667 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:41:34,667 INFO L933 BasicCegarLoop]: 36 mSDtfsCounter, 19 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:41:34,667 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 99 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:41:34,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2022-02-20 23:41:34,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2022-02-20 23:41:34,669 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:41:34,669 INFO L82 GeneralOperation]: Start isEquivalent. First operand 108 states. Second operand has 108 states, 102 states have (on average 1.2450980392156863) internal successors, (127), 107 states have internal predecessors, (127), 0 states have call successors, (0), 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:41:34,669 INFO L74 IsIncluded]: Start isIncluded. First operand 108 states. Second operand has 108 states, 102 states have (on average 1.2450980392156863) internal successors, (127), 107 states have internal predecessors, (127), 0 states have call successors, (0), 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:41:34,669 INFO L87 Difference]: Start difference. First operand 108 states. Second operand has 108 states, 102 states have (on average 1.2450980392156863) internal successors, (127), 107 states have internal predecessors, (127), 0 states have call successors, (0), 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:41:34,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:41:34,670 INFO L93 Difference]: Finished difference Result 108 states and 127 transitions. [2022-02-20 23:41:34,670 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 127 transitions. [2022-02-20 23:41:34,670 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:41:34,670 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:41:34,670 INFO L74 IsIncluded]: Start isIncluded. First operand has 108 states, 102 states have (on average 1.2450980392156863) internal successors, (127), 107 states have internal predecessors, (127), 0 states have call successors, (0), 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 108 states. [2022-02-20 23:41:34,671 INFO L87 Difference]: Start difference. First operand has 108 states, 102 states have (on average 1.2450980392156863) internal successors, (127), 107 states have internal predecessors, (127), 0 states have call successors, (0), 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 108 states. [2022-02-20 23:41:34,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:41:34,672 INFO L93 Difference]: Finished difference Result 108 states and 127 transitions. [2022-02-20 23:41:34,672 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 127 transitions. [2022-02-20 23:41:34,672 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:41:34,672 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:41:34,672 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:41:34,673 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:41:34,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 102 states have (on average 1.2450980392156863) internal successors, (127), 107 states have internal predecessors, (127), 0 states have call successors, (0), 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:41:34,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 127 transitions. [2022-02-20 23:41:34,674 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 127 transitions. Word has length 24 [2022-02-20 23:41:34,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:41:34,674 INFO L470 AbstractCegarLoop]: Abstraction has 108 states and 127 transitions. [2022-02-20 23:41:34,674 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 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:41:34,674 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 127 transitions. [2022-02-20 23:41:34,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-02-20 23:41:34,674 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:41:34,675 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:41:34,699 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Ended with exit code 0 [2022-02-20 23:41:34,881 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:41:34,881 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2022-02-20 23:41:34,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:41:34,882 INFO L85 PathProgramCache]: Analyzing trace with hash 2105509516, now seen corresponding path program 1 times [2022-02-20 23:41:34,882 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:41:34,882 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1163955231] [2022-02-20 23:41:34,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:41:34,882 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:41:34,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:41:34,883 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:41:34,884 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2022-02-20 23:41:34,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:41:34,987 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 34 conjunts are in the unsatisfiable core [2022-02-20 23:41:35,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:41:35,003 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:41:35,027 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:41:35,029 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-02-20 23:41:35,033 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-02-20 23:41:35,089 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-02-20 23:41:35,089 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-02-20 23:41:35,140 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2022-02-20 23:41:35,146 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2022-02-20 23:41:35,246 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-02-20 23:41:35,250 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-02-20 23:41:35,854 INFO L290 TraceCheckUtils]: 0: Hoare triple {8851#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven; {8851#true} is VALID [2022-02-20 23:41:35,854 INFO L290 TraceCheckUtils]: 1: Hoare triple {8851#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~nondet12#1, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_#t~nondet16#1, main_#t~post15#1, main_~i~0#1, main_#t~ret17#1.base, main_#t~ret17#1.offset, main_~length~0#1, main_~n~0#1, main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset, main_~nondetString~0#1.base, main_~nondetString~0#1.offset;main_~length~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;main_~n~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; {8851#true} is VALID [2022-02-20 23:41:35,854 INFO L290 TraceCheckUtils]: 2: Hoare triple {8851#true} assume ~bvslt32(main_~length~0#1, 1bv32);main_~length~0#1 := 1bv32; {8851#true} is VALID [2022-02-20 23:41:35,854 INFO L290 TraceCheckUtils]: 3: Hoare triple {8851#true} assume !~bvslt32(main_~n~0#1, 1bv32); {8865#(not (bvslt |ULTIMATE.start_main_~n~0#1| (_ bv1 32)))} is VALID [2022-02-20 23:41:35,856 INFO L290 TraceCheckUtils]: 4: Hoare triple {8865#(not (bvslt |ULTIMATE.start_main_~n~0#1| (_ bv1 32)))} call main_#t~malloc13#1.base, main_#t~malloc13#1.offset := #Ultimate.allocOnStack(main_~n~0#1);main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset := main_#t~malloc13#1.base, main_#t~malloc13#1.offset;call main_#t~malloc14#1.base, main_#t~malloc14#1.offset := #Ultimate.allocOnStack(main_~length~0#1);main_~nondetString~0#1.base, main_~nondetString~0#1.offset := main_#t~malloc14#1.base, main_#t~malloc14#1.offset;main_~i~0#1 := 0bv32; {8869#(and (not (bvslt |ULTIMATE.start_main_~n~0#1| (_ bv1 32))) (= |ULTIMATE.start_main_~nondetArea~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_main_~n~0#1| (select |#length| |ULTIMATE.start_main_~nondetArea~0#1.base|)))} is VALID [2022-02-20 23:41:35,856 INFO L290 TraceCheckUtils]: 5: Hoare triple {8869#(and (not (bvslt |ULTIMATE.start_main_~n~0#1| (_ bv1 32))) (= |ULTIMATE.start_main_~nondetArea~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_main_~n~0#1| (select |#length| |ULTIMATE.start_main_~nondetArea~0#1.base|)))} assume !~bvslt32(main_~i~0#1, ~bvsub32(main_~length~0#1, 1bv32)); {8869#(and (not (bvslt |ULTIMATE.start_main_~n~0#1| (_ bv1 32))) (= |ULTIMATE.start_main_~nondetArea~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_main_~n~0#1| (select |#length| |ULTIMATE.start_main_~nondetArea~0#1.base|)))} is VALID [2022-02-20 23:41:35,858 INFO L290 TraceCheckUtils]: 6: Hoare triple {8869#(and (not (bvslt |ULTIMATE.start_main_~n~0#1| (_ bv1 32))) (= |ULTIMATE.start_main_~nondetArea~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_main_~n~0#1| (select |#length| |ULTIMATE.start_main_~nondetArea~0#1.base|)))} SUMMARY for call write~intINTTYPE1(0bv8, main_~nondetString~0#1.base, ~bvadd32(main_~nondetString~0#1.offset, ~bvsub32(main_~length~0#1, 1bv32)), 1bv32); srcloc: L543-4 {8869#(and (not (bvslt |ULTIMATE.start_main_~n~0#1| (_ bv1 32))) (= |ULTIMATE.start_main_~nondetArea~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_main_~n~0#1| (select |#length| |ULTIMATE.start_main_~nondetArea~0#1.base|)))} is VALID [2022-02-20 23:41:35,859 INFO L290 TraceCheckUtils]: 7: Hoare triple {8869#(and (not (bvslt |ULTIMATE.start_main_~n~0#1| (_ bv1 32))) (= |ULTIMATE.start_main_~nondetArea~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_main_~n~0#1| (select |#length| |ULTIMATE.start_main_~nondetArea~0#1.base|)))} assume { :begin_inline_cstpncpy } true;cstpncpy_#in~dst#1.base, cstpncpy_#in~dst#1.offset, cstpncpy_#in~src#1.base, cstpncpy_#in~src#1.offset, cstpncpy_#in~n#1 := main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset, main_~nondetString~0#1.base, main_~nondetString~0#1.offset, main_~n~0#1;havoc cstpncpy_#res#1.base, cstpncpy_#res#1.offset;havoc cstpncpy_#t~mem2#1.base, cstpncpy_#t~mem2#1.offset, cstpncpy_#t~mem3#1.base, cstpncpy_#t~mem3#1.offset, cstpncpy_#t~post5#1.base, cstpncpy_#t~post5#1.offset, cstpncpy_#t~post6#1.base, cstpncpy_#t~post6#1.offset, cstpncpy_#t~mem7#1, cstpncpy_#t~post9#1.base, cstpncpy_#t~post9#1.offset, cstpncpy_#t~pre8#1, cstpncpy_#t~pre4#1, cstpncpy_~d~0#1.base, cstpncpy_~d~0#1.offset, cstpncpy_~s~0#1.base, cstpncpy_~s~0#1.offset, cstpncpy_#t~mem10#1.base, cstpncpy_#t~mem10#1.offset, cstpncpy_~#dst#1.base, cstpncpy_~#dst#1.offset, cstpncpy_~src#1.base, cstpncpy_~src#1.offset, cstpncpy_~n#1;call cstpncpy_~#dst#1.base, cstpncpy_~#dst#1.offset := #Ultimate.allocOnStack(4bv32); {8879#(and (or (= |ULTIMATE.start_cstpncpy_#in~dst#1.base| |ULTIMATE.start_cstpncpy_~#dst#1.base|) (= (select |#length| |ULTIMATE.start_cstpncpy_#in~dst#1.base|) |ULTIMATE.start_cstpncpy_#in~n#1|)) (not (bvslt |ULTIMATE.start_cstpncpy_#in~n#1| (_ bv1 32))) (= |ULTIMATE.start_cstpncpy_#in~dst#1.offset| (_ bv0 32)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_cstpncpy_~#dst#1.base|)))} is VALID [2022-02-20 23:41:35,861 INFO L290 TraceCheckUtils]: 8: Hoare triple {8879#(and (or (= |ULTIMATE.start_cstpncpy_#in~dst#1.base| |ULTIMATE.start_cstpncpy_~#dst#1.base|) (= (select |#length| |ULTIMATE.start_cstpncpy_#in~dst#1.base|) |ULTIMATE.start_cstpncpy_#in~n#1|)) (not (bvslt |ULTIMATE.start_cstpncpy_#in~n#1| (_ bv1 32))) (= |ULTIMATE.start_cstpncpy_#in~dst#1.offset| (_ bv0 32)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_cstpncpy_~#dst#1.base|)))} SUMMARY for call write~$Pointer$(cstpncpy_#in~dst#1.base, cstpncpy_#in~dst#1.offset, cstpncpy_~#dst#1.base, cstpncpy_~#dst#1.offset, 4bv32); srcloc: L513 {8883#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_cstpncpy_~#dst#1.base|) |ULTIMATE.start_cstpncpy_~#dst#1.offset|)) (or (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_cstpncpy_~#dst#1.base|) |ULTIMATE.start_cstpncpy_~#dst#1.offset|)) |ULTIMATE.start_cstpncpy_#in~n#1|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_cstpncpy_~#dst#1.base|) |ULTIMATE.start_cstpncpy_~#dst#1.offset|) |ULTIMATE.start_cstpncpy_~#dst#1.base|)) (not (bvslt |ULTIMATE.start_cstpncpy_#in~n#1| (_ bv1 32))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_cstpncpy_~#dst#1.base|)))} is VALID [2022-02-20 23:41:35,862 INFO L290 TraceCheckUtils]: 9: Hoare triple {8883#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_cstpncpy_~#dst#1.base|) |ULTIMATE.start_cstpncpy_~#dst#1.offset|)) (or (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_cstpncpy_~#dst#1.base|) |ULTIMATE.start_cstpncpy_~#dst#1.offset|)) |ULTIMATE.start_cstpncpy_#in~n#1|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_cstpncpy_~#dst#1.base|) |ULTIMATE.start_cstpncpy_~#dst#1.offset|) |ULTIMATE.start_cstpncpy_~#dst#1.base|)) (not (bvslt |ULTIMATE.start_cstpncpy_#in~n#1| (_ bv1 32))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_cstpncpy_~#dst#1.base|)))} cstpncpy_~src#1.base, cstpncpy_~src#1.offset := cstpncpy_#in~src#1.base, cstpncpy_#in~src#1.offset;cstpncpy_~n#1 := cstpncpy_#in~n#1; {8887#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_cstpncpy_~#dst#1.base|) |ULTIMATE.start_cstpncpy_~#dst#1.offset|)) (or (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_cstpncpy_~#dst#1.base|) |ULTIMATE.start_cstpncpy_~#dst#1.offset|) |ULTIMATE.start_cstpncpy_~#dst#1.base|) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_cstpncpy_~#dst#1.base|) |ULTIMATE.start_cstpncpy_~#dst#1.offset|)) |ULTIMATE.start_cstpncpy_~n#1|)) (not (bvslt |ULTIMATE.start_cstpncpy_~n#1| (_ bv1 32))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_cstpncpy_~#dst#1.base|)))} is VALID [2022-02-20 23:41:35,862 INFO L290 TraceCheckUtils]: 10: Hoare triple {8887#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_cstpncpy_~#dst#1.base|) |ULTIMATE.start_cstpncpy_~#dst#1.offset|)) (or (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_cstpncpy_~#dst#1.base|) |ULTIMATE.start_cstpncpy_~#dst#1.offset|) |ULTIMATE.start_cstpncpy_~#dst#1.base|) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_cstpncpy_~#dst#1.base|) |ULTIMATE.start_cstpncpy_~#dst#1.offset|)) |ULTIMATE.start_cstpncpy_~n#1|)) (not (bvslt |ULTIMATE.start_cstpncpy_~n#1| (_ bv1 32))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_cstpncpy_~#dst#1.base|)))} assume 0bv32 != cstpncpy_~n#1; {8887#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_cstpncpy_~#dst#1.base|) |ULTIMATE.start_cstpncpy_~#dst#1.offset|)) (or (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_cstpncpy_~#dst#1.base|) |ULTIMATE.start_cstpncpy_~#dst#1.offset|) |ULTIMATE.start_cstpncpy_~#dst#1.base|) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_cstpncpy_~#dst#1.base|) |ULTIMATE.start_cstpncpy_~#dst#1.offset|)) |ULTIMATE.start_cstpncpy_~n#1|)) (not (bvslt |ULTIMATE.start_cstpncpy_~n#1| (_ bv1 32))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_cstpncpy_~#dst#1.base|)))} is VALID [2022-02-20 23:41:35,864 INFO L290 TraceCheckUtils]: 11: Hoare triple {8887#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_cstpncpy_~#dst#1.base|) |ULTIMATE.start_cstpncpy_~#dst#1.offset|)) (or (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_cstpncpy_~#dst#1.base|) |ULTIMATE.start_cstpncpy_~#dst#1.offset|) |ULTIMATE.start_cstpncpy_~#dst#1.base|) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_cstpncpy_~#dst#1.base|) |ULTIMATE.start_cstpncpy_~#dst#1.offset|)) |ULTIMATE.start_cstpncpy_~n#1|)) (not (bvslt |ULTIMATE.start_cstpncpy_~n#1| (_ bv1 32))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_cstpncpy_~#dst#1.base|)))} SUMMARY for call cstpncpy_#t~mem2#1.base, cstpncpy_#t~mem2#1.offset := read~$Pointer$(cstpncpy_~#dst#1.base, cstpncpy_~#dst#1.offset, 4bv32); srcloc: L517 {8894#(and (= |ULTIMATE.start_cstpncpy_#t~mem2#1.offset| (_ bv0 32)) (exists ((|ULTIMATE.start_cstpncpy_~#dst#1.base| (_ BitVec 32))) (and (or (= |ULTIMATE.start_cstpncpy_#t~mem2#1.base| |ULTIMATE.start_cstpncpy_~#dst#1.base|) (= (select |#length| |ULTIMATE.start_cstpncpy_#t~mem2#1.base|) |ULTIMATE.start_cstpncpy_~n#1|)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_cstpncpy_~#dst#1.base|)))) (not (bvslt |ULTIMATE.start_cstpncpy_~n#1| (_ bv1 32))))} is VALID [2022-02-20 23:41:35,864 INFO L290 TraceCheckUtils]: 12: Hoare triple {8894#(and (= |ULTIMATE.start_cstpncpy_#t~mem2#1.offset| (_ bv0 32)) (exists ((|ULTIMATE.start_cstpncpy_~#dst#1.base| (_ BitVec 32))) (and (or (= |ULTIMATE.start_cstpncpy_#t~mem2#1.base| |ULTIMATE.start_cstpncpy_~#dst#1.base|) (= (select |#length| |ULTIMATE.start_cstpncpy_#t~mem2#1.base|) |ULTIMATE.start_cstpncpy_~n#1|)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_cstpncpy_~#dst#1.base|)))) (not (bvslt |ULTIMATE.start_cstpncpy_~n#1| (_ bv1 32))))} cstpncpy_~d~0#1.base, cstpncpy_~d~0#1.offset := cstpncpy_#t~mem2#1.base, cstpncpy_#t~mem2#1.offset;havoc cstpncpy_#t~mem2#1.base, cstpncpy_#t~mem2#1.offset;cstpncpy_~s~0#1.base, cstpncpy_~s~0#1.offset := cstpncpy_~src#1.base, cstpncpy_~src#1.offset; {8898#(and (exists ((|ULTIMATE.start_cstpncpy_~#dst#1.base| (_ BitVec 32))) (and (or (= (select |#length| |ULTIMATE.start_cstpncpy_~d~0#1.base|) |ULTIMATE.start_cstpncpy_~n#1|) (= |ULTIMATE.start_cstpncpy_~d~0#1.base| |ULTIMATE.start_cstpncpy_~#dst#1.base|)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_cstpncpy_~#dst#1.base|)))) (= |ULTIMATE.start_cstpncpy_~d~0#1.offset| (_ bv0 32)) (not (bvslt |ULTIMATE.start_cstpncpy_~n#1| (_ bv1 32))))} is VALID [2022-02-20 23:41:35,865 INFO L290 TraceCheckUtils]: 13: Hoare triple {8898#(and (exists ((|ULTIMATE.start_cstpncpy_~#dst#1.base| (_ BitVec 32))) (and (or (= (select |#length| |ULTIMATE.start_cstpncpy_~d~0#1.base|) |ULTIMATE.start_cstpncpy_~n#1|) (= |ULTIMATE.start_cstpncpy_~d~0#1.base| |ULTIMATE.start_cstpncpy_~#dst#1.base|)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_cstpncpy_~#dst#1.base|)))) (= |ULTIMATE.start_cstpncpy_~d~0#1.offset| (_ bv0 32)) (not (bvslt |ULTIMATE.start_cstpncpy_~n#1| (_ bv1 32))))} SUMMARY for call cstpncpy_#t~mem3#1.base, cstpncpy_#t~mem3#1.offset := read~$Pointer$(cstpncpy_~#dst#1.base, cstpncpy_~#dst#1.offset, 4bv32); srcloc: L519 {8898#(and (exists ((|ULTIMATE.start_cstpncpy_~#dst#1.base| (_ BitVec 32))) (and (or (= (select |#length| |ULTIMATE.start_cstpncpy_~d~0#1.base|) |ULTIMATE.start_cstpncpy_~n#1|) (= |ULTIMATE.start_cstpncpy_~d~0#1.base| |ULTIMATE.start_cstpncpy_~#dst#1.base|)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_cstpncpy_~#dst#1.base|)))) (= |ULTIMATE.start_cstpncpy_~d~0#1.offset| (_ bv0 32)) (not (bvslt |ULTIMATE.start_cstpncpy_~n#1| (_ bv1 32))))} is VALID [2022-02-20 23:41:35,866 INFO L290 TraceCheckUtils]: 14: Hoare triple {8898#(and (exists ((|ULTIMATE.start_cstpncpy_~#dst#1.base| (_ BitVec 32))) (and (or (= (select |#length| |ULTIMATE.start_cstpncpy_~d~0#1.base|) |ULTIMATE.start_cstpncpy_~n#1|) (= |ULTIMATE.start_cstpncpy_~d~0#1.base| |ULTIMATE.start_cstpncpy_~#dst#1.base|)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_cstpncpy_~#dst#1.base|)))) (= |ULTIMATE.start_cstpncpy_~d~0#1.offset| (_ bv0 32)) (not (bvslt |ULTIMATE.start_cstpncpy_~n#1| (_ bv1 32))))} SUMMARY for call write~$Pointer$(cstpncpy_#t~mem3#1.base, ~bvadd32(cstpncpy_#t~mem3#1.offset, cstpncpy_~n#1), cstpncpy_~#dst#1.base, cstpncpy_~#dst#1.offset, 4bv32); srcloc: L519-1 {8898#(and (exists ((|ULTIMATE.start_cstpncpy_~#dst#1.base| (_ BitVec 32))) (and (or (= (select |#length| |ULTIMATE.start_cstpncpy_~d~0#1.base|) |ULTIMATE.start_cstpncpy_~n#1|) (= |ULTIMATE.start_cstpncpy_~d~0#1.base| |ULTIMATE.start_cstpncpy_~#dst#1.base|)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_cstpncpy_~#dst#1.base|)))) (= |ULTIMATE.start_cstpncpy_~d~0#1.offset| (_ bv0 32)) (not (bvslt |ULTIMATE.start_cstpncpy_~n#1| (_ bv1 32))))} is VALID [2022-02-20 23:41:35,866 INFO L290 TraceCheckUtils]: 15: Hoare triple {8898#(and (exists ((|ULTIMATE.start_cstpncpy_~#dst#1.base| (_ BitVec 32))) (and (or (= (select |#length| |ULTIMATE.start_cstpncpy_~d~0#1.base|) |ULTIMATE.start_cstpncpy_~n#1|) (= |ULTIMATE.start_cstpncpy_~d~0#1.base| |ULTIMATE.start_cstpncpy_~#dst#1.base|)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_cstpncpy_~#dst#1.base|)))) (= |ULTIMATE.start_cstpncpy_~d~0#1.offset| (_ bv0 32)) (not (bvslt |ULTIMATE.start_cstpncpy_~n#1| (_ bv1 32))))} havoc cstpncpy_#t~mem3#1.base, cstpncpy_#t~mem3#1.offset; {8898#(and (exists ((|ULTIMATE.start_cstpncpy_~#dst#1.base| (_ BitVec 32))) (and (or (= (select |#length| |ULTIMATE.start_cstpncpy_~d~0#1.base|) |ULTIMATE.start_cstpncpy_~n#1|) (= |ULTIMATE.start_cstpncpy_~d~0#1.base| |ULTIMATE.start_cstpncpy_~#dst#1.base|)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_cstpncpy_~#dst#1.base|)))) (= |ULTIMATE.start_cstpncpy_~d~0#1.offset| (_ bv0 32)) (not (bvslt |ULTIMATE.start_cstpncpy_~n#1| (_ bv1 32))))} is VALID [2022-02-20 23:41:35,867 INFO L290 TraceCheckUtils]: 16: Hoare triple {8898#(and (exists ((|ULTIMATE.start_cstpncpy_~#dst#1.base| (_ BitVec 32))) (and (or (= (select |#length| |ULTIMATE.start_cstpncpy_~d~0#1.base|) |ULTIMATE.start_cstpncpy_~n#1|) (= |ULTIMATE.start_cstpncpy_~d~0#1.base| |ULTIMATE.start_cstpncpy_~#dst#1.base|)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_cstpncpy_~#dst#1.base|)))) (= |ULTIMATE.start_cstpncpy_~d~0#1.offset| (_ bv0 32)) (not (bvslt |ULTIMATE.start_cstpncpy_~n#1| (_ bv1 32))))} cstpncpy_#t~post5#1.base, cstpncpy_#t~post5#1.offset := cstpncpy_~d~0#1.base, cstpncpy_~d~0#1.offset;cstpncpy_~d~0#1.base, cstpncpy_~d~0#1.offset := cstpncpy_#t~post5#1.base, ~bvadd32(1bv32, cstpncpy_#t~post5#1.offset);cstpncpy_#t~post6#1.base, cstpncpy_#t~post6#1.offset := cstpncpy_~s~0#1.base, cstpncpy_~s~0#1.offset;cstpncpy_~s~0#1.base, cstpncpy_~s~0#1.offset := cstpncpy_#t~post6#1.base, ~bvadd32(1bv32, cstpncpy_#t~post6#1.offset); {8911#(and (exists ((|ULTIMATE.start_cstpncpy_~#dst#1.base| (_ BitVec 32))) (and (or (= |ULTIMATE.start_cstpncpy_#t~post5#1.base| |ULTIMATE.start_cstpncpy_~#dst#1.base|) (= (select |#length| |ULTIMATE.start_cstpncpy_#t~post5#1.base|) |ULTIMATE.start_cstpncpy_~n#1|)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_cstpncpy_~#dst#1.base|)))) (= (bvadd (_ bv1 32) |ULTIMATE.start_cstpncpy_#t~post5#1.offset|) |ULTIMATE.start_cstpncpy_~d~0#1.offset|) (= |ULTIMATE.start_cstpncpy_#t~post5#1.base| |ULTIMATE.start_cstpncpy_~d~0#1.base|) (= (_ bv0 32) |ULTIMATE.start_cstpncpy_#t~post5#1.offset|) (not (bvslt |ULTIMATE.start_cstpncpy_~n#1| (_ bv1 32))))} is VALID [2022-02-20 23:41:35,869 INFO L290 TraceCheckUtils]: 17: Hoare triple {8911#(and (exists ((|ULTIMATE.start_cstpncpy_~#dst#1.base| (_ BitVec 32))) (and (or (= |ULTIMATE.start_cstpncpy_#t~post5#1.base| |ULTIMATE.start_cstpncpy_~#dst#1.base|) (= (select |#length| |ULTIMATE.start_cstpncpy_#t~post5#1.base|) |ULTIMATE.start_cstpncpy_~n#1|)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_cstpncpy_~#dst#1.base|)))) (= (bvadd (_ bv1 32) |ULTIMATE.start_cstpncpy_#t~post5#1.offset|) |ULTIMATE.start_cstpncpy_~d~0#1.offset|) (= |ULTIMATE.start_cstpncpy_#t~post5#1.base| |ULTIMATE.start_cstpncpy_~d~0#1.base|) (= (_ bv0 32) |ULTIMATE.start_cstpncpy_#t~post5#1.offset|) (not (bvslt |ULTIMATE.start_cstpncpy_~n#1| (_ bv1 32))))} SUMMARY for call cstpncpy_#t~mem7#1 := read~intINTTYPE1(cstpncpy_#t~post6#1.base, cstpncpy_#t~post6#1.offset, 1bv32); srcloc: L521 {8911#(and (exists ((|ULTIMATE.start_cstpncpy_~#dst#1.base| (_ BitVec 32))) (and (or (= |ULTIMATE.start_cstpncpy_#t~post5#1.base| |ULTIMATE.start_cstpncpy_~#dst#1.base|) (= (select |#length| |ULTIMATE.start_cstpncpy_#t~post5#1.base|) |ULTIMATE.start_cstpncpy_~n#1|)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_cstpncpy_~#dst#1.base|)))) (= (bvadd (_ bv1 32) |ULTIMATE.start_cstpncpy_#t~post5#1.offset|) |ULTIMATE.start_cstpncpy_~d~0#1.offset|) (= |ULTIMATE.start_cstpncpy_#t~post5#1.base| |ULTIMATE.start_cstpncpy_~d~0#1.base|) (= (_ bv0 32) |ULTIMATE.start_cstpncpy_#t~post5#1.offset|) (not (bvslt |ULTIMATE.start_cstpncpy_~n#1| (_ bv1 32))))} is VALID [2022-02-20 23:41:35,870 INFO L290 TraceCheckUtils]: 18: Hoare triple {8911#(and (exists ((|ULTIMATE.start_cstpncpy_~#dst#1.base| (_ BitVec 32))) (and (or (= |ULTIMATE.start_cstpncpy_#t~post5#1.base| |ULTIMATE.start_cstpncpy_~#dst#1.base|) (= (select |#length| |ULTIMATE.start_cstpncpy_#t~post5#1.base|) |ULTIMATE.start_cstpncpy_~n#1|)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_cstpncpy_~#dst#1.base|)))) (= (bvadd (_ bv1 32) |ULTIMATE.start_cstpncpy_#t~post5#1.offset|) |ULTIMATE.start_cstpncpy_~d~0#1.offset|) (= |ULTIMATE.start_cstpncpy_#t~post5#1.base| |ULTIMATE.start_cstpncpy_~d~0#1.base|) (= (_ bv0 32) |ULTIMATE.start_cstpncpy_#t~post5#1.offset|) (not (bvslt |ULTIMATE.start_cstpncpy_~n#1| (_ bv1 32))))} SUMMARY for call write~intINTTYPE1(cstpncpy_#t~mem7#1, cstpncpy_#t~post5#1.base, cstpncpy_#t~post5#1.offset, 1bv32); srcloc: L521-1 {8918#(and (exists ((|ULTIMATE.start_cstpncpy_~#dst#1.base| (_ BitVec 32))) (and (or (= (select |#length| |ULTIMATE.start_cstpncpy_~d~0#1.base|) |ULTIMATE.start_cstpncpy_~n#1|) (= |ULTIMATE.start_cstpncpy_~d~0#1.base| |ULTIMATE.start_cstpncpy_~#dst#1.base|)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_cstpncpy_~#dst#1.base|)))) (not (bvslt |ULTIMATE.start_cstpncpy_~n#1| (_ bv1 32))) (= |ULTIMATE.start_cstpncpy_~d~0#1.offset| (_ bv1 32)))} is VALID [2022-02-20 23:41:35,871 INFO L290 TraceCheckUtils]: 19: Hoare triple {8918#(and (exists ((|ULTIMATE.start_cstpncpy_~#dst#1.base| (_ BitVec 32))) (and (or (= (select |#length| |ULTIMATE.start_cstpncpy_~d~0#1.base|) |ULTIMATE.start_cstpncpy_~n#1|) (= |ULTIMATE.start_cstpncpy_~d~0#1.base| |ULTIMATE.start_cstpncpy_~#dst#1.base|)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_cstpncpy_~#dst#1.base|)))) (not (bvslt |ULTIMATE.start_cstpncpy_~n#1| (_ bv1 32))) (= |ULTIMATE.start_cstpncpy_~d~0#1.offset| (_ bv1 32)))} assume 0bv32 == ~sign_extendFrom8To32(cstpncpy_#t~mem7#1);havoc cstpncpy_#t~post5#1.base, cstpncpy_#t~post5#1.offset;havoc cstpncpy_#t~post6#1.base, cstpncpy_#t~post6#1.offset;havoc cstpncpy_#t~mem7#1; {8918#(and (exists ((|ULTIMATE.start_cstpncpy_~#dst#1.base| (_ BitVec 32))) (and (or (= (select |#length| |ULTIMATE.start_cstpncpy_~d~0#1.base|) |ULTIMATE.start_cstpncpy_~n#1|) (= |ULTIMATE.start_cstpncpy_~d~0#1.base| |ULTIMATE.start_cstpncpy_~#dst#1.base|)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_cstpncpy_~#dst#1.base|)))) (not (bvslt |ULTIMATE.start_cstpncpy_~n#1| (_ bv1 32))) (= |ULTIMATE.start_cstpncpy_~d~0#1.offset| (_ bv1 32)))} is VALID [2022-02-20 23:41:35,875 INFO L290 TraceCheckUtils]: 20: Hoare triple {8918#(and (exists ((|ULTIMATE.start_cstpncpy_~#dst#1.base| (_ BitVec 32))) (and (or (= (select |#length| |ULTIMATE.start_cstpncpy_~d~0#1.base|) |ULTIMATE.start_cstpncpy_~n#1|) (= |ULTIMATE.start_cstpncpy_~d~0#1.base| |ULTIMATE.start_cstpncpy_~#dst#1.base|)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_cstpncpy_~#dst#1.base|)))) (not (bvslt |ULTIMATE.start_cstpncpy_~n#1| (_ bv1 32))) (= |ULTIMATE.start_cstpncpy_~d~0#1.offset| (_ bv1 32)))} SUMMARY for call write~$Pointer$(cstpncpy_~d~0#1.base, ~bvsub32(cstpncpy_~d~0#1.offset, 1bv32), cstpncpy_~#dst#1.base, cstpncpy_~#dst#1.offset, 4bv32); srcloc: L522 {8918#(and (exists ((|ULTIMATE.start_cstpncpy_~#dst#1.base| (_ BitVec 32))) (and (or (= (select |#length| |ULTIMATE.start_cstpncpy_~d~0#1.base|) |ULTIMATE.start_cstpncpy_~n#1|) (= |ULTIMATE.start_cstpncpy_~d~0#1.base| |ULTIMATE.start_cstpncpy_~#dst#1.base|)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_cstpncpy_~#dst#1.base|)))) (not (bvslt |ULTIMATE.start_cstpncpy_~n#1| (_ bv1 32))) (= |ULTIMATE.start_cstpncpy_~d~0#1.offset| (_ bv1 32)))} is VALID [2022-02-20 23:41:35,877 INFO L290 TraceCheckUtils]: 21: Hoare triple {8918#(and (exists ((|ULTIMATE.start_cstpncpy_~#dst#1.base| (_ BitVec 32))) (and (or (= (select |#length| |ULTIMATE.start_cstpncpy_~d~0#1.base|) |ULTIMATE.start_cstpncpy_~n#1|) (= |ULTIMATE.start_cstpncpy_~d~0#1.base| |ULTIMATE.start_cstpncpy_~#dst#1.base|)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_cstpncpy_~#dst#1.base|)))) (not (bvslt |ULTIMATE.start_cstpncpy_~n#1| (_ bv1 32))) (= |ULTIMATE.start_cstpncpy_~d~0#1.offset| (_ bv1 32)))} cstpncpy_#t~pre8#1 := ~bvsub32(cstpncpy_~n#1, 1bv32);cstpncpy_~n#1 := ~bvsub32(cstpncpy_~n#1, 1bv32); {8928#(and (not (bvslt (bvadd |ULTIMATE.start_cstpncpy_#t~pre8#1| (_ bv1 32)) (_ bv1 32))) (exists ((|ULTIMATE.start_cstpncpy_~#dst#1.base| (_ BitVec 32))) (and (= (_ bv4 32) (select |#length| |ULTIMATE.start_cstpncpy_~#dst#1.base|)) (or (= (select |#length| |ULTIMATE.start_cstpncpy_~d~0#1.base|) (bvadd |ULTIMATE.start_cstpncpy_#t~pre8#1| (_ bv1 32))) (= |ULTIMATE.start_cstpncpy_~d~0#1.base| |ULTIMATE.start_cstpncpy_~#dst#1.base|)))) (= |ULTIMATE.start_cstpncpy_~d~0#1.offset| (_ bv1 32)))} is VALID [2022-02-20 23:41:35,878 INFO L290 TraceCheckUtils]: 22: Hoare triple {8928#(and (not (bvslt (bvadd |ULTIMATE.start_cstpncpy_#t~pre8#1| (_ bv1 32)) (_ bv1 32))) (exists ((|ULTIMATE.start_cstpncpy_~#dst#1.base| (_ BitVec 32))) (and (= (_ bv4 32) (select |#length| |ULTIMATE.start_cstpncpy_~#dst#1.base|)) (or (= (select |#length| |ULTIMATE.start_cstpncpy_~d~0#1.base|) (bvadd |ULTIMATE.start_cstpncpy_#t~pre8#1| (_ bv1 32))) (= |ULTIMATE.start_cstpncpy_~d~0#1.base| |ULTIMATE.start_cstpncpy_~#dst#1.base|)))) (= |ULTIMATE.start_cstpncpy_~d~0#1.offset| (_ bv1 32)))} assume !!(0bv32 != cstpncpy_#t~pre8#1);havoc cstpncpy_#t~pre8#1;cstpncpy_#t~post9#1.base, cstpncpy_#t~post9#1.offset := cstpncpy_~d~0#1.base, cstpncpy_~d~0#1.offset;cstpncpy_~d~0#1.base, cstpncpy_~d~0#1.offset := cstpncpy_#t~post9#1.base, ~bvadd32(1bv32, cstpncpy_#t~post9#1.offset); {8932#(and (exists ((|ULTIMATE.start_cstpncpy_~#dst#1.base| (_ BitVec 32))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_cstpncpy_~#dst#1.base|))) (= |ULTIMATE.start_cstpncpy_#t~post9#1.offset| (_ bv1 32)) (not (bvslt (select |#length| |ULTIMATE.start_cstpncpy_#t~post9#1.base|) (_ bv1 32))) (not (= (bvadd (_ bv4294967295 32) (select |#length| |ULTIMATE.start_cstpncpy_#t~post9#1.base|)) (_ bv0 32))))} is VALID [2022-02-20 23:41:35,879 INFO L290 TraceCheckUtils]: 23: Hoare triple {8932#(and (exists ((|ULTIMATE.start_cstpncpy_~#dst#1.base| (_ BitVec 32))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_cstpncpy_~#dst#1.base|))) (= |ULTIMATE.start_cstpncpy_#t~post9#1.offset| (_ bv1 32)) (not (bvslt (select |#length| |ULTIMATE.start_cstpncpy_#t~post9#1.base|) (_ bv1 32))) (not (= (bvadd (_ bv4294967295 32) (select |#length| |ULTIMATE.start_cstpncpy_#t~post9#1.base|)) (_ bv0 32))))} assume !((~bvule32(~bvadd32(1bv32, cstpncpy_#t~post9#1.offset), #length[cstpncpy_#t~post9#1.base]) && ~bvule32(cstpncpy_#t~post9#1.offset, ~bvadd32(1bv32, cstpncpy_#t~post9#1.offset))) && ~bvule32(0bv32, cstpncpy_#t~post9#1.offset)); {8852#false} is VALID [2022-02-20 23:41:35,879 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:41:35,879 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:41:35,880 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:41:35,880 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1163955231] [2022-02-20 23:41:35,880 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1163955231] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:41:35,880 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:41:35,880 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-02-20 23:41:35,880 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759062250] [2022-02-20 23:41:35,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:41:35,880 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.0) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2022-02-20 23:41:35,881 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:41:35,881 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 13 states, 12 states have (on average 2.0) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 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:41:35,920 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:41:35,920 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-02-20 23:41:35,920 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:41:35,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-02-20 23:41:35,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2022-02-20 23:41:35,920 INFO L87 Difference]: Start difference. First operand 108 states and 127 transitions. Second operand has 13 states, 12 states have (on average 2.0) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 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:41:36,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:41:36,637 INFO L93 Difference]: Finished difference Result 113 states and 134 transitions. [2022-02-20 23:41:36,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-02-20 23:41:36,637 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.0) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2022-02-20 23:41:36,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:41:36,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 2.0) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 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:41:36,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 56 transitions. [2022-02-20 23:41:36,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 2.0) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 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:41:36,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 56 transitions. [2022-02-20 23:41:36,639 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 56 transitions. [2022-02-20 23:41:36,720 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:41:36,721 INFO L225 Difference]: With dead ends: 113 [2022-02-20 23:41:36,721 INFO L226 Difference]: Without dead ends: 113 [2022-02-20 23:41:36,721 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2022-02-20 23:41:36,721 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 20 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 83 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:41:36,721 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 232 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 53 Invalid, 0 Unknown, 83 Unchecked, 0.2s Time] [2022-02-20 23:41:36,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2022-02-20 23:41:36,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2022-02-20 23:41:36,723 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:41:36,723 INFO L82 GeneralOperation]: Start isEquivalent. First operand 113 states. Second operand has 113 states, 107 states have (on average 1.2523364485981308) internal successors, (134), 112 states have internal predecessors, (134), 0 states have call successors, (0), 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:41:36,723 INFO L74 IsIncluded]: Start isIncluded. First operand 113 states. Second operand has 113 states, 107 states have (on average 1.2523364485981308) internal successors, (134), 112 states have internal predecessors, (134), 0 states have call successors, (0), 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:41:36,723 INFO L87 Difference]: Start difference. First operand 113 states. Second operand has 113 states, 107 states have (on average 1.2523364485981308) internal successors, (134), 112 states have internal predecessors, (134), 0 states have call successors, (0), 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:41:36,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:41:36,725 INFO L93 Difference]: Finished difference Result 113 states and 134 transitions. [2022-02-20 23:41:36,725 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 134 transitions. [2022-02-20 23:41:36,725 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:41:36,725 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:41:36,725 INFO L74 IsIncluded]: Start isIncluded. First operand has 113 states, 107 states have (on average 1.2523364485981308) internal successors, (134), 112 states have internal predecessors, (134), 0 states have call successors, (0), 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 113 states. [2022-02-20 23:41:36,726 INFO L87 Difference]: Start difference. First operand has 113 states, 107 states have (on average 1.2523364485981308) internal successors, (134), 112 states have internal predecessors, (134), 0 states have call successors, (0), 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 113 states. [2022-02-20 23:41:36,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:41:36,727 INFO L93 Difference]: Finished difference Result 113 states and 134 transitions. [2022-02-20 23:41:36,727 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 134 transitions. [2022-02-20 23:41:36,728 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:41:36,728 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:41:36,728 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:41:36,728 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:41:36,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 107 states have (on average 1.2523364485981308) internal successors, (134), 112 states have internal predecessors, (134), 0 states have call successors, (0), 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:41:36,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 134 transitions. [2022-02-20 23:41:36,730 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 134 transitions. Word has length 24 [2022-02-20 23:41:36,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:41:36,730 INFO L470 AbstractCegarLoop]: Abstraction has 113 states and 134 transitions. [2022-02-20 23:41:36,730 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.0) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 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:41:36,730 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 134 transitions. [2022-02-20 23:41:36,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-02-20 23:41:36,730 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:41:36,731 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:41:36,753 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2022-02-20 23:41:36,938 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:41:36,938 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2022-02-20 23:41:36,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:41:36,939 INFO L85 PathProgramCache]: Analyzing trace with hash 2126531647, now seen corresponding path program 1 times [2022-02-20 23:41:36,939 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:41:36,939 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1919808291] [2022-02-20 23:41:36,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:41:36,939 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:41:36,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:41:36,940 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:41:36,940 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2022-02-20 23:41:37,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:41:37,021 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 23:41:37,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:41:37,029 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:41:37,079 INFO L290 TraceCheckUtils]: 0: Hoare triple {9395#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven; {9395#true} is VALID [2022-02-20 23:41:37,079 INFO L290 TraceCheckUtils]: 1: Hoare triple {9395#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~nondet12#1, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_#t~nondet16#1, main_#t~post15#1, main_~i~0#1, main_#t~ret17#1.base, main_#t~ret17#1.offset, main_~length~0#1, main_~n~0#1, main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset, main_~nondetString~0#1.base, main_~nondetString~0#1.offset;main_~length~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;main_~n~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; {9395#true} is VALID [2022-02-20 23:41:37,079 INFO L290 TraceCheckUtils]: 2: Hoare triple {9395#true} assume ~bvslt32(main_~length~0#1, 1bv32);main_~length~0#1 := 1bv32; {9395#true} is VALID [2022-02-20 23:41:37,079 INFO L290 TraceCheckUtils]: 3: Hoare triple {9395#true} assume !~bvslt32(main_~n~0#1, 1bv32); {9395#true} is VALID [2022-02-20 23:41:37,079 INFO L290 TraceCheckUtils]: 4: Hoare triple {9395#true} call main_#t~malloc13#1.base, main_#t~malloc13#1.offset := #Ultimate.allocOnStack(main_~n~0#1);main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset := main_#t~malloc13#1.base, main_#t~malloc13#1.offset;call main_#t~malloc14#1.base, main_#t~malloc14#1.offset := #Ultimate.allocOnStack(main_~length~0#1);main_~nondetString~0#1.base, main_~nondetString~0#1.offset := main_#t~malloc14#1.base, main_#t~malloc14#1.offset;main_~i~0#1 := 0bv32; {9395#true} is VALID [2022-02-20 23:41:37,080 INFO L290 TraceCheckUtils]: 5: Hoare triple {9395#true} assume !~bvslt32(main_~i~0#1, ~bvsub32(main_~length~0#1, 1bv32)); {9395#true} is VALID [2022-02-20 23:41:37,080 INFO L290 TraceCheckUtils]: 6: Hoare triple {9395#true} SUMMARY for call write~intINTTYPE1(0bv8, main_~nondetString~0#1.base, ~bvadd32(main_~nondetString~0#1.offset, ~bvsub32(main_~length~0#1, 1bv32)), 1bv32); srcloc: L543-4 {9395#true} is VALID [2022-02-20 23:41:37,080 INFO L290 TraceCheckUtils]: 7: Hoare triple {9395#true} assume { :begin_inline_cstpncpy } true;cstpncpy_#in~dst#1.base, cstpncpy_#in~dst#1.offset, cstpncpy_#in~src#1.base, cstpncpy_#in~src#1.offset, cstpncpy_#in~n#1 := main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset, main_~nondetString~0#1.base, main_~nondetString~0#1.offset, main_~n~0#1;havoc cstpncpy_#res#1.base, cstpncpy_#res#1.offset;havoc cstpncpy_#t~mem2#1.base, cstpncpy_#t~mem2#1.offset, cstpncpy_#t~mem3#1.base, cstpncpy_#t~mem3#1.offset, cstpncpy_#t~post5#1.base, cstpncpy_#t~post5#1.offset, cstpncpy_#t~post6#1.base, cstpncpy_#t~post6#1.offset, cstpncpy_#t~mem7#1, cstpncpy_#t~post9#1.base, cstpncpy_#t~post9#1.offset, cstpncpy_#t~pre8#1, cstpncpy_#t~pre4#1, cstpncpy_~d~0#1.base, cstpncpy_~d~0#1.offset, cstpncpy_~s~0#1.base, cstpncpy_~s~0#1.offset, cstpncpy_#t~mem10#1.base, cstpncpy_#t~mem10#1.offset, cstpncpy_~#dst#1.base, cstpncpy_~#dst#1.offset, cstpncpy_~src#1.base, cstpncpy_~src#1.offset, cstpncpy_~n#1;call cstpncpy_~#dst#1.base, cstpncpy_~#dst#1.offset := #Ultimate.allocOnStack(4bv32); {9395#true} is VALID [2022-02-20 23:41:37,080 INFO L290 TraceCheckUtils]: 8: Hoare triple {9395#true} SUMMARY for call write~$Pointer$(cstpncpy_#in~dst#1.base, cstpncpy_#in~dst#1.offset, cstpncpy_~#dst#1.base, cstpncpy_~#dst#1.offset, 4bv32); srcloc: L513 {9395#true} is VALID [2022-02-20 23:41:37,080 INFO L290 TraceCheckUtils]: 9: Hoare triple {9395#true} cstpncpy_~src#1.base, cstpncpy_~src#1.offset := cstpncpy_#in~src#1.base, cstpncpy_#in~src#1.offset;cstpncpy_~n#1 := cstpncpy_#in~n#1; {9395#true} is VALID [2022-02-20 23:41:37,080 INFO L290 TraceCheckUtils]: 10: Hoare triple {9395#true} assume 0bv32 != cstpncpy_~n#1; {9395#true} is VALID [2022-02-20 23:41:37,080 INFO L290 TraceCheckUtils]: 11: Hoare triple {9395#true} SUMMARY for call cstpncpy_#t~mem2#1.base, cstpncpy_#t~mem2#1.offset := read~$Pointer$(cstpncpy_~#dst#1.base, cstpncpy_~#dst#1.offset, 4bv32); srcloc: L517 {9395#true} is VALID [2022-02-20 23:41:37,080 INFO L290 TraceCheckUtils]: 12: Hoare triple {9395#true} cstpncpy_~d~0#1.base, cstpncpy_~d~0#1.offset := cstpncpy_#t~mem2#1.base, cstpncpy_#t~mem2#1.offset;havoc cstpncpy_#t~mem2#1.base, cstpncpy_#t~mem2#1.offset;cstpncpy_~s~0#1.base, cstpncpy_~s~0#1.offset := cstpncpy_~src#1.base, cstpncpy_~src#1.offset; {9395#true} is VALID [2022-02-20 23:41:37,080 INFO L290 TraceCheckUtils]: 13: Hoare triple {9395#true} SUMMARY for call cstpncpy_#t~mem3#1.base, cstpncpy_#t~mem3#1.offset := read~$Pointer$(cstpncpy_~#dst#1.base, cstpncpy_~#dst#1.offset, 4bv32); srcloc: L519 {9395#true} is VALID [2022-02-20 23:41:37,080 INFO L290 TraceCheckUtils]: 14: Hoare triple {9395#true} SUMMARY for call write~$Pointer$(cstpncpy_#t~mem3#1.base, ~bvadd32(cstpncpy_#t~mem3#1.offset, cstpncpy_~n#1), cstpncpy_~#dst#1.base, cstpncpy_~#dst#1.offset, 4bv32); srcloc: L519-1 {9395#true} is VALID [2022-02-20 23:41:37,081 INFO L290 TraceCheckUtils]: 15: Hoare triple {9395#true} havoc cstpncpy_#t~mem3#1.base, cstpncpy_#t~mem3#1.offset; {9395#true} is VALID [2022-02-20 23:41:37,081 INFO L290 TraceCheckUtils]: 16: Hoare triple {9395#true} cstpncpy_#t~post5#1.base, cstpncpy_#t~post5#1.offset := cstpncpy_~d~0#1.base, cstpncpy_~d~0#1.offset;cstpncpy_~d~0#1.base, cstpncpy_~d~0#1.offset := cstpncpy_#t~post5#1.base, ~bvadd32(1bv32, cstpncpy_#t~post5#1.offset);cstpncpy_#t~post6#1.base, cstpncpy_#t~post6#1.offset := cstpncpy_~s~0#1.base, cstpncpy_~s~0#1.offset;cstpncpy_~s~0#1.base, cstpncpy_~s~0#1.offset := cstpncpy_#t~post6#1.base, ~bvadd32(1bv32, cstpncpy_#t~post6#1.offset); {9448#(= |ULTIMATE.start_cstpncpy_#t~post6#1.base| |ULTIMATE.start_cstpncpy_~s~0#1.base|)} is VALID [2022-02-20 23:41:37,081 INFO L290 TraceCheckUtils]: 17: Hoare triple {9448#(= |ULTIMATE.start_cstpncpy_#t~post6#1.base| |ULTIMATE.start_cstpncpy_~s~0#1.base|)} SUMMARY for call cstpncpy_#t~mem7#1 := read~intINTTYPE1(cstpncpy_#t~post6#1.base, cstpncpy_#t~post6#1.offset, 1bv32); srcloc: L521 {9452#(= (select |#valid| |ULTIMATE.start_cstpncpy_~s~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:41:37,082 INFO L290 TraceCheckUtils]: 18: Hoare triple {9452#(= (select |#valid| |ULTIMATE.start_cstpncpy_~s~0#1.base|) (_ bv1 1))} SUMMARY for call write~intINTTYPE1(cstpncpy_#t~mem7#1, cstpncpy_#t~post5#1.base, cstpncpy_#t~post5#1.offset, 1bv32); srcloc: L521-1 {9452#(= (select |#valid| |ULTIMATE.start_cstpncpy_~s~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:41:37,082 INFO L290 TraceCheckUtils]: 19: Hoare triple {9452#(= (select |#valid| |ULTIMATE.start_cstpncpy_~s~0#1.base|) (_ bv1 1))} assume !(0bv32 == ~sign_extendFrom8To32(cstpncpy_#t~mem7#1));havoc cstpncpy_#t~post5#1.base, cstpncpy_#t~post5#1.offset;havoc cstpncpy_#t~post6#1.base, cstpncpy_#t~post6#1.offset;havoc cstpncpy_#t~mem7#1; {9452#(= (select |#valid| |ULTIMATE.start_cstpncpy_~s~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:41:37,082 INFO L290 TraceCheckUtils]: 20: Hoare triple {9452#(= (select |#valid| |ULTIMATE.start_cstpncpy_~s~0#1.base|) (_ bv1 1))} cstpncpy_#t~pre4#1 := ~bvsub32(cstpncpy_~n#1, 1bv32);cstpncpy_~n#1 := ~bvsub32(cstpncpy_~n#1, 1bv32); {9452#(= (select |#valid| |ULTIMATE.start_cstpncpy_~s~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:41:37,083 INFO L290 TraceCheckUtils]: 21: Hoare triple {9452#(= (select |#valid| |ULTIMATE.start_cstpncpy_~s~0#1.base|) (_ bv1 1))} assume !!(0bv32 != cstpncpy_#t~pre4#1);havoc cstpncpy_#t~pre4#1; {9452#(= (select |#valid| |ULTIMATE.start_cstpncpy_~s~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:41:37,083 INFO L290 TraceCheckUtils]: 22: Hoare triple {9452#(= (select |#valid| |ULTIMATE.start_cstpncpy_~s~0#1.base|) (_ bv1 1))} cstpncpy_#t~post5#1.base, cstpncpy_#t~post5#1.offset := cstpncpy_~d~0#1.base, cstpncpy_~d~0#1.offset;cstpncpy_~d~0#1.base, cstpncpy_~d~0#1.offset := cstpncpy_#t~post5#1.base, ~bvadd32(1bv32, cstpncpy_#t~post5#1.offset);cstpncpy_#t~post6#1.base, cstpncpy_#t~post6#1.offset := cstpncpy_~s~0#1.base, cstpncpy_~s~0#1.offset;cstpncpy_~s~0#1.base, cstpncpy_~s~0#1.offset := cstpncpy_#t~post6#1.base, ~bvadd32(1bv32, cstpncpy_#t~post6#1.offset); {9468#(= (select |#valid| |ULTIMATE.start_cstpncpy_#t~post6#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:41:37,083 INFO L290 TraceCheckUtils]: 23: Hoare triple {9468#(= (select |#valid| |ULTIMATE.start_cstpncpy_#t~post6#1.base|) (_ bv1 1))} assume !(1bv1 == #valid[cstpncpy_#t~post6#1.base]); {9396#false} is VALID [2022-02-20 23:41:37,084 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:41:37,084 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:41:37,114 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-02-20 23:41:37,114 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 11 [2022-02-20 23:41:37,139 INFO L290 TraceCheckUtils]: 23: Hoare triple {9468#(= (select |#valid| |ULTIMATE.start_cstpncpy_#t~post6#1.base|) (_ bv1 1))} assume !(1bv1 == #valid[cstpncpy_#t~post6#1.base]); {9396#false} is VALID [2022-02-20 23:41:37,140 INFO L290 TraceCheckUtils]: 22: Hoare triple {9452#(= (select |#valid| |ULTIMATE.start_cstpncpy_~s~0#1.base|) (_ bv1 1))} cstpncpy_#t~post5#1.base, cstpncpy_#t~post5#1.offset := cstpncpy_~d~0#1.base, cstpncpy_~d~0#1.offset;cstpncpy_~d~0#1.base, cstpncpy_~d~0#1.offset := cstpncpy_#t~post5#1.base, ~bvadd32(1bv32, cstpncpy_#t~post5#1.offset);cstpncpy_#t~post6#1.base, cstpncpy_#t~post6#1.offset := cstpncpy_~s~0#1.base, cstpncpy_~s~0#1.offset;cstpncpy_~s~0#1.base, cstpncpy_~s~0#1.offset := cstpncpy_#t~post6#1.base, ~bvadd32(1bv32, cstpncpy_#t~post6#1.offset); {9468#(= (select |#valid| |ULTIMATE.start_cstpncpy_#t~post6#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:41:37,140 INFO L290 TraceCheckUtils]: 21: Hoare triple {9452#(= (select |#valid| |ULTIMATE.start_cstpncpy_~s~0#1.base|) (_ bv1 1))} assume !!(0bv32 != cstpncpy_#t~pre4#1);havoc cstpncpy_#t~pre4#1; {9452#(= (select |#valid| |ULTIMATE.start_cstpncpy_~s~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:41:37,141 INFO L290 TraceCheckUtils]: 20: Hoare triple {9452#(= (select |#valid| |ULTIMATE.start_cstpncpy_~s~0#1.base|) (_ bv1 1))} cstpncpy_#t~pre4#1 := ~bvsub32(cstpncpy_~n#1, 1bv32);cstpncpy_~n#1 := ~bvsub32(cstpncpy_~n#1, 1bv32); {9452#(= (select |#valid| |ULTIMATE.start_cstpncpy_~s~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:41:37,141 INFO L290 TraceCheckUtils]: 19: Hoare triple {9452#(= (select |#valid| |ULTIMATE.start_cstpncpy_~s~0#1.base|) (_ bv1 1))} assume !(0bv32 == ~sign_extendFrom8To32(cstpncpy_#t~mem7#1));havoc cstpncpy_#t~post5#1.base, cstpncpy_#t~post5#1.offset;havoc cstpncpy_#t~post6#1.base, cstpncpy_#t~post6#1.offset;havoc cstpncpy_#t~mem7#1; {9452#(= (select |#valid| |ULTIMATE.start_cstpncpy_~s~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:41:37,141 INFO L290 TraceCheckUtils]: 18: Hoare triple {9452#(= (select |#valid| |ULTIMATE.start_cstpncpy_~s~0#1.base|) (_ bv1 1))} SUMMARY for call write~intINTTYPE1(cstpncpy_#t~mem7#1, cstpncpy_#t~post5#1.base, cstpncpy_#t~post5#1.offset, 1bv32); srcloc: L521-1 {9452#(= (select |#valid| |ULTIMATE.start_cstpncpy_~s~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:41:37,142 INFO L290 TraceCheckUtils]: 17: Hoare triple {9448#(= |ULTIMATE.start_cstpncpy_#t~post6#1.base| |ULTIMATE.start_cstpncpy_~s~0#1.base|)} SUMMARY for call cstpncpy_#t~mem7#1 := read~intINTTYPE1(cstpncpy_#t~post6#1.base, cstpncpy_#t~post6#1.offset, 1bv32); srcloc: L521 {9452#(= (select |#valid| |ULTIMATE.start_cstpncpy_~s~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:41:37,142 INFO L290 TraceCheckUtils]: 16: Hoare triple {9395#true} cstpncpy_#t~post5#1.base, cstpncpy_#t~post5#1.offset := cstpncpy_~d~0#1.base, cstpncpy_~d~0#1.offset;cstpncpy_~d~0#1.base, cstpncpy_~d~0#1.offset := cstpncpy_#t~post5#1.base, ~bvadd32(1bv32, cstpncpy_#t~post5#1.offset);cstpncpy_#t~post6#1.base, cstpncpy_#t~post6#1.offset := cstpncpy_~s~0#1.base, cstpncpy_~s~0#1.offset;cstpncpy_~s~0#1.base, cstpncpy_~s~0#1.offset := cstpncpy_#t~post6#1.base, ~bvadd32(1bv32, cstpncpy_#t~post6#1.offset); {9448#(= |ULTIMATE.start_cstpncpy_#t~post6#1.base| |ULTIMATE.start_cstpncpy_~s~0#1.base|)} is VALID [2022-02-20 23:41:37,142 INFO L290 TraceCheckUtils]: 15: Hoare triple {9395#true} havoc cstpncpy_#t~mem3#1.base, cstpncpy_#t~mem3#1.offset; {9395#true} is VALID [2022-02-20 23:41:37,142 INFO L290 TraceCheckUtils]: 14: Hoare triple {9395#true} SUMMARY for call write~$Pointer$(cstpncpy_#t~mem3#1.base, ~bvadd32(cstpncpy_#t~mem3#1.offset, cstpncpy_~n#1), cstpncpy_~#dst#1.base, cstpncpy_~#dst#1.offset, 4bv32); srcloc: L519-1 {9395#true} is VALID [2022-02-20 23:41:37,142 INFO L290 TraceCheckUtils]: 13: Hoare triple {9395#true} SUMMARY for call cstpncpy_#t~mem3#1.base, cstpncpy_#t~mem3#1.offset := read~$Pointer$(cstpncpy_~#dst#1.base, cstpncpy_~#dst#1.offset, 4bv32); srcloc: L519 {9395#true} is VALID [2022-02-20 23:41:37,142 INFO L290 TraceCheckUtils]: 12: Hoare triple {9395#true} cstpncpy_~d~0#1.base, cstpncpy_~d~0#1.offset := cstpncpy_#t~mem2#1.base, cstpncpy_#t~mem2#1.offset;havoc cstpncpy_#t~mem2#1.base, cstpncpy_#t~mem2#1.offset;cstpncpy_~s~0#1.base, cstpncpy_~s~0#1.offset := cstpncpy_~src#1.base, cstpncpy_~src#1.offset; {9395#true} is VALID [2022-02-20 23:41:37,142 INFO L290 TraceCheckUtils]: 11: Hoare triple {9395#true} SUMMARY for call cstpncpy_#t~mem2#1.base, cstpncpy_#t~mem2#1.offset := read~$Pointer$(cstpncpy_~#dst#1.base, cstpncpy_~#dst#1.offset, 4bv32); srcloc: L517 {9395#true} is VALID [2022-02-20 23:41:37,143 INFO L290 TraceCheckUtils]: 10: Hoare triple {9395#true} assume 0bv32 != cstpncpy_~n#1; {9395#true} is VALID [2022-02-20 23:41:37,143 INFO L290 TraceCheckUtils]: 9: Hoare triple {9395#true} cstpncpy_~src#1.base, cstpncpy_~src#1.offset := cstpncpy_#in~src#1.base, cstpncpy_#in~src#1.offset;cstpncpy_~n#1 := cstpncpy_#in~n#1; {9395#true} is VALID [2022-02-20 23:41:37,143 INFO L290 TraceCheckUtils]: 8: Hoare triple {9395#true} SUMMARY for call write~$Pointer$(cstpncpy_#in~dst#1.base, cstpncpy_#in~dst#1.offset, cstpncpy_~#dst#1.base, cstpncpy_~#dst#1.offset, 4bv32); srcloc: L513 {9395#true} is VALID [2022-02-20 23:41:37,143 INFO L290 TraceCheckUtils]: 7: Hoare triple {9395#true} assume { :begin_inline_cstpncpy } true;cstpncpy_#in~dst#1.base, cstpncpy_#in~dst#1.offset, cstpncpy_#in~src#1.base, cstpncpy_#in~src#1.offset, cstpncpy_#in~n#1 := main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset, main_~nondetString~0#1.base, main_~nondetString~0#1.offset, main_~n~0#1;havoc cstpncpy_#res#1.base, cstpncpy_#res#1.offset;havoc cstpncpy_#t~mem2#1.base, cstpncpy_#t~mem2#1.offset, cstpncpy_#t~mem3#1.base, cstpncpy_#t~mem3#1.offset, cstpncpy_#t~post5#1.base, cstpncpy_#t~post5#1.offset, cstpncpy_#t~post6#1.base, cstpncpy_#t~post6#1.offset, cstpncpy_#t~mem7#1, cstpncpy_#t~post9#1.base, cstpncpy_#t~post9#1.offset, cstpncpy_#t~pre8#1, cstpncpy_#t~pre4#1, cstpncpy_~d~0#1.base, cstpncpy_~d~0#1.offset, cstpncpy_~s~0#1.base, cstpncpy_~s~0#1.offset, cstpncpy_#t~mem10#1.base, cstpncpy_#t~mem10#1.offset, cstpncpy_~#dst#1.base, cstpncpy_~#dst#1.offset, cstpncpy_~src#1.base, cstpncpy_~src#1.offset, cstpncpy_~n#1;call cstpncpy_~#dst#1.base, cstpncpy_~#dst#1.offset := #Ultimate.allocOnStack(4bv32); {9395#true} is VALID [2022-02-20 23:41:37,143 INFO L290 TraceCheckUtils]: 6: Hoare triple {9395#true} SUMMARY for call write~intINTTYPE1(0bv8, main_~nondetString~0#1.base, ~bvadd32(main_~nondetString~0#1.offset, ~bvsub32(main_~length~0#1, 1bv32)), 1bv32); srcloc: L543-4 {9395#true} is VALID [2022-02-20 23:41:37,143 INFO L290 TraceCheckUtils]: 5: Hoare triple {9395#true} assume !~bvslt32(main_~i~0#1, ~bvsub32(main_~length~0#1, 1bv32)); {9395#true} is VALID [2022-02-20 23:41:37,143 INFO L290 TraceCheckUtils]: 4: Hoare triple {9395#true} call main_#t~malloc13#1.base, main_#t~malloc13#1.offset := #Ultimate.allocOnStack(main_~n~0#1);main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset := main_#t~malloc13#1.base, main_#t~malloc13#1.offset;call main_#t~malloc14#1.base, main_#t~malloc14#1.offset := #Ultimate.allocOnStack(main_~length~0#1);main_~nondetString~0#1.base, main_~nondetString~0#1.offset := main_#t~malloc14#1.base, main_#t~malloc14#1.offset;main_~i~0#1 := 0bv32; {9395#true} is VALID [2022-02-20 23:41:37,143 INFO L290 TraceCheckUtils]: 3: Hoare triple {9395#true} assume !~bvslt32(main_~n~0#1, 1bv32); {9395#true} is VALID [2022-02-20 23:41:37,143 INFO L290 TraceCheckUtils]: 2: Hoare triple {9395#true} assume ~bvslt32(main_~length~0#1, 1bv32);main_~length~0#1 := 1bv32; {9395#true} is VALID [2022-02-20 23:41:37,143 INFO L290 TraceCheckUtils]: 1: Hoare triple {9395#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~nondet12#1, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_#t~nondet16#1, main_#t~post15#1, main_~i~0#1, main_#t~ret17#1.base, main_#t~ret17#1.offset, main_~length~0#1, main_~n~0#1, main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset, main_~nondetString~0#1.base, main_~nondetString~0#1.offset;main_~length~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;main_~n~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; {9395#true} is VALID [2022-02-20 23:41:37,143 INFO L290 TraceCheckUtils]: 0: Hoare triple {9395#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven; {9395#true} is VALID [2022-02-20 23:41:37,143 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:41:37,143 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:41:37,143 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1919808291] [2022-02-20 23:41:37,143 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1919808291] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:41:37,143 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 23:41:37,143 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2022-02-20 23:41:37,144 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900450415] [2022-02-20 23:41:37,144 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 23:41:37,144 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2022-02-20 23:41:37,144 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:41:37,144 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 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:41:37,166 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:41:37,166 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:41:37,166 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:41:37,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:41:37,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:41:37,167 INFO L87 Difference]: Start difference. First operand 113 states and 134 transitions. Second operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 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:41:37,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:41:37,547 INFO L93 Difference]: Finished difference Result 112 states and 133 transitions. [2022-02-20 23:41:37,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 23:41:37,547 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2022-02-20 23:41:37,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:41:37,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 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:41:37,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2022-02-20 23:41:37,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 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:41:37,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2022-02-20 23:41:37,549 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 47 transitions. [2022-02-20 23:41:37,605 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:41:37,606 INFO L225 Difference]: With dead ends: 112 [2022-02-20 23:41:37,606 INFO L226 Difference]: Without dead ends: 112 [2022-02-20 23:41:37,606 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:41:37,607 INFO L933 BasicCegarLoop]: 37 mSDtfsCounter, 19 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:41:37,611 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 101 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:41:37,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2022-02-20 23:41:37,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2022-02-20 23:41:37,612 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:41:37,612 INFO L82 GeneralOperation]: Start isEquivalent. First operand 112 states. Second operand has 112 states, 107 states have (on average 1.2429906542056075) internal successors, (133), 111 states have internal predecessors, (133), 0 states have call successors, (0), 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:41:37,613 INFO L74 IsIncluded]: Start isIncluded. First operand 112 states. Second operand has 112 states, 107 states have (on average 1.2429906542056075) internal successors, (133), 111 states have internal predecessors, (133), 0 states have call successors, (0), 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:41:37,613 INFO L87 Difference]: Start difference. First operand 112 states. Second operand has 112 states, 107 states have (on average 1.2429906542056075) internal successors, (133), 111 states have internal predecessors, (133), 0 states have call successors, (0), 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:41:37,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:41:37,614 INFO L93 Difference]: Finished difference Result 112 states and 133 transitions. [2022-02-20 23:41:37,614 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 133 transitions. [2022-02-20 23:41:37,614 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:41:37,614 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:41:37,614 INFO L74 IsIncluded]: Start isIncluded. First operand has 112 states, 107 states have (on average 1.2429906542056075) internal successors, (133), 111 states have internal predecessors, (133), 0 states have call successors, (0), 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 112 states. [2022-02-20 23:41:37,614 INFO L87 Difference]: Start difference. First operand has 112 states, 107 states have (on average 1.2429906542056075) internal successors, (133), 111 states have internal predecessors, (133), 0 states have call successors, (0), 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 112 states. [2022-02-20 23:41:37,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:41:37,616 INFO L93 Difference]: Finished difference Result 112 states and 133 transitions. [2022-02-20 23:41:37,616 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 133 transitions. [2022-02-20 23:41:37,616 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:41:37,617 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:41:37,617 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:41:37,617 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:41:37,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 107 states have (on average 1.2429906542056075) internal successors, (133), 111 states have internal predecessors, (133), 0 states have call successors, (0), 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:41:37,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 133 transitions. [2022-02-20 23:41:37,619 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 133 transitions. Word has length 24 [2022-02-20 23:41:37,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:41:37,619 INFO L470 AbstractCegarLoop]: Abstraction has 112 states and 133 transitions. [2022-02-20 23:41:37,619 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 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:41:37,620 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 133 transitions. [2022-02-20 23:41:37,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-02-20 23:41:37,620 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:41:37,620 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:41:37,629 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2022-02-20 23:41:37,829 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:41:37,829 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2022-02-20 23:41:37,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:41:37,830 INFO L85 PathProgramCache]: Analyzing trace with hash 2126531648, now seen corresponding path program 1 times [2022-02-20 23:41:37,830 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:41:37,830 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1748482904] [2022-02-20 23:41:37,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:41:37,830 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:41:37,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:41:37,831 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:41:37,832 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2022-02-20 23:41:37,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:41:37,939 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 22 conjunts are in the unsatisfiable core [2022-02-20 23:41:37,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:41:37,951 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:41:37,981 INFO L356 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2022-02-20 23:41:37,981 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 1 case distinctions, treesize of input 9 treesize of output 18 [2022-02-20 23:41:38,021 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 12 treesize of output 8 [2022-02-20 23:41:38,048 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-20 23:41:38,048 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-02-20 23:41:38,074 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-02-20 23:41:38,178 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-02-20 23:41:38,230 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-02-20 23:41:38,248 INFO L290 TraceCheckUtils]: 0: Hoare triple {9990#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven; {9990#true} is VALID [2022-02-20 23:41:38,248 INFO L290 TraceCheckUtils]: 1: Hoare triple {9990#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~nondet12#1, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_#t~nondet16#1, main_#t~post15#1, main_~i~0#1, main_#t~ret17#1.base, main_#t~ret17#1.offset, main_~length~0#1, main_~n~0#1, main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset, main_~nondetString~0#1.base, main_~nondetString~0#1.offset;main_~length~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;main_~n~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; {9990#true} is VALID [2022-02-20 23:41:38,249 INFO L290 TraceCheckUtils]: 2: Hoare triple {9990#true} assume ~bvslt32(main_~length~0#1, 1bv32);main_~length~0#1 := 1bv32; {10001#(= (_ bv1 32) |ULTIMATE.start_main_~length~0#1|)} is VALID [2022-02-20 23:41:38,249 INFO L290 TraceCheckUtils]: 3: Hoare triple {10001#(= (_ bv1 32) |ULTIMATE.start_main_~length~0#1|)} assume !~bvslt32(main_~n~0#1, 1bv32); {10001#(= (_ bv1 32) |ULTIMATE.start_main_~length~0#1|)} is VALID [2022-02-20 23:41:38,250 INFO L290 TraceCheckUtils]: 4: Hoare triple {10001#(= (_ bv1 32) |ULTIMATE.start_main_~length~0#1|)} call main_#t~malloc13#1.base, main_#t~malloc13#1.offset := #Ultimate.allocOnStack(main_~n~0#1);main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset := main_#t~malloc13#1.base, main_#t~malloc13#1.offset;call main_#t~malloc14#1.base, main_#t~malloc14#1.offset := #Ultimate.allocOnStack(main_~length~0#1);main_~nondetString~0#1.base, main_~nondetString~0#1.offset := main_#t~malloc14#1.base, main_#t~malloc14#1.offset;main_~i~0#1 := 0bv32; {10008#(and (= (_ bv1 32) |ULTIMATE.start_main_~length~0#1|) (= |ULTIMATE.start_main_~nondetString~0#1.offset| (_ bv0 32)) (= (select |#valid| |ULTIMATE.start_main_~nondetString~0#1.base|) (_ bv1 1)))} is VALID [2022-02-20 23:41:38,251 INFO L290 TraceCheckUtils]: 5: Hoare triple {10008#(and (= (_ bv1 32) |ULTIMATE.start_main_~length~0#1|) (= |ULTIMATE.start_main_~nondetString~0#1.offset| (_ bv0 32)) (= (select |#valid| |ULTIMATE.start_main_~nondetString~0#1.base|) (_ bv1 1)))} assume !~bvslt32(main_~i~0#1, ~bvsub32(main_~length~0#1, 1bv32)); {10008#(and (= (_ bv1 32) |ULTIMATE.start_main_~length~0#1|) (= |ULTIMATE.start_main_~nondetString~0#1.offset| (_ bv0 32)) (= (select |#valid| |ULTIMATE.start_main_~nondetString~0#1.base|) (_ bv1 1)))} is VALID [2022-02-20 23:41:38,252 INFO L290 TraceCheckUtils]: 6: Hoare triple {10008#(and (= (_ bv1 32) |ULTIMATE.start_main_~length~0#1|) (= |ULTIMATE.start_main_~nondetString~0#1.offset| (_ bv0 32)) (= (select |#valid| |ULTIMATE.start_main_~nondetString~0#1.base|) (_ bv1 1)))} SUMMARY for call write~intINTTYPE1(0bv8, main_~nondetString~0#1.base, ~bvadd32(main_~nondetString~0#1.offset, ~bvsub32(main_~length~0#1, 1bv32)), 1bv32); srcloc: L543-4 {10015#(and (= |ULTIMATE.start_main_~nondetString~0#1.offset| (_ bv0 32)) (= ((_ sign_extend 24) (_ bv0 8)) (select (select |#memory_int| |ULTIMATE.start_main_~nondetString~0#1.base|) |ULTIMATE.start_main_~nondetString~0#1.offset|)) (= (select |#valid| |ULTIMATE.start_main_~nondetString~0#1.base|) (_ bv1 1)))} is VALID [2022-02-20 23:41:38,252 INFO L290 TraceCheckUtils]: 7: Hoare triple {10015#(and (= |ULTIMATE.start_main_~nondetString~0#1.offset| (_ bv0 32)) (= ((_ sign_extend 24) (_ bv0 8)) (select (select |#memory_int| |ULTIMATE.start_main_~nondetString~0#1.base|) |ULTIMATE.start_main_~nondetString~0#1.offset|)) (= (select |#valid| |ULTIMATE.start_main_~nondetString~0#1.base|) (_ bv1 1)))} assume { :begin_inline_cstpncpy } true;cstpncpy_#in~dst#1.base, cstpncpy_#in~dst#1.offset, cstpncpy_#in~src#1.base, cstpncpy_#in~src#1.offset, cstpncpy_#in~n#1 := main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset, main_~nondetString~0#1.base, main_~nondetString~0#1.offset, main_~n~0#1;havoc cstpncpy_#res#1.base, cstpncpy_#res#1.offset;havoc cstpncpy_#t~mem2#1.base, cstpncpy_#t~mem2#1.offset, cstpncpy_#t~mem3#1.base, cstpncpy_#t~mem3#1.offset, cstpncpy_#t~post5#1.base, cstpncpy_#t~post5#1.offset, cstpncpy_#t~post6#1.base, cstpncpy_#t~post6#1.offset, cstpncpy_#t~mem7#1, cstpncpy_#t~post9#1.base, cstpncpy_#t~post9#1.offset, cstpncpy_#t~pre8#1, cstpncpy_#t~pre4#1, cstpncpy_~d~0#1.base, cstpncpy_~d~0#1.offset, cstpncpy_~s~0#1.base, cstpncpy_~s~0#1.offset, cstpncpy_#t~mem10#1.base, cstpncpy_#t~mem10#1.offset, cstpncpy_~#dst#1.base, cstpncpy_~#dst#1.offset, cstpncpy_~src#1.base, cstpncpy_~src#1.offset, cstpncpy_~n#1;call cstpncpy_~#dst#1.base, cstpncpy_~#dst#1.offset := #Ultimate.allocOnStack(4bv32); {10019#(and (= |ULTIMATE.start_cstpncpy_#in~src#1.offset| (_ bv0 32)) (not (= |ULTIMATE.start_cstpncpy_#in~src#1.base| |ULTIMATE.start_cstpncpy_~#dst#1.base|)) (= ((_ sign_extend 24) (_ bv0 8)) (select (select |#memory_int| |ULTIMATE.start_cstpncpy_#in~src#1.base|) |ULTIMATE.start_cstpncpy_#in~src#1.offset|)))} is VALID [2022-02-20 23:41:38,254 INFO L290 TraceCheckUtils]: 8: Hoare triple {10019#(and (= |ULTIMATE.start_cstpncpy_#in~src#1.offset| (_ bv0 32)) (not (= |ULTIMATE.start_cstpncpy_#in~src#1.base| |ULTIMATE.start_cstpncpy_~#dst#1.base|)) (= ((_ sign_extend 24) (_ bv0 8)) (select (select |#memory_int| |ULTIMATE.start_cstpncpy_#in~src#1.base|) |ULTIMATE.start_cstpncpy_#in~src#1.offset|)))} SUMMARY for call write~$Pointer$(cstpncpy_#in~dst#1.base, cstpncpy_#in~dst#1.offset, cstpncpy_~#dst#1.base, cstpncpy_~#dst#1.offset, 4bv32); srcloc: L513 {10019#(and (= |ULTIMATE.start_cstpncpy_#in~src#1.offset| (_ bv0 32)) (not (= |ULTIMATE.start_cstpncpy_#in~src#1.base| |ULTIMATE.start_cstpncpy_~#dst#1.base|)) (= ((_ sign_extend 24) (_ bv0 8)) (select (select |#memory_int| |ULTIMATE.start_cstpncpy_#in~src#1.base|) |ULTIMATE.start_cstpncpy_#in~src#1.offset|)))} is VALID [2022-02-20 23:41:38,254 INFO L290 TraceCheckUtils]: 9: Hoare triple {10019#(and (= |ULTIMATE.start_cstpncpy_#in~src#1.offset| (_ bv0 32)) (not (= |ULTIMATE.start_cstpncpy_#in~src#1.base| |ULTIMATE.start_cstpncpy_~#dst#1.base|)) (= ((_ sign_extend 24) (_ bv0 8)) (select (select |#memory_int| |ULTIMATE.start_cstpncpy_#in~src#1.base|) |ULTIMATE.start_cstpncpy_#in~src#1.offset|)))} cstpncpy_~src#1.base, cstpncpy_~src#1.offset := cstpncpy_#in~src#1.base, cstpncpy_#in~src#1.offset;cstpncpy_~n#1 := cstpncpy_#in~n#1; {10026#(and (not (= |ULTIMATE.start_cstpncpy_~src#1.base| |ULTIMATE.start_cstpncpy_~#dst#1.base|)) (= (_ bv0 32) |ULTIMATE.start_cstpncpy_~src#1.offset|) (= ((_ sign_extend 24) (_ bv0 8)) (select (select |#memory_int| |ULTIMATE.start_cstpncpy_~src#1.base|) (_ bv0 32))))} is VALID [2022-02-20 23:41:38,255 INFO L290 TraceCheckUtils]: 10: Hoare triple {10026#(and (not (= |ULTIMATE.start_cstpncpy_~src#1.base| |ULTIMATE.start_cstpncpy_~#dst#1.base|)) (= (_ bv0 32) |ULTIMATE.start_cstpncpy_~src#1.offset|) (= ((_ sign_extend 24) (_ bv0 8)) (select (select |#memory_int| |ULTIMATE.start_cstpncpy_~src#1.base|) (_ bv0 32))))} assume 0bv32 != cstpncpy_~n#1; {10026#(and (not (= |ULTIMATE.start_cstpncpy_~src#1.base| |ULTIMATE.start_cstpncpy_~#dst#1.base|)) (= (_ bv0 32) |ULTIMATE.start_cstpncpy_~src#1.offset|) (= ((_ sign_extend 24) (_ bv0 8)) (select (select |#memory_int| |ULTIMATE.start_cstpncpy_~src#1.base|) (_ bv0 32))))} is VALID [2022-02-20 23:41:38,255 INFO L290 TraceCheckUtils]: 11: Hoare triple {10026#(and (not (= |ULTIMATE.start_cstpncpy_~src#1.base| |ULTIMATE.start_cstpncpy_~#dst#1.base|)) (= (_ bv0 32) |ULTIMATE.start_cstpncpy_~src#1.offset|) (= ((_ sign_extend 24) (_ bv0 8)) (select (select |#memory_int| |ULTIMATE.start_cstpncpy_~src#1.base|) (_ bv0 32))))} SUMMARY for call cstpncpy_#t~mem2#1.base, cstpncpy_#t~mem2#1.offset := read~$Pointer$(cstpncpy_~#dst#1.base, cstpncpy_~#dst#1.offset, 4bv32); srcloc: L517 {10026#(and (not (= |ULTIMATE.start_cstpncpy_~src#1.base| |ULTIMATE.start_cstpncpy_~#dst#1.base|)) (= (_ bv0 32) |ULTIMATE.start_cstpncpy_~src#1.offset|) (= ((_ sign_extend 24) (_ bv0 8)) (select (select |#memory_int| |ULTIMATE.start_cstpncpy_~src#1.base|) (_ bv0 32))))} is VALID [2022-02-20 23:41:38,255 INFO L290 TraceCheckUtils]: 12: Hoare triple {10026#(and (not (= |ULTIMATE.start_cstpncpy_~src#1.base| |ULTIMATE.start_cstpncpy_~#dst#1.base|)) (= (_ bv0 32) |ULTIMATE.start_cstpncpy_~src#1.offset|) (= ((_ sign_extend 24) (_ bv0 8)) (select (select |#memory_int| |ULTIMATE.start_cstpncpy_~src#1.base|) (_ bv0 32))))} cstpncpy_~d~0#1.base, cstpncpy_~d~0#1.offset := cstpncpy_#t~mem2#1.base, cstpncpy_#t~mem2#1.offset;havoc cstpncpy_#t~mem2#1.base, cstpncpy_#t~mem2#1.offset;cstpncpy_~s~0#1.base, cstpncpy_~s~0#1.offset := cstpncpy_~src#1.base, cstpncpy_~src#1.offset; {10036#(and (= ((_ sign_extend 24) (_ bv0 8)) (select (select |#memory_int| |ULTIMATE.start_cstpncpy_~s~0#1.base|) (_ bv0 32))) (not (= |ULTIMATE.start_cstpncpy_~s~0#1.base| |ULTIMATE.start_cstpncpy_~#dst#1.base|)) (= |ULTIMATE.start_cstpncpy_~s~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:41:38,257 INFO L290 TraceCheckUtils]: 13: Hoare triple {10036#(and (= ((_ sign_extend 24) (_ bv0 8)) (select (select |#memory_int| |ULTIMATE.start_cstpncpy_~s~0#1.base|) (_ bv0 32))) (not (= |ULTIMATE.start_cstpncpy_~s~0#1.base| |ULTIMATE.start_cstpncpy_~#dst#1.base|)) (= |ULTIMATE.start_cstpncpy_~s~0#1.offset| (_ bv0 32)))} SUMMARY for call cstpncpy_#t~mem3#1.base, cstpncpy_#t~mem3#1.offset := read~$Pointer$(cstpncpy_~#dst#1.base, cstpncpy_~#dst#1.offset, 4bv32); srcloc: L519 {10036#(and (= ((_ sign_extend 24) (_ bv0 8)) (select (select |#memory_int| |ULTIMATE.start_cstpncpy_~s~0#1.base|) (_ bv0 32))) (not (= |ULTIMATE.start_cstpncpy_~s~0#1.base| |ULTIMATE.start_cstpncpy_~#dst#1.base|)) (= |ULTIMATE.start_cstpncpy_~s~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:41:38,259 INFO L290 TraceCheckUtils]: 14: Hoare triple {10036#(and (= ((_ sign_extend 24) (_ bv0 8)) (select (select |#memory_int| |ULTIMATE.start_cstpncpy_~s~0#1.base|) (_ bv0 32))) (not (= |ULTIMATE.start_cstpncpy_~s~0#1.base| |ULTIMATE.start_cstpncpy_~#dst#1.base|)) (= |ULTIMATE.start_cstpncpy_~s~0#1.offset| (_ bv0 32)))} SUMMARY for call write~$Pointer$(cstpncpy_#t~mem3#1.base, ~bvadd32(cstpncpy_#t~mem3#1.offset, cstpncpy_~n#1), cstpncpy_~#dst#1.base, cstpncpy_~#dst#1.offset, 4bv32); srcloc: L519-1 {10043#(and (= ((_ sign_extend 24) (_ bv0 8)) (select (select |#memory_int| |ULTIMATE.start_cstpncpy_~s~0#1.base|) (_ bv0 32))) (= |ULTIMATE.start_cstpncpy_~s~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:41:38,259 INFO L290 TraceCheckUtils]: 15: Hoare triple {10043#(and (= ((_ sign_extend 24) (_ bv0 8)) (select (select |#memory_int| |ULTIMATE.start_cstpncpy_~s~0#1.base|) (_ bv0 32))) (= |ULTIMATE.start_cstpncpy_~s~0#1.offset| (_ bv0 32)))} havoc cstpncpy_#t~mem3#1.base, cstpncpy_#t~mem3#1.offset; {10043#(and (= ((_ sign_extend 24) (_ bv0 8)) (select (select |#memory_int| |ULTIMATE.start_cstpncpy_~s~0#1.base|) (_ bv0 32))) (= |ULTIMATE.start_cstpncpy_~s~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:41:38,260 INFO L290 TraceCheckUtils]: 16: Hoare triple {10043#(and (= ((_ sign_extend 24) (_ bv0 8)) (select (select |#memory_int| |ULTIMATE.start_cstpncpy_~s~0#1.base|) (_ bv0 32))) (= |ULTIMATE.start_cstpncpy_~s~0#1.offset| (_ bv0 32)))} cstpncpy_#t~post5#1.base, cstpncpy_#t~post5#1.offset := cstpncpy_~d~0#1.base, cstpncpy_~d~0#1.offset;cstpncpy_~d~0#1.base, cstpncpy_~d~0#1.offset := cstpncpy_#t~post5#1.base, ~bvadd32(1bv32, cstpncpy_#t~post5#1.offset);cstpncpy_#t~post6#1.base, cstpncpy_#t~post6#1.offset := cstpncpy_~s~0#1.base, cstpncpy_~s~0#1.offset;cstpncpy_~s~0#1.base, cstpncpy_~s~0#1.offset := cstpncpy_#t~post6#1.base, ~bvadd32(1bv32, cstpncpy_#t~post6#1.offset); {10050#(and (= ((_ sign_extend 24) (_ bv0 8)) (select (select |#memory_int| |ULTIMATE.start_cstpncpy_#t~post6#1.base|) (_ bv0 32))) (= |ULTIMATE.start_cstpncpy_#t~post6#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:41:38,260 INFO L290 TraceCheckUtils]: 17: Hoare triple {10050#(and (= ((_ sign_extend 24) (_ bv0 8)) (select (select |#memory_int| |ULTIMATE.start_cstpncpy_#t~post6#1.base|) (_ bv0 32))) (= |ULTIMATE.start_cstpncpy_#t~post6#1.offset| (_ bv0 32)))} SUMMARY for call cstpncpy_#t~mem7#1 := read~intINTTYPE1(cstpncpy_#t~post6#1.base, cstpncpy_#t~post6#1.offset, 1bv32); srcloc: L521 {10054#(= ((_ extract 7 0) ((_ sign_extend 24) (_ bv0 8))) |ULTIMATE.start_cstpncpy_#t~mem7#1|)} is VALID [2022-02-20 23:41:38,261 INFO L290 TraceCheckUtils]: 18: Hoare triple {10054#(= ((_ extract 7 0) ((_ sign_extend 24) (_ bv0 8))) |ULTIMATE.start_cstpncpy_#t~mem7#1|)} SUMMARY for call write~intINTTYPE1(cstpncpy_#t~mem7#1, cstpncpy_#t~post5#1.base, cstpncpy_#t~post5#1.offset, 1bv32); srcloc: L521-1 {10054#(= ((_ extract 7 0) ((_ sign_extend 24) (_ bv0 8))) |ULTIMATE.start_cstpncpy_#t~mem7#1|)} is VALID [2022-02-20 23:41:38,261 INFO L290 TraceCheckUtils]: 19: Hoare triple {10054#(= ((_ extract 7 0) ((_ sign_extend 24) (_ bv0 8))) |ULTIMATE.start_cstpncpy_#t~mem7#1|)} assume !(0bv32 == ~sign_extendFrom8To32(cstpncpy_#t~mem7#1));havoc cstpncpy_#t~post5#1.base, cstpncpy_#t~post5#1.offset;havoc cstpncpy_#t~post6#1.base, cstpncpy_#t~post6#1.offset;havoc cstpncpy_#t~mem7#1; {9991#false} is VALID [2022-02-20 23:41:38,261 INFO L290 TraceCheckUtils]: 20: Hoare triple {9991#false} cstpncpy_#t~pre4#1 := ~bvsub32(cstpncpy_~n#1, 1bv32);cstpncpy_~n#1 := ~bvsub32(cstpncpy_~n#1, 1bv32); {9991#false} is VALID [2022-02-20 23:41:38,261 INFO L290 TraceCheckUtils]: 21: Hoare triple {9991#false} assume !!(0bv32 != cstpncpy_#t~pre4#1);havoc cstpncpy_#t~pre4#1; {9991#false} is VALID [2022-02-20 23:41:38,261 INFO L290 TraceCheckUtils]: 22: Hoare triple {9991#false} cstpncpy_#t~post5#1.base, cstpncpy_#t~post5#1.offset := cstpncpy_~d~0#1.base, cstpncpy_~d~0#1.offset;cstpncpy_~d~0#1.base, cstpncpy_~d~0#1.offset := cstpncpy_#t~post5#1.base, ~bvadd32(1bv32, cstpncpy_#t~post5#1.offset);cstpncpy_#t~post6#1.base, cstpncpy_#t~post6#1.offset := cstpncpy_~s~0#1.base, cstpncpy_~s~0#1.offset;cstpncpy_~s~0#1.base, cstpncpy_~s~0#1.offset := cstpncpy_#t~post6#1.base, ~bvadd32(1bv32, cstpncpy_#t~post6#1.offset); {9991#false} is VALID [2022-02-20 23:41:38,261 INFO L290 TraceCheckUtils]: 23: Hoare triple {9991#false} assume !((~bvule32(~bvadd32(1bv32, cstpncpy_#t~post6#1.offset), #length[cstpncpy_#t~post6#1.base]) && ~bvule32(cstpncpy_#t~post6#1.offset, ~bvadd32(1bv32, cstpncpy_#t~post6#1.offset))) && ~bvule32(0bv32, cstpncpy_#t~post6#1.offset)); {9991#false} is VALID [2022-02-20 23:41:38,261 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:41:38,261 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:41:38,262 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:41:38,262 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1748482904] [2022-02-20 23:41:38,262 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1748482904] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:41:38,262 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:41:38,262 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-02-20 23:41:38,262 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715403493] [2022-02-20 23:41:38,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:41:38,262 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2022-02-20 23:41:38,262 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:41:38,262 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 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:41:38,290 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:41:38,290 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-20 23:41:38,290 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:41:38,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-20 23:41:38,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-02-20 23:41:38,290 INFO L87 Difference]: Start difference. First operand 112 states and 133 transitions. Second operand has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 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:41:39,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:41:39,897 INFO L93 Difference]: Finished difference Result 157 states and 179 transitions. [2022-02-20 23:41:39,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 23:41:39,898 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2022-02-20 23:41:39,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:41:39,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 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:41:39,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 74 transitions. [2022-02-20 23:41:39,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 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:41:39,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 74 transitions. [2022-02-20 23:41:39,899 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 74 transitions. [2022-02-20 23:41:40,003 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:41:40,004 INFO L225 Difference]: With dead ends: 157 [2022-02-20 23:41:40,004 INFO L226 Difference]: Without dead ends: 157 [2022-02-20 23:41:40,005 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=230, Unknown=0, NotChecked=0, Total=306 [2022-02-20 23:41:40,005 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 45 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-20 23:41:40,005 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [45 Valid, 280 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-20 23:41:40,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2022-02-20 23:41:40,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 140. [2022-02-20 23:41:40,007 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:41:40,007 INFO L82 GeneralOperation]: Start isEquivalent. First operand 157 states. Second operand has 140 states, 135 states have (on average 1.1925925925925926) internal successors, (161), 139 states have internal predecessors, (161), 0 states have call successors, (0), 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:41:40,007 INFO L74 IsIncluded]: Start isIncluded. First operand 157 states. Second operand has 140 states, 135 states have (on average 1.1925925925925926) internal successors, (161), 139 states have internal predecessors, (161), 0 states have call successors, (0), 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:41:40,007 INFO L87 Difference]: Start difference. First operand 157 states. Second operand has 140 states, 135 states have (on average 1.1925925925925926) internal successors, (161), 139 states have internal predecessors, (161), 0 states have call successors, (0), 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:41:40,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:41:40,009 INFO L93 Difference]: Finished difference Result 157 states and 179 transitions. [2022-02-20 23:41:40,009 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 179 transitions. [2022-02-20 23:41:40,009 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:41:40,010 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:41:40,010 INFO L74 IsIncluded]: Start isIncluded. First operand has 140 states, 135 states have (on average 1.1925925925925926) internal successors, (161), 139 states have internal predecessors, (161), 0 states have call successors, (0), 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 157 states. [2022-02-20 23:41:40,010 INFO L87 Difference]: Start difference. First operand has 140 states, 135 states have (on average 1.1925925925925926) internal successors, (161), 139 states have internal predecessors, (161), 0 states have call successors, (0), 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 157 states. [2022-02-20 23:41:40,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:41:40,012 INFO L93 Difference]: Finished difference Result 157 states and 179 transitions. [2022-02-20 23:41:40,012 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 179 transitions. [2022-02-20 23:41:40,013 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:41:40,013 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:41:40,013 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:41:40,013 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:41:40,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 135 states have (on average 1.1925925925925926) internal successors, (161), 139 states have internal predecessors, (161), 0 states have call successors, (0), 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:41:40,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 161 transitions. [2022-02-20 23:41:40,015 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 161 transitions. Word has length 24 [2022-02-20 23:41:40,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:41:40,015 INFO L470 AbstractCegarLoop]: Abstraction has 140 states and 161 transitions. [2022-02-20 23:41:40,015 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 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:41:40,015 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 161 transitions. [2022-02-20 23:41:40,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-02-20 23:41:40,016 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:41:40,017 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:41:40,026 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Forceful destruction successful, exit code 0 [2022-02-20 23:41:40,224 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:41:40,224 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2022-02-20 23:41:40,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:41:40,225 INFO L85 PathProgramCache]: Analyzing trace with hash -1949580930, now seen corresponding path program 1 times [2022-02-20 23:41:40,225 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:41:40,225 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [855860160] [2022-02-20 23:41:40,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:41:40,225 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:41:40,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:41:40,226 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:41:40,227 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2022-02-20 23:41:40,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:41:40,346 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 32 conjunts are in the unsatisfiable core [2022-02-20 23:41:40,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:41:40,361 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:41:40,402 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-02-20 23:41:40,403 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 1 case distinctions, treesize of input 9 treesize of output 15 [2022-02-20 23:41:40,419 INFO L356 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2022-02-20 23:41:40,419 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 1 case distinctions, treesize of input 9 treesize of output 18 [2022-02-20 23:41:40,509 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 17 treesize of output 13 [2022-02-20 23:41:40,551 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-20 23:41:40,551 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-02-20 23:41:40,562 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 32 [2022-02-20 23:41:40,615 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-02-20 23:41:40,797 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2022-02-20 23:41:40,958 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-20 23:41:40,958 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 9 [2022-02-20 23:41:41,026 INFO L290 TraceCheckUtils]: 0: Hoare triple {10697#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven; {10697#true} is VALID [2022-02-20 23:41:41,026 INFO L290 TraceCheckUtils]: 1: Hoare triple {10697#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~nondet12#1, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_#t~nondet16#1, main_#t~post15#1, main_~i~0#1, main_#t~ret17#1.base, main_#t~ret17#1.offset, main_~length~0#1, main_~n~0#1, main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset, main_~nondetString~0#1.base, main_~nondetString~0#1.offset;main_~length~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;main_~n~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; {10697#true} is VALID [2022-02-20 23:41:41,026 INFO L290 TraceCheckUtils]: 2: Hoare triple {10697#true} assume !~bvslt32(main_~length~0#1, 1bv32); {10708#(not (bvslt |ULTIMATE.start_main_~length~0#1| (_ bv1 32)))} is VALID [2022-02-20 23:41:41,027 INFO L290 TraceCheckUtils]: 3: Hoare triple {10708#(not (bvslt |ULTIMATE.start_main_~length~0#1| (_ bv1 32)))} assume !~bvslt32(main_~n~0#1, 1bv32); {10708#(not (bvslt |ULTIMATE.start_main_~length~0#1| (_ bv1 32)))} is VALID [2022-02-20 23:41:41,028 INFO L290 TraceCheckUtils]: 4: Hoare triple {10708#(not (bvslt |ULTIMATE.start_main_~length~0#1| (_ bv1 32)))} call main_#t~malloc13#1.base, main_#t~malloc13#1.offset := #Ultimate.allocOnStack(main_~n~0#1);main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset := main_#t~malloc13#1.base, main_#t~malloc13#1.offset;call main_#t~malloc14#1.base, main_#t~malloc14#1.offset := #Ultimate.allocOnStack(main_~length~0#1);main_~nondetString~0#1.base, main_~nondetString~0#1.offset := main_#t~malloc14#1.base, main_#t~malloc14#1.offset;main_~i~0#1 := 0bv32; {10715#(and (= (select |#length| |ULTIMATE.start_main_~nondetString~0#1.base|) |ULTIMATE.start_main_~length~0#1|) (not (bvslt |ULTIMATE.start_main_~length~0#1| (_ bv1 32))) (= |ULTIMATE.start_main_~i~0#1| (_ bv0 32)) (= |ULTIMATE.start_main_~nondetString~0#1.offset| (_ bv0 32)) (= (select |#valid| |ULTIMATE.start_main_~nondetString~0#1.base|) (_ bv1 1)))} is VALID [2022-02-20 23:41:41,028 INFO L290 TraceCheckUtils]: 5: Hoare triple {10715#(and (= (select |#length| |ULTIMATE.start_main_~nondetString~0#1.base|) |ULTIMATE.start_main_~length~0#1|) (not (bvslt |ULTIMATE.start_main_~length~0#1| (_ bv1 32))) (= |ULTIMATE.start_main_~i~0#1| (_ bv0 32)) (= |ULTIMATE.start_main_~nondetString~0#1.offset| (_ bv0 32)) (= (select |#valid| |ULTIMATE.start_main_~nondetString~0#1.base|) (_ bv1 1)))} assume !~bvslt32(main_~i~0#1, ~bvsub32(main_~length~0#1, 1bv32)); {10719#(and (= (select |#length| |ULTIMATE.start_main_~nondetString~0#1.base|) |ULTIMATE.start_main_~length~0#1|) (not (bvslt (_ bv0 32) (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~length~0#1|))) (not (bvslt |ULTIMATE.start_main_~length~0#1| (_ bv1 32))) (= |ULTIMATE.start_main_~nondetString~0#1.offset| (_ bv0 32)) (= (select |#valid| |ULTIMATE.start_main_~nondetString~0#1.base|) (_ bv1 1)))} is VALID [2022-02-20 23:41:41,030 INFO L290 TraceCheckUtils]: 6: Hoare triple {10719#(and (= (select |#length| |ULTIMATE.start_main_~nondetString~0#1.base|) |ULTIMATE.start_main_~length~0#1|) (not (bvslt (_ bv0 32) (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~length~0#1|))) (not (bvslt |ULTIMATE.start_main_~length~0#1| (_ bv1 32))) (= |ULTIMATE.start_main_~nondetString~0#1.offset| (_ bv0 32)) (= (select |#valid| |ULTIMATE.start_main_~nondetString~0#1.base|) (_ bv1 1)))} SUMMARY for call write~intINTTYPE1(0bv8, main_~nondetString~0#1.base, ~bvadd32(main_~nondetString~0#1.offset, ~bvsub32(main_~length~0#1, 1bv32)), 1bv32); srcloc: L543-4 {10723#(and (not (bvslt (_ bv0 32) (bvadd (select |#length| |ULTIMATE.start_main_~nondetString~0#1.base|) (_ bv4294967295 32)))) (= |ULTIMATE.start_main_~nondetString~0#1.offset| (_ bv0 32)) (not (bvslt (select |#length| |ULTIMATE.start_main_~nondetString~0#1.base|) (_ bv1 32))) (= (select |#valid| |ULTIMATE.start_main_~nondetString~0#1.base|) (_ bv1 1)) (= ((_ sign_extend 24) (_ bv0 8)) (select (select |#memory_int| |ULTIMATE.start_main_~nondetString~0#1.base|) (bvadd (select |#length| |ULTIMATE.start_main_~nondetString~0#1.base|) (_ bv4294967295 32) |ULTIMATE.start_main_~nondetString~0#1.offset|))))} is VALID [2022-02-20 23:41:41,033 INFO L290 TraceCheckUtils]: 7: Hoare triple {10723#(and (not (bvslt (_ bv0 32) (bvadd (select |#length| |ULTIMATE.start_main_~nondetString~0#1.base|) (_ bv4294967295 32)))) (= |ULTIMATE.start_main_~nondetString~0#1.offset| (_ bv0 32)) (not (bvslt (select |#length| |ULTIMATE.start_main_~nondetString~0#1.base|) (_ bv1 32))) (= (select |#valid| |ULTIMATE.start_main_~nondetString~0#1.base|) (_ bv1 1)) (= ((_ sign_extend 24) (_ bv0 8)) (select (select |#memory_int| |ULTIMATE.start_main_~nondetString~0#1.base|) (bvadd (select |#length| |ULTIMATE.start_main_~nondetString~0#1.base|) (_ bv4294967295 32) |ULTIMATE.start_main_~nondetString~0#1.offset|))))} assume { :begin_inline_cstpncpy } true;cstpncpy_#in~dst#1.base, cstpncpy_#in~dst#1.offset, cstpncpy_#in~src#1.base, cstpncpy_#in~src#1.offset, cstpncpy_#in~n#1 := main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset, main_~nondetString~0#1.base, main_~nondetString~0#1.offset, main_~n~0#1;havoc cstpncpy_#res#1.base, cstpncpy_#res#1.offset;havoc cstpncpy_#t~mem2#1.base, cstpncpy_#t~mem2#1.offset, cstpncpy_#t~mem3#1.base, cstpncpy_#t~mem3#1.offset, cstpncpy_#t~post5#1.base, cstpncpy_#t~post5#1.offset, cstpncpy_#t~post6#1.base, cstpncpy_#t~post6#1.offset, cstpncpy_#t~mem7#1, cstpncpy_#t~post9#1.base, cstpncpy_#t~post9#1.offset, cstpncpy_#t~pre8#1, cstpncpy_#t~pre4#1, cstpncpy_~d~0#1.base, cstpncpy_~d~0#1.offset, cstpncpy_~s~0#1.base, cstpncpy_~s~0#1.offset, cstpncpy_#t~mem10#1.base, cstpncpy_#t~mem10#1.offset, cstpncpy_~#dst#1.base, cstpncpy_~#dst#1.offset, cstpncpy_~src#1.base, cstpncpy_~src#1.offset, cstpncpy_~n#1;call cstpncpy_~#dst#1.base, cstpncpy_~#dst#1.offset := #Ultimate.allocOnStack(4bv32); {10727#(and (= |ULTIMATE.start_cstpncpy_#in~src#1.offset| (_ bv0 32)) (= ((_ sign_extend 24) (_ bv0 8)) (select (select |#memory_int| |ULTIMATE.start_cstpncpy_#in~src#1.base|) (bvadd (select |#length| |ULTIMATE.start_cstpncpy_#in~src#1.base|) (_ bv4294967295 32) |ULTIMATE.start_cstpncpy_#in~src#1.offset|))) (not (= |ULTIMATE.start_cstpncpy_#in~src#1.base| |ULTIMATE.start_cstpncpy_~#dst#1.base|)) (not (bvslt (select |#length| |ULTIMATE.start_cstpncpy_#in~src#1.base|) (_ bv1 32))) (not (bvslt (_ bv0 32) (bvadd (select |#length| |ULTIMATE.start_cstpncpy_#in~src#1.base|) (_ bv4294967295 32)))))} is VALID [2022-02-20 23:41:41,034 INFO L290 TraceCheckUtils]: 8: Hoare triple {10727#(and (= |ULTIMATE.start_cstpncpy_#in~src#1.offset| (_ bv0 32)) (= ((_ sign_extend 24) (_ bv0 8)) (select (select |#memory_int| |ULTIMATE.start_cstpncpy_#in~src#1.base|) (bvadd (select |#length| |ULTIMATE.start_cstpncpy_#in~src#1.base|) (_ bv4294967295 32) |ULTIMATE.start_cstpncpy_#in~src#1.offset|))) (not (= |ULTIMATE.start_cstpncpy_#in~src#1.base| |ULTIMATE.start_cstpncpy_~#dst#1.base|)) (not (bvslt (select |#length| |ULTIMATE.start_cstpncpy_#in~src#1.base|) (_ bv1 32))) (not (bvslt (_ bv0 32) (bvadd (select |#length| |ULTIMATE.start_cstpncpy_#in~src#1.base|) (_ bv4294967295 32)))))} SUMMARY for call write~$Pointer$(cstpncpy_#in~dst#1.base, cstpncpy_#in~dst#1.offset, cstpncpy_~#dst#1.base, cstpncpy_~#dst#1.offset, 4bv32); srcloc: L513 {10727#(and (= |ULTIMATE.start_cstpncpy_#in~src#1.offset| (_ bv0 32)) (= ((_ sign_extend 24) (_ bv0 8)) (select (select |#memory_int| |ULTIMATE.start_cstpncpy_#in~src#1.base|) (bvadd (select |#length| |ULTIMATE.start_cstpncpy_#in~src#1.base|) (_ bv4294967295 32) |ULTIMATE.start_cstpncpy_#in~src#1.offset|))) (not (= |ULTIMATE.start_cstpncpy_#in~src#1.base| |ULTIMATE.start_cstpncpy_~#dst#1.base|)) (not (bvslt (select |#length| |ULTIMATE.start_cstpncpy_#in~src#1.base|) (_ bv1 32))) (not (bvslt (_ bv0 32) (bvadd (select |#length| |ULTIMATE.start_cstpncpy_#in~src#1.base|) (_ bv4294967295 32)))))} is VALID [2022-02-20 23:41:41,035 INFO L290 TraceCheckUtils]: 9: Hoare triple {10727#(and (= |ULTIMATE.start_cstpncpy_#in~src#1.offset| (_ bv0 32)) (= ((_ sign_extend 24) (_ bv0 8)) (select (select |#memory_int| |ULTIMATE.start_cstpncpy_#in~src#1.base|) (bvadd (select |#length| |ULTIMATE.start_cstpncpy_#in~src#1.base|) (_ bv4294967295 32) |ULTIMATE.start_cstpncpy_#in~src#1.offset|))) (not (= |ULTIMATE.start_cstpncpy_#in~src#1.base| |ULTIMATE.start_cstpncpy_~#dst#1.base|)) (not (bvslt (select |#length| |ULTIMATE.start_cstpncpy_#in~src#1.base|) (_ bv1 32))) (not (bvslt (_ bv0 32) (bvadd (select |#length| |ULTIMATE.start_cstpncpy_#in~src#1.base|) (_ bv4294967295 32)))))} cstpncpy_~src#1.base, cstpncpy_~src#1.offset := cstpncpy_#in~src#1.base, cstpncpy_#in~src#1.offset;cstpncpy_~n#1 := cstpncpy_#in~n#1; {10734#(and (not (= |ULTIMATE.start_cstpncpy_~src#1.base| |ULTIMATE.start_cstpncpy_~#dst#1.base|)) (= ((_ sign_extend 24) (_ bv0 8)) (select (select |#memory_int| |ULTIMATE.start_cstpncpy_~src#1.base|) (bvadd (select |#length| |ULTIMATE.start_cstpncpy_~src#1.base|) (_ bv4294967295 32)))) (= (_ bv0 32) |ULTIMATE.start_cstpncpy_~src#1.offset|) (not (bvslt (_ bv0 32) (bvadd (select |#length| |ULTIMATE.start_cstpncpy_~src#1.base|) (_ bv4294967295 32)))) (not (bvslt (select |#length| |ULTIMATE.start_cstpncpy_~src#1.base|) (_ bv1 32))))} is VALID [2022-02-20 23:41:41,036 INFO L290 TraceCheckUtils]: 10: Hoare triple {10734#(and (not (= |ULTIMATE.start_cstpncpy_~src#1.base| |ULTIMATE.start_cstpncpy_~#dst#1.base|)) (= ((_ sign_extend 24) (_ bv0 8)) (select (select |#memory_int| |ULTIMATE.start_cstpncpy_~src#1.base|) (bvadd (select |#length| |ULTIMATE.start_cstpncpy_~src#1.base|) (_ bv4294967295 32)))) (= (_ bv0 32) |ULTIMATE.start_cstpncpy_~src#1.offset|) (not (bvslt (_ bv0 32) (bvadd (select |#length| |ULTIMATE.start_cstpncpy_~src#1.base|) (_ bv4294967295 32)))) (not (bvslt (select |#length| |ULTIMATE.start_cstpncpy_~src#1.base|) (_ bv1 32))))} assume 0bv32 != cstpncpy_~n#1; {10734#(and (not (= |ULTIMATE.start_cstpncpy_~src#1.base| |ULTIMATE.start_cstpncpy_~#dst#1.base|)) (= ((_ sign_extend 24) (_ bv0 8)) (select (select |#memory_int| |ULTIMATE.start_cstpncpy_~src#1.base|) (bvadd (select |#length| |ULTIMATE.start_cstpncpy_~src#1.base|) (_ bv4294967295 32)))) (= (_ bv0 32) |ULTIMATE.start_cstpncpy_~src#1.offset|) (not (bvslt (_ bv0 32) (bvadd (select |#length| |ULTIMATE.start_cstpncpy_~src#1.base|) (_ bv4294967295 32)))) (not (bvslt (select |#length| |ULTIMATE.start_cstpncpy_~src#1.base|) (_ bv1 32))))} is VALID [2022-02-20 23:41:41,036 INFO L290 TraceCheckUtils]: 11: Hoare triple {10734#(and (not (= |ULTIMATE.start_cstpncpy_~src#1.base| |ULTIMATE.start_cstpncpy_~#dst#1.base|)) (= ((_ sign_extend 24) (_ bv0 8)) (select (select |#memory_int| |ULTIMATE.start_cstpncpy_~src#1.base|) (bvadd (select |#length| |ULTIMATE.start_cstpncpy_~src#1.base|) (_ bv4294967295 32)))) (= (_ bv0 32) |ULTIMATE.start_cstpncpy_~src#1.offset|) (not (bvslt (_ bv0 32) (bvadd (select |#length| |ULTIMATE.start_cstpncpy_~src#1.base|) (_ bv4294967295 32)))) (not (bvslt (select |#length| |ULTIMATE.start_cstpncpy_~src#1.base|) (_ bv1 32))))} SUMMARY for call cstpncpy_#t~mem2#1.base, cstpncpy_#t~mem2#1.offset := read~$Pointer$(cstpncpy_~#dst#1.base, cstpncpy_~#dst#1.offset, 4bv32); srcloc: L517 {10734#(and (not (= |ULTIMATE.start_cstpncpy_~src#1.base| |ULTIMATE.start_cstpncpy_~#dst#1.base|)) (= ((_ sign_extend 24) (_ bv0 8)) (select (select |#memory_int| |ULTIMATE.start_cstpncpy_~src#1.base|) (bvadd (select |#length| |ULTIMATE.start_cstpncpy_~src#1.base|) (_ bv4294967295 32)))) (= (_ bv0 32) |ULTIMATE.start_cstpncpy_~src#1.offset|) (not (bvslt (_ bv0 32) (bvadd (select |#length| |ULTIMATE.start_cstpncpy_~src#1.base|) (_ bv4294967295 32)))) (not (bvslt (select |#length| |ULTIMATE.start_cstpncpy_~src#1.base|) (_ bv1 32))))} is VALID [2022-02-20 23:41:41,037 INFO L290 TraceCheckUtils]: 12: Hoare triple {10734#(and (not (= |ULTIMATE.start_cstpncpy_~src#1.base| |ULTIMATE.start_cstpncpy_~#dst#1.base|)) (= ((_ sign_extend 24) (_ bv0 8)) (select (select |#memory_int| |ULTIMATE.start_cstpncpy_~src#1.base|) (bvadd (select |#length| |ULTIMATE.start_cstpncpy_~src#1.base|) (_ bv4294967295 32)))) (= (_ bv0 32) |ULTIMATE.start_cstpncpy_~src#1.offset|) (not (bvslt (_ bv0 32) (bvadd (select |#length| |ULTIMATE.start_cstpncpy_~src#1.base|) (_ bv4294967295 32)))) (not (bvslt (select |#length| |ULTIMATE.start_cstpncpy_~src#1.base|) (_ bv1 32))))} cstpncpy_~d~0#1.base, cstpncpy_~d~0#1.offset := cstpncpy_#t~mem2#1.base, cstpncpy_#t~mem2#1.offset;havoc cstpncpy_#t~mem2#1.base, cstpncpy_#t~mem2#1.offset;cstpncpy_~s~0#1.base, cstpncpy_~s~0#1.offset := cstpncpy_~src#1.base, cstpncpy_~src#1.offset; {10744#(and (not (bvslt (select |#length| |ULTIMATE.start_cstpncpy_~s~0#1.base|) (_ bv1 32))) (= ((_ sign_extend 24) (_ bv0 8)) (select (select |#memory_int| |ULTIMATE.start_cstpncpy_~s~0#1.base|) (bvadd (select |#length| |ULTIMATE.start_cstpncpy_~s~0#1.base|) (_ bv4294967295 32)))) (not (bvslt (_ bv0 32) (bvadd (select |#length| |ULTIMATE.start_cstpncpy_~s~0#1.base|) (_ bv4294967295 32)))) (not (= |ULTIMATE.start_cstpncpy_~s~0#1.base| |ULTIMATE.start_cstpncpy_~#dst#1.base|)) (= |ULTIMATE.start_cstpncpy_~s~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:41:41,037 INFO L290 TraceCheckUtils]: 13: Hoare triple {10744#(and (not (bvslt (select |#length| |ULTIMATE.start_cstpncpy_~s~0#1.base|) (_ bv1 32))) (= ((_ sign_extend 24) (_ bv0 8)) (select (select |#memory_int| |ULTIMATE.start_cstpncpy_~s~0#1.base|) (bvadd (select |#length| |ULTIMATE.start_cstpncpy_~s~0#1.base|) (_ bv4294967295 32)))) (not (bvslt (_ bv0 32) (bvadd (select |#length| |ULTIMATE.start_cstpncpy_~s~0#1.base|) (_ bv4294967295 32)))) (not (= |ULTIMATE.start_cstpncpy_~s~0#1.base| |ULTIMATE.start_cstpncpy_~#dst#1.base|)) (= |ULTIMATE.start_cstpncpy_~s~0#1.offset| (_ bv0 32)))} SUMMARY for call cstpncpy_#t~mem3#1.base, cstpncpy_#t~mem3#1.offset := read~$Pointer$(cstpncpy_~#dst#1.base, cstpncpy_~#dst#1.offset, 4bv32); srcloc: L519 {10744#(and (not (bvslt (select |#length| |ULTIMATE.start_cstpncpy_~s~0#1.base|) (_ bv1 32))) (= ((_ sign_extend 24) (_ bv0 8)) (select (select |#memory_int| |ULTIMATE.start_cstpncpy_~s~0#1.base|) (bvadd (select |#length| |ULTIMATE.start_cstpncpy_~s~0#1.base|) (_ bv4294967295 32)))) (not (bvslt (_ bv0 32) (bvadd (select |#length| |ULTIMATE.start_cstpncpy_~s~0#1.base|) (_ bv4294967295 32)))) (not (= |ULTIMATE.start_cstpncpy_~s~0#1.base| |ULTIMATE.start_cstpncpy_~#dst#1.base|)) (= |ULTIMATE.start_cstpncpy_~s~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:41:41,039 INFO L290 TraceCheckUtils]: 14: Hoare triple {10744#(and (not (bvslt (select |#length| |ULTIMATE.start_cstpncpy_~s~0#1.base|) (_ bv1 32))) (= ((_ sign_extend 24) (_ bv0 8)) (select (select |#memory_int| |ULTIMATE.start_cstpncpy_~s~0#1.base|) (bvadd (select |#length| |ULTIMATE.start_cstpncpy_~s~0#1.base|) (_ bv4294967295 32)))) (not (bvslt (_ bv0 32) (bvadd (select |#length| |ULTIMATE.start_cstpncpy_~s~0#1.base|) (_ bv4294967295 32)))) (not (= |ULTIMATE.start_cstpncpy_~s~0#1.base| |ULTIMATE.start_cstpncpy_~#dst#1.base|)) (= |ULTIMATE.start_cstpncpy_~s~0#1.offset| (_ bv0 32)))} SUMMARY for call write~$Pointer$(cstpncpy_#t~mem3#1.base, ~bvadd32(cstpncpy_#t~mem3#1.offset, cstpncpy_~n#1), cstpncpy_~#dst#1.base, cstpncpy_~#dst#1.offset, 4bv32); srcloc: L519-1 {10751#(and (not (bvslt (select |#length| |ULTIMATE.start_cstpncpy_~s~0#1.base|) (_ bv1 32))) (= ((_ sign_extend 24) (_ bv0 8)) (select (select |#memory_int| |ULTIMATE.start_cstpncpy_~s~0#1.base|) (bvadd (select |#length| |ULTIMATE.start_cstpncpy_~s~0#1.base|) (_ bv4294967295 32)))) (not (bvslt (_ bv0 32) (bvadd (select |#length| |ULTIMATE.start_cstpncpy_~s~0#1.base|) (_ bv4294967295 32)))) (= |ULTIMATE.start_cstpncpy_~s~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:41:41,040 INFO L290 TraceCheckUtils]: 15: Hoare triple {10751#(and (not (bvslt (select |#length| |ULTIMATE.start_cstpncpy_~s~0#1.base|) (_ bv1 32))) (= ((_ sign_extend 24) (_ bv0 8)) (select (select |#memory_int| |ULTIMATE.start_cstpncpy_~s~0#1.base|) (bvadd (select |#length| |ULTIMATE.start_cstpncpy_~s~0#1.base|) (_ bv4294967295 32)))) (not (bvslt (_ bv0 32) (bvadd (select |#length| |ULTIMATE.start_cstpncpy_~s~0#1.base|) (_ bv4294967295 32)))) (= |ULTIMATE.start_cstpncpy_~s~0#1.offset| (_ bv0 32)))} havoc cstpncpy_#t~mem3#1.base, cstpncpy_#t~mem3#1.offset; {10751#(and (not (bvslt (select |#length| |ULTIMATE.start_cstpncpy_~s~0#1.base|) (_ bv1 32))) (= ((_ sign_extend 24) (_ bv0 8)) (select (select |#memory_int| |ULTIMATE.start_cstpncpy_~s~0#1.base|) (bvadd (select |#length| |ULTIMATE.start_cstpncpy_~s~0#1.base|) (_ bv4294967295 32)))) (not (bvslt (_ bv0 32) (bvadd (select |#length| |ULTIMATE.start_cstpncpy_~s~0#1.base|) (_ bv4294967295 32)))) (= |ULTIMATE.start_cstpncpy_~s~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:41:41,040 INFO L290 TraceCheckUtils]: 16: Hoare triple {10751#(and (not (bvslt (select |#length| |ULTIMATE.start_cstpncpy_~s~0#1.base|) (_ bv1 32))) (= ((_ sign_extend 24) (_ bv0 8)) (select (select |#memory_int| |ULTIMATE.start_cstpncpy_~s~0#1.base|) (bvadd (select |#length| |ULTIMATE.start_cstpncpy_~s~0#1.base|) (_ bv4294967295 32)))) (not (bvslt (_ bv0 32) (bvadd (select |#length| |ULTIMATE.start_cstpncpy_~s~0#1.base|) (_ bv4294967295 32)))) (= |ULTIMATE.start_cstpncpy_~s~0#1.offset| (_ bv0 32)))} cstpncpy_#t~post5#1.base, cstpncpy_#t~post5#1.offset := cstpncpy_~d~0#1.base, cstpncpy_~d~0#1.offset;cstpncpy_~d~0#1.base, cstpncpy_~d~0#1.offset := cstpncpy_#t~post5#1.base, ~bvadd32(1bv32, cstpncpy_#t~post5#1.offset);cstpncpy_#t~post6#1.base, cstpncpy_#t~post6#1.offset := cstpncpy_~s~0#1.base, cstpncpy_~s~0#1.offset;cstpncpy_~s~0#1.base, cstpncpy_~s~0#1.offset := cstpncpy_#t~post6#1.base, ~bvadd32(1bv32, cstpncpy_#t~post6#1.offset); {10758#(and (= |ULTIMATE.start_cstpncpy_#t~post6#1.base| |ULTIMATE.start_cstpncpy_~s~0#1.base|) (not (bvslt (_ bv0 32) (bvadd (_ bv4294967295 32) (select |#length| |ULTIMATE.start_cstpncpy_#t~post6#1.base|)))) (= (select (select |#memory_int| |ULTIMATE.start_cstpncpy_#t~post6#1.base|) (bvadd (_ bv4294967295 32) (select |#length| |ULTIMATE.start_cstpncpy_#t~post6#1.base|))) ((_ sign_extend 24) (_ bv0 8))) (= |ULTIMATE.start_cstpncpy_~s~0#1.offset| (bvadd |ULTIMATE.start_cstpncpy_#t~post6#1.offset| (_ bv1 32))) (= |ULTIMATE.start_cstpncpy_#t~post6#1.offset| (_ bv0 32)) (not (bvslt (select |#length| |ULTIMATE.start_cstpncpy_#t~post6#1.base|) (_ bv1 32))))} is VALID [2022-02-20 23:41:41,042 INFO L290 TraceCheckUtils]: 17: Hoare triple {10758#(and (= |ULTIMATE.start_cstpncpy_#t~post6#1.base| |ULTIMATE.start_cstpncpy_~s~0#1.base|) (not (bvslt (_ bv0 32) (bvadd (_ bv4294967295 32) (select |#length| |ULTIMATE.start_cstpncpy_#t~post6#1.base|)))) (= (select (select |#memory_int| |ULTIMATE.start_cstpncpy_#t~post6#1.base|) (bvadd (_ bv4294967295 32) (select |#length| |ULTIMATE.start_cstpncpy_#t~post6#1.base|))) ((_ sign_extend 24) (_ bv0 8))) (= |ULTIMATE.start_cstpncpy_~s~0#1.offset| (bvadd |ULTIMATE.start_cstpncpy_#t~post6#1.offset| (_ bv1 32))) (= |ULTIMATE.start_cstpncpy_#t~post6#1.offset| (_ bv0 32)) (not (bvslt (select |#length| |ULTIMATE.start_cstpncpy_#t~post6#1.base|) (_ bv1 32))))} SUMMARY for call cstpncpy_#t~mem7#1 := read~intINTTYPE1(cstpncpy_#t~post6#1.base, cstpncpy_#t~post6#1.offset, 1bv32); srcloc: L521 {10762#(and (= (bvadd |ULTIMATE.start_cstpncpy_~s~0#1.offset| (_ bv4294967295 32)) (_ bv0 32)) (not (bvslt (select |#length| |ULTIMATE.start_cstpncpy_~s~0#1.base|) (_ bv1 32))) (not (bvslt (_ bv0 32) (bvadd (select |#length| |ULTIMATE.start_cstpncpy_~s~0#1.base|) (_ bv4294967295 32)))) (= ((_ extract 7 0) ((_ sign_extend 24) (_ bv0 8))) |ULTIMATE.start_cstpncpy_#t~mem7#1|))} is VALID [2022-02-20 23:41:41,042 INFO L290 TraceCheckUtils]: 18: Hoare triple {10762#(and (= (bvadd |ULTIMATE.start_cstpncpy_~s~0#1.offset| (_ bv4294967295 32)) (_ bv0 32)) (not (bvslt (select |#length| |ULTIMATE.start_cstpncpy_~s~0#1.base|) (_ bv1 32))) (not (bvslt (_ bv0 32) (bvadd (select |#length| |ULTIMATE.start_cstpncpy_~s~0#1.base|) (_ bv4294967295 32)))) (= ((_ extract 7 0) ((_ sign_extend 24) (_ bv0 8))) |ULTIMATE.start_cstpncpy_#t~mem7#1|))} SUMMARY for call write~intINTTYPE1(cstpncpy_#t~mem7#1, cstpncpy_#t~post5#1.base, cstpncpy_#t~post5#1.offset, 1bv32); srcloc: L521-1 {10762#(and (= (bvadd |ULTIMATE.start_cstpncpy_~s~0#1.offset| (_ bv4294967295 32)) (_ bv0 32)) (not (bvslt (select |#length| |ULTIMATE.start_cstpncpy_~s~0#1.base|) (_ bv1 32))) (not (bvslt (_ bv0 32) (bvadd (select |#length| |ULTIMATE.start_cstpncpy_~s~0#1.base|) (_ bv4294967295 32)))) (= ((_ extract 7 0) ((_ sign_extend 24) (_ bv0 8))) |ULTIMATE.start_cstpncpy_#t~mem7#1|))} is VALID [2022-02-20 23:41:41,043 INFO L290 TraceCheckUtils]: 19: Hoare triple {10762#(and (= (bvadd |ULTIMATE.start_cstpncpy_~s~0#1.offset| (_ bv4294967295 32)) (_ bv0 32)) (not (bvslt (select |#length| |ULTIMATE.start_cstpncpy_~s~0#1.base|) (_ bv1 32))) (not (bvslt (_ bv0 32) (bvadd (select |#length| |ULTIMATE.start_cstpncpy_~s~0#1.base|) (_ bv4294967295 32)))) (= ((_ extract 7 0) ((_ sign_extend 24) (_ bv0 8))) |ULTIMATE.start_cstpncpy_#t~mem7#1|))} assume !(0bv32 == ~sign_extendFrom8To32(cstpncpy_#t~mem7#1));havoc cstpncpy_#t~post5#1.base, cstpncpy_#t~post5#1.offset;havoc cstpncpy_#t~post6#1.base, cstpncpy_#t~post6#1.offset;havoc cstpncpy_#t~mem7#1; {10698#false} is VALID [2022-02-20 23:41:41,043 INFO L290 TraceCheckUtils]: 20: Hoare triple {10698#false} cstpncpy_#t~pre4#1 := ~bvsub32(cstpncpy_~n#1, 1bv32);cstpncpy_~n#1 := ~bvsub32(cstpncpy_~n#1, 1bv32); {10698#false} is VALID [2022-02-20 23:41:41,043 INFO L290 TraceCheckUtils]: 21: Hoare triple {10698#false} assume !!(0bv32 != cstpncpy_#t~pre4#1);havoc cstpncpy_#t~pre4#1; {10698#false} is VALID [2022-02-20 23:41:41,043 INFO L290 TraceCheckUtils]: 22: Hoare triple {10698#false} cstpncpy_#t~post5#1.base, cstpncpy_#t~post5#1.offset := cstpncpy_~d~0#1.base, cstpncpy_~d~0#1.offset;cstpncpy_~d~0#1.base, cstpncpy_~d~0#1.offset := cstpncpy_#t~post5#1.base, ~bvadd32(1bv32, cstpncpy_#t~post5#1.offset);cstpncpy_#t~post6#1.base, cstpncpy_#t~post6#1.offset := cstpncpy_~s~0#1.base, cstpncpy_~s~0#1.offset;cstpncpy_~s~0#1.base, cstpncpy_~s~0#1.offset := cstpncpy_#t~post6#1.base, ~bvadd32(1bv32, cstpncpy_#t~post6#1.offset); {10698#false} is VALID [2022-02-20 23:41:41,043 INFO L290 TraceCheckUtils]: 23: Hoare triple {10698#false} assume !((~bvule32(~bvadd32(1bv32, cstpncpy_#t~post6#1.offset), #length[cstpncpy_#t~post6#1.base]) && ~bvule32(cstpncpy_#t~post6#1.offset, ~bvadd32(1bv32, cstpncpy_#t~post6#1.offset))) && ~bvule32(0bv32, cstpncpy_#t~post6#1.offset)); {10698#false} is VALID [2022-02-20 23:41:41,043 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:41:41,043 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:41:41,043 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:41:41,043 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [855860160] [2022-02-20 23:41:41,043 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [855860160] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:41:41,044 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:41:41,044 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-02-20 23:41:41,044 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822411294] [2022-02-20 23:41:41,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:41:41,044 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.0) internal successors, (24), 12 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2022-02-20 23:41:41,044 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:41:41,044 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 2.0) internal successors, (24), 12 states have internal predecessors, (24), 0 states have call successors, (0), 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:41:41,080 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:41:41,080 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-02-20 23:41:41,080 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:41:41,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-20 23:41:41,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2022-02-20 23:41:41,080 INFO L87 Difference]: Start difference. First operand 140 states and 161 transitions. Second operand has 12 states, 12 states have (on average 2.0) internal successors, (24), 12 states have internal predecessors, (24), 0 states have call successors, (0), 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:41:44,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:41:44,710 INFO L93 Difference]: Finished difference Result 182 states and 205 transitions. [2022-02-20 23:41:44,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 23:41:44,711 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.0) internal successors, (24), 12 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2022-02-20 23:41:44,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:41:44,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.0) internal successors, (24), 12 states have internal predecessors, (24), 0 states have call successors, (0), 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:41:44,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 73 transitions. [2022-02-20 23:41:44,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.0) internal successors, (24), 12 states have internal predecessors, (24), 0 states have call successors, (0), 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:41:44,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 73 transitions. [2022-02-20 23:41:44,712 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 73 transitions. [2022-02-20 23:41:44,893 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:41:44,894 INFO L225 Difference]: With dead ends: 182 [2022-02-20 23:41:44,894 INFO L226 Difference]: Without dead ends: 182 [2022-02-20 23:41:44,894 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=98, Invalid=244, Unknown=0, NotChecked=0, Total=342 [2022-02-20 23:41:44,895 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 114 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:41:44,895 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [114 Valid, 174 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-02-20 23:41:44,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2022-02-20 23:41:44,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 140. [2022-02-20 23:41:44,896 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:41:44,897 INFO L82 GeneralOperation]: Start isEquivalent. First operand 182 states. Second operand has 140 states, 135 states have (on average 1.1925925925925926) internal successors, (161), 139 states have internal predecessors, (161), 0 states have call successors, (0), 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:41:44,897 INFO L74 IsIncluded]: Start isIncluded. First operand 182 states. Second operand has 140 states, 135 states have (on average 1.1925925925925926) internal successors, (161), 139 states have internal predecessors, (161), 0 states have call successors, (0), 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:41:44,897 INFO L87 Difference]: Start difference. First operand 182 states. Second operand has 140 states, 135 states have (on average 1.1925925925925926) internal successors, (161), 139 states have internal predecessors, (161), 0 states have call successors, (0), 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:41:44,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:41:44,899 INFO L93 Difference]: Finished difference Result 182 states and 205 transitions. [2022-02-20 23:41:44,899 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 205 transitions. [2022-02-20 23:41:44,899 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:41:44,899 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:41:44,900 INFO L74 IsIncluded]: Start isIncluded. First operand has 140 states, 135 states have (on average 1.1925925925925926) internal successors, (161), 139 states have internal predecessors, (161), 0 states have call successors, (0), 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 182 states. [2022-02-20 23:41:44,900 INFO L87 Difference]: Start difference. First operand has 140 states, 135 states have (on average 1.1925925925925926) internal successors, (161), 139 states have internal predecessors, (161), 0 states have call successors, (0), 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 182 states. [2022-02-20 23:41:44,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:41:44,902 INFO L93 Difference]: Finished difference Result 182 states and 205 transitions. [2022-02-20 23:41:44,902 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 205 transitions. [2022-02-20 23:41:44,902 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:41:44,903 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:41:44,903 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:41:44,903 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:41:44,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 135 states have (on average 1.1925925925925926) internal successors, (161), 139 states have internal predecessors, (161), 0 states have call successors, (0), 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:41:44,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 161 transitions. [2022-02-20 23:41:44,905 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 161 transitions. Word has length 24 [2022-02-20 23:41:44,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:41:44,905 INFO L470 AbstractCegarLoop]: Abstraction has 140 states and 161 transitions. [2022-02-20 23:41:44,905 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.0) internal successors, (24), 12 states have internal predecessors, (24), 0 states have call successors, (0), 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:41:44,905 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 161 transitions. [2022-02-20 23:41:44,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-02-20 23:41:44,906 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:41:44,906 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:41:44,915 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (25)] Forceful destruction successful, exit code 0 [2022-02-20 23:41:45,113 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:41:45,113 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2022-02-20 23:41:45,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:41:45,113 INFO L85 PathProgramCache]: Analyzing trace with hash 1664467980, now seen corresponding path program 1 times [2022-02-20 23:41:45,114 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:41:45,114 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [508132158] [2022-02-20 23:41:45,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:41:45,114 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:41:45,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:41:45,115 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:41:45,116 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2022-02-20 23:41:45,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:41:45,251 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 16 conjunts are in the unsatisfiable core [2022-02-20 23:41:45,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:41:45,263 INFO L286 TraceCheckSpWp]: Computing forward predicates...