/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loops/veris.c_OpenSER_cases1_stripFullBoth_arr.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-10 15:27:58,149 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 15:27:58,153 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 15:27:58,174 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 15:27:58,174 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 15:27:58,176 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 15:27:58,178 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 15:27:58,180 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 15:27:58,181 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 15:27:58,182 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 15:27:58,183 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 15:27:58,185 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 15:27:58,185 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 15:27:58,186 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 15:27:58,187 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 15:27:58,188 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 15:27:58,189 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 15:27:58,190 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 15:27:58,192 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 15:27:58,194 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 15:27:58,196 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 15:27:58,197 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 15:27:58,198 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 15:27:58,199 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 15:27:58,202 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 15:27:58,202 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 15:27:58,202 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 15:27:58,203 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 15:27:58,203 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 15:27:58,204 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 15:27:58,205 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 15:27:58,205 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 15:27:58,206 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 15:27:58,207 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 15:27:58,208 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 15:27:58,208 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 15:27:58,209 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 15:27:58,209 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 15:27:58,209 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 15:27:58,210 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 15:27:58,211 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 15:27:58,212 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-10 15:27:58,226 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 15:27:58,226 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 15:27:58,228 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-10 15:27:58,228 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-10 15:27:58,228 INFO L138 SettingsManager]: * Use SBE=true [2020-07-10 15:27:58,228 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 15:27:58,229 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 15:27:58,229 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 15:27:58,229 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 15:27:58,229 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 15:27:58,229 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 15:27:58,230 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 15:27:58,230 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 15:27:58,230 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 15:27:58,230 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 15:27:58,230 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 15:27:58,230 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 15:27:58,231 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 15:27:58,231 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-10 15:27:58,231 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 15:27:58,231 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 15:27:58,232 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 15:27:58,232 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 15:27:58,232 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-10 15:27:58,232 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-10 15:27:58,232 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-10 15:27:58,233 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-10 15:27:58,233 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 15:27:58,233 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-10 15:27:58,233 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-10 15:27:58,522 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 15:27:58,536 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 15:27:58,539 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 15:27:58,541 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 15:27:58,541 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 15:27:58,542 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/veris.c_OpenSER_cases1_stripFullBoth_arr.i [2020-07-10 15:27:58,606 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b1a4952e/abacaa97f1ac48d8b40490fdb866a998/FLAG3a24306eb [2020-07-10 15:27:59,048 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 15:27:59,050 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/veris.c_OpenSER_cases1_stripFullBoth_arr.i [2020-07-10 15:27:59,057 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b1a4952e/abacaa97f1ac48d8b40490fdb866a998/FLAG3a24306eb [2020-07-10 15:27:59,448 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b1a4952e/abacaa97f1ac48d8b40490fdb866a998 [2020-07-10 15:27:59,459 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 15:27:59,462 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 15:27:59,463 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 15:27:59,463 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 15:27:59,467 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 15:27:59,468 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:27:59" (1/1) ... [2020-07-10 15:27:59,472 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@334cde82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:27:59, skipping insertion in model container [2020-07-10 15:27:59,472 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:27:59" (1/1) ... [2020-07-10 15:27:59,480 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 15:27:59,509 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 15:27:59,786 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 15:27:59,797 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 15:27:59,917 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 15:27:59,941 INFO L208 MainTranslator]: Completed translation [2020-07-10 15:27:59,942 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:27:59 WrapperNode [2020-07-10 15:27:59,942 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 15:27:59,942 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 15:27:59,942 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 15:27:59,943 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 15:27:59,955 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:27:59" (1/1) ... [2020-07-10 15:27:59,955 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:27:59" (1/1) ... [2020-07-10 15:27:59,965 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:27:59" (1/1) ... [2020-07-10 15:27:59,965 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:27:59" (1/1) ... [2020-07-10 15:27:59,984 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:27:59" (1/1) ... [2020-07-10 15:27:59,998 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:27:59" (1/1) ... [2020-07-10 15:28:00,001 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:27:59" (1/1) ... [2020-07-10 15:28:00,006 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 15:28:00,007 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 15:28:00,007 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 15:28:00,007 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 15:28:00,008 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:27:59" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 15:28:00,077 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 15:28:00,078 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 15:28:00,078 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-10 15:28:00,078 INFO L138 BoogieDeclarations]: Found implementation of procedure r_strncpy [2020-07-10 15:28:00,078 INFO L138 BoogieDeclarations]: Found implementation of procedure parse_expression_list [2020-07-10 15:28:00,078 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 15:28:00,078 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 15:28:00,079 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2020-07-10 15:28:00,079 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-10 15:28:00,079 INFO L130 BoogieDeclarations]: Found specification of procedure strchr [2020-07-10 15:28:00,079 INFO L130 BoogieDeclarations]: Found specification of procedure strrchr [2020-07-10 15:28:00,079 INFO L130 BoogieDeclarations]: Found specification of procedure strstr [2020-07-10 15:28:00,079 INFO L130 BoogieDeclarations]: Found specification of procedure strncpy [2020-07-10 15:28:00,080 INFO L130 BoogieDeclarations]: Found specification of procedure strncpy_ptr [2020-07-10 15:28:00,080 INFO L130 BoogieDeclarations]: Found specification of procedure strcpy [2020-07-10 15:28:00,080 INFO L130 BoogieDeclarations]: Found specification of procedure strlen [2020-07-10 15:28:00,080 INFO L130 BoogieDeclarations]: Found specification of procedure strncmp [2020-07-10 15:28:00,080 INFO L130 BoogieDeclarations]: Found specification of procedure strcmp [2020-07-10 15:28:00,080 INFO L130 BoogieDeclarations]: Found specification of procedure strcat [2020-07-10 15:28:00,081 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2020-07-10 15:28:00,081 INFO L130 BoogieDeclarations]: Found specification of procedure isascii [2020-07-10 15:28:00,081 INFO L130 BoogieDeclarations]: Found specification of procedure isspace [2020-07-10 15:28:00,081 INFO L130 BoogieDeclarations]: Found specification of procedure getc [2020-07-10 15:28:00,081 INFO L130 BoogieDeclarations]: Found specification of procedure strrand [2020-07-10 15:28:00,081 INFO L130 BoogieDeclarations]: Found specification of procedure istrrand [2020-07-10 15:28:00,082 INFO L130 BoogieDeclarations]: Found specification of procedure istrchr [2020-07-10 15:28:00,082 INFO L130 BoogieDeclarations]: Found specification of procedure istrrchr [2020-07-10 15:28:00,082 INFO L130 BoogieDeclarations]: Found specification of procedure istrncmp [2020-07-10 15:28:00,082 INFO L130 BoogieDeclarations]: Found specification of procedure istrstr [2020-07-10 15:28:00,082 INFO L130 BoogieDeclarations]: Found specification of procedure r_strncpy [2020-07-10 15:28:00,082 INFO L130 BoogieDeclarations]: Found specification of procedure r_strcpy [2020-07-10 15:28:00,082 INFO L130 BoogieDeclarations]: Found specification of procedure r_strcat [2020-07-10 15:28:00,083 INFO L130 BoogieDeclarations]: Found specification of procedure r_strncat [2020-07-10 15:28:00,083 INFO L130 BoogieDeclarations]: Found specification of procedure r_memcpy [2020-07-10 15:28:00,083 INFO L130 BoogieDeclarations]: Found specification of procedure parse_expression_list [2020-07-10 15:28:00,083 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-10 15:28:00,083 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-10 15:28:00,083 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-10 15:28:00,084 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-10 15:28:00,084 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 15:28:00,084 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 15:28:00,084 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 15:28:00,677 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 15:28:00,678 INFO L295 CfgBuilder]: Removed 4 assume(true) statements. [2020-07-10 15:28:00,682 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 03:28:00 BoogieIcfgContainer [2020-07-10 15:28:00,683 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 15:28:00,684 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 15:28:00,684 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 15:28:00,687 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 15:28:00,688 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 03:27:59" (1/3) ... [2020-07-10 15:28:00,689 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ec8207a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 03:28:00, skipping insertion in model container [2020-07-10 15:28:00,689 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:27:59" (2/3) ... [2020-07-10 15:28:00,690 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ec8207a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 03:28:00, skipping insertion in model container [2020-07-10 15:28:00,690 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 03:28:00" (3/3) ... [2020-07-10 15:28:00,692 INFO L109 eAbstractionObserver]: Analyzing ICFG veris.c_OpenSER_cases1_stripFullBoth_arr.i [2020-07-10 15:28:00,702 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-10 15:28:00,710 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-10 15:28:00,725 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-10 15:28:00,749 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 15:28:00,749 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 15:28:00,749 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-10 15:28:00,749 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 15:28:00,750 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 15:28:00,750 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 15:28:00,750 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 15:28:00,750 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 15:28:00,771 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states. [2020-07-10 15:28:00,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2020-07-10 15:28:00,779 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:28:00,780 INFO L422 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, 1, 1, 1, 1, 1] [2020-07-10 15:28:00,780 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:28:00,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:28:00,787 INFO L82 PathProgramCache]: Analyzing trace with hash -1663477819, now seen corresponding path program 1 times [2020-07-10 15:28:00,798 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:28:00,799 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70282656] [2020-07-10 15:28:00,799 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:28:00,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:01,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:01,076 INFO L280 TraceCheckUtils]: 0: Hoare triple {67#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {58#true} is VALID [2020-07-10 15:28:01,077 INFO L280 TraceCheckUtils]: 1: Hoare triple {58#true} assume true; {58#true} is VALID [2020-07-10 15:28:01,077 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {58#true} {58#true} #151#return; {58#true} is VALID [2020-07-10 15:28:01,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:01,090 INFO L280 TraceCheckUtils]: 0: Hoare triple {58#true} ~dest.base, ~dest.offset := #in~dest.base, #in~dest.offset;~src.base, ~src.offset := #in~src.base, #in~src.offset;~n := #in~n;call #t~ret0.base, #t~ret0.offset := strncpy(~dest.base, ~dest.offset, ~src.base, ~src.offset, ~n);#res.base, #res.offset := #t~ret0.base, #t~ret0.offset;havoc #t~ret0.base, #t~ret0.offset; {58#true} is VALID [2020-07-10 15:28:01,091 INFO L280 TraceCheckUtils]: 1: Hoare triple {58#true} assume true; {58#true} is VALID [2020-07-10 15:28:01,091 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {58#true} {59#false} #147#return; {59#false} is VALID [2020-07-10 15:28:01,093 INFO L263 TraceCheckUtils]: 0: Hoare triple {58#true} call ULTIMATE.init(); {67#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 15:28:01,094 INFO L280 TraceCheckUtils]: 1: Hoare triple {67#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {58#true} is VALID [2020-07-10 15:28:01,094 INFO L280 TraceCheckUtils]: 2: Hoare triple {58#true} assume true; {58#true} is VALID [2020-07-10 15:28:01,094 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {58#true} {58#true} #151#return; {58#true} is VALID [2020-07-10 15:28:01,095 INFO L263 TraceCheckUtils]: 4: Hoare triple {58#true} call #t~ret23 := main(); {58#true} is VALID [2020-07-10 15:28:01,096 INFO L280 TraceCheckUtils]: 5: Hoare triple {58#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(9);~i~1 := 0; {63#(= 0 main_~i~1)} is VALID [2020-07-10 15:28:01,098 INFO L280 TraceCheckUtils]: 6: Hoare triple {63#(= 0 main_~i~1)} assume !(~i~1 < 8); {59#false} is VALID [2020-07-10 15:28:01,099 INFO L280 TraceCheckUtils]: 7: Hoare triple {59#false} call write~int(0, ~#A~0.base, 8 + ~#A~0.offset, 1); {59#false} is VALID [2020-07-10 15:28:01,099 INFO L263 TraceCheckUtils]: 8: Hoare triple {59#false} call #t~ret22 := parse_expression_list(~#A~0.base, ~#A~0.offset); {59#false} is VALID [2020-07-10 15:28:01,099 INFO L280 TraceCheckUtils]: 9: Hoare triple {59#false} ~str.base, ~str.offset := #in~str.base, #in~str.offset;~start~0 := 0;~i~0 := -1;~j~0 := -1;call ~#str2~0.base, ~#str2~0.offset := #Ultimate.allocOnStack(2); {59#false} is VALID [2020-07-10 15:28:01,100 INFO L280 TraceCheckUtils]: 10: Hoare triple {59#false} assume !(~str.base == 0 && ~str.offset == 0); {59#false} is VALID [2020-07-10 15:28:01,100 INFO L280 TraceCheckUtils]: 11: Hoare triple {59#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2;call #t~mem3 := read~int(~str.base, ~str.offset + ~i~0, 1);#t~switch4 := 0 == #t~mem3; {59#false} is VALID [2020-07-10 15:28:01,100 INFO L280 TraceCheckUtils]: 12: Hoare triple {59#false} assume #t~switch4; {59#false} is VALID [2020-07-10 15:28:01,101 INFO L280 TraceCheckUtils]: 13: Hoare triple {59#false} assume !true; {59#false} is VALID [2020-07-10 15:28:01,101 INFO L280 TraceCheckUtils]: 14: Hoare triple {59#false} call #t~mem9 := read~int(~str.base, ~str.offset + ~start~0, 1); {59#false} is VALID [2020-07-10 15:28:01,101 INFO L280 TraceCheckUtils]: 15: Hoare triple {59#false} assume 34 == #t~mem9;havoc #t~mem9;#t~post10 := ~start~0;~start~0 := 1 + #t~post10;havoc #t~post10; {59#false} is VALID [2020-07-10 15:28:01,102 INFO L280 TraceCheckUtils]: 16: Hoare triple {59#false} ~j~0 := ~i~0 - 1; {59#false} is VALID [2020-07-10 15:28:01,102 INFO L280 TraceCheckUtils]: 17: Hoare triple {59#false} assume !true; {59#false} is VALID [2020-07-10 15:28:01,102 INFO L280 TraceCheckUtils]: 18: Hoare triple {59#false} #t~short17 := 0 < ~j~0; {59#false} is VALID [2020-07-10 15:28:01,103 INFO L280 TraceCheckUtils]: 19: Hoare triple {59#false} assume #t~short17;call #t~mem16 := read~int(~str.base, ~str.offset + ~j~0, 1);#t~short17 := 34 == #t~mem16; {59#false} is VALID [2020-07-10 15:28:01,103 INFO L280 TraceCheckUtils]: 20: Hoare triple {59#false} assume !#t~short17;havoc #t~mem16;havoc #t~short17; {59#false} is VALID [2020-07-10 15:28:01,103 INFO L280 TraceCheckUtils]: 21: Hoare triple {59#false} assume ~start~0 <= ~j~0; {59#false} is VALID [2020-07-10 15:28:01,104 INFO L280 TraceCheckUtils]: 22: Hoare triple {59#false} assume !(1 + (~j~0 - ~start~0) >= 2); {59#false} is VALID [2020-07-10 15:28:01,104 INFO L263 TraceCheckUtils]: 23: Hoare triple {59#false} call #t~ret19.base, #t~ret19.offset := r_strncpy(~#str2~0.base, ~#str2~0.offset, ~str.base, ~str.offset + ~start~0, 1 + (~j~0 - ~start~0)); {58#true} is VALID [2020-07-10 15:28:01,104 INFO L280 TraceCheckUtils]: 24: Hoare triple {58#true} ~dest.base, ~dest.offset := #in~dest.base, #in~dest.offset;~src.base, ~src.offset := #in~src.base, #in~src.offset;~n := #in~n;call #t~ret0.base, #t~ret0.offset := strncpy(~dest.base, ~dest.offset, ~src.base, ~src.offset, ~n);#res.base, #res.offset := #t~ret0.base, #t~ret0.offset;havoc #t~ret0.base, #t~ret0.offset; {58#true} is VALID [2020-07-10 15:28:01,104 INFO L280 TraceCheckUtils]: 25: Hoare triple {58#true} assume true; {58#true} is VALID [2020-07-10 15:28:01,105 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {58#true} {59#false} #147#return; {59#false} is VALID [2020-07-10 15:28:01,105 INFO L280 TraceCheckUtils]: 27: Hoare triple {59#false} havoc #t~ret19.base, #t~ret19.offset; {59#false} is VALID [2020-07-10 15:28:01,105 INFO L263 TraceCheckUtils]: 28: Hoare triple {59#false} call __VERIFIER_assert((if 1 + (~j~0 - ~start~0) < 2 then 1 else 0)); {59#false} is VALID [2020-07-10 15:28:01,106 INFO L280 TraceCheckUtils]: 29: Hoare triple {59#false} ~cond := #in~cond; {59#false} is VALID [2020-07-10 15:28:01,106 INFO L280 TraceCheckUtils]: 30: Hoare triple {59#false} assume 0 == ~cond; {59#false} is VALID [2020-07-10 15:28:01,106 INFO L280 TraceCheckUtils]: 31: Hoare triple {59#false} assume !false; {59#false} is VALID [2020-07-10 15:28:01,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:28:01,112 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70282656] [2020-07-10 15:28:01,113 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:28:01,113 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-10 15:28:01,114 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720458967] [2020-07-10 15:28:01,120 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2020-07-10 15:28:01,124 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:28:01,128 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-10 15:28:01,194 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:28:01,194 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-10 15:28:01,194 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:28:01,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-10 15:28:01,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-10 15:28:01,205 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 4 states. [2020-07-10 15:28:01,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:01,628 INFO L93 Difference]: Finished difference Result 104 states and 142 transitions. [2020-07-10 15:28:01,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-10 15:28:01,628 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2020-07-10 15:28:01,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:28:01,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-10 15:28:01,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 142 transitions. [2020-07-10 15:28:01,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-10 15:28:01,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 142 transitions. [2020-07-10 15:28:01,652 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 142 transitions. [2020-07-10 15:28:01,866 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 142 edges. 142 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:28:01,888 INFO L225 Difference]: With dead ends: 104 [2020-07-10 15:28:01,889 INFO L226 Difference]: Without dead ends: 49 [2020-07-10 15:28:01,896 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-10 15:28:01,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2020-07-10 15:28:01,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 48. [2020-07-10 15:28:01,945 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:28:01,946 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand 48 states. [2020-07-10 15:28:01,946 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 48 states. [2020-07-10 15:28:01,947 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 48 states. [2020-07-10 15:28:01,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:01,953 INFO L93 Difference]: Finished difference Result 49 states and 59 transitions. [2020-07-10 15:28:01,953 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 59 transitions. [2020-07-10 15:28:01,953 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:28:01,954 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:28:01,954 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 49 states. [2020-07-10 15:28:01,954 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 49 states. [2020-07-10 15:28:01,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:01,960 INFO L93 Difference]: Finished difference Result 49 states and 59 transitions. [2020-07-10 15:28:01,960 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 59 transitions. [2020-07-10 15:28:01,961 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:28:01,961 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:28:01,961 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:28:01,962 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:28:01,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2020-07-10 15:28:01,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 58 transitions. [2020-07-10 15:28:01,967 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 58 transitions. Word has length 32 [2020-07-10 15:28:01,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:28:01,968 INFO L479 AbstractCegarLoop]: Abstraction has 48 states and 58 transitions. [2020-07-10 15:28:01,968 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-10 15:28:01,968 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 58 transitions. [2020-07-10 15:28:01,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-07-10 15:28:01,970 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:28:01,970 INFO L422 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:28:01,971 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 15:28:01,971 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:28:01,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:28:01,971 INFO L82 PathProgramCache]: Analyzing trace with hash 227833136, now seen corresponding path program 1 times [2020-07-10 15:28:01,972 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:28:01,972 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624645191] [2020-07-10 15:28:01,972 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:28:01,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:02,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:02,067 INFO L280 TraceCheckUtils]: 0: Hoare triple {369#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {359#true} is VALID [2020-07-10 15:28:02,067 INFO L280 TraceCheckUtils]: 1: Hoare triple {359#true} assume true; {359#true} is VALID [2020-07-10 15:28:02,067 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {359#true} {359#true} #151#return; {359#true} is VALID [2020-07-10 15:28:02,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:02,075 INFO L280 TraceCheckUtils]: 0: Hoare triple {359#true} ~dest.base, ~dest.offset := #in~dest.base, #in~dest.offset;~src.base, ~src.offset := #in~src.base, #in~src.offset;~n := #in~n;call #t~ret0.base, #t~ret0.offset := strncpy(~dest.base, ~dest.offset, ~src.base, ~src.offset, ~n);#res.base, #res.offset := #t~ret0.base, #t~ret0.offset;havoc #t~ret0.base, #t~ret0.offset; {359#true} is VALID [2020-07-10 15:28:02,076 INFO L280 TraceCheckUtils]: 1: Hoare triple {359#true} assume true; {359#true} is VALID [2020-07-10 15:28:02,076 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {359#true} {360#false} #147#return; {360#false} is VALID [2020-07-10 15:28:02,077 INFO L263 TraceCheckUtils]: 0: Hoare triple {359#true} call ULTIMATE.init(); {369#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 15:28:02,077 INFO L280 TraceCheckUtils]: 1: Hoare triple {369#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {359#true} is VALID [2020-07-10 15:28:02,078 INFO L280 TraceCheckUtils]: 2: Hoare triple {359#true} assume true; {359#true} is VALID [2020-07-10 15:28:02,078 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {359#true} {359#true} #151#return; {359#true} is VALID [2020-07-10 15:28:02,078 INFO L263 TraceCheckUtils]: 4: Hoare triple {359#true} call #t~ret23 := main(); {359#true} is VALID [2020-07-10 15:28:02,079 INFO L280 TraceCheckUtils]: 5: Hoare triple {359#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(9);~i~1 := 0; {364#(= 0 main_~i~1)} is VALID [2020-07-10 15:28:02,080 INFO L280 TraceCheckUtils]: 6: Hoare triple {364#(= 0 main_~i~1)} assume !!(~i~1 < 8);assume -128 <= #t~nondet21 && #t~nondet21 <= 127;call write~int(#t~nondet21, ~#A~0.base, ~#A~0.offset + ~i~1, 1);havoc #t~nondet21; {364#(= 0 main_~i~1)} is VALID [2020-07-10 15:28:02,081 INFO L280 TraceCheckUtils]: 7: Hoare triple {364#(= 0 main_~i~1)} #t~post20 := ~i~1;~i~1 := 1 + #t~post20;havoc #t~post20; {365#(<= main_~i~1 1)} is VALID [2020-07-10 15:28:02,082 INFO L280 TraceCheckUtils]: 8: Hoare triple {365#(<= main_~i~1 1)} assume !(~i~1 < 8); {360#false} is VALID [2020-07-10 15:28:02,082 INFO L280 TraceCheckUtils]: 9: Hoare triple {360#false} call write~int(0, ~#A~0.base, 8 + ~#A~0.offset, 1); {360#false} is VALID [2020-07-10 15:28:02,082 INFO L263 TraceCheckUtils]: 10: Hoare triple {360#false} call #t~ret22 := parse_expression_list(~#A~0.base, ~#A~0.offset); {360#false} is VALID [2020-07-10 15:28:02,083 INFO L280 TraceCheckUtils]: 11: Hoare triple {360#false} ~str.base, ~str.offset := #in~str.base, #in~str.offset;~start~0 := 0;~i~0 := -1;~j~0 := -1;call ~#str2~0.base, ~#str2~0.offset := #Ultimate.allocOnStack(2); {360#false} is VALID [2020-07-10 15:28:02,083 INFO L280 TraceCheckUtils]: 12: Hoare triple {360#false} assume !(~str.base == 0 && ~str.offset == 0); {360#false} is VALID [2020-07-10 15:28:02,083 INFO L280 TraceCheckUtils]: 13: Hoare triple {360#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2;call #t~mem3 := read~int(~str.base, ~str.offset + ~i~0, 1);#t~switch4 := 0 == #t~mem3; {360#false} is VALID [2020-07-10 15:28:02,083 INFO L280 TraceCheckUtils]: 14: Hoare triple {360#false} assume #t~switch4; {360#false} is VALID [2020-07-10 15:28:02,084 INFO L280 TraceCheckUtils]: 15: Hoare triple {360#false} call #t~mem5 := read~int(~str.base, ~str.offset + ~start~0, 1);#t~short7 := 32 == #t~mem5; {360#false} is VALID [2020-07-10 15:28:02,084 INFO L280 TraceCheckUtils]: 16: Hoare triple {360#false} assume #t~short7; {360#false} is VALID [2020-07-10 15:28:02,084 INFO L280 TraceCheckUtils]: 17: Hoare triple {360#false} assume !#t~short7;havoc #t~mem5;havoc #t~short7;havoc #t~mem6; {360#false} is VALID [2020-07-10 15:28:02,085 INFO L280 TraceCheckUtils]: 18: Hoare triple {360#false} call #t~mem9 := read~int(~str.base, ~str.offset + ~start~0, 1); {360#false} is VALID [2020-07-10 15:28:02,085 INFO L280 TraceCheckUtils]: 19: Hoare triple {360#false} assume 34 == #t~mem9;havoc #t~mem9;#t~post10 := ~start~0;~start~0 := 1 + #t~post10;havoc #t~post10; {360#false} is VALID [2020-07-10 15:28:02,085 INFO L280 TraceCheckUtils]: 20: Hoare triple {360#false} ~j~0 := ~i~0 - 1; {360#false} is VALID [2020-07-10 15:28:02,085 INFO L280 TraceCheckUtils]: 21: Hoare triple {360#false} #t~short14 := 0 < ~j~0; {360#false} is VALID [2020-07-10 15:28:02,086 INFO L280 TraceCheckUtils]: 22: Hoare triple {360#false} assume !#t~short14; {360#false} is VALID [2020-07-10 15:28:02,086 INFO L280 TraceCheckUtils]: 23: Hoare triple {360#false} assume !#t~short14;havoc #t~mem11;havoc #t~short13;havoc #t~short14;havoc #t~mem12; {360#false} is VALID [2020-07-10 15:28:02,086 INFO L280 TraceCheckUtils]: 24: Hoare triple {360#false} #t~short17 := 0 < ~j~0; {360#false} is VALID [2020-07-10 15:28:02,087 INFO L280 TraceCheckUtils]: 25: Hoare triple {360#false} assume #t~short17;call #t~mem16 := read~int(~str.base, ~str.offset + ~j~0, 1);#t~short17 := 34 == #t~mem16; {360#false} is VALID [2020-07-10 15:28:02,087 INFO L280 TraceCheckUtils]: 26: Hoare triple {360#false} assume !#t~short17;havoc #t~mem16;havoc #t~short17; {360#false} is VALID [2020-07-10 15:28:02,087 INFO L280 TraceCheckUtils]: 27: Hoare triple {360#false} assume ~start~0 <= ~j~0; {360#false} is VALID [2020-07-10 15:28:02,088 INFO L280 TraceCheckUtils]: 28: Hoare triple {360#false} assume !(1 + (~j~0 - ~start~0) >= 2); {360#false} is VALID [2020-07-10 15:28:02,088 INFO L263 TraceCheckUtils]: 29: Hoare triple {360#false} call #t~ret19.base, #t~ret19.offset := r_strncpy(~#str2~0.base, ~#str2~0.offset, ~str.base, ~str.offset + ~start~0, 1 + (~j~0 - ~start~0)); {359#true} is VALID [2020-07-10 15:28:02,088 INFO L280 TraceCheckUtils]: 30: Hoare triple {359#true} ~dest.base, ~dest.offset := #in~dest.base, #in~dest.offset;~src.base, ~src.offset := #in~src.base, #in~src.offset;~n := #in~n;call #t~ret0.base, #t~ret0.offset := strncpy(~dest.base, ~dest.offset, ~src.base, ~src.offset, ~n);#res.base, #res.offset := #t~ret0.base, #t~ret0.offset;havoc #t~ret0.base, #t~ret0.offset; {359#true} is VALID [2020-07-10 15:28:02,088 INFO L280 TraceCheckUtils]: 31: Hoare triple {359#true} assume true; {359#true} is VALID [2020-07-10 15:28:02,089 INFO L275 TraceCheckUtils]: 32: Hoare quadruple {359#true} {360#false} #147#return; {360#false} is VALID [2020-07-10 15:28:02,089 INFO L280 TraceCheckUtils]: 33: Hoare triple {360#false} havoc #t~ret19.base, #t~ret19.offset; {360#false} is VALID [2020-07-10 15:28:02,089 INFO L263 TraceCheckUtils]: 34: Hoare triple {360#false} call __VERIFIER_assert((if 1 + (~j~0 - ~start~0) < 2 then 1 else 0)); {360#false} is VALID [2020-07-10 15:28:02,089 INFO L280 TraceCheckUtils]: 35: Hoare triple {360#false} ~cond := #in~cond; {360#false} is VALID [2020-07-10 15:28:02,090 INFO L280 TraceCheckUtils]: 36: Hoare triple {360#false} assume 0 == ~cond; {360#false} is VALID [2020-07-10 15:28:02,090 INFO L280 TraceCheckUtils]: 37: Hoare triple {360#false} assume !false; {360#false} is VALID [2020-07-10 15:28:02,093 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:28:02,093 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624645191] [2020-07-10 15:28:02,093 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [211132802] [2020-07-10 15:28:02,093 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:28:02,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:02,165 INFO L264 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-10 15:28:02,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:02,190 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:28:02,247 INFO L263 TraceCheckUtils]: 0: Hoare triple {359#true} call ULTIMATE.init(); {359#true} is VALID [2020-07-10 15:28:02,247 INFO L280 TraceCheckUtils]: 1: Hoare triple {359#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {359#true} is VALID [2020-07-10 15:28:02,248 INFO L280 TraceCheckUtils]: 2: Hoare triple {359#true} assume true; {359#true} is VALID [2020-07-10 15:28:02,248 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {359#true} {359#true} #151#return; {359#true} is VALID [2020-07-10 15:28:02,248 INFO L263 TraceCheckUtils]: 4: Hoare triple {359#true} call #t~ret23 := main(); {359#true} is VALID [2020-07-10 15:28:02,249 INFO L280 TraceCheckUtils]: 5: Hoare triple {359#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(9);~i~1 := 0; {359#true} is VALID [2020-07-10 15:28:02,249 INFO L280 TraceCheckUtils]: 6: Hoare triple {359#true} assume !!(~i~1 < 8);assume -128 <= #t~nondet21 && #t~nondet21 <= 127;call write~int(#t~nondet21, ~#A~0.base, ~#A~0.offset + ~i~1, 1);havoc #t~nondet21; {359#true} is VALID [2020-07-10 15:28:02,249 INFO L280 TraceCheckUtils]: 7: Hoare triple {359#true} #t~post20 := ~i~1;~i~1 := 1 + #t~post20;havoc #t~post20; {359#true} is VALID [2020-07-10 15:28:02,250 INFO L280 TraceCheckUtils]: 8: Hoare triple {359#true} assume !(~i~1 < 8); {359#true} is VALID [2020-07-10 15:28:02,250 INFO L280 TraceCheckUtils]: 9: Hoare triple {359#true} call write~int(0, ~#A~0.base, 8 + ~#A~0.offset, 1); {359#true} is VALID [2020-07-10 15:28:02,251 INFO L263 TraceCheckUtils]: 10: Hoare triple {359#true} call #t~ret22 := parse_expression_list(~#A~0.base, ~#A~0.offset); {359#true} is VALID [2020-07-10 15:28:02,251 INFO L280 TraceCheckUtils]: 11: Hoare triple {359#true} ~str.base, ~str.offset := #in~str.base, #in~str.offset;~start~0 := 0;~i~0 := -1;~j~0 := -1;call ~#str2~0.base, ~#str2~0.offset := #Ultimate.allocOnStack(2); {359#true} is VALID [2020-07-10 15:28:02,251 INFO L280 TraceCheckUtils]: 12: Hoare triple {359#true} assume !(~str.base == 0 && ~str.offset == 0); {359#true} is VALID [2020-07-10 15:28:02,251 INFO L280 TraceCheckUtils]: 13: Hoare triple {359#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2;call #t~mem3 := read~int(~str.base, ~str.offset + ~i~0, 1);#t~switch4 := 0 == #t~mem3; {359#true} is VALID [2020-07-10 15:28:02,252 INFO L280 TraceCheckUtils]: 14: Hoare triple {359#true} assume #t~switch4; {359#true} is VALID [2020-07-10 15:28:02,252 INFO L280 TraceCheckUtils]: 15: Hoare triple {359#true} call #t~mem5 := read~int(~str.base, ~str.offset + ~start~0, 1);#t~short7 := 32 == #t~mem5; {359#true} is VALID [2020-07-10 15:28:02,253 INFO L280 TraceCheckUtils]: 16: Hoare triple {359#true} assume #t~short7; {421#|parse_expression_list_#t~short7|} is VALID [2020-07-10 15:28:02,254 INFO L280 TraceCheckUtils]: 17: Hoare triple {421#|parse_expression_list_#t~short7|} assume !#t~short7;havoc #t~mem5;havoc #t~short7;havoc #t~mem6; {360#false} is VALID [2020-07-10 15:28:02,254 INFO L280 TraceCheckUtils]: 18: Hoare triple {360#false} call #t~mem9 := read~int(~str.base, ~str.offset + ~start~0, 1); {360#false} is VALID [2020-07-10 15:28:02,255 INFO L280 TraceCheckUtils]: 19: Hoare triple {360#false} assume 34 == #t~mem9;havoc #t~mem9;#t~post10 := ~start~0;~start~0 := 1 + #t~post10;havoc #t~post10; {360#false} is VALID [2020-07-10 15:28:02,255 INFO L280 TraceCheckUtils]: 20: Hoare triple {360#false} ~j~0 := ~i~0 - 1; {360#false} is VALID [2020-07-10 15:28:02,256 INFO L280 TraceCheckUtils]: 21: Hoare triple {360#false} #t~short14 := 0 < ~j~0; {360#false} is VALID [2020-07-10 15:28:02,256 INFO L280 TraceCheckUtils]: 22: Hoare triple {360#false} assume !#t~short14; {360#false} is VALID [2020-07-10 15:28:02,256 INFO L280 TraceCheckUtils]: 23: Hoare triple {360#false} assume !#t~short14;havoc #t~mem11;havoc #t~short13;havoc #t~short14;havoc #t~mem12; {360#false} is VALID [2020-07-10 15:28:02,257 INFO L280 TraceCheckUtils]: 24: Hoare triple {360#false} #t~short17 := 0 < ~j~0; {360#false} is VALID [2020-07-10 15:28:02,257 INFO L280 TraceCheckUtils]: 25: Hoare triple {360#false} assume #t~short17;call #t~mem16 := read~int(~str.base, ~str.offset + ~j~0, 1);#t~short17 := 34 == #t~mem16; {360#false} is VALID [2020-07-10 15:28:02,257 INFO L280 TraceCheckUtils]: 26: Hoare triple {360#false} assume !#t~short17;havoc #t~mem16;havoc #t~short17; {360#false} is VALID [2020-07-10 15:28:02,258 INFO L280 TraceCheckUtils]: 27: Hoare triple {360#false} assume ~start~0 <= ~j~0; {360#false} is VALID [2020-07-10 15:28:02,258 INFO L280 TraceCheckUtils]: 28: Hoare triple {360#false} assume !(1 + (~j~0 - ~start~0) >= 2); {360#false} is VALID [2020-07-10 15:28:02,258 INFO L263 TraceCheckUtils]: 29: Hoare triple {360#false} call #t~ret19.base, #t~ret19.offset := r_strncpy(~#str2~0.base, ~#str2~0.offset, ~str.base, ~str.offset + ~start~0, 1 + (~j~0 - ~start~0)); {360#false} is VALID [2020-07-10 15:28:02,259 INFO L280 TraceCheckUtils]: 30: Hoare triple {360#false} ~dest.base, ~dest.offset := #in~dest.base, #in~dest.offset;~src.base, ~src.offset := #in~src.base, #in~src.offset;~n := #in~n;call #t~ret0.base, #t~ret0.offset := strncpy(~dest.base, ~dest.offset, ~src.base, ~src.offset, ~n);#res.base, #res.offset := #t~ret0.base, #t~ret0.offset;havoc #t~ret0.base, #t~ret0.offset; {360#false} is VALID [2020-07-10 15:28:02,259 INFO L280 TraceCheckUtils]: 31: Hoare triple {360#false} assume true; {360#false} is VALID [2020-07-10 15:28:02,259 INFO L275 TraceCheckUtils]: 32: Hoare quadruple {360#false} {360#false} #147#return; {360#false} is VALID [2020-07-10 15:28:02,260 INFO L280 TraceCheckUtils]: 33: Hoare triple {360#false} havoc #t~ret19.base, #t~ret19.offset; {360#false} is VALID [2020-07-10 15:28:02,260 INFO L263 TraceCheckUtils]: 34: Hoare triple {360#false} call __VERIFIER_assert((if 1 + (~j~0 - ~start~0) < 2 then 1 else 0)); {360#false} is VALID [2020-07-10 15:28:02,260 INFO L280 TraceCheckUtils]: 35: Hoare triple {360#false} ~cond := #in~cond; {360#false} is VALID [2020-07-10 15:28:02,261 INFO L280 TraceCheckUtils]: 36: Hoare triple {360#false} assume 0 == ~cond; {360#false} is VALID [2020-07-10 15:28:02,261 INFO L280 TraceCheckUtils]: 37: Hoare triple {360#false} assume !false; {360#false} is VALID [2020-07-10 15:28:02,264 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-10 15:28:02,264 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-10 15:28:02,264 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2020-07-10 15:28:02,266 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542469632] [2020-07-10 15:28:02,267 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2020-07-10 15:28:02,267 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:28:02,268 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 15:28:02,331 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:28:02,332 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 15:28:02,332 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:28:02,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 15:28:02,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-07-10 15:28:02,333 INFO L87 Difference]: Start difference. First operand 48 states and 58 transitions. Second operand 3 states. [2020-07-10 15:28:02,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:02,463 INFO L93 Difference]: Finished difference Result 84 states and 104 transitions. [2020-07-10 15:28:02,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 15:28:02,464 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2020-07-10 15:28:02,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:28:02,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:28:02,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 103 transitions. [2020-07-10 15:28:02,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:28:02,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 103 transitions. [2020-07-10 15:28:02,473 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 103 transitions. [2020-07-10 15:28:02,601 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:28:02,603 INFO L225 Difference]: With dead ends: 84 [2020-07-10 15:28:02,604 INFO L226 Difference]: Without dead ends: 49 [2020-07-10 15:28:02,605 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-07-10 15:28:02,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2020-07-10 15:28:02,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2020-07-10 15:28:02,627 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:28:02,627 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand 49 states. [2020-07-10 15:28:02,628 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 49 states. [2020-07-10 15:28:02,628 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 49 states. [2020-07-10 15:28:02,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:02,631 INFO L93 Difference]: Finished difference Result 49 states and 59 transitions. [2020-07-10 15:28:02,631 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 59 transitions. [2020-07-10 15:28:02,632 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:28:02,632 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:28:02,632 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 49 states. [2020-07-10 15:28:02,633 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 49 states. [2020-07-10 15:28:02,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:02,636 INFO L93 Difference]: Finished difference Result 49 states and 59 transitions. [2020-07-10 15:28:02,636 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 59 transitions. [2020-07-10 15:28:02,637 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:28:02,637 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:28:02,637 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:28:02,638 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:28:02,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2020-07-10 15:28:02,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 59 transitions. [2020-07-10 15:28:02,641 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 59 transitions. Word has length 38 [2020-07-10 15:28:02,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:28:02,642 INFO L479 AbstractCegarLoop]: Abstraction has 49 states and 59 transitions. [2020-07-10 15:28:02,642 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 15:28:02,642 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 59 transitions. [2020-07-10 15:28:02,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-07-10 15:28:02,643 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:28:02,643 INFO L422 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:28:02,857 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2020-07-10 15:28:02,858 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:28:02,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:28:02,859 INFO L82 PathProgramCache]: Analyzing trace with hash 446687854, now seen corresponding path program 1 times [2020-07-10 15:28:02,859 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:28:02,860 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832432786] [2020-07-10 15:28:02,860 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:28:02,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:02,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:02,965 INFO L280 TraceCheckUtils]: 0: Hoare triple {762#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {752#true} is VALID [2020-07-10 15:28:02,965 INFO L280 TraceCheckUtils]: 1: Hoare triple {752#true} assume true; {752#true} is VALID [2020-07-10 15:28:02,966 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {752#true} {752#true} #151#return; {752#true} is VALID [2020-07-10 15:28:02,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:02,983 INFO L280 TraceCheckUtils]: 0: Hoare triple {752#true} ~dest.base, ~dest.offset := #in~dest.base, #in~dest.offset;~src.base, ~src.offset := #in~src.base, #in~src.offset;~n := #in~n;call #t~ret0.base, #t~ret0.offset := strncpy(~dest.base, ~dest.offset, ~src.base, ~src.offset, ~n);#res.base, #res.offset := #t~ret0.base, #t~ret0.offset;havoc #t~ret0.base, #t~ret0.offset; {752#true} is VALID [2020-07-10 15:28:02,984 INFO L280 TraceCheckUtils]: 1: Hoare triple {752#true} assume true; {752#true} is VALID [2020-07-10 15:28:02,984 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {752#true} {753#false} #147#return; {753#false} is VALID [2020-07-10 15:28:02,985 INFO L263 TraceCheckUtils]: 0: Hoare triple {752#true} call ULTIMATE.init(); {762#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 15:28:02,986 INFO L280 TraceCheckUtils]: 1: Hoare triple {762#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {752#true} is VALID [2020-07-10 15:28:02,986 INFO L280 TraceCheckUtils]: 2: Hoare triple {752#true} assume true; {752#true} is VALID [2020-07-10 15:28:02,986 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {752#true} {752#true} #151#return; {752#true} is VALID [2020-07-10 15:28:02,987 INFO L263 TraceCheckUtils]: 4: Hoare triple {752#true} call #t~ret23 := main(); {752#true} is VALID [2020-07-10 15:28:02,988 INFO L280 TraceCheckUtils]: 5: Hoare triple {752#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(9);~i~1 := 0; {757#(= 0 main_~i~1)} is VALID [2020-07-10 15:28:02,988 INFO L280 TraceCheckUtils]: 6: Hoare triple {757#(= 0 main_~i~1)} assume !!(~i~1 < 8);assume -128 <= #t~nondet21 && #t~nondet21 <= 127;call write~int(#t~nondet21, ~#A~0.base, ~#A~0.offset + ~i~1, 1);havoc #t~nondet21; {757#(= 0 main_~i~1)} is VALID [2020-07-10 15:28:02,989 INFO L280 TraceCheckUtils]: 7: Hoare triple {757#(= 0 main_~i~1)} #t~post20 := ~i~1;~i~1 := 1 + #t~post20;havoc #t~post20; {758#(<= main_~i~1 1)} is VALID [2020-07-10 15:28:02,990 INFO L280 TraceCheckUtils]: 8: Hoare triple {758#(<= main_~i~1 1)} assume !(~i~1 < 8); {753#false} is VALID [2020-07-10 15:28:02,990 INFO L280 TraceCheckUtils]: 9: Hoare triple {753#false} call write~int(0, ~#A~0.base, 8 + ~#A~0.offset, 1); {753#false} is VALID [2020-07-10 15:28:02,991 INFO L263 TraceCheckUtils]: 10: Hoare triple {753#false} call #t~ret22 := parse_expression_list(~#A~0.base, ~#A~0.offset); {753#false} is VALID [2020-07-10 15:28:02,991 INFO L280 TraceCheckUtils]: 11: Hoare triple {753#false} ~str.base, ~str.offset := #in~str.base, #in~str.offset;~start~0 := 0;~i~0 := -1;~j~0 := -1;call ~#str2~0.base, ~#str2~0.offset := #Ultimate.allocOnStack(2); {753#false} is VALID [2020-07-10 15:28:02,991 INFO L280 TraceCheckUtils]: 12: Hoare triple {753#false} assume !(~str.base == 0 && ~str.offset == 0); {753#false} is VALID [2020-07-10 15:28:02,991 INFO L280 TraceCheckUtils]: 13: Hoare triple {753#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2;call #t~mem3 := read~int(~str.base, ~str.offset + ~i~0, 1);#t~switch4 := 0 == #t~mem3; {753#false} is VALID [2020-07-10 15:28:02,992 INFO L280 TraceCheckUtils]: 14: Hoare triple {753#false} assume #t~switch4; {753#false} is VALID [2020-07-10 15:28:02,992 INFO L280 TraceCheckUtils]: 15: Hoare triple {753#false} call #t~mem5 := read~int(~str.base, ~str.offset + ~start~0, 1);#t~short7 := 32 == #t~mem5; {753#false} is VALID [2020-07-10 15:28:02,992 INFO L280 TraceCheckUtils]: 16: Hoare triple {753#false} assume !#t~short7;call #t~mem6 := read~int(~str.base, ~str.offset + ~start~0, 1);#t~short7 := 9 == #t~mem6; {753#false} is VALID [2020-07-10 15:28:02,993 INFO L280 TraceCheckUtils]: 17: Hoare triple {753#false} assume !#t~short7;havoc #t~mem5;havoc #t~short7;havoc #t~mem6; {753#false} is VALID [2020-07-10 15:28:02,993 INFO L280 TraceCheckUtils]: 18: Hoare triple {753#false} call #t~mem9 := read~int(~str.base, ~str.offset + ~start~0, 1); {753#false} is VALID [2020-07-10 15:28:02,993 INFO L280 TraceCheckUtils]: 19: Hoare triple {753#false} assume 34 == #t~mem9;havoc #t~mem9;#t~post10 := ~start~0;~start~0 := 1 + #t~post10;havoc #t~post10; {753#false} is VALID [2020-07-10 15:28:02,993 INFO L280 TraceCheckUtils]: 20: Hoare triple {753#false} ~j~0 := ~i~0 - 1; {753#false} is VALID [2020-07-10 15:28:02,994 INFO L280 TraceCheckUtils]: 21: Hoare triple {753#false} #t~short14 := 0 < ~j~0; {753#false} is VALID [2020-07-10 15:28:02,994 INFO L280 TraceCheckUtils]: 22: Hoare triple {753#false} assume !#t~short14; {753#false} is VALID [2020-07-10 15:28:02,994 INFO L280 TraceCheckUtils]: 23: Hoare triple {753#false} assume !#t~short14;havoc #t~mem11;havoc #t~short13;havoc #t~short14;havoc #t~mem12; {753#false} is VALID [2020-07-10 15:28:02,994 INFO L280 TraceCheckUtils]: 24: Hoare triple {753#false} #t~short17 := 0 < ~j~0; {753#false} is VALID [2020-07-10 15:28:02,995 INFO L280 TraceCheckUtils]: 25: Hoare triple {753#false} assume #t~short17;call #t~mem16 := read~int(~str.base, ~str.offset + ~j~0, 1);#t~short17 := 34 == #t~mem16; {753#false} is VALID [2020-07-10 15:28:02,995 INFO L280 TraceCheckUtils]: 26: Hoare triple {753#false} assume !#t~short17;havoc #t~mem16;havoc #t~short17; {753#false} is VALID [2020-07-10 15:28:02,995 INFO L280 TraceCheckUtils]: 27: Hoare triple {753#false} assume ~start~0 <= ~j~0; {753#false} is VALID [2020-07-10 15:28:02,996 INFO L280 TraceCheckUtils]: 28: Hoare triple {753#false} assume !(1 + (~j~0 - ~start~0) >= 2); {753#false} is VALID [2020-07-10 15:28:02,996 INFO L263 TraceCheckUtils]: 29: Hoare triple {753#false} call #t~ret19.base, #t~ret19.offset := r_strncpy(~#str2~0.base, ~#str2~0.offset, ~str.base, ~str.offset + ~start~0, 1 + (~j~0 - ~start~0)); {752#true} is VALID [2020-07-10 15:28:02,996 INFO L280 TraceCheckUtils]: 30: Hoare triple {752#true} ~dest.base, ~dest.offset := #in~dest.base, #in~dest.offset;~src.base, ~src.offset := #in~src.base, #in~src.offset;~n := #in~n;call #t~ret0.base, #t~ret0.offset := strncpy(~dest.base, ~dest.offset, ~src.base, ~src.offset, ~n);#res.base, #res.offset := #t~ret0.base, #t~ret0.offset;havoc #t~ret0.base, #t~ret0.offset; {752#true} is VALID [2020-07-10 15:28:02,996 INFO L280 TraceCheckUtils]: 31: Hoare triple {752#true} assume true; {752#true} is VALID [2020-07-10 15:28:02,997 INFO L275 TraceCheckUtils]: 32: Hoare quadruple {752#true} {753#false} #147#return; {753#false} is VALID [2020-07-10 15:28:02,997 INFO L280 TraceCheckUtils]: 33: Hoare triple {753#false} havoc #t~ret19.base, #t~ret19.offset; {753#false} is VALID [2020-07-10 15:28:02,997 INFO L263 TraceCheckUtils]: 34: Hoare triple {753#false} call __VERIFIER_assert((if 1 + (~j~0 - ~start~0) < 2 then 1 else 0)); {753#false} is VALID [2020-07-10 15:28:02,997 INFO L280 TraceCheckUtils]: 35: Hoare triple {753#false} ~cond := #in~cond; {753#false} is VALID [2020-07-10 15:28:02,998 INFO L280 TraceCheckUtils]: 36: Hoare triple {753#false} assume 0 == ~cond; {753#false} is VALID [2020-07-10 15:28:02,998 INFO L280 TraceCheckUtils]: 37: Hoare triple {753#false} assume !false; {753#false} is VALID [2020-07-10 15:28:03,000 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:28:03,000 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832432786] [2020-07-10 15:28:03,001 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [669288425] [2020-07-10 15:28:03,001 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:28:03,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:03,069 INFO L264 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-10 15:28:03,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:03,084 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:28:03,149 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-10 15:28:03,176 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-10 15:28:03,206 INFO L263 TraceCheckUtils]: 0: Hoare triple {752#true} call ULTIMATE.init(); {752#true} is VALID [2020-07-10 15:28:03,206 INFO L280 TraceCheckUtils]: 1: Hoare triple {752#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {752#true} is VALID [2020-07-10 15:28:03,206 INFO L280 TraceCheckUtils]: 2: Hoare triple {752#true} assume true; {752#true} is VALID [2020-07-10 15:28:03,207 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {752#true} {752#true} #151#return; {752#true} is VALID [2020-07-10 15:28:03,207 INFO L263 TraceCheckUtils]: 4: Hoare triple {752#true} call #t~ret23 := main(); {752#true} is VALID [2020-07-10 15:28:03,207 INFO L280 TraceCheckUtils]: 5: Hoare triple {752#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(9);~i~1 := 0; {752#true} is VALID [2020-07-10 15:28:03,207 INFO L280 TraceCheckUtils]: 6: Hoare triple {752#true} assume !!(~i~1 < 8);assume -128 <= #t~nondet21 && #t~nondet21 <= 127;call write~int(#t~nondet21, ~#A~0.base, ~#A~0.offset + ~i~1, 1);havoc #t~nondet21; {752#true} is VALID [2020-07-10 15:28:03,208 INFO L280 TraceCheckUtils]: 7: Hoare triple {752#true} #t~post20 := ~i~1;~i~1 := 1 + #t~post20;havoc #t~post20; {752#true} is VALID [2020-07-10 15:28:03,208 INFO L280 TraceCheckUtils]: 8: Hoare triple {752#true} assume !(~i~1 < 8); {752#true} is VALID [2020-07-10 15:28:03,208 INFO L280 TraceCheckUtils]: 9: Hoare triple {752#true} call write~int(0, ~#A~0.base, 8 + ~#A~0.offset, 1); {752#true} is VALID [2020-07-10 15:28:03,208 INFO L263 TraceCheckUtils]: 10: Hoare triple {752#true} call #t~ret22 := parse_expression_list(~#A~0.base, ~#A~0.offset); {752#true} is VALID [2020-07-10 15:28:03,209 INFO L280 TraceCheckUtils]: 11: Hoare triple {752#true} ~str.base, ~str.offset := #in~str.base, #in~str.offset;~start~0 := 0;~i~0 := -1;~j~0 := -1;call ~#str2~0.base, ~#str2~0.offset := #Ultimate.allocOnStack(2); {752#true} is VALID [2020-07-10 15:28:03,209 INFO L280 TraceCheckUtils]: 12: Hoare triple {752#true} assume !(~str.base == 0 && ~str.offset == 0); {752#true} is VALID [2020-07-10 15:28:03,209 INFO L280 TraceCheckUtils]: 13: Hoare triple {752#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2;call #t~mem3 := read~int(~str.base, ~str.offset + ~i~0, 1);#t~switch4 := 0 == #t~mem3; {752#true} is VALID [2020-07-10 15:28:03,210 INFO L280 TraceCheckUtils]: 14: Hoare triple {752#true} assume #t~switch4; {752#true} is VALID [2020-07-10 15:28:03,210 INFO L280 TraceCheckUtils]: 15: Hoare triple {752#true} call #t~mem5 := read~int(~str.base, ~str.offset + ~start~0, 1);#t~short7 := 32 == #t~mem5; {752#true} is VALID [2020-07-10 15:28:03,210 INFO L280 TraceCheckUtils]: 16: Hoare triple {752#true} assume !#t~short7;call #t~mem6 := read~int(~str.base, ~str.offset + ~start~0, 1);#t~short7 := 9 == #t~mem6; {752#true} is VALID [2020-07-10 15:28:03,210 INFO L280 TraceCheckUtils]: 17: Hoare triple {752#true} assume !#t~short7;havoc #t~mem5;havoc #t~short7;havoc #t~mem6; {752#true} is VALID [2020-07-10 15:28:03,211 INFO L280 TraceCheckUtils]: 18: Hoare triple {752#true} call #t~mem9 := read~int(~str.base, ~str.offset + ~start~0, 1); {752#true} is VALID [2020-07-10 15:28:03,211 INFO L280 TraceCheckUtils]: 19: Hoare triple {752#true} assume 34 == #t~mem9;havoc #t~mem9;#t~post10 := ~start~0;~start~0 := 1 + #t~post10;havoc #t~post10; {752#true} is VALID [2020-07-10 15:28:03,211 INFO L280 TraceCheckUtils]: 20: Hoare triple {752#true} ~j~0 := ~i~0 - 1; {752#true} is VALID [2020-07-10 15:28:03,212 INFO L280 TraceCheckUtils]: 21: Hoare triple {752#true} #t~short14 := 0 < ~j~0; {829#(or (and (<= parse_expression_list_~j~0 0) (not |parse_expression_list_#t~short14|)) (and (< 0 parse_expression_list_~j~0) |parse_expression_list_#t~short14|))} is VALID [2020-07-10 15:28:03,213 INFO L280 TraceCheckUtils]: 22: Hoare triple {829#(or (and (<= parse_expression_list_~j~0 0) (not |parse_expression_list_#t~short14|)) (and (< 0 parse_expression_list_~j~0) |parse_expression_list_#t~short14|))} assume !#t~short14; {833#(<= parse_expression_list_~j~0 0)} is VALID [2020-07-10 15:28:03,214 INFO L280 TraceCheckUtils]: 23: Hoare triple {833#(<= parse_expression_list_~j~0 0)} assume !#t~short14;havoc #t~mem11;havoc #t~short13;havoc #t~short14;havoc #t~mem12; {833#(<= parse_expression_list_~j~0 0)} is VALID [2020-07-10 15:28:03,215 INFO L280 TraceCheckUtils]: 24: Hoare triple {833#(<= parse_expression_list_~j~0 0)} #t~short17 := 0 < ~j~0; {840#(not |parse_expression_list_#t~short17|)} is VALID [2020-07-10 15:28:03,216 INFO L280 TraceCheckUtils]: 25: Hoare triple {840#(not |parse_expression_list_#t~short17|)} assume #t~short17;call #t~mem16 := read~int(~str.base, ~str.offset + ~j~0, 1);#t~short17 := 34 == #t~mem16; {753#false} is VALID [2020-07-10 15:28:03,216 INFO L280 TraceCheckUtils]: 26: Hoare triple {753#false} assume !#t~short17;havoc #t~mem16;havoc #t~short17; {753#false} is VALID [2020-07-10 15:28:03,216 INFO L280 TraceCheckUtils]: 27: Hoare triple {753#false} assume ~start~0 <= ~j~0; {753#false} is VALID [2020-07-10 15:28:03,216 INFO L280 TraceCheckUtils]: 28: Hoare triple {753#false} assume !(1 + (~j~0 - ~start~0) >= 2); {753#false} is VALID [2020-07-10 15:28:03,217 INFO L263 TraceCheckUtils]: 29: Hoare triple {753#false} call #t~ret19.base, #t~ret19.offset := r_strncpy(~#str2~0.base, ~#str2~0.offset, ~str.base, ~str.offset + ~start~0, 1 + (~j~0 - ~start~0)); {753#false} is VALID [2020-07-10 15:28:03,217 INFO L280 TraceCheckUtils]: 30: Hoare triple {753#false} ~dest.base, ~dest.offset := #in~dest.base, #in~dest.offset;~src.base, ~src.offset := #in~src.base, #in~src.offset;~n := #in~n;call #t~ret0.base, #t~ret0.offset := strncpy(~dest.base, ~dest.offset, ~src.base, ~src.offset, ~n);#res.base, #res.offset := #t~ret0.base, #t~ret0.offset;havoc #t~ret0.base, #t~ret0.offset; {753#false} is VALID [2020-07-10 15:28:03,217 INFO L280 TraceCheckUtils]: 31: Hoare triple {753#false} assume true; {753#false} is VALID [2020-07-10 15:28:03,217 INFO L275 TraceCheckUtils]: 32: Hoare quadruple {753#false} {753#false} #147#return; {753#false} is VALID [2020-07-10 15:28:03,218 INFO L280 TraceCheckUtils]: 33: Hoare triple {753#false} havoc #t~ret19.base, #t~ret19.offset; {753#false} is VALID [2020-07-10 15:28:03,218 INFO L263 TraceCheckUtils]: 34: Hoare triple {753#false} call __VERIFIER_assert((if 1 + (~j~0 - ~start~0) < 2 then 1 else 0)); {753#false} is VALID [2020-07-10 15:28:03,218 INFO L280 TraceCheckUtils]: 35: Hoare triple {753#false} ~cond := #in~cond; {753#false} is VALID [2020-07-10 15:28:03,218 INFO L280 TraceCheckUtils]: 36: Hoare triple {753#false} assume 0 == ~cond; {753#false} is VALID [2020-07-10 15:28:03,219 INFO L280 TraceCheckUtils]: 37: Hoare triple {753#false} assume !false; {753#false} is VALID [2020-07-10 15:28:03,221 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-10 15:28:03,221 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-10 15:28:03,221 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2020-07-10 15:28:03,221 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440801276] [2020-07-10 15:28:03,222 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2020-07-10 15:28:03,222 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:28:03,223 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-10 15:28:03,268 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:28:03,268 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-10 15:28:03,268 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:28:03,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-10 15:28:03,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-07-10 15:28:03,269 INFO L87 Difference]: Start difference. First operand 49 states and 59 transitions. Second operand 5 states. [2020-07-10 15:28:03,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:03,648 INFO L93 Difference]: Finished difference Result 109 states and 138 transitions. [2020-07-10 15:28:03,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-10 15:28:03,648 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2020-07-10 15:28:03,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:28:03,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 15:28:03,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 134 transitions. [2020-07-10 15:28:03,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 15:28:03,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 134 transitions. [2020-07-10 15:28:03,666 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 134 transitions. [2020-07-10 15:28:03,826 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 134 edges. 134 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:28:03,828 INFO L225 Difference]: With dead ends: 109 [2020-07-10 15:28:03,829 INFO L226 Difference]: Without dead ends: 73 [2020-07-10 15:28:03,831 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2020-07-10 15:28:03,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2020-07-10 15:28:03,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 53. [2020-07-10 15:28:03,857 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:28:03,857 INFO L82 GeneralOperation]: Start isEquivalent. First operand 73 states. Second operand 53 states. [2020-07-10 15:28:03,857 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand 53 states. [2020-07-10 15:28:03,857 INFO L87 Difference]: Start difference. First operand 73 states. Second operand 53 states. [2020-07-10 15:28:03,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:03,866 INFO L93 Difference]: Finished difference Result 73 states and 89 transitions. [2020-07-10 15:28:03,866 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 89 transitions. [2020-07-10 15:28:03,868 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:28:03,868 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:28:03,868 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand 73 states. [2020-07-10 15:28:03,868 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 73 states. [2020-07-10 15:28:03,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:03,879 INFO L93 Difference]: Finished difference Result 73 states and 89 transitions. [2020-07-10 15:28:03,880 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 89 transitions. [2020-07-10 15:28:03,881 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:28:03,881 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:28:03,881 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:28:03,881 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:28:03,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2020-07-10 15:28:03,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 63 transitions. [2020-07-10 15:28:03,885 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 63 transitions. Word has length 38 [2020-07-10 15:28:03,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:28:03,887 INFO L479 AbstractCegarLoop]: Abstraction has 53 states and 63 transitions. [2020-07-10 15:28:03,888 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-10 15:28:03,888 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 63 transitions. [2020-07-10 15:28:03,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-07-10 15:28:03,891 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:28:03,891 INFO L422 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:28:04,104 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:28:04,105 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:28:04,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:28:04,106 INFO L82 PathProgramCache]: Analyzing trace with hash -140118160, now seen corresponding path program 1 times [2020-07-10 15:28:04,106 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:28:04,107 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393533894] [2020-07-10 15:28:04,107 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:28:04,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:04,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:04,174 INFO L280 TraceCheckUtils]: 0: Hoare triple {1242#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1232#true} is VALID [2020-07-10 15:28:04,174 INFO L280 TraceCheckUtils]: 1: Hoare triple {1232#true} assume true; {1232#true} is VALID [2020-07-10 15:28:04,174 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1232#true} {1232#true} #151#return; {1232#true} is VALID [2020-07-10 15:28:04,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:04,183 INFO L280 TraceCheckUtils]: 0: Hoare triple {1232#true} ~dest.base, ~dest.offset := #in~dest.base, #in~dest.offset;~src.base, ~src.offset := #in~src.base, #in~src.offset;~n := #in~n;call #t~ret0.base, #t~ret0.offset := strncpy(~dest.base, ~dest.offset, ~src.base, ~src.offset, ~n);#res.base, #res.offset := #t~ret0.base, #t~ret0.offset;havoc #t~ret0.base, #t~ret0.offset; {1232#true} is VALID [2020-07-10 15:28:04,183 INFO L280 TraceCheckUtils]: 1: Hoare triple {1232#true} assume true; {1232#true} is VALID [2020-07-10 15:28:04,183 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1232#true} {1233#false} #147#return; {1233#false} is VALID [2020-07-10 15:28:04,184 INFO L263 TraceCheckUtils]: 0: Hoare triple {1232#true} call ULTIMATE.init(); {1242#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 15:28:04,185 INFO L280 TraceCheckUtils]: 1: Hoare triple {1242#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1232#true} is VALID [2020-07-10 15:28:04,185 INFO L280 TraceCheckUtils]: 2: Hoare triple {1232#true} assume true; {1232#true} is VALID [2020-07-10 15:28:04,185 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1232#true} {1232#true} #151#return; {1232#true} is VALID [2020-07-10 15:28:04,185 INFO L263 TraceCheckUtils]: 4: Hoare triple {1232#true} call #t~ret23 := main(); {1232#true} is VALID [2020-07-10 15:28:04,186 INFO L280 TraceCheckUtils]: 5: Hoare triple {1232#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(9);~i~1 := 0; {1237#(= 0 main_~i~1)} is VALID [2020-07-10 15:28:04,187 INFO L280 TraceCheckUtils]: 6: Hoare triple {1237#(= 0 main_~i~1)} assume !!(~i~1 < 8);assume -128 <= #t~nondet21 && #t~nondet21 <= 127;call write~int(#t~nondet21, ~#A~0.base, ~#A~0.offset + ~i~1, 1);havoc #t~nondet21; {1237#(= 0 main_~i~1)} is VALID [2020-07-10 15:28:04,188 INFO L280 TraceCheckUtils]: 7: Hoare triple {1237#(= 0 main_~i~1)} #t~post20 := ~i~1;~i~1 := 1 + #t~post20;havoc #t~post20; {1238#(<= main_~i~1 1)} is VALID [2020-07-10 15:28:04,189 INFO L280 TraceCheckUtils]: 8: Hoare triple {1238#(<= main_~i~1 1)} assume !(~i~1 < 8); {1233#false} is VALID [2020-07-10 15:28:04,189 INFO L280 TraceCheckUtils]: 9: Hoare triple {1233#false} call write~int(0, ~#A~0.base, 8 + ~#A~0.offset, 1); {1233#false} is VALID [2020-07-10 15:28:04,189 INFO L263 TraceCheckUtils]: 10: Hoare triple {1233#false} call #t~ret22 := parse_expression_list(~#A~0.base, ~#A~0.offset); {1233#false} is VALID [2020-07-10 15:28:04,189 INFO L280 TraceCheckUtils]: 11: Hoare triple {1233#false} ~str.base, ~str.offset := #in~str.base, #in~str.offset;~start~0 := 0;~i~0 := -1;~j~0 := -1;call ~#str2~0.base, ~#str2~0.offset := #Ultimate.allocOnStack(2); {1233#false} is VALID [2020-07-10 15:28:04,190 INFO L280 TraceCheckUtils]: 12: Hoare triple {1233#false} assume !(~str.base == 0 && ~str.offset == 0); {1233#false} is VALID [2020-07-10 15:28:04,190 INFO L280 TraceCheckUtils]: 13: Hoare triple {1233#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2;call #t~mem3 := read~int(~str.base, ~str.offset + ~i~0, 1);#t~switch4 := 0 == #t~mem3; {1233#false} is VALID [2020-07-10 15:28:04,190 INFO L280 TraceCheckUtils]: 14: Hoare triple {1233#false} assume #t~switch4; {1233#false} is VALID [2020-07-10 15:28:04,190 INFO L280 TraceCheckUtils]: 15: Hoare triple {1233#false} call #t~mem5 := read~int(~str.base, ~str.offset + ~start~0, 1);#t~short7 := 32 == #t~mem5; {1233#false} is VALID [2020-07-10 15:28:04,191 INFO L280 TraceCheckUtils]: 16: Hoare triple {1233#false} assume !#t~short7;call #t~mem6 := read~int(~str.base, ~str.offset + ~start~0, 1);#t~short7 := 9 == #t~mem6; {1233#false} is VALID [2020-07-10 15:28:04,191 INFO L280 TraceCheckUtils]: 17: Hoare triple {1233#false} assume !#t~short7;havoc #t~mem5;havoc #t~short7;havoc #t~mem6; {1233#false} is VALID [2020-07-10 15:28:04,191 INFO L280 TraceCheckUtils]: 18: Hoare triple {1233#false} call #t~mem9 := read~int(~str.base, ~str.offset + ~start~0, 1); {1233#false} is VALID [2020-07-10 15:28:04,191 INFO L280 TraceCheckUtils]: 19: Hoare triple {1233#false} assume 34 == #t~mem9;havoc #t~mem9;#t~post10 := ~start~0;~start~0 := 1 + #t~post10;havoc #t~post10; {1233#false} is VALID [2020-07-10 15:28:04,192 INFO L280 TraceCheckUtils]: 20: Hoare triple {1233#false} ~j~0 := ~i~0 - 1; {1233#false} is VALID [2020-07-10 15:28:04,192 INFO L280 TraceCheckUtils]: 21: Hoare triple {1233#false} #t~short14 := 0 < ~j~0; {1233#false} is VALID [2020-07-10 15:28:04,192 INFO L280 TraceCheckUtils]: 22: Hoare triple {1233#false} assume !#t~short14; {1233#false} is VALID [2020-07-10 15:28:04,192 INFO L280 TraceCheckUtils]: 23: Hoare triple {1233#false} assume !#t~short14;havoc #t~mem11;havoc #t~short13;havoc #t~short14;havoc #t~mem12; {1233#false} is VALID [2020-07-10 15:28:04,193 INFO L280 TraceCheckUtils]: 24: Hoare triple {1233#false} #t~short17 := 0 < ~j~0; {1233#false} is VALID [2020-07-10 15:28:04,193 INFO L280 TraceCheckUtils]: 25: Hoare triple {1233#false} assume !#t~short17; {1233#false} is VALID [2020-07-10 15:28:04,193 INFO L280 TraceCheckUtils]: 26: Hoare triple {1233#false} assume !#t~short17;havoc #t~mem16;havoc #t~short17; {1233#false} is VALID [2020-07-10 15:28:04,193 INFO L280 TraceCheckUtils]: 27: Hoare triple {1233#false} assume ~start~0 <= ~j~0; {1233#false} is VALID [2020-07-10 15:28:04,194 INFO L280 TraceCheckUtils]: 28: Hoare triple {1233#false} assume !(1 + (~j~0 - ~start~0) >= 2); {1233#false} is VALID [2020-07-10 15:28:04,194 INFO L263 TraceCheckUtils]: 29: Hoare triple {1233#false} call #t~ret19.base, #t~ret19.offset := r_strncpy(~#str2~0.base, ~#str2~0.offset, ~str.base, ~str.offset + ~start~0, 1 + (~j~0 - ~start~0)); {1232#true} is VALID [2020-07-10 15:28:04,194 INFO L280 TraceCheckUtils]: 30: Hoare triple {1232#true} ~dest.base, ~dest.offset := #in~dest.base, #in~dest.offset;~src.base, ~src.offset := #in~src.base, #in~src.offset;~n := #in~n;call #t~ret0.base, #t~ret0.offset := strncpy(~dest.base, ~dest.offset, ~src.base, ~src.offset, ~n);#res.base, #res.offset := #t~ret0.base, #t~ret0.offset;havoc #t~ret0.base, #t~ret0.offset; {1232#true} is VALID [2020-07-10 15:28:04,194 INFO L280 TraceCheckUtils]: 31: Hoare triple {1232#true} assume true; {1232#true} is VALID [2020-07-10 15:28:04,195 INFO L275 TraceCheckUtils]: 32: Hoare quadruple {1232#true} {1233#false} #147#return; {1233#false} is VALID [2020-07-10 15:28:04,195 INFO L280 TraceCheckUtils]: 33: Hoare triple {1233#false} havoc #t~ret19.base, #t~ret19.offset; {1233#false} is VALID [2020-07-10 15:28:04,195 INFO L263 TraceCheckUtils]: 34: Hoare triple {1233#false} call __VERIFIER_assert((if 1 + (~j~0 - ~start~0) < 2 then 1 else 0)); {1233#false} is VALID [2020-07-10 15:28:04,195 INFO L280 TraceCheckUtils]: 35: Hoare triple {1233#false} ~cond := #in~cond; {1233#false} is VALID [2020-07-10 15:28:04,196 INFO L280 TraceCheckUtils]: 36: Hoare triple {1233#false} assume 0 == ~cond; {1233#false} is VALID [2020-07-10 15:28:04,196 INFO L280 TraceCheckUtils]: 37: Hoare triple {1233#false} assume !false; {1233#false} is VALID [2020-07-10 15:28:04,197 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:28:04,198 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393533894] [2020-07-10 15:28:04,198 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [175791367] [2020-07-10 15:28:04,198 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:28:04,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:04,266 INFO L264 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-10 15:28:04,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:04,279 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:28:04,330 INFO L263 TraceCheckUtils]: 0: Hoare triple {1232#true} call ULTIMATE.init(); {1232#true} is VALID [2020-07-10 15:28:04,331 INFO L280 TraceCheckUtils]: 1: Hoare triple {1232#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1232#true} is VALID [2020-07-10 15:28:04,331 INFO L280 TraceCheckUtils]: 2: Hoare triple {1232#true} assume true; {1232#true} is VALID [2020-07-10 15:28:04,331 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1232#true} {1232#true} #151#return; {1232#true} is VALID [2020-07-10 15:28:04,332 INFO L263 TraceCheckUtils]: 4: Hoare triple {1232#true} call #t~ret23 := main(); {1232#true} is VALID [2020-07-10 15:28:04,333 INFO L280 TraceCheckUtils]: 5: Hoare triple {1232#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(9);~i~1 := 0; {1261#(<= main_~i~1 0)} is VALID [2020-07-10 15:28:04,333 INFO L280 TraceCheckUtils]: 6: Hoare triple {1261#(<= main_~i~1 0)} assume !!(~i~1 < 8);assume -128 <= #t~nondet21 && #t~nondet21 <= 127;call write~int(#t~nondet21, ~#A~0.base, ~#A~0.offset + ~i~1, 1);havoc #t~nondet21; {1261#(<= main_~i~1 0)} is VALID [2020-07-10 15:28:04,334 INFO L280 TraceCheckUtils]: 7: Hoare triple {1261#(<= main_~i~1 0)} #t~post20 := ~i~1;~i~1 := 1 + #t~post20;havoc #t~post20; {1238#(<= main_~i~1 1)} is VALID [2020-07-10 15:28:04,335 INFO L280 TraceCheckUtils]: 8: Hoare triple {1238#(<= main_~i~1 1)} assume !(~i~1 < 8); {1233#false} is VALID [2020-07-10 15:28:04,335 INFO L280 TraceCheckUtils]: 9: Hoare triple {1233#false} call write~int(0, ~#A~0.base, 8 + ~#A~0.offset, 1); {1233#false} is VALID [2020-07-10 15:28:04,336 INFO L263 TraceCheckUtils]: 10: Hoare triple {1233#false} call #t~ret22 := parse_expression_list(~#A~0.base, ~#A~0.offset); {1233#false} is VALID [2020-07-10 15:28:04,336 INFO L280 TraceCheckUtils]: 11: Hoare triple {1233#false} ~str.base, ~str.offset := #in~str.base, #in~str.offset;~start~0 := 0;~i~0 := -1;~j~0 := -1;call ~#str2~0.base, ~#str2~0.offset := #Ultimate.allocOnStack(2); {1233#false} is VALID [2020-07-10 15:28:04,336 INFO L280 TraceCheckUtils]: 12: Hoare triple {1233#false} assume !(~str.base == 0 && ~str.offset == 0); {1233#false} is VALID [2020-07-10 15:28:04,336 INFO L280 TraceCheckUtils]: 13: Hoare triple {1233#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2;call #t~mem3 := read~int(~str.base, ~str.offset + ~i~0, 1);#t~switch4 := 0 == #t~mem3; {1233#false} is VALID [2020-07-10 15:28:04,337 INFO L280 TraceCheckUtils]: 14: Hoare triple {1233#false} assume #t~switch4; {1233#false} is VALID [2020-07-10 15:28:04,337 INFO L280 TraceCheckUtils]: 15: Hoare triple {1233#false} call #t~mem5 := read~int(~str.base, ~str.offset + ~start~0, 1);#t~short7 := 32 == #t~mem5; {1233#false} is VALID [2020-07-10 15:28:04,337 INFO L280 TraceCheckUtils]: 16: Hoare triple {1233#false} assume !#t~short7;call #t~mem6 := read~int(~str.base, ~str.offset + ~start~0, 1);#t~short7 := 9 == #t~mem6; {1233#false} is VALID [2020-07-10 15:28:04,338 INFO L280 TraceCheckUtils]: 17: Hoare triple {1233#false} assume !#t~short7;havoc #t~mem5;havoc #t~short7;havoc #t~mem6; {1233#false} is VALID [2020-07-10 15:28:04,338 INFO L280 TraceCheckUtils]: 18: Hoare triple {1233#false} call #t~mem9 := read~int(~str.base, ~str.offset + ~start~0, 1); {1233#false} is VALID [2020-07-10 15:28:04,338 INFO L280 TraceCheckUtils]: 19: Hoare triple {1233#false} assume 34 == #t~mem9;havoc #t~mem9;#t~post10 := ~start~0;~start~0 := 1 + #t~post10;havoc #t~post10; {1233#false} is VALID [2020-07-10 15:28:04,338 INFO L280 TraceCheckUtils]: 20: Hoare triple {1233#false} ~j~0 := ~i~0 - 1; {1233#false} is VALID [2020-07-10 15:28:04,338 INFO L280 TraceCheckUtils]: 21: Hoare triple {1233#false} #t~short14 := 0 < ~j~0; {1233#false} is VALID [2020-07-10 15:28:04,339 INFO L280 TraceCheckUtils]: 22: Hoare triple {1233#false} assume !#t~short14; {1233#false} is VALID [2020-07-10 15:28:04,339 INFO L280 TraceCheckUtils]: 23: Hoare triple {1233#false} assume !#t~short14;havoc #t~mem11;havoc #t~short13;havoc #t~short14;havoc #t~mem12; {1233#false} is VALID [2020-07-10 15:28:04,339 INFO L280 TraceCheckUtils]: 24: Hoare triple {1233#false} #t~short17 := 0 < ~j~0; {1233#false} is VALID [2020-07-10 15:28:04,339 INFO L280 TraceCheckUtils]: 25: Hoare triple {1233#false} assume !#t~short17; {1233#false} is VALID [2020-07-10 15:28:04,340 INFO L280 TraceCheckUtils]: 26: Hoare triple {1233#false} assume !#t~short17;havoc #t~mem16;havoc #t~short17; {1233#false} is VALID [2020-07-10 15:28:04,340 INFO L280 TraceCheckUtils]: 27: Hoare triple {1233#false} assume ~start~0 <= ~j~0; {1233#false} is VALID [2020-07-10 15:28:04,340 INFO L280 TraceCheckUtils]: 28: Hoare triple {1233#false} assume !(1 + (~j~0 - ~start~0) >= 2); {1233#false} is VALID [2020-07-10 15:28:04,340 INFO L263 TraceCheckUtils]: 29: Hoare triple {1233#false} call #t~ret19.base, #t~ret19.offset := r_strncpy(~#str2~0.base, ~#str2~0.offset, ~str.base, ~str.offset + ~start~0, 1 + (~j~0 - ~start~0)); {1233#false} is VALID [2020-07-10 15:28:04,341 INFO L280 TraceCheckUtils]: 30: Hoare triple {1233#false} ~dest.base, ~dest.offset := #in~dest.base, #in~dest.offset;~src.base, ~src.offset := #in~src.base, #in~src.offset;~n := #in~n;call #t~ret0.base, #t~ret0.offset := strncpy(~dest.base, ~dest.offset, ~src.base, ~src.offset, ~n);#res.base, #res.offset := #t~ret0.base, #t~ret0.offset;havoc #t~ret0.base, #t~ret0.offset; {1233#false} is VALID [2020-07-10 15:28:04,341 INFO L280 TraceCheckUtils]: 31: Hoare triple {1233#false} assume true; {1233#false} is VALID [2020-07-10 15:28:04,341 INFO L275 TraceCheckUtils]: 32: Hoare quadruple {1233#false} {1233#false} #147#return; {1233#false} is VALID [2020-07-10 15:28:04,341 INFO L280 TraceCheckUtils]: 33: Hoare triple {1233#false} havoc #t~ret19.base, #t~ret19.offset; {1233#false} is VALID [2020-07-10 15:28:04,341 INFO L263 TraceCheckUtils]: 34: Hoare triple {1233#false} call __VERIFIER_assert((if 1 + (~j~0 - ~start~0) < 2 then 1 else 0)); {1233#false} is VALID [2020-07-10 15:28:04,342 INFO L280 TraceCheckUtils]: 35: Hoare triple {1233#false} ~cond := #in~cond; {1233#false} is VALID [2020-07-10 15:28:04,342 INFO L280 TraceCheckUtils]: 36: Hoare triple {1233#false} assume 0 == ~cond; {1233#false} is VALID [2020-07-10 15:28:04,342 INFO L280 TraceCheckUtils]: 37: Hoare triple {1233#false} assume !false; {1233#false} is VALID [2020-07-10 15:28:04,344 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:28:04,344 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-10 15:28:04,344 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 6 [2020-07-10 15:28:04,344 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623102285] [2020-07-10 15:28:04,345 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 38 [2020-07-10 15:28:04,346 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:28:04,346 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-10 15:28:04,395 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:28:04,395 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-10 15:28:04,396 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:28:04,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-10 15:28:04,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-07-10 15:28:04,396 INFO L87 Difference]: Start difference. First operand 53 states and 63 transitions. Second operand 6 states. [2020-07-10 15:28:04,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:04,768 INFO L93 Difference]: Finished difference Result 100 states and 120 transitions. [2020-07-10 15:28:04,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-10 15:28:04,768 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 38 [2020-07-10 15:28:04,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:28:04,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 15:28:04,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 110 transitions. [2020-07-10 15:28:04,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 15:28:04,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 110 transitions. [2020-07-10 15:28:04,775 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 110 transitions. [2020-07-10 15:28:04,909 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:28:04,912 INFO L225 Difference]: With dead ends: 100 [2020-07-10 15:28:04,912 INFO L226 Difference]: Without dead ends: 56 [2020-07-10 15:28:04,915 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-07-10 15:28:04,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2020-07-10 15:28:04,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 55. [2020-07-10 15:28:04,936 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:28:04,936 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand 55 states. [2020-07-10 15:28:04,936 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 55 states. [2020-07-10 15:28:04,936 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 55 states. [2020-07-10 15:28:04,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:04,938 INFO L93 Difference]: Finished difference Result 56 states and 66 transitions. [2020-07-10 15:28:04,938 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 66 transitions. [2020-07-10 15:28:04,939 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:28:04,939 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:28:04,939 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 56 states. [2020-07-10 15:28:04,939 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 56 states. [2020-07-10 15:28:04,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:04,943 INFO L93 Difference]: Finished difference Result 56 states and 66 transitions. [2020-07-10 15:28:04,943 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 66 transitions. [2020-07-10 15:28:04,944 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:28:04,944 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:28:04,944 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:28:04,944 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:28:04,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2020-07-10 15:28:04,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 65 transitions. [2020-07-10 15:28:04,948 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 65 transitions. Word has length 38 [2020-07-10 15:28:04,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:28:04,949 INFO L479 AbstractCegarLoop]: Abstraction has 55 states and 65 transitions. [2020-07-10 15:28:04,949 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-10 15:28:04,949 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 65 transitions. [2020-07-10 15:28:04,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-07-10 15:28:04,950 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:28:04,950 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:28:05,164 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:28:05,165 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:28:05,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:28:05,166 INFO L82 PathProgramCache]: Analyzing trace with hash -1477568014, now seen corresponding path program 2 times [2020-07-10 15:28:05,166 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:28:05,167 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316284452] [2020-07-10 15:28:05,167 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:28:05,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:05,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:05,274 INFO L280 TraceCheckUtils]: 0: Hoare triple {1676#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1665#true} is VALID [2020-07-10 15:28:05,275 INFO L280 TraceCheckUtils]: 1: Hoare triple {1665#true} assume true; {1665#true} is VALID [2020-07-10 15:28:05,275 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1665#true} {1665#true} #151#return; {1665#true} is VALID [2020-07-10 15:28:05,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:05,281 INFO L280 TraceCheckUtils]: 0: Hoare triple {1665#true} ~dest.base, ~dest.offset := #in~dest.base, #in~dest.offset;~src.base, ~src.offset := #in~src.base, #in~src.offset;~n := #in~n;call #t~ret0.base, #t~ret0.offset := strncpy(~dest.base, ~dest.offset, ~src.base, ~src.offset, ~n);#res.base, #res.offset := #t~ret0.base, #t~ret0.offset;havoc #t~ret0.base, #t~ret0.offset; {1665#true} is VALID [2020-07-10 15:28:05,282 INFO L280 TraceCheckUtils]: 1: Hoare triple {1665#true} assume true; {1665#true} is VALID [2020-07-10 15:28:05,282 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1665#true} {1666#false} #147#return; {1666#false} is VALID [2020-07-10 15:28:05,283 INFO L263 TraceCheckUtils]: 0: Hoare triple {1665#true} call ULTIMATE.init(); {1676#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 15:28:05,283 INFO L280 TraceCheckUtils]: 1: Hoare triple {1676#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1665#true} is VALID [2020-07-10 15:28:05,284 INFO L280 TraceCheckUtils]: 2: Hoare triple {1665#true} assume true; {1665#true} is VALID [2020-07-10 15:28:05,284 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1665#true} {1665#true} #151#return; {1665#true} is VALID [2020-07-10 15:28:05,284 INFO L263 TraceCheckUtils]: 4: Hoare triple {1665#true} call #t~ret23 := main(); {1665#true} is VALID [2020-07-10 15:28:05,285 INFO L280 TraceCheckUtils]: 5: Hoare triple {1665#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(9);~i~1 := 0; {1670#(= 0 main_~i~1)} is VALID [2020-07-10 15:28:05,287 INFO L280 TraceCheckUtils]: 6: Hoare triple {1670#(= 0 main_~i~1)} assume !!(~i~1 < 8);assume -128 <= #t~nondet21 && #t~nondet21 <= 127;call write~int(#t~nondet21, ~#A~0.base, ~#A~0.offset + ~i~1, 1);havoc #t~nondet21; {1670#(= 0 main_~i~1)} is VALID [2020-07-10 15:28:05,288 INFO L280 TraceCheckUtils]: 7: Hoare triple {1670#(= 0 main_~i~1)} #t~post20 := ~i~1;~i~1 := 1 + #t~post20;havoc #t~post20; {1671#(<= main_~i~1 1)} is VALID [2020-07-10 15:28:05,289 INFO L280 TraceCheckUtils]: 8: Hoare triple {1671#(<= main_~i~1 1)} assume !!(~i~1 < 8);assume -128 <= #t~nondet21 && #t~nondet21 <= 127;call write~int(#t~nondet21, ~#A~0.base, ~#A~0.offset + ~i~1, 1);havoc #t~nondet21; {1671#(<= main_~i~1 1)} is VALID [2020-07-10 15:28:05,290 INFO L280 TraceCheckUtils]: 9: Hoare triple {1671#(<= main_~i~1 1)} #t~post20 := ~i~1;~i~1 := 1 + #t~post20;havoc #t~post20; {1672#(<= main_~i~1 2)} is VALID [2020-07-10 15:28:05,291 INFO L280 TraceCheckUtils]: 10: Hoare triple {1672#(<= main_~i~1 2)} assume !(~i~1 < 8); {1666#false} is VALID [2020-07-10 15:28:05,291 INFO L280 TraceCheckUtils]: 11: Hoare triple {1666#false} call write~int(0, ~#A~0.base, 8 + ~#A~0.offset, 1); {1666#false} is VALID [2020-07-10 15:28:05,292 INFO L263 TraceCheckUtils]: 12: Hoare triple {1666#false} call #t~ret22 := parse_expression_list(~#A~0.base, ~#A~0.offset); {1666#false} is VALID [2020-07-10 15:28:05,292 INFO L280 TraceCheckUtils]: 13: Hoare triple {1666#false} ~str.base, ~str.offset := #in~str.base, #in~str.offset;~start~0 := 0;~i~0 := -1;~j~0 := -1;call ~#str2~0.base, ~#str2~0.offset := #Ultimate.allocOnStack(2); {1666#false} is VALID [2020-07-10 15:28:05,292 INFO L280 TraceCheckUtils]: 14: Hoare triple {1666#false} assume !(~str.base == 0 && ~str.offset == 0); {1666#false} is VALID [2020-07-10 15:28:05,292 INFO L280 TraceCheckUtils]: 15: Hoare triple {1666#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2;call #t~mem3 := read~int(~str.base, ~str.offset + ~i~0, 1);#t~switch4 := 0 == #t~mem3; {1666#false} is VALID [2020-07-10 15:28:05,293 INFO L280 TraceCheckUtils]: 16: Hoare triple {1666#false} assume #t~switch4; {1666#false} is VALID [2020-07-10 15:28:05,293 INFO L280 TraceCheckUtils]: 17: Hoare triple {1666#false} call #t~mem5 := read~int(~str.base, ~str.offset + ~start~0, 1);#t~short7 := 32 == #t~mem5; {1666#false} is VALID [2020-07-10 15:28:05,293 INFO L280 TraceCheckUtils]: 18: Hoare triple {1666#false} assume !#t~short7;call #t~mem6 := read~int(~str.base, ~str.offset + ~start~0, 1);#t~short7 := 9 == #t~mem6; {1666#false} is VALID [2020-07-10 15:28:05,293 INFO L280 TraceCheckUtils]: 19: Hoare triple {1666#false} assume !#t~short7;havoc #t~mem5;havoc #t~short7;havoc #t~mem6; {1666#false} is VALID [2020-07-10 15:28:05,294 INFO L280 TraceCheckUtils]: 20: Hoare triple {1666#false} call #t~mem9 := read~int(~str.base, ~str.offset + ~start~0, 1); {1666#false} is VALID [2020-07-10 15:28:05,294 INFO L280 TraceCheckUtils]: 21: Hoare triple {1666#false} assume 34 == #t~mem9;havoc #t~mem9;#t~post10 := ~start~0;~start~0 := 1 + #t~post10;havoc #t~post10; {1666#false} is VALID [2020-07-10 15:28:05,294 INFO L280 TraceCheckUtils]: 22: Hoare triple {1666#false} ~j~0 := ~i~0 - 1; {1666#false} is VALID [2020-07-10 15:28:05,294 INFO L280 TraceCheckUtils]: 23: Hoare triple {1666#false} #t~short14 := 0 < ~j~0; {1666#false} is VALID [2020-07-10 15:28:05,294 INFO L280 TraceCheckUtils]: 24: Hoare triple {1666#false} assume !#t~short14; {1666#false} is VALID [2020-07-10 15:28:05,295 INFO L280 TraceCheckUtils]: 25: Hoare triple {1666#false} assume !#t~short14;havoc #t~mem11;havoc #t~short13;havoc #t~short14;havoc #t~mem12; {1666#false} is VALID [2020-07-10 15:28:05,295 INFO L280 TraceCheckUtils]: 26: Hoare triple {1666#false} #t~short17 := 0 < ~j~0; {1666#false} is VALID [2020-07-10 15:28:05,295 INFO L280 TraceCheckUtils]: 27: Hoare triple {1666#false} assume !#t~short17; {1666#false} is VALID [2020-07-10 15:28:05,295 INFO L280 TraceCheckUtils]: 28: Hoare triple {1666#false} assume !#t~short17;havoc #t~mem16;havoc #t~short17; {1666#false} is VALID [2020-07-10 15:28:05,296 INFO L280 TraceCheckUtils]: 29: Hoare triple {1666#false} assume ~start~0 <= ~j~0; {1666#false} is VALID [2020-07-10 15:28:05,296 INFO L280 TraceCheckUtils]: 30: Hoare triple {1666#false} assume !(1 + (~j~0 - ~start~0) >= 2); {1666#false} is VALID [2020-07-10 15:28:05,296 INFO L263 TraceCheckUtils]: 31: Hoare triple {1666#false} call #t~ret19.base, #t~ret19.offset := r_strncpy(~#str2~0.base, ~#str2~0.offset, ~str.base, ~str.offset + ~start~0, 1 + (~j~0 - ~start~0)); {1665#true} is VALID [2020-07-10 15:28:05,296 INFO L280 TraceCheckUtils]: 32: Hoare triple {1665#true} ~dest.base, ~dest.offset := #in~dest.base, #in~dest.offset;~src.base, ~src.offset := #in~src.base, #in~src.offset;~n := #in~n;call #t~ret0.base, #t~ret0.offset := strncpy(~dest.base, ~dest.offset, ~src.base, ~src.offset, ~n);#res.base, #res.offset := #t~ret0.base, #t~ret0.offset;havoc #t~ret0.base, #t~ret0.offset; {1665#true} is VALID [2020-07-10 15:28:05,297 INFO L280 TraceCheckUtils]: 33: Hoare triple {1665#true} assume true; {1665#true} is VALID [2020-07-10 15:28:05,297 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {1665#true} {1666#false} #147#return; {1666#false} is VALID [2020-07-10 15:28:05,297 INFO L280 TraceCheckUtils]: 35: Hoare triple {1666#false} havoc #t~ret19.base, #t~ret19.offset; {1666#false} is VALID [2020-07-10 15:28:05,297 INFO L263 TraceCheckUtils]: 36: Hoare triple {1666#false} call __VERIFIER_assert((if 1 + (~j~0 - ~start~0) < 2 then 1 else 0)); {1666#false} is VALID [2020-07-10 15:28:05,298 INFO L280 TraceCheckUtils]: 37: Hoare triple {1666#false} ~cond := #in~cond; {1666#false} is VALID [2020-07-10 15:28:05,298 INFO L280 TraceCheckUtils]: 38: Hoare triple {1666#false} assume 0 == ~cond; {1666#false} is VALID [2020-07-10 15:28:05,298 INFO L280 TraceCheckUtils]: 39: Hoare triple {1666#false} assume !false; {1666#false} is VALID [2020-07-10 15:28:05,299 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:28:05,300 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316284452] [2020-07-10 15:28:05,300 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1252750905] [2020-07-10 15:28:05,300 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:28:05,368 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2020-07-10 15:28:05,368 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-10 15:28:05,369 INFO L264 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-10 15:28:05,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:05,385 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:28:05,549 INFO L263 TraceCheckUtils]: 0: Hoare triple {1665#true} call ULTIMATE.init(); {1665#true} is VALID [2020-07-10 15:28:05,550 INFO L280 TraceCheckUtils]: 1: Hoare triple {1665#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1665#true} is VALID [2020-07-10 15:28:05,550 INFO L280 TraceCheckUtils]: 2: Hoare triple {1665#true} assume true; {1665#true} is VALID [2020-07-10 15:28:05,550 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1665#true} {1665#true} #151#return; {1665#true} is VALID [2020-07-10 15:28:05,550 INFO L263 TraceCheckUtils]: 4: Hoare triple {1665#true} call #t~ret23 := main(); {1665#true} is VALID [2020-07-10 15:28:05,550 INFO L280 TraceCheckUtils]: 5: Hoare triple {1665#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(9);~i~1 := 0; {1665#true} is VALID [2020-07-10 15:28:05,551 INFO L280 TraceCheckUtils]: 6: Hoare triple {1665#true} assume !!(~i~1 < 8);assume -128 <= #t~nondet21 && #t~nondet21 <= 127;call write~int(#t~nondet21, ~#A~0.base, ~#A~0.offset + ~i~1, 1);havoc #t~nondet21; {1665#true} is VALID [2020-07-10 15:28:05,551 INFO L280 TraceCheckUtils]: 7: Hoare triple {1665#true} #t~post20 := ~i~1;~i~1 := 1 + #t~post20;havoc #t~post20; {1665#true} is VALID [2020-07-10 15:28:05,551 INFO L280 TraceCheckUtils]: 8: Hoare triple {1665#true} assume !!(~i~1 < 8);assume -128 <= #t~nondet21 && #t~nondet21 <= 127;call write~int(#t~nondet21, ~#A~0.base, ~#A~0.offset + ~i~1, 1);havoc #t~nondet21; {1665#true} is VALID [2020-07-10 15:28:05,551 INFO L280 TraceCheckUtils]: 9: Hoare triple {1665#true} #t~post20 := ~i~1;~i~1 := 1 + #t~post20;havoc #t~post20; {1665#true} is VALID [2020-07-10 15:28:05,552 INFO L280 TraceCheckUtils]: 10: Hoare triple {1665#true} assume !(~i~1 < 8); {1665#true} is VALID [2020-07-10 15:28:05,552 INFO L280 TraceCheckUtils]: 11: Hoare triple {1665#true} call write~int(0, ~#A~0.base, 8 + ~#A~0.offset, 1); {1665#true} is VALID [2020-07-10 15:28:05,552 INFO L263 TraceCheckUtils]: 12: Hoare triple {1665#true} call #t~ret22 := parse_expression_list(~#A~0.base, ~#A~0.offset); {1665#true} is VALID [2020-07-10 15:28:05,553 INFO L280 TraceCheckUtils]: 13: Hoare triple {1665#true} ~str.base, ~str.offset := #in~str.base, #in~str.offset;~start~0 := 0;~i~0 := -1;~j~0 := -1;call ~#str2~0.base, ~#str2~0.offset := #Ultimate.allocOnStack(2); {1719#(and (<= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~i~0 1) 0))} is VALID [2020-07-10 15:28:05,554 INFO L280 TraceCheckUtils]: 14: Hoare triple {1719#(and (<= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~i~0 1) 0))} assume !(~str.base == 0 && ~str.offset == 0); {1719#(and (<= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~i~0 1) 0))} is VALID [2020-07-10 15:28:05,555 INFO L280 TraceCheckUtils]: 15: Hoare triple {1719#(and (<= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~i~0 1) 0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2;call #t~mem3 := read~int(~str.base, ~str.offset + ~i~0, 1);#t~switch4 := 0 == #t~mem3; {1726#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} is VALID [2020-07-10 15:28:05,556 INFO L280 TraceCheckUtils]: 16: Hoare triple {1726#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} assume #t~switch4; {1726#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} is VALID [2020-07-10 15:28:05,557 INFO L280 TraceCheckUtils]: 17: Hoare triple {1726#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} call #t~mem5 := read~int(~str.base, ~str.offset + ~start~0, 1);#t~short7 := 32 == #t~mem5; {1726#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} is VALID [2020-07-10 15:28:05,564 INFO L280 TraceCheckUtils]: 18: Hoare triple {1726#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} assume !#t~short7;call #t~mem6 := read~int(~str.base, ~str.offset + ~start~0, 1);#t~short7 := 9 == #t~mem6; {1726#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} is VALID [2020-07-10 15:28:05,565 INFO L280 TraceCheckUtils]: 19: Hoare triple {1726#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} assume !#t~short7;havoc #t~mem5;havoc #t~short7;havoc #t~mem6; {1726#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} is VALID [2020-07-10 15:28:05,566 INFO L280 TraceCheckUtils]: 20: Hoare triple {1726#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} call #t~mem9 := read~int(~str.base, ~str.offset + ~start~0, 1); {1726#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} is VALID [2020-07-10 15:28:05,567 INFO L280 TraceCheckUtils]: 21: Hoare triple {1726#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} assume 34 == #t~mem9;havoc #t~mem9;#t~post10 := ~start~0;~start~0 := 1 + #t~post10;havoc #t~post10; {1745#(and (<= 1 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} is VALID [2020-07-10 15:28:05,568 INFO L280 TraceCheckUtils]: 22: Hoare triple {1745#(and (<= 1 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} ~j~0 := ~i~0 - 1; {1749#(and (<= 1 parse_expression_list_~start~0) (<= (+ parse_expression_list_~j~0 1) 0))} is VALID [2020-07-10 15:28:05,569 INFO L280 TraceCheckUtils]: 23: Hoare triple {1749#(and (<= 1 parse_expression_list_~start~0) (<= (+ parse_expression_list_~j~0 1) 0))} #t~short14 := 0 < ~j~0; {1749#(and (<= 1 parse_expression_list_~start~0) (<= (+ parse_expression_list_~j~0 1) 0))} is VALID [2020-07-10 15:28:05,570 INFO L280 TraceCheckUtils]: 24: Hoare triple {1749#(and (<= 1 parse_expression_list_~start~0) (<= (+ parse_expression_list_~j~0 1) 0))} assume !#t~short14; {1749#(and (<= 1 parse_expression_list_~start~0) (<= (+ parse_expression_list_~j~0 1) 0))} is VALID [2020-07-10 15:28:05,571 INFO L280 TraceCheckUtils]: 25: Hoare triple {1749#(and (<= 1 parse_expression_list_~start~0) (<= (+ parse_expression_list_~j~0 1) 0))} assume !#t~short14;havoc #t~mem11;havoc #t~short13;havoc #t~short14;havoc #t~mem12; {1749#(and (<= 1 parse_expression_list_~start~0) (<= (+ parse_expression_list_~j~0 1) 0))} is VALID [2020-07-10 15:28:05,572 INFO L280 TraceCheckUtils]: 26: Hoare triple {1749#(and (<= 1 parse_expression_list_~start~0) (<= (+ parse_expression_list_~j~0 1) 0))} #t~short17 := 0 < ~j~0; {1749#(and (<= 1 parse_expression_list_~start~0) (<= (+ parse_expression_list_~j~0 1) 0))} is VALID [2020-07-10 15:28:05,573 INFO L280 TraceCheckUtils]: 27: Hoare triple {1749#(and (<= 1 parse_expression_list_~start~0) (<= (+ parse_expression_list_~j~0 1) 0))} assume !#t~short17; {1749#(and (<= 1 parse_expression_list_~start~0) (<= (+ parse_expression_list_~j~0 1) 0))} is VALID [2020-07-10 15:28:05,573 INFO L280 TraceCheckUtils]: 28: Hoare triple {1749#(and (<= 1 parse_expression_list_~start~0) (<= (+ parse_expression_list_~j~0 1) 0))} assume !#t~short17;havoc #t~mem16;havoc #t~short17; {1749#(and (<= 1 parse_expression_list_~start~0) (<= (+ parse_expression_list_~j~0 1) 0))} is VALID [2020-07-10 15:28:05,574 INFO L280 TraceCheckUtils]: 29: Hoare triple {1749#(and (<= 1 parse_expression_list_~start~0) (<= (+ parse_expression_list_~j~0 1) 0))} assume ~start~0 <= ~j~0; {1666#false} is VALID [2020-07-10 15:28:05,575 INFO L280 TraceCheckUtils]: 30: Hoare triple {1666#false} assume !(1 + (~j~0 - ~start~0) >= 2); {1666#false} is VALID [2020-07-10 15:28:05,575 INFO L263 TraceCheckUtils]: 31: Hoare triple {1666#false} call #t~ret19.base, #t~ret19.offset := r_strncpy(~#str2~0.base, ~#str2~0.offset, ~str.base, ~str.offset + ~start~0, 1 + (~j~0 - ~start~0)); {1666#false} is VALID [2020-07-10 15:28:05,575 INFO L280 TraceCheckUtils]: 32: Hoare triple {1666#false} ~dest.base, ~dest.offset := #in~dest.base, #in~dest.offset;~src.base, ~src.offset := #in~src.base, #in~src.offset;~n := #in~n;call #t~ret0.base, #t~ret0.offset := strncpy(~dest.base, ~dest.offset, ~src.base, ~src.offset, ~n);#res.base, #res.offset := #t~ret0.base, #t~ret0.offset;havoc #t~ret0.base, #t~ret0.offset; {1666#false} is VALID [2020-07-10 15:28:05,576 INFO L280 TraceCheckUtils]: 33: Hoare triple {1666#false} assume true; {1666#false} is VALID [2020-07-10 15:28:05,576 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {1666#false} {1666#false} #147#return; {1666#false} is VALID [2020-07-10 15:28:05,576 INFO L280 TraceCheckUtils]: 35: Hoare triple {1666#false} havoc #t~ret19.base, #t~ret19.offset; {1666#false} is VALID [2020-07-10 15:28:05,576 INFO L263 TraceCheckUtils]: 36: Hoare triple {1666#false} call __VERIFIER_assert((if 1 + (~j~0 - ~start~0) < 2 then 1 else 0)); {1666#false} is VALID [2020-07-10 15:28:05,576 INFO L280 TraceCheckUtils]: 37: Hoare triple {1666#false} ~cond := #in~cond; {1666#false} is VALID [2020-07-10 15:28:05,577 INFO L280 TraceCheckUtils]: 38: Hoare triple {1666#false} assume 0 == ~cond; {1666#false} is VALID [2020-07-10 15:28:05,577 INFO L280 TraceCheckUtils]: 39: Hoare triple {1666#false} assume !false; {1666#false} is VALID [2020-07-10 15:28:05,579 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-07-10 15:28:05,580 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-10 15:28:05,580 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2020-07-10 15:28:05,580 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850650141] [2020-07-10 15:28:05,581 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2020-07-10 15:28:05,581 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:28:05,581 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-10 15:28:05,622 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:28:05,623 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-10 15:28:05,623 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:28:05,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-10 15:28:05,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2020-07-10 15:28:05,624 INFO L87 Difference]: Start difference. First operand 55 states and 65 transitions. Second operand 6 states. [2020-07-10 15:28:06,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:06,153 INFO L93 Difference]: Finished difference Result 147 states and 185 transitions. [2020-07-10 15:28:06,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-10 15:28:06,153 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2020-07-10 15:28:06,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:28:06,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 15:28:06,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 162 transitions. [2020-07-10 15:28:06,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 15:28:06,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 162 transitions. [2020-07-10 15:28:06,167 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 162 transitions. [2020-07-10 15:28:06,358 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 162 edges. 162 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:28:06,361 INFO L225 Difference]: With dead ends: 147 [2020-07-10 15:28:06,362 INFO L226 Difference]: Without dead ends: 86 [2020-07-10 15:28:06,363 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2020-07-10 15:28:06,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2020-07-10 15:28:06,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 62. [2020-07-10 15:28:06,399 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:28:06,399 INFO L82 GeneralOperation]: Start isEquivalent. First operand 86 states. Second operand 62 states. [2020-07-10 15:28:06,400 INFO L74 IsIncluded]: Start isIncluded. First operand 86 states. Second operand 62 states. [2020-07-10 15:28:06,400 INFO L87 Difference]: Start difference. First operand 86 states. Second operand 62 states. [2020-07-10 15:28:06,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:06,406 INFO L93 Difference]: Finished difference Result 86 states and 104 transitions. [2020-07-10 15:28:06,406 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 104 transitions. [2020-07-10 15:28:06,406 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:28:06,407 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:28:06,407 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand 86 states. [2020-07-10 15:28:06,407 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 86 states. [2020-07-10 15:28:06,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:06,411 INFO L93 Difference]: Finished difference Result 86 states and 104 transitions. [2020-07-10 15:28:06,412 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 104 transitions. [2020-07-10 15:28:06,412 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:28:06,412 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:28:06,412 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:28:06,413 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:28:06,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2020-07-10 15:28:06,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 73 transitions. [2020-07-10 15:28:06,416 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 73 transitions. Word has length 40 [2020-07-10 15:28:06,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:28:06,416 INFO L479 AbstractCegarLoop]: Abstraction has 62 states and 73 transitions. [2020-07-10 15:28:06,416 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-10 15:28:06,417 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 73 transitions. [2020-07-10 15:28:06,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-07-10 15:28:06,418 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:28:06,419 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:28:06,632 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:28:06,633 INFO L427 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:28:06,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:28:06,633 INFO L82 PathProgramCache]: Analyzing trace with hash 1128455540, now seen corresponding path program 1 times [2020-07-10 15:28:06,633 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:28:06,634 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666764357] [2020-07-10 15:28:06,634 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:28:06,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:06,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:06,708 INFO L280 TraceCheckUtils]: 0: Hoare triple {2243#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2232#true} is VALID [2020-07-10 15:28:06,708 INFO L280 TraceCheckUtils]: 1: Hoare triple {2232#true} assume true; {2232#true} is VALID [2020-07-10 15:28:06,709 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2232#true} {2232#true} #151#return; {2232#true} is VALID [2020-07-10 15:28:06,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:06,716 INFO L280 TraceCheckUtils]: 0: Hoare triple {2232#true} ~dest.base, ~dest.offset := #in~dest.base, #in~dest.offset;~src.base, ~src.offset := #in~src.base, #in~src.offset;~n := #in~n;call #t~ret0.base, #t~ret0.offset := strncpy(~dest.base, ~dest.offset, ~src.base, ~src.offset, ~n);#res.base, #res.offset := #t~ret0.base, #t~ret0.offset;havoc #t~ret0.base, #t~ret0.offset; {2232#true} is VALID [2020-07-10 15:28:06,716 INFO L280 TraceCheckUtils]: 1: Hoare triple {2232#true} assume true; {2232#true} is VALID [2020-07-10 15:28:06,716 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2232#true} {2233#false} #147#return; {2233#false} is VALID [2020-07-10 15:28:06,717 INFO L263 TraceCheckUtils]: 0: Hoare triple {2232#true} call ULTIMATE.init(); {2243#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 15:28:06,717 INFO L280 TraceCheckUtils]: 1: Hoare triple {2243#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2232#true} is VALID [2020-07-10 15:28:06,718 INFO L280 TraceCheckUtils]: 2: Hoare triple {2232#true} assume true; {2232#true} is VALID [2020-07-10 15:28:06,718 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2232#true} {2232#true} #151#return; {2232#true} is VALID [2020-07-10 15:28:06,718 INFO L263 TraceCheckUtils]: 4: Hoare triple {2232#true} call #t~ret23 := main(); {2232#true} is VALID [2020-07-10 15:28:06,719 INFO L280 TraceCheckUtils]: 5: Hoare triple {2232#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(9);~i~1 := 0; {2237#(= 0 main_~i~1)} is VALID [2020-07-10 15:28:06,720 INFO L280 TraceCheckUtils]: 6: Hoare triple {2237#(= 0 main_~i~1)} assume !!(~i~1 < 8);assume -128 <= #t~nondet21 && #t~nondet21 <= 127;call write~int(#t~nondet21, ~#A~0.base, ~#A~0.offset + ~i~1, 1);havoc #t~nondet21; {2237#(= 0 main_~i~1)} is VALID [2020-07-10 15:28:06,721 INFO L280 TraceCheckUtils]: 7: Hoare triple {2237#(= 0 main_~i~1)} #t~post20 := ~i~1;~i~1 := 1 + #t~post20;havoc #t~post20; {2238#(<= main_~i~1 1)} is VALID [2020-07-10 15:28:06,726 INFO L280 TraceCheckUtils]: 8: Hoare triple {2238#(<= main_~i~1 1)} assume !!(~i~1 < 8);assume -128 <= #t~nondet21 && #t~nondet21 <= 127;call write~int(#t~nondet21, ~#A~0.base, ~#A~0.offset + ~i~1, 1);havoc #t~nondet21; {2238#(<= main_~i~1 1)} is VALID [2020-07-10 15:28:06,728 INFO L280 TraceCheckUtils]: 9: Hoare triple {2238#(<= main_~i~1 1)} #t~post20 := ~i~1;~i~1 := 1 + #t~post20;havoc #t~post20; {2239#(<= main_~i~1 2)} is VALID [2020-07-10 15:28:06,728 INFO L280 TraceCheckUtils]: 10: Hoare triple {2239#(<= main_~i~1 2)} assume !(~i~1 < 8); {2233#false} is VALID [2020-07-10 15:28:06,729 INFO L280 TraceCheckUtils]: 11: Hoare triple {2233#false} call write~int(0, ~#A~0.base, 8 + ~#A~0.offset, 1); {2233#false} is VALID [2020-07-10 15:28:06,729 INFO L263 TraceCheckUtils]: 12: Hoare triple {2233#false} call #t~ret22 := parse_expression_list(~#A~0.base, ~#A~0.offset); {2233#false} is VALID [2020-07-10 15:28:06,729 INFO L280 TraceCheckUtils]: 13: Hoare triple {2233#false} ~str.base, ~str.offset := #in~str.base, #in~str.offset;~start~0 := 0;~i~0 := -1;~j~0 := -1;call ~#str2~0.base, ~#str2~0.offset := #Ultimate.allocOnStack(2); {2233#false} is VALID [2020-07-10 15:28:06,729 INFO L280 TraceCheckUtils]: 14: Hoare triple {2233#false} assume !(~str.base == 0 && ~str.offset == 0); {2233#false} is VALID [2020-07-10 15:28:06,729 INFO L280 TraceCheckUtils]: 15: Hoare triple {2233#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2;call #t~mem3 := read~int(~str.base, ~str.offset + ~i~0, 1);#t~switch4 := 0 == #t~mem3; {2233#false} is VALID [2020-07-10 15:28:06,730 INFO L280 TraceCheckUtils]: 16: Hoare triple {2233#false} assume #t~switch4; {2233#false} is VALID [2020-07-10 15:28:06,730 INFO L280 TraceCheckUtils]: 17: Hoare triple {2233#false} call #t~mem5 := read~int(~str.base, ~str.offset + ~start~0, 1);#t~short7 := 32 == #t~mem5; {2233#false} is VALID [2020-07-10 15:28:06,730 INFO L280 TraceCheckUtils]: 18: Hoare triple {2233#false} assume !#t~short7;call #t~mem6 := read~int(~str.base, ~str.offset + ~start~0, 1);#t~short7 := 9 == #t~mem6; {2233#false} is VALID [2020-07-10 15:28:06,730 INFO L280 TraceCheckUtils]: 19: Hoare triple {2233#false} assume !#t~short7;havoc #t~mem5;havoc #t~short7;havoc #t~mem6; {2233#false} is VALID [2020-07-10 15:28:06,731 INFO L280 TraceCheckUtils]: 20: Hoare triple {2233#false} call #t~mem9 := read~int(~str.base, ~str.offset + ~start~0, 1); {2233#false} is VALID [2020-07-10 15:28:06,731 INFO L280 TraceCheckUtils]: 21: Hoare triple {2233#false} assume !(34 == #t~mem9);havoc #t~mem9; {2233#false} is VALID [2020-07-10 15:28:06,731 INFO L280 TraceCheckUtils]: 22: Hoare triple {2233#false} ~j~0 := ~i~0 - 1; {2233#false} is VALID [2020-07-10 15:28:06,731 INFO L280 TraceCheckUtils]: 23: Hoare triple {2233#false} #t~short14 := 0 < ~j~0; {2233#false} is VALID [2020-07-10 15:28:06,731 INFO L280 TraceCheckUtils]: 24: Hoare triple {2233#false} assume !#t~short14; {2233#false} is VALID [2020-07-10 15:28:06,731 INFO L280 TraceCheckUtils]: 25: Hoare triple {2233#false} assume !#t~short14;havoc #t~mem11;havoc #t~short13;havoc #t~short14;havoc #t~mem12; {2233#false} is VALID [2020-07-10 15:28:06,732 INFO L280 TraceCheckUtils]: 26: Hoare triple {2233#false} #t~short17 := 0 < ~j~0; {2233#false} is VALID [2020-07-10 15:28:06,732 INFO L280 TraceCheckUtils]: 27: Hoare triple {2233#false} assume !#t~short17; {2233#false} is VALID [2020-07-10 15:28:06,732 INFO L280 TraceCheckUtils]: 28: Hoare triple {2233#false} assume !#t~short17;havoc #t~mem16;havoc #t~short17; {2233#false} is VALID [2020-07-10 15:28:06,732 INFO L280 TraceCheckUtils]: 29: Hoare triple {2233#false} assume ~start~0 <= ~j~0; {2233#false} is VALID [2020-07-10 15:28:06,732 INFO L280 TraceCheckUtils]: 30: Hoare triple {2233#false} assume !(1 + (~j~0 - ~start~0) >= 2); {2233#false} is VALID [2020-07-10 15:28:06,733 INFO L263 TraceCheckUtils]: 31: Hoare triple {2233#false} call #t~ret19.base, #t~ret19.offset := r_strncpy(~#str2~0.base, ~#str2~0.offset, ~str.base, ~str.offset + ~start~0, 1 + (~j~0 - ~start~0)); {2232#true} is VALID [2020-07-10 15:28:06,733 INFO L280 TraceCheckUtils]: 32: Hoare triple {2232#true} ~dest.base, ~dest.offset := #in~dest.base, #in~dest.offset;~src.base, ~src.offset := #in~src.base, #in~src.offset;~n := #in~n;call #t~ret0.base, #t~ret0.offset := strncpy(~dest.base, ~dest.offset, ~src.base, ~src.offset, ~n);#res.base, #res.offset := #t~ret0.base, #t~ret0.offset;havoc #t~ret0.base, #t~ret0.offset; {2232#true} is VALID [2020-07-10 15:28:06,733 INFO L280 TraceCheckUtils]: 33: Hoare triple {2232#true} assume true; {2232#true} is VALID [2020-07-10 15:28:06,733 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {2232#true} {2233#false} #147#return; {2233#false} is VALID [2020-07-10 15:28:06,734 INFO L280 TraceCheckUtils]: 35: Hoare triple {2233#false} havoc #t~ret19.base, #t~ret19.offset; {2233#false} is VALID [2020-07-10 15:28:06,734 INFO L263 TraceCheckUtils]: 36: Hoare triple {2233#false} call __VERIFIER_assert((if 1 + (~j~0 - ~start~0) < 2 then 1 else 0)); {2233#false} is VALID [2020-07-10 15:28:06,734 INFO L280 TraceCheckUtils]: 37: Hoare triple {2233#false} ~cond := #in~cond; {2233#false} is VALID [2020-07-10 15:28:06,734 INFO L280 TraceCheckUtils]: 38: Hoare triple {2233#false} assume 0 == ~cond; {2233#false} is VALID [2020-07-10 15:28:06,734 INFO L280 TraceCheckUtils]: 39: Hoare triple {2233#false} assume !false; {2233#false} is VALID [2020-07-10 15:28:06,735 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:28:06,736 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666764357] [2020-07-10 15:28:06,736 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [64677665] [2020-07-10 15:28:06,736 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:28:06,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:06,801 INFO L264 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-10 15:28:06,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:06,815 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:28:06,868 INFO L263 TraceCheckUtils]: 0: Hoare triple {2232#true} call ULTIMATE.init(); {2232#true} is VALID [2020-07-10 15:28:06,868 INFO L280 TraceCheckUtils]: 1: Hoare triple {2232#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2232#true} is VALID [2020-07-10 15:28:06,868 INFO L280 TraceCheckUtils]: 2: Hoare triple {2232#true} assume true; {2232#true} is VALID [2020-07-10 15:28:06,868 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2232#true} {2232#true} #151#return; {2232#true} is VALID [2020-07-10 15:28:06,868 INFO L263 TraceCheckUtils]: 4: Hoare triple {2232#true} call #t~ret23 := main(); {2232#true} is VALID [2020-07-10 15:28:06,869 INFO L280 TraceCheckUtils]: 5: Hoare triple {2232#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(9);~i~1 := 0; {2262#(<= main_~i~1 0)} is VALID [2020-07-10 15:28:06,869 INFO L280 TraceCheckUtils]: 6: Hoare triple {2262#(<= main_~i~1 0)} assume !!(~i~1 < 8);assume -128 <= #t~nondet21 && #t~nondet21 <= 127;call write~int(#t~nondet21, ~#A~0.base, ~#A~0.offset + ~i~1, 1);havoc #t~nondet21; {2262#(<= main_~i~1 0)} is VALID [2020-07-10 15:28:06,870 INFO L280 TraceCheckUtils]: 7: Hoare triple {2262#(<= main_~i~1 0)} #t~post20 := ~i~1;~i~1 := 1 + #t~post20;havoc #t~post20; {2238#(<= main_~i~1 1)} is VALID [2020-07-10 15:28:06,871 INFO L280 TraceCheckUtils]: 8: Hoare triple {2238#(<= main_~i~1 1)} assume !!(~i~1 < 8);assume -128 <= #t~nondet21 && #t~nondet21 <= 127;call write~int(#t~nondet21, ~#A~0.base, ~#A~0.offset + ~i~1, 1);havoc #t~nondet21; {2238#(<= main_~i~1 1)} is VALID [2020-07-10 15:28:06,871 INFO L280 TraceCheckUtils]: 9: Hoare triple {2238#(<= main_~i~1 1)} #t~post20 := ~i~1;~i~1 := 1 + #t~post20;havoc #t~post20; {2239#(<= main_~i~1 2)} is VALID [2020-07-10 15:28:06,873 INFO L280 TraceCheckUtils]: 10: Hoare triple {2239#(<= main_~i~1 2)} assume !(~i~1 < 8); {2233#false} is VALID [2020-07-10 15:28:06,873 INFO L280 TraceCheckUtils]: 11: Hoare triple {2233#false} call write~int(0, ~#A~0.base, 8 + ~#A~0.offset, 1); {2233#false} is VALID [2020-07-10 15:28:06,873 INFO L263 TraceCheckUtils]: 12: Hoare triple {2233#false} call #t~ret22 := parse_expression_list(~#A~0.base, ~#A~0.offset); {2233#false} is VALID [2020-07-10 15:28:06,873 INFO L280 TraceCheckUtils]: 13: Hoare triple {2233#false} ~str.base, ~str.offset := #in~str.base, #in~str.offset;~start~0 := 0;~i~0 := -1;~j~0 := -1;call ~#str2~0.base, ~#str2~0.offset := #Ultimate.allocOnStack(2); {2233#false} is VALID [2020-07-10 15:28:06,874 INFO L280 TraceCheckUtils]: 14: Hoare triple {2233#false} assume !(~str.base == 0 && ~str.offset == 0); {2233#false} is VALID [2020-07-10 15:28:06,874 INFO L280 TraceCheckUtils]: 15: Hoare triple {2233#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2;call #t~mem3 := read~int(~str.base, ~str.offset + ~i~0, 1);#t~switch4 := 0 == #t~mem3; {2233#false} is VALID [2020-07-10 15:28:06,874 INFO L280 TraceCheckUtils]: 16: Hoare triple {2233#false} assume #t~switch4; {2233#false} is VALID [2020-07-10 15:28:06,874 INFO L280 TraceCheckUtils]: 17: Hoare triple {2233#false} call #t~mem5 := read~int(~str.base, ~str.offset + ~start~0, 1);#t~short7 := 32 == #t~mem5; {2233#false} is VALID [2020-07-10 15:28:06,875 INFO L280 TraceCheckUtils]: 18: Hoare triple {2233#false} assume !#t~short7;call #t~mem6 := read~int(~str.base, ~str.offset + ~start~0, 1);#t~short7 := 9 == #t~mem6; {2233#false} is VALID [2020-07-10 15:28:06,875 INFO L280 TraceCheckUtils]: 19: Hoare triple {2233#false} assume !#t~short7;havoc #t~mem5;havoc #t~short7;havoc #t~mem6; {2233#false} is VALID [2020-07-10 15:28:06,875 INFO L280 TraceCheckUtils]: 20: Hoare triple {2233#false} call #t~mem9 := read~int(~str.base, ~str.offset + ~start~0, 1); {2233#false} is VALID [2020-07-10 15:28:06,875 INFO L280 TraceCheckUtils]: 21: Hoare triple {2233#false} assume !(34 == #t~mem9);havoc #t~mem9; {2233#false} is VALID [2020-07-10 15:28:06,876 INFO L280 TraceCheckUtils]: 22: Hoare triple {2233#false} ~j~0 := ~i~0 - 1; {2233#false} is VALID [2020-07-10 15:28:06,876 INFO L280 TraceCheckUtils]: 23: Hoare triple {2233#false} #t~short14 := 0 < ~j~0; {2233#false} is VALID [2020-07-10 15:28:06,876 INFO L280 TraceCheckUtils]: 24: Hoare triple {2233#false} assume !#t~short14; {2233#false} is VALID [2020-07-10 15:28:06,876 INFO L280 TraceCheckUtils]: 25: Hoare triple {2233#false} assume !#t~short14;havoc #t~mem11;havoc #t~short13;havoc #t~short14;havoc #t~mem12; {2233#false} is VALID [2020-07-10 15:28:06,876 INFO L280 TraceCheckUtils]: 26: Hoare triple {2233#false} #t~short17 := 0 < ~j~0; {2233#false} is VALID [2020-07-10 15:28:06,877 INFO L280 TraceCheckUtils]: 27: Hoare triple {2233#false} assume !#t~short17; {2233#false} is VALID [2020-07-10 15:28:06,877 INFO L280 TraceCheckUtils]: 28: Hoare triple {2233#false} assume !#t~short17;havoc #t~mem16;havoc #t~short17; {2233#false} is VALID [2020-07-10 15:28:06,877 INFO L280 TraceCheckUtils]: 29: Hoare triple {2233#false} assume ~start~0 <= ~j~0; {2233#false} is VALID [2020-07-10 15:28:06,877 INFO L280 TraceCheckUtils]: 30: Hoare triple {2233#false} assume !(1 + (~j~0 - ~start~0) >= 2); {2233#false} is VALID [2020-07-10 15:28:06,877 INFO L263 TraceCheckUtils]: 31: Hoare triple {2233#false} call #t~ret19.base, #t~ret19.offset := r_strncpy(~#str2~0.base, ~#str2~0.offset, ~str.base, ~str.offset + ~start~0, 1 + (~j~0 - ~start~0)); {2233#false} is VALID [2020-07-10 15:28:06,877 INFO L280 TraceCheckUtils]: 32: Hoare triple {2233#false} ~dest.base, ~dest.offset := #in~dest.base, #in~dest.offset;~src.base, ~src.offset := #in~src.base, #in~src.offset;~n := #in~n;call #t~ret0.base, #t~ret0.offset := strncpy(~dest.base, ~dest.offset, ~src.base, ~src.offset, ~n);#res.base, #res.offset := #t~ret0.base, #t~ret0.offset;havoc #t~ret0.base, #t~ret0.offset; {2233#false} is VALID [2020-07-10 15:28:06,877 INFO L280 TraceCheckUtils]: 33: Hoare triple {2233#false} assume true; {2233#false} is VALID [2020-07-10 15:28:06,878 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {2233#false} {2233#false} #147#return; {2233#false} is VALID [2020-07-10 15:28:06,878 INFO L280 TraceCheckUtils]: 35: Hoare triple {2233#false} havoc #t~ret19.base, #t~ret19.offset; {2233#false} is VALID [2020-07-10 15:28:06,878 INFO L263 TraceCheckUtils]: 36: Hoare triple {2233#false} call __VERIFIER_assert((if 1 + (~j~0 - ~start~0) < 2 then 1 else 0)); {2233#false} is VALID [2020-07-10 15:28:06,878 INFO L280 TraceCheckUtils]: 37: Hoare triple {2233#false} ~cond := #in~cond; {2233#false} is VALID [2020-07-10 15:28:06,878 INFO L280 TraceCheckUtils]: 38: Hoare triple {2233#false} assume 0 == ~cond; {2233#false} is VALID [2020-07-10 15:28:06,879 INFO L280 TraceCheckUtils]: 39: Hoare triple {2233#false} assume !false; {2233#false} is VALID [2020-07-10 15:28:06,880 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:28:06,880 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-10 15:28:06,880 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 7 [2020-07-10 15:28:06,881 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501879463] [2020-07-10 15:28:06,881 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 40 [2020-07-10 15:28:06,882 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:28:06,882 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-10 15:28:06,928 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:28:06,928 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-10 15:28:06,928 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:28:06,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-10 15:28:06,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-07-10 15:28:06,929 INFO L87 Difference]: Start difference. First operand 62 states and 73 transitions. Second operand 7 states. [2020-07-10 15:28:07,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:07,288 INFO L93 Difference]: Finished difference Result 116 states and 138 transitions. [2020-07-10 15:28:07,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-10 15:28:07,288 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 40 [2020-07-10 15:28:07,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:28:07,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-10 15:28:07,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 112 transitions. [2020-07-10 15:28:07,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-10 15:28:07,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 112 transitions. [2020-07-10 15:28:07,293 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 112 transitions. [2020-07-10 15:28:07,406 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:28:07,408 INFO L225 Difference]: With dead ends: 116 [2020-07-10 15:28:07,408 INFO L226 Difference]: Without dead ends: 65 [2020-07-10 15:28:07,409 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-07-10 15:28:07,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2020-07-10 15:28:07,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 64. [2020-07-10 15:28:07,431 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:28:07,431 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand 64 states. [2020-07-10 15:28:07,431 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand 64 states. [2020-07-10 15:28:07,432 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 64 states. [2020-07-10 15:28:07,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:07,434 INFO L93 Difference]: Finished difference Result 65 states and 76 transitions. [2020-07-10 15:28:07,434 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 76 transitions. [2020-07-10 15:28:07,435 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:28:07,435 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:28:07,435 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand 65 states. [2020-07-10 15:28:07,435 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 65 states. [2020-07-10 15:28:07,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:07,438 INFO L93 Difference]: Finished difference Result 65 states and 76 transitions. [2020-07-10 15:28:07,438 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 76 transitions. [2020-07-10 15:28:07,438 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:28:07,438 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:28:07,438 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:28:07,438 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:28:07,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2020-07-10 15:28:07,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 75 transitions. [2020-07-10 15:28:07,441 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 75 transitions. Word has length 40 [2020-07-10 15:28:07,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:28:07,442 INFO L479 AbstractCegarLoop]: Abstraction has 64 states and 75 transitions. [2020-07-10 15:28:07,442 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-10 15:28:07,442 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 75 transitions. [2020-07-10 15:28:07,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2020-07-10 15:28:07,443 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:28:07,443 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:28:07,657 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2020-07-10 15:28:07,658 INFO L427 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:28:07,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:28:07,659 INFO L82 PathProgramCache]: Analyzing trace with hash 34367350, now seen corresponding path program 2 times [2020-07-10 15:28:07,659 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:28:07,660 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780348336] [2020-07-10 15:28:07,660 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:28:07,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:07,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:07,763 INFO L280 TraceCheckUtils]: 0: Hoare triple {2735#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2723#true} is VALID [2020-07-10 15:28:07,763 INFO L280 TraceCheckUtils]: 1: Hoare triple {2723#true} assume true; {2723#true} is VALID [2020-07-10 15:28:07,763 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2723#true} {2723#true} #151#return; {2723#true} is VALID [2020-07-10 15:28:07,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:07,767 INFO L280 TraceCheckUtils]: 0: Hoare triple {2723#true} ~dest.base, ~dest.offset := #in~dest.base, #in~dest.offset;~src.base, ~src.offset := #in~src.base, #in~src.offset;~n := #in~n;call #t~ret0.base, #t~ret0.offset := strncpy(~dest.base, ~dest.offset, ~src.base, ~src.offset, ~n);#res.base, #res.offset := #t~ret0.base, #t~ret0.offset;havoc #t~ret0.base, #t~ret0.offset; {2723#true} is VALID [2020-07-10 15:28:07,767 INFO L280 TraceCheckUtils]: 1: Hoare triple {2723#true} assume true; {2723#true} is VALID [2020-07-10 15:28:07,767 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2723#true} {2724#false} #147#return; {2724#false} is VALID [2020-07-10 15:28:07,768 INFO L263 TraceCheckUtils]: 0: Hoare triple {2723#true} call ULTIMATE.init(); {2735#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 15:28:07,768 INFO L280 TraceCheckUtils]: 1: Hoare triple {2735#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2723#true} is VALID [2020-07-10 15:28:07,768 INFO L280 TraceCheckUtils]: 2: Hoare triple {2723#true} assume true; {2723#true} is VALID [2020-07-10 15:28:07,769 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2723#true} {2723#true} #151#return; {2723#true} is VALID [2020-07-10 15:28:07,769 INFO L263 TraceCheckUtils]: 4: Hoare triple {2723#true} call #t~ret23 := main(); {2723#true} is VALID [2020-07-10 15:28:07,770 INFO L280 TraceCheckUtils]: 5: Hoare triple {2723#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(9);~i~1 := 0; {2728#(= 0 main_~i~1)} is VALID [2020-07-10 15:28:07,771 INFO L280 TraceCheckUtils]: 6: Hoare triple {2728#(= 0 main_~i~1)} assume !!(~i~1 < 8);assume -128 <= #t~nondet21 && #t~nondet21 <= 127;call write~int(#t~nondet21, ~#A~0.base, ~#A~0.offset + ~i~1, 1);havoc #t~nondet21; {2728#(= 0 main_~i~1)} is VALID [2020-07-10 15:28:07,772 INFO L280 TraceCheckUtils]: 7: Hoare triple {2728#(= 0 main_~i~1)} #t~post20 := ~i~1;~i~1 := 1 + #t~post20;havoc #t~post20; {2729#(<= main_~i~1 1)} is VALID [2020-07-10 15:28:07,772 INFO L280 TraceCheckUtils]: 8: Hoare triple {2729#(<= main_~i~1 1)} assume !!(~i~1 < 8);assume -128 <= #t~nondet21 && #t~nondet21 <= 127;call write~int(#t~nondet21, ~#A~0.base, ~#A~0.offset + ~i~1, 1);havoc #t~nondet21; {2729#(<= main_~i~1 1)} is VALID [2020-07-10 15:28:07,774 INFO L280 TraceCheckUtils]: 9: Hoare triple {2729#(<= main_~i~1 1)} #t~post20 := ~i~1;~i~1 := 1 + #t~post20;havoc #t~post20; {2730#(<= main_~i~1 2)} is VALID [2020-07-10 15:28:07,775 INFO L280 TraceCheckUtils]: 10: Hoare triple {2730#(<= main_~i~1 2)} assume !!(~i~1 < 8);assume -128 <= #t~nondet21 && #t~nondet21 <= 127;call write~int(#t~nondet21, ~#A~0.base, ~#A~0.offset + ~i~1, 1);havoc #t~nondet21; {2730#(<= main_~i~1 2)} is VALID [2020-07-10 15:28:07,777 INFO L280 TraceCheckUtils]: 11: Hoare triple {2730#(<= main_~i~1 2)} #t~post20 := ~i~1;~i~1 := 1 + #t~post20;havoc #t~post20; {2731#(<= main_~i~1 3)} is VALID [2020-07-10 15:28:07,778 INFO L280 TraceCheckUtils]: 12: Hoare triple {2731#(<= main_~i~1 3)} assume !(~i~1 < 8); {2724#false} is VALID [2020-07-10 15:28:07,778 INFO L280 TraceCheckUtils]: 13: Hoare triple {2724#false} call write~int(0, ~#A~0.base, 8 + ~#A~0.offset, 1); {2724#false} is VALID [2020-07-10 15:28:07,778 INFO L263 TraceCheckUtils]: 14: Hoare triple {2724#false} call #t~ret22 := parse_expression_list(~#A~0.base, ~#A~0.offset); {2724#false} is VALID [2020-07-10 15:28:07,779 INFO L280 TraceCheckUtils]: 15: Hoare triple {2724#false} ~str.base, ~str.offset := #in~str.base, #in~str.offset;~start~0 := 0;~i~0 := -1;~j~0 := -1;call ~#str2~0.base, ~#str2~0.offset := #Ultimate.allocOnStack(2); {2724#false} is VALID [2020-07-10 15:28:07,779 INFO L280 TraceCheckUtils]: 16: Hoare triple {2724#false} assume !(~str.base == 0 && ~str.offset == 0); {2724#false} is VALID [2020-07-10 15:28:07,779 INFO L280 TraceCheckUtils]: 17: Hoare triple {2724#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2;call #t~mem3 := read~int(~str.base, ~str.offset + ~i~0, 1);#t~switch4 := 0 == #t~mem3; {2724#false} is VALID [2020-07-10 15:28:07,779 INFO L280 TraceCheckUtils]: 18: Hoare triple {2724#false} assume #t~switch4; {2724#false} is VALID [2020-07-10 15:28:07,779 INFO L280 TraceCheckUtils]: 19: Hoare triple {2724#false} call #t~mem5 := read~int(~str.base, ~str.offset + ~start~0, 1);#t~short7 := 32 == #t~mem5; {2724#false} is VALID [2020-07-10 15:28:07,780 INFO L280 TraceCheckUtils]: 20: Hoare triple {2724#false} assume !#t~short7;call #t~mem6 := read~int(~str.base, ~str.offset + ~start~0, 1);#t~short7 := 9 == #t~mem6; {2724#false} is VALID [2020-07-10 15:28:07,780 INFO L280 TraceCheckUtils]: 21: Hoare triple {2724#false} assume !#t~short7;havoc #t~mem5;havoc #t~short7;havoc #t~mem6; {2724#false} is VALID [2020-07-10 15:28:07,780 INFO L280 TraceCheckUtils]: 22: Hoare triple {2724#false} call #t~mem9 := read~int(~str.base, ~str.offset + ~start~0, 1); {2724#false} is VALID [2020-07-10 15:28:07,780 INFO L280 TraceCheckUtils]: 23: Hoare triple {2724#false} assume !(34 == #t~mem9);havoc #t~mem9; {2724#false} is VALID [2020-07-10 15:28:07,780 INFO L280 TraceCheckUtils]: 24: Hoare triple {2724#false} ~j~0 := ~i~0 - 1; {2724#false} is VALID [2020-07-10 15:28:07,780 INFO L280 TraceCheckUtils]: 25: Hoare triple {2724#false} #t~short14 := 0 < ~j~0; {2724#false} is VALID [2020-07-10 15:28:07,781 INFO L280 TraceCheckUtils]: 26: Hoare triple {2724#false} assume !#t~short14; {2724#false} is VALID [2020-07-10 15:28:07,781 INFO L280 TraceCheckUtils]: 27: Hoare triple {2724#false} assume !#t~short14;havoc #t~mem11;havoc #t~short13;havoc #t~short14;havoc #t~mem12; {2724#false} is VALID [2020-07-10 15:28:07,781 INFO L280 TraceCheckUtils]: 28: Hoare triple {2724#false} #t~short17 := 0 < ~j~0; {2724#false} is VALID [2020-07-10 15:28:07,781 INFO L280 TraceCheckUtils]: 29: Hoare triple {2724#false} assume !#t~short17; {2724#false} is VALID [2020-07-10 15:28:07,781 INFO L280 TraceCheckUtils]: 30: Hoare triple {2724#false} assume !#t~short17;havoc #t~mem16;havoc #t~short17; {2724#false} is VALID [2020-07-10 15:28:07,782 INFO L280 TraceCheckUtils]: 31: Hoare triple {2724#false} assume ~start~0 <= ~j~0; {2724#false} is VALID [2020-07-10 15:28:07,782 INFO L280 TraceCheckUtils]: 32: Hoare triple {2724#false} assume !(1 + (~j~0 - ~start~0) >= 2); {2724#false} is VALID [2020-07-10 15:28:07,782 INFO L263 TraceCheckUtils]: 33: Hoare triple {2724#false} call #t~ret19.base, #t~ret19.offset := r_strncpy(~#str2~0.base, ~#str2~0.offset, ~str.base, ~str.offset + ~start~0, 1 + (~j~0 - ~start~0)); {2723#true} is VALID [2020-07-10 15:28:07,782 INFO L280 TraceCheckUtils]: 34: Hoare triple {2723#true} ~dest.base, ~dest.offset := #in~dest.base, #in~dest.offset;~src.base, ~src.offset := #in~src.base, #in~src.offset;~n := #in~n;call #t~ret0.base, #t~ret0.offset := strncpy(~dest.base, ~dest.offset, ~src.base, ~src.offset, ~n);#res.base, #res.offset := #t~ret0.base, #t~ret0.offset;havoc #t~ret0.base, #t~ret0.offset; {2723#true} is VALID [2020-07-10 15:28:07,782 INFO L280 TraceCheckUtils]: 35: Hoare triple {2723#true} assume true; {2723#true} is VALID [2020-07-10 15:28:07,783 INFO L275 TraceCheckUtils]: 36: Hoare quadruple {2723#true} {2724#false} #147#return; {2724#false} is VALID [2020-07-10 15:28:07,783 INFO L280 TraceCheckUtils]: 37: Hoare triple {2724#false} havoc #t~ret19.base, #t~ret19.offset; {2724#false} is VALID [2020-07-10 15:28:07,783 INFO L263 TraceCheckUtils]: 38: Hoare triple {2724#false} call __VERIFIER_assert((if 1 + (~j~0 - ~start~0) < 2 then 1 else 0)); {2724#false} is VALID [2020-07-10 15:28:07,783 INFO L280 TraceCheckUtils]: 39: Hoare triple {2724#false} ~cond := #in~cond; {2724#false} is VALID [2020-07-10 15:28:07,783 INFO L280 TraceCheckUtils]: 40: Hoare triple {2724#false} assume 0 == ~cond; {2724#false} is VALID [2020-07-10 15:28:07,783 INFO L280 TraceCheckUtils]: 41: Hoare triple {2724#false} assume !false; {2724#false} is VALID [2020-07-10 15:28:07,785 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:28:07,785 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780348336] [2020-07-10 15:28:07,785 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1879351817] [2020-07-10 15:28:07,785 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:28:07,835 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2020-07-10 15:28:07,836 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-10 15:28:07,836 INFO L264 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-10 15:28:07,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:07,850 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:28:07,972 INFO L263 TraceCheckUtils]: 0: Hoare triple {2723#true} call ULTIMATE.init(); {2723#true} is VALID [2020-07-10 15:28:07,972 INFO L280 TraceCheckUtils]: 1: Hoare triple {2723#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2723#true} is VALID [2020-07-10 15:28:07,972 INFO L280 TraceCheckUtils]: 2: Hoare triple {2723#true} assume true; {2723#true} is VALID [2020-07-10 15:28:07,972 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2723#true} {2723#true} #151#return; {2723#true} is VALID [2020-07-10 15:28:07,972 INFO L263 TraceCheckUtils]: 4: Hoare triple {2723#true} call #t~ret23 := main(); {2723#true} is VALID [2020-07-10 15:28:07,973 INFO L280 TraceCheckUtils]: 5: Hoare triple {2723#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(9);~i~1 := 0; {2723#true} is VALID [2020-07-10 15:28:07,973 INFO L280 TraceCheckUtils]: 6: Hoare triple {2723#true} assume !!(~i~1 < 8);assume -128 <= #t~nondet21 && #t~nondet21 <= 127;call write~int(#t~nondet21, ~#A~0.base, ~#A~0.offset + ~i~1, 1);havoc #t~nondet21; {2723#true} is VALID [2020-07-10 15:28:07,973 INFO L280 TraceCheckUtils]: 7: Hoare triple {2723#true} #t~post20 := ~i~1;~i~1 := 1 + #t~post20;havoc #t~post20; {2723#true} is VALID [2020-07-10 15:28:07,973 INFO L280 TraceCheckUtils]: 8: Hoare triple {2723#true} assume !!(~i~1 < 8);assume -128 <= #t~nondet21 && #t~nondet21 <= 127;call write~int(#t~nondet21, ~#A~0.base, ~#A~0.offset + ~i~1, 1);havoc #t~nondet21; {2723#true} is VALID [2020-07-10 15:28:07,973 INFO L280 TraceCheckUtils]: 9: Hoare triple {2723#true} #t~post20 := ~i~1;~i~1 := 1 + #t~post20;havoc #t~post20; {2723#true} is VALID [2020-07-10 15:28:07,974 INFO L280 TraceCheckUtils]: 10: Hoare triple {2723#true} assume !!(~i~1 < 8);assume -128 <= #t~nondet21 && #t~nondet21 <= 127;call write~int(#t~nondet21, ~#A~0.base, ~#A~0.offset + ~i~1, 1);havoc #t~nondet21; {2723#true} is VALID [2020-07-10 15:28:07,974 INFO L280 TraceCheckUtils]: 11: Hoare triple {2723#true} #t~post20 := ~i~1;~i~1 := 1 + #t~post20;havoc #t~post20; {2723#true} is VALID [2020-07-10 15:28:07,974 INFO L280 TraceCheckUtils]: 12: Hoare triple {2723#true} assume !(~i~1 < 8); {2723#true} is VALID [2020-07-10 15:28:07,974 INFO L280 TraceCheckUtils]: 13: Hoare triple {2723#true} call write~int(0, ~#A~0.base, 8 + ~#A~0.offset, 1); {2723#true} is VALID [2020-07-10 15:28:07,974 INFO L263 TraceCheckUtils]: 14: Hoare triple {2723#true} call #t~ret22 := parse_expression_list(~#A~0.base, ~#A~0.offset); {2723#true} is VALID [2020-07-10 15:28:07,976 INFO L280 TraceCheckUtils]: 15: Hoare triple {2723#true} ~str.base, ~str.offset := #in~str.base, #in~str.offset;~start~0 := 0;~i~0 := -1;~j~0 := -1;call ~#str2~0.base, ~#str2~0.offset := #Ultimate.allocOnStack(2); {2784#(and (<= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~i~0 1) 0))} is VALID [2020-07-10 15:28:07,977 INFO L280 TraceCheckUtils]: 16: Hoare triple {2784#(and (<= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~i~0 1) 0))} assume !(~str.base == 0 && ~str.offset == 0); {2784#(and (<= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~i~0 1) 0))} is VALID [2020-07-10 15:28:07,986 INFO L280 TraceCheckUtils]: 17: Hoare triple {2784#(and (<= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~i~0 1) 0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2;call #t~mem3 := read~int(~str.base, ~str.offset + ~i~0, 1);#t~switch4 := 0 == #t~mem3; {2791#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} is VALID [2020-07-10 15:28:07,987 INFO L280 TraceCheckUtils]: 18: Hoare triple {2791#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} assume #t~switch4; {2791#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} is VALID [2020-07-10 15:28:07,990 INFO L280 TraceCheckUtils]: 19: Hoare triple {2791#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} call #t~mem5 := read~int(~str.base, ~str.offset + ~start~0, 1);#t~short7 := 32 == #t~mem5; {2791#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} is VALID [2020-07-10 15:28:07,991 INFO L280 TraceCheckUtils]: 20: Hoare triple {2791#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} assume !#t~short7;call #t~mem6 := read~int(~str.base, ~str.offset + ~start~0, 1);#t~short7 := 9 == #t~mem6; {2791#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} is VALID [2020-07-10 15:28:07,992 INFO L280 TraceCheckUtils]: 21: Hoare triple {2791#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} assume !#t~short7;havoc #t~mem5;havoc #t~short7;havoc #t~mem6; {2791#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} is VALID [2020-07-10 15:28:07,992 INFO L280 TraceCheckUtils]: 22: Hoare triple {2791#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} call #t~mem9 := read~int(~str.base, ~str.offset + ~start~0, 1); {2791#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} is VALID [2020-07-10 15:28:07,992 INFO L280 TraceCheckUtils]: 23: Hoare triple {2791#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} assume !(34 == #t~mem9);havoc #t~mem9; {2791#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} is VALID [2020-07-10 15:28:07,993 INFO L280 TraceCheckUtils]: 24: Hoare triple {2791#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} ~j~0 := ~i~0 - 1; {2813#(and (<= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~j~0 1) 0))} is VALID [2020-07-10 15:28:07,994 INFO L280 TraceCheckUtils]: 25: Hoare triple {2813#(and (<= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~j~0 1) 0))} #t~short14 := 0 < ~j~0; {2813#(and (<= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~j~0 1) 0))} is VALID [2020-07-10 15:28:07,995 INFO L280 TraceCheckUtils]: 26: Hoare triple {2813#(and (<= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~j~0 1) 0))} assume !#t~short14; {2813#(and (<= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~j~0 1) 0))} is VALID [2020-07-10 15:28:07,995 INFO L280 TraceCheckUtils]: 27: Hoare triple {2813#(and (<= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~j~0 1) 0))} assume !#t~short14;havoc #t~mem11;havoc #t~short13;havoc #t~short14;havoc #t~mem12; {2813#(and (<= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~j~0 1) 0))} is VALID [2020-07-10 15:28:07,996 INFO L280 TraceCheckUtils]: 28: Hoare triple {2813#(and (<= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~j~0 1) 0))} #t~short17 := 0 < ~j~0; {2813#(and (<= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~j~0 1) 0))} is VALID [2020-07-10 15:28:07,996 INFO L280 TraceCheckUtils]: 29: Hoare triple {2813#(and (<= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~j~0 1) 0))} assume !#t~short17; {2813#(and (<= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~j~0 1) 0))} is VALID [2020-07-10 15:28:07,997 INFO L280 TraceCheckUtils]: 30: Hoare triple {2813#(and (<= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~j~0 1) 0))} assume !#t~short17;havoc #t~mem16;havoc #t~short17; {2813#(and (<= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~j~0 1) 0))} is VALID [2020-07-10 15:28:07,997 INFO L280 TraceCheckUtils]: 31: Hoare triple {2813#(and (<= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~j~0 1) 0))} assume ~start~0 <= ~j~0; {2724#false} is VALID [2020-07-10 15:28:07,998 INFO L280 TraceCheckUtils]: 32: Hoare triple {2724#false} assume !(1 + (~j~0 - ~start~0) >= 2); {2724#false} is VALID [2020-07-10 15:28:07,998 INFO L263 TraceCheckUtils]: 33: Hoare triple {2724#false} call #t~ret19.base, #t~ret19.offset := r_strncpy(~#str2~0.base, ~#str2~0.offset, ~str.base, ~str.offset + ~start~0, 1 + (~j~0 - ~start~0)); {2724#false} is VALID [2020-07-10 15:28:07,998 INFO L280 TraceCheckUtils]: 34: Hoare triple {2724#false} ~dest.base, ~dest.offset := #in~dest.base, #in~dest.offset;~src.base, ~src.offset := #in~src.base, #in~src.offset;~n := #in~n;call #t~ret0.base, #t~ret0.offset := strncpy(~dest.base, ~dest.offset, ~src.base, ~src.offset, ~n);#res.base, #res.offset := #t~ret0.base, #t~ret0.offset;havoc #t~ret0.base, #t~ret0.offset; {2724#false} is VALID [2020-07-10 15:28:07,998 INFO L280 TraceCheckUtils]: 35: Hoare triple {2724#false} assume true; {2724#false} is VALID [2020-07-10 15:28:07,998 INFO L275 TraceCheckUtils]: 36: Hoare quadruple {2724#false} {2724#false} #147#return; {2724#false} is VALID [2020-07-10 15:28:07,998 INFO L280 TraceCheckUtils]: 37: Hoare triple {2724#false} havoc #t~ret19.base, #t~ret19.offset; {2724#false} is VALID [2020-07-10 15:28:07,998 INFO L263 TraceCheckUtils]: 38: Hoare triple {2724#false} call __VERIFIER_assert((if 1 + (~j~0 - ~start~0) < 2 then 1 else 0)); {2724#false} is VALID [2020-07-10 15:28:07,999 INFO L280 TraceCheckUtils]: 39: Hoare triple {2724#false} ~cond := #in~cond; {2724#false} is VALID [2020-07-10 15:28:07,999 INFO L280 TraceCheckUtils]: 40: Hoare triple {2724#false} assume 0 == ~cond; {2724#false} is VALID [2020-07-10 15:28:07,999 INFO L280 TraceCheckUtils]: 41: Hoare triple {2724#false} assume !false; {2724#false} is VALID [2020-07-10 15:28:08,001 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2020-07-10 15:28:08,001 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-10 15:28:08,001 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 10 [2020-07-10 15:28:08,002 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593245492] [2020-07-10 15:28:08,002 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2020-07-10 15:28:08,002 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:28:08,002 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-10 15:28:08,045 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:28:08,045 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-10 15:28:08,046 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:28:08,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-10 15:28:08,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2020-07-10 15:28:08,046 INFO L87 Difference]: Start difference. First operand 64 states and 75 transitions. Second operand 5 states. [2020-07-10 15:28:08,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:08,404 INFO L93 Difference]: Finished difference Result 134 states and 163 transitions. [2020-07-10 15:28:08,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-10 15:28:08,404 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2020-07-10 15:28:08,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:28:08,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 15:28:08,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 143 transitions. [2020-07-10 15:28:08,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 15:28:08,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 143 transitions. [2020-07-10 15:28:08,418 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 143 transitions. [2020-07-10 15:28:08,573 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 143 edges. 143 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:28:08,574 INFO L225 Difference]: With dead ends: 134 [2020-07-10 15:28:08,575 INFO L226 Difference]: Without dead ends: 75 [2020-07-10 15:28:08,576 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2020-07-10 15:28:08,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2020-07-10 15:28:08,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 59. [2020-07-10 15:28:08,610 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:28:08,611 INFO L82 GeneralOperation]: Start isEquivalent. First operand 75 states. Second operand 59 states. [2020-07-10 15:28:08,611 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand 59 states. [2020-07-10 15:28:08,611 INFO L87 Difference]: Start difference. First operand 75 states. Second operand 59 states. [2020-07-10 15:28:08,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:08,617 INFO L93 Difference]: Finished difference Result 75 states and 89 transitions. [2020-07-10 15:28:08,617 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 89 transitions. [2020-07-10 15:28:08,618 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:28:08,618 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:28:08,618 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 75 states. [2020-07-10 15:28:08,618 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 75 states. [2020-07-10 15:28:08,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:08,641 INFO L93 Difference]: Finished difference Result 75 states and 89 transitions. [2020-07-10 15:28:08,642 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 89 transitions. [2020-07-10 15:28:08,642 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:28:08,642 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:28:08,642 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:28:08,642 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:28:08,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2020-07-10 15:28:08,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 69 transitions. [2020-07-10 15:28:08,645 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 69 transitions. Word has length 42 [2020-07-10 15:28:08,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:28:08,646 INFO L479 AbstractCegarLoop]: Abstraction has 59 states and 69 transitions. [2020-07-10 15:28:08,646 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-10 15:28:08,646 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 69 transitions. [2020-07-10 15:28:08,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2020-07-10 15:28:08,647 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:28:08,648 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:28:08,860 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:28:08,861 INFO L427 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:28:08,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:28:08,862 INFO L82 PathProgramCache]: Analyzing trace with hash -615754617, now seen corresponding path program 1 times [2020-07-10 15:28:08,862 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:28:08,863 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613058294] [2020-07-10 15:28:08,863 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:28:08,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:08,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:08,936 INFO L280 TraceCheckUtils]: 0: Hoare triple {3271#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {3259#true} is VALID [2020-07-10 15:28:08,937 INFO L280 TraceCheckUtils]: 1: Hoare triple {3259#true} assume true; {3259#true} is VALID [2020-07-10 15:28:08,937 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {3259#true} {3259#true} #151#return; {3259#true} is VALID [2020-07-10 15:28:08,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:08,951 INFO L280 TraceCheckUtils]: 0: Hoare triple {3259#true} ~dest.base, ~dest.offset := #in~dest.base, #in~dest.offset;~src.base, ~src.offset := #in~src.base, #in~src.offset;~n := #in~n;call #t~ret0.base, #t~ret0.offset := strncpy(~dest.base, ~dest.offset, ~src.base, ~src.offset, ~n);#res.base, #res.offset := #t~ret0.base, #t~ret0.offset;havoc #t~ret0.base, #t~ret0.offset; {3259#true} is VALID [2020-07-10 15:28:08,952 INFO L280 TraceCheckUtils]: 1: Hoare triple {3259#true} assume true; {3259#true} is VALID [2020-07-10 15:28:08,952 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {3259#true} {3260#false} #147#return; {3260#false} is VALID [2020-07-10 15:28:08,953 INFO L263 TraceCheckUtils]: 0: Hoare triple {3259#true} call ULTIMATE.init(); {3271#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 15:28:08,953 INFO L280 TraceCheckUtils]: 1: Hoare triple {3271#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {3259#true} is VALID [2020-07-10 15:28:08,953 INFO L280 TraceCheckUtils]: 2: Hoare triple {3259#true} assume true; {3259#true} is VALID [2020-07-10 15:28:08,953 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3259#true} {3259#true} #151#return; {3259#true} is VALID [2020-07-10 15:28:08,953 INFO L263 TraceCheckUtils]: 4: Hoare triple {3259#true} call #t~ret23 := main(); {3259#true} is VALID [2020-07-10 15:28:08,954 INFO L280 TraceCheckUtils]: 5: Hoare triple {3259#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(9);~i~1 := 0; {3264#(= 0 main_~i~1)} is VALID [2020-07-10 15:28:08,954 INFO L280 TraceCheckUtils]: 6: Hoare triple {3264#(= 0 main_~i~1)} assume !!(~i~1 < 8);assume -128 <= #t~nondet21 && #t~nondet21 <= 127;call write~int(#t~nondet21, ~#A~0.base, ~#A~0.offset + ~i~1, 1);havoc #t~nondet21; {3264#(= 0 main_~i~1)} is VALID [2020-07-10 15:28:08,955 INFO L280 TraceCheckUtils]: 7: Hoare triple {3264#(= 0 main_~i~1)} #t~post20 := ~i~1;~i~1 := 1 + #t~post20;havoc #t~post20; {3265#(<= main_~i~1 1)} is VALID [2020-07-10 15:28:08,955 INFO L280 TraceCheckUtils]: 8: Hoare triple {3265#(<= main_~i~1 1)} assume !!(~i~1 < 8);assume -128 <= #t~nondet21 && #t~nondet21 <= 127;call write~int(#t~nondet21, ~#A~0.base, ~#A~0.offset + ~i~1, 1);havoc #t~nondet21; {3265#(<= main_~i~1 1)} is VALID [2020-07-10 15:28:08,956 INFO L280 TraceCheckUtils]: 9: Hoare triple {3265#(<= main_~i~1 1)} #t~post20 := ~i~1;~i~1 := 1 + #t~post20;havoc #t~post20; {3266#(<= main_~i~1 2)} is VALID [2020-07-10 15:28:08,956 INFO L280 TraceCheckUtils]: 10: Hoare triple {3266#(<= main_~i~1 2)} assume !!(~i~1 < 8);assume -128 <= #t~nondet21 && #t~nondet21 <= 127;call write~int(#t~nondet21, ~#A~0.base, ~#A~0.offset + ~i~1, 1);havoc #t~nondet21; {3266#(<= main_~i~1 2)} is VALID [2020-07-10 15:28:08,956 INFO L280 TraceCheckUtils]: 11: Hoare triple {3266#(<= main_~i~1 2)} #t~post20 := ~i~1;~i~1 := 1 + #t~post20;havoc #t~post20; {3267#(<= main_~i~1 3)} is VALID [2020-07-10 15:28:08,957 INFO L280 TraceCheckUtils]: 12: Hoare triple {3267#(<= main_~i~1 3)} assume !(~i~1 < 8); {3260#false} is VALID [2020-07-10 15:28:08,957 INFO L280 TraceCheckUtils]: 13: Hoare triple {3260#false} call write~int(0, ~#A~0.base, 8 + ~#A~0.offset, 1); {3260#false} is VALID [2020-07-10 15:28:08,957 INFO L263 TraceCheckUtils]: 14: Hoare triple {3260#false} call #t~ret22 := parse_expression_list(~#A~0.base, ~#A~0.offset); {3260#false} is VALID [2020-07-10 15:28:08,957 INFO L280 TraceCheckUtils]: 15: Hoare triple {3260#false} ~str.base, ~str.offset := #in~str.base, #in~str.offset;~start~0 := 0;~i~0 := -1;~j~0 := -1;call ~#str2~0.base, ~#str2~0.offset := #Ultimate.allocOnStack(2); {3260#false} is VALID [2020-07-10 15:28:08,958 INFO L280 TraceCheckUtils]: 16: Hoare triple {3260#false} assume !(~str.base == 0 && ~str.offset == 0); {3260#false} is VALID [2020-07-10 15:28:08,958 INFO L280 TraceCheckUtils]: 17: Hoare triple {3260#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2;call #t~mem3 := read~int(~str.base, ~str.offset + ~i~0, 1);#t~switch4 := 0 == #t~mem3; {3260#false} is VALID [2020-07-10 15:28:08,958 INFO L280 TraceCheckUtils]: 18: Hoare triple {3260#false} assume !#t~switch4; {3260#false} is VALID [2020-07-10 15:28:08,958 INFO L280 TraceCheckUtils]: 19: Hoare triple {3260#false} havoc #t~switch4;havoc #t~mem3; {3260#false} is VALID [2020-07-10 15:28:08,958 INFO L280 TraceCheckUtils]: 20: Hoare triple {3260#false} call #t~mem1 := read~int(~str.base, ~str.offset + ~i~0, 1); {3260#false} is VALID [2020-07-10 15:28:08,958 INFO L280 TraceCheckUtils]: 21: Hoare triple {3260#false} assume !!(0 != #t~mem1);havoc #t~mem1; {3260#false} is VALID [2020-07-10 15:28:08,958 INFO L280 TraceCheckUtils]: 22: Hoare triple {3260#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2;call #t~mem3 := read~int(~str.base, ~str.offset + ~i~0, 1);#t~switch4 := 0 == #t~mem3; {3260#false} is VALID [2020-07-10 15:28:08,959 INFO L280 TraceCheckUtils]: 23: Hoare triple {3260#false} assume #t~switch4; {3260#false} is VALID [2020-07-10 15:28:08,959 INFO L280 TraceCheckUtils]: 24: Hoare triple {3260#false} call #t~mem5 := read~int(~str.base, ~str.offset + ~start~0, 1);#t~short7 := 32 == #t~mem5; {3260#false} is VALID [2020-07-10 15:28:08,959 INFO L280 TraceCheckUtils]: 25: Hoare triple {3260#false} assume !#t~short7;call #t~mem6 := read~int(~str.base, ~str.offset + ~start~0, 1);#t~short7 := 9 == #t~mem6; {3260#false} is VALID [2020-07-10 15:28:08,959 INFO L280 TraceCheckUtils]: 26: Hoare triple {3260#false} assume !#t~short7;havoc #t~mem5;havoc #t~short7;havoc #t~mem6; {3260#false} is VALID [2020-07-10 15:28:08,959 INFO L280 TraceCheckUtils]: 27: Hoare triple {3260#false} call #t~mem9 := read~int(~str.base, ~str.offset + ~start~0, 1); {3260#false} is VALID [2020-07-10 15:28:08,959 INFO L280 TraceCheckUtils]: 28: Hoare triple {3260#false} assume 34 == #t~mem9;havoc #t~mem9;#t~post10 := ~start~0;~start~0 := 1 + #t~post10;havoc #t~post10; {3260#false} is VALID [2020-07-10 15:28:08,959 INFO L280 TraceCheckUtils]: 29: Hoare triple {3260#false} ~j~0 := ~i~0 - 1; {3260#false} is VALID [2020-07-10 15:28:08,959 INFO L280 TraceCheckUtils]: 30: Hoare triple {3260#false} #t~short14 := 0 < ~j~0; {3260#false} is VALID [2020-07-10 15:28:08,960 INFO L280 TraceCheckUtils]: 31: Hoare triple {3260#false} assume !#t~short14; {3260#false} is VALID [2020-07-10 15:28:08,960 INFO L280 TraceCheckUtils]: 32: Hoare triple {3260#false} assume !#t~short14;havoc #t~mem11;havoc #t~short13;havoc #t~short14;havoc #t~mem12; {3260#false} is VALID [2020-07-10 15:28:08,960 INFO L280 TraceCheckUtils]: 33: Hoare triple {3260#false} #t~short17 := 0 < ~j~0; {3260#false} is VALID [2020-07-10 15:28:08,960 INFO L280 TraceCheckUtils]: 34: Hoare triple {3260#false} assume !#t~short17; {3260#false} is VALID [2020-07-10 15:28:08,960 INFO L280 TraceCheckUtils]: 35: Hoare triple {3260#false} assume !#t~short17;havoc #t~mem16;havoc #t~short17; {3260#false} is VALID [2020-07-10 15:28:08,960 INFO L280 TraceCheckUtils]: 36: Hoare triple {3260#false} assume ~start~0 <= ~j~0; {3260#false} is VALID [2020-07-10 15:28:08,960 INFO L280 TraceCheckUtils]: 37: Hoare triple {3260#false} assume !(1 + (~j~0 - ~start~0) >= 2); {3260#false} is VALID [2020-07-10 15:28:08,960 INFO L263 TraceCheckUtils]: 38: Hoare triple {3260#false} call #t~ret19.base, #t~ret19.offset := r_strncpy(~#str2~0.base, ~#str2~0.offset, ~str.base, ~str.offset + ~start~0, 1 + (~j~0 - ~start~0)); {3259#true} is VALID [2020-07-10 15:28:08,961 INFO L280 TraceCheckUtils]: 39: Hoare triple {3259#true} ~dest.base, ~dest.offset := #in~dest.base, #in~dest.offset;~src.base, ~src.offset := #in~src.base, #in~src.offset;~n := #in~n;call #t~ret0.base, #t~ret0.offset := strncpy(~dest.base, ~dest.offset, ~src.base, ~src.offset, ~n);#res.base, #res.offset := #t~ret0.base, #t~ret0.offset;havoc #t~ret0.base, #t~ret0.offset; {3259#true} is VALID [2020-07-10 15:28:08,961 INFO L280 TraceCheckUtils]: 40: Hoare triple {3259#true} assume true; {3259#true} is VALID [2020-07-10 15:28:08,961 INFO L275 TraceCheckUtils]: 41: Hoare quadruple {3259#true} {3260#false} #147#return; {3260#false} is VALID [2020-07-10 15:28:08,961 INFO L280 TraceCheckUtils]: 42: Hoare triple {3260#false} havoc #t~ret19.base, #t~ret19.offset; {3260#false} is VALID [2020-07-10 15:28:08,961 INFO L263 TraceCheckUtils]: 43: Hoare triple {3260#false} call __VERIFIER_assert((if 1 + (~j~0 - ~start~0) < 2 then 1 else 0)); {3260#false} is VALID [2020-07-10 15:28:08,961 INFO L280 TraceCheckUtils]: 44: Hoare triple {3260#false} ~cond := #in~cond; {3260#false} is VALID [2020-07-10 15:28:08,961 INFO L280 TraceCheckUtils]: 45: Hoare triple {3260#false} assume 0 == ~cond; {3260#false} is VALID [2020-07-10 15:28:08,962 INFO L280 TraceCheckUtils]: 46: Hoare triple {3260#false} assume !false; {3260#false} is VALID [2020-07-10 15:28:08,963 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-10 15:28:08,963 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613058294] [2020-07-10 15:28:08,964 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [786134479] [2020-07-10 15:28:08,964 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:28:09,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:09,020 INFO L264 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-10 15:28:09,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:09,033 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:28:09,097 INFO L263 TraceCheckUtils]: 0: Hoare triple {3259#true} call ULTIMATE.init(); {3259#true} is VALID [2020-07-10 15:28:09,098 INFO L280 TraceCheckUtils]: 1: Hoare triple {3259#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {3259#true} is VALID [2020-07-10 15:28:09,098 INFO L280 TraceCheckUtils]: 2: Hoare triple {3259#true} assume true; {3259#true} is VALID [2020-07-10 15:28:09,098 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3259#true} {3259#true} #151#return; {3259#true} is VALID [2020-07-10 15:28:09,098 INFO L263 TraceCheckUtils]: 4: Hoare triple {3259#true} call #t~ret23 := main(); {3259#true} is VALID [2020-07-10 15:28:09,099 INFO L280 TraceCheckUtils]: 5: Hoare triple {3259#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(9);~i~1 := 0; {3290#(<= main_~i~1 0)} is VALID [2020-07-10 15:28:09,100 INFO L280 TraceCheckUtils]: 6: Hoare triple {3290#(<= main_~i~1 0)} assume !!(~i~1 < 8);assume -128 <= #t~nondet21 && #t~nondet21 <= 127;call write~int(#t~nondet21, ~#A~0.base, ~#A~0.offset + ~i~1, 1);havoc #t~nondet21; {3290#(<= main_~i~1 0)} is VALID [2020-07-10 15:28:09,100 INFO L280 TraceCheckUtils]: 7: Hoare triple {3290#(<= main_~i~1 0)} #t~post20 := ~i~1;~i~1 := 1 + #t~post20;havoc #t~post20; {3265#(<= main_~i~1 1)} is VALID [2020-07-10 15:28:09,101 INFO L280 TraceCheckUtils]: 8: Hoare triple {3265#(<= main_~i~1 1)} assume !!(~i~1 < 8);assume -128 <= #t~nondet21 && #t~nondet21 <= 127;call write~int(#t~nondet21, ~#A~0.base, ~#A~0.offset + ~i~1, 1);havoc #t~nondet21; {3265#(<= main_~i~1 1)} is VALID [2020-07-10 15:28:09,101 INFO L280 TraceCheckUtils]: 9: Hoare triple {3265#(<= main_~i~1 1)} #t~post20 := ~i~1;~i~1 := 1 + #t~post20;havoc #t~post20; {3266#(<= main_~i~1 2)} is VALID [2020-07-10 15:28:09,101 INFO L280 TraceCheckUtils]: 10: Hoare triple {3266#(<= main_~i~1 2)} assume !!(~i~1 < 8);assume -128 <= #t~nondet21 && #t~nondet21 <= 127;call write~int(#t~nondet21, ~#A~0.base, ~#A~0.offset + ~i~1, 1);havoc #t~nondet21; {3266#(<= main_~i~1 2)} is VALID [2020-07-10 15:28:09,102 INFO L280 TraceCheckUtils]: 11: Hoare triple {3266#(<= main_~i~1 2)} #t~post20 := ~i~1;~i~1 := 1 + #t~post20;havoc #t~post20; {3267#(<= main_~i~1 3)} is VALID [2020-07-10 15:28:09,102 INFO L280 TraceCheckUtils]: 12: Hoare triple {3267#(<= main_~i~1 3)} assume !(~i~1 < 8); {3260#false} is VALID [2020-07-10 15:28:09,102 INFO L280 TraceCheckUtils]: 13: Hoare triple {3260#false} call write~int(0, ~#A~0.base, 8 + ~#A~0.offset, 1); {3260#false} is VALID [2020-07-10 15:28:09,103 INFO L263 TraceCheckUtils]: 14: Hoare triple {3260#false} call #t~ret22 := parse_expression_list(~#A~0.base, ~#A~0.offset); {3260#false} is VALID [2020-07-10 15:28:09,103 INFO L280 TraceCheckUtils]: 15: Hoare triple {3260#false} ~str.base, ~str.offset := #in~str.base, #in~str.offset;~start~0 := 0;~i~0 := -1;~j~0 := -1;call ~#str2~0.base, ~#str2~0.offset := #Ultimate.allocOnStack(2); {3260#false} is VALID [2020-07-10 15:28:09,103 INFO L280 TraceCheckUtils]: 16: Hoare triple {3260#false} assume !(~str.base == 0 && ~str.offset == 0); {3260#false} is VALID [2020-07-10 15:28:09,103 INFO L280 TraceCheckUtils]: 17: Hoare triple {3260#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2;call #t~mem3 := read~int(~str.base, ~str.offset + ~i~0, 1);#t~switch4 := 0 == #t~mem3; {3260#false} is VALID [2020-07-10 15:28:09,103 INFO L280 TraceCheckUtils]: 18: Hoare triple {3260#false} assume !#t~switch4; {3260#false} is VALID [2020-07-10 15:28:09,103 INFO L280 TraceCheckUtils]: 19: Hoare triple {3260#false} havoc #t~switch4;havoc #t~mem3; {3260#false} is VALID [2020-07-10 15:28:09,103 INFO L280 TraceCheckUtils]: 20: Hoare triple {3260#false} call #t~mem1 := read~int(~str.base, ~str.offset + ~i~0, 1); {3260#false} is VALID [2020-07-10 15:28:09,104 INFO L280 TraceCheckUtils]: 21: Hoare triple {3260#false} assume !!(0 != #t~mem1);havoc #t~mem1; {3260#false} is VALID [2020-07-10 15:28:09,104 INFO L280 TraceCheckUtils]: 22: Hoare triple {3260#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2;call #t~mem3 := read~int(~str.base, ~str.offset + ~i~0, 1);#t~switch4 := 0 == #t~mem3; {3260#false} is VALID [2020-07-10 15:28:09,104 INFO L280 TraceCheckUtils]: 23: Hoare triple {3260#false} assume #t~switch4; {3260#false} is VALID [2020-07-10 15:28:09,104 INFO L280 TraceCheckUtils]: 24: Hoare triple {3260#false} call #t~mem5 := read~int(~str.base, ~str.offset + ~start~0, 1);#t~short7 := 32 == #t~mem5; {3260#false} is VALID [2020-07-10 15:28:09,104 INFO L280 TraceCheckUtils]: 25: Hoare triple {3260#false} assume !#t~short7;call #t~mem6 := read~int(~str.base, ~str.offset + ~start~0, 1);#t~short7 := 9 == #t~mem6; {3260#false} is VALID [2020-07-10 15:28:09,104 INFO L280 TraceCheckUtils]: 26: Hoare triple {3260#false} assume !#t~short7;havoc #t~mem5;havoc #t~short7;havoc #t~mem6; {3260#false} is VALID [2020-07-10 15:28:09,104 INFO L280 TraceCheckUtils]: 27: Hoare triple {3260#false} call #t~mem9 := read~int(~str.base, ~str.offset + ~start~0, 1); {3260#false} is VALID [2020-07-10 15:28:09,104 INFO L280 TraceCheckUtils]: 28: Hoare triple {3260#false} assume 34 == #t~mem9;havoc #t~mem9;#t~post10 := ~start~0;~start~0 := 1 + #t~post10;havoc #t~post10; {3260#false} is VALID [2020-07-10 15:28:09,105 INFO L280 TraceCheckUtils]: 29: Hoare triple {3260#false} ~j~0 := ~i~0 - 1; {3260#false} is VALID [2020-07-10 15:28:09,105 INFO L280 TraceCheckUtils]: 30: Hoare triple {3260#false} #t~short14 := 0 < ~j~0; {3260#false} is VALID [2020-07-10 15:28:09,105 INFO L280 TraceCheckUtils]: 31: Hoare triple {3260#false} assume !#t~short14; {3260#false} is VALID [2020-07-10 15:28:09,105 INFO L280 TraceCheckUtils]: 32: Hoare triple {3260#false} assume !#t~short14;havoc #t~mem11;havoc #t~short13;havoc #t~short14;havoc #t~mem12; {3260#false} is VALID [2020-07-10 15:28:09,105 INFO L280 TraceCheckUtils]: 33: Hoare triple {3260#false} #t~short17 := 0 < ~j~0; {3260#false} is VALID [2020-07-10 15:28:09,105 INFO L280 TraceCheckUtils]: 34: Hoare triple {3260#false} assume !#t~short17; {3260#false} is VALID [2020-07-10 15:28:09,105 INFO L280 TraceCheckUtils]: 35: Hoare triple {3260#false} assume !#t~short17;havoc #t~mem16;havoc #t~short17; {3260#false} is VALID [2020-07-10 15:28:09,105 INFO L280 TraceCheckUtils]: 36: Hoare triple {3260#false} assume ~start~0 <= ~j~0; {3260#false} is VALID [2020-07-10 15:28:09,106 INFO L280 TraceCheckUtils]: 37: Hoare triple {3260#false} assume !(1 + (~j~0 - ~start~0) >= 2); {3260#false} is VALID [2020-07-10 15:28:09,106 INFO L263 TraceCheckUtils]: 38: Hoare triple {3260#false} call #t~ret19.base, #t~ret19.offset := r_strncpy(~#str2~0.base, ~#str2~0.offset, ~str.base, ~str.offset + ~start~0, 1 + (~j~0 - ~start~0)); {3260#false} is VALID [2020-07-10 15:28:09,106 INFO L280 TraceCheckUtils]: 39: Hoare triple {3260#false} ~dest.base, ~dest.offset := #in~dest.base, #in~dest.offset;~src.base, ~src.offset := #in~src.base, #in~src.offset;~n := #in~n;call #t~ret0.base, #t~ret0.offset := strncpy(~dest.base, ~dest.offset, ~src.base, ~src.offset, ~n);#res.base, #res.offset := #t~ret0.base, #t~ret0.offset;havoc #t~ret0.base, #t~ret0.offset; {3260#false} is VALID [2020-07-10 15:28:09,106 INFO L280 TraceCheckUtils]: 40: Hoare triple {3260#false} assume true; {3260#false} is VALID [2020-07-10 15:28:09,106 INFO L275 TraceCheckUtils]: 41: Hoare quadruple {3260#false} {3260#false} #147#return; {3260#false} is VALID [2020-07-10 15:28:09,106 INFO L280 TraceCheckUtils]: 42: Hoare triple {3260#false} havoc #t~ret19.base, #t~ret19.offset; {3260#false} is VALID [2020-07-10 15:28:09,106 INFO L263 TraceCheckUtils]: 43: Hoare triple {3260#false} call __VERIFIER_assert((if 1 + (~j~0 - ~start~0) < 2 then 1 else 0)); {3260#false} is VALID [2020-07-10 15:28:09,106 INFO L280 TraceCheckUtils]: 44: Hoare triple {3260#false} ~cond := #in~cond; {3260#false} is VALID [2020-07-10 15:28:09,107 INFO L280 TraceCheckUtils]: 45: Hoare triple {3260#false} assume 0 == ~cond; {3260#false} is VALID [2020-07-10 15:28:09,107 INFO L280 TraceCheckUtils]: 46: Hoare triple {3260#false} assume !false; {3260#false} is VALID [2020-07-10 15:28:09,108 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-10 15:28:09,108 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-10 15:28:09,108 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 8 [2020-07-10 15:28:09,109 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781382037] [2020-07-10 15:28:09,109 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 47 [2020-07-10 15:28:09,109 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:28:09,110 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-10 15:28:09,166 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:28:09,166 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-10 15:28:09,167 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:28:09,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-10 15:28:09,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-07-10 15:28:09,167 INFO L87 Difference]: Start difference. First operand 59 states and 69 transitions. Second operand 8 states. [2020-07-10 15:28:09,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:09,556 INFO L93 Difference]: Finished difference Result 108 states and 128 transitions. [2020-07-10 15:28:09,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-10 15:28:09,556 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 47 [2020-07-10 15:28:09,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:28:09,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-10 15:28:09,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 114 transitions. [2020-07-10 15:28:09,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-10 15:28:09,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 114 transitions. [2020-07-10 15:28:09,561 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 114 transitions. [2020-07-10 15:28:09,685 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:28:09,687 INFO L225 Difference]: With dead ends: 108 [2020-07-10 15:28:09,687 INFO L226 Difference]: Without dead ends: 62 [2020-07-10 15:28:09,688 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-07-10 15:28:09,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2020-07-10 15:28:09,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2020-07-10 15:28:09,719 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:28:09,719 INFO L82 GeneralOperation]: Start isEquivalent. First operand 62 states. Second operand 61 states. [2020-07-10 15:28:09,720 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand 61 states. [2020-07-10 15:28:09,720 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 61 states. [2020-07-10 15:28:09,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:09,722 INFO L93 Difference]: Finished difference Result 62 states and 72 transitions. [2020-07-10 15:28:09,722 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 72 transitions. [2020-07-10 15:28:09,723 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:28:09,723 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:28:09,723 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand 62 states. [2020-07-10 15:28:09,723 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 62 states. [2020-07-10 15:28:09,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:09,726 INFO L93 Difference]: Finished difference Result 62 states and 72 transitions. [2020-07-10 15:28:09,726 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 72 transitions. [2020-07-10 15:28:09,726 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:28:09,726 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:28:09,727 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:28:09,727 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:28:09,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2020-07-10 15:28:09,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 71 transitions. [2020-07-10 15:28:09,729 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 71 transitions. Word has length 47 [2020-07-10 15:28:09,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:28:09,730 INFO L479 AbstractCegarLoop]: Abstraction has 61 states and 71 transitions. [2020-07-10 15:28:09,730 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-10 15:28:09,730 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 71 transitions. [2020-07-10 15:28:09,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2020-07-10 15:28:09,730 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:28:09,731 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:28:09,943 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:28:09,944 INFO L427 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:28:09,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:28:09,945 INFO L82 PathProgramCache]: Analyzing trace with hash -900340667, now seen corresponding path program 2 times [2020-07-10 15:28:09,945 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:28:09,946 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805741115] [2020-07-10 15:28:09,946 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:28:09,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:10,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:10,035 INFO L280 TraceCheckUtils]: 0: Hoare triple {3767#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {3754#true} is VALID [2020-07-10 15:28:10,036 INFO L280 TraceCheckUtils]: 1: Hoare triple {3754#true} assume true; {3754#true} is VALID [2020-07-10 15:28:10,036 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {3754#true} {3754#true} #151#return; {3754#true} is VALID [2020-07-10 15:28:10,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:10,047 INFO L280 TraceCheckUtils]: 0: Hoare triple {3754#true} ~dest.base, ~dest.offset := #in~dest.base, #in~dest.offset;~src.base, ~src.offset := #in~src.base, #in~src.offset;~n := #in~n;call #t~ret0.base, #t~ret0.offset := strncpy(~dest.base, ~dest.offset, ~src.base, ~src.offset, ~n);#res.base, #res.offset := #t~ret0.base, #t~ret0.offset;havoc #t~ret0.base, #t~ret0.offset; {3754#true} is VALID [2020-07-10 15:28:10,047 INFO L280 TraceCheckUtils]: 1: Hoare triple {3754#true} assume true; {3754#true} is VALID [2020-07-10 15:28:10,047 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {3754#true} {3755#false} #147#return; {3755#false} is VALID [2020-07-10 15:28:10,048 INFO L263 TraceCheckUtils]: 0: Hoare triple {3754#true} call ULTIMATE.init(); {3767#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 15:28:10,048 INFO L280 TraceCheckUtils]: 1: Hoare triple {3767#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {3754#true} is VALID [2020-07-10 15:28:10,048 INFO L280 TraceCheckUtils]: 2: Hoare triple {3754#true} assume true; {3754#true} is VALID [2020-07-10 15:28:10,048 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3754#true} {3754#true} #151#return; {3754#true} is VALID [2020-07-10 15:28:10,048 INFO L263 TraceCheckUtils]: 4: Hoare triple {3754#true} call #t~ret23 := main(); {3754#true} is VALID [2020-07-10 15:28:10,052 INFO L280 TraceCheckUtils]: 5: Hoare triple {3754#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(9);~i~1 := 0; {3759#(= 0 main_~i~1)} is VALID [2020-07-10 15:28:10,054 INFO L280 TraceCheckUtils]: 6: Hoare triple {3759#(= 0 main_~i~1)} assume !!(~i~1 < 8);assume -128 <= #t~nondet21 && #t~nondet21 <= 127;call write~int(#t~nondet21, ~#A~0.base, ~#A~0.offset + ~i~1, 1);havoc #t~nondet21; {3759#(= 0 main_~i~1)} is VALID [2020-07-10 15:28:10,055 INFO L280 TraceCheckUtils]: 7: Hoare triple {3759#(= 0 main_~i~1)} #t~post20 := ~i~1;~i~1 := 1 + #t~post20;havoc #t~post20; {3760#(<= main_~i~1 1)} is VALID [2020-07-10 15:28:10,056 INFO L280 TraceCheckUtils]: 8: Hoare triple {3760#(<= main_~i~1 1)} assume !!(~i~1 < 8);assume -128 <= #t~nondet21 && #t~nondet21 <= 127;call write~int(#t~nondet21, ~#A~0.base, ~#A~0.offset + ~i~1, 1);havoc #t~nondet21; {3760#(<= main_~i~1 1)} is VALID [2020-07-10 15:28:10,056 INFO L280 TraceCheckUtils]: 9: Hoare triple {3760#(<= main_~i~1 1)} #t~post20 := ~i~1;~i~1 := 1 + #t~post20;havoc #t~post20; {3761#(<= main_~i~1 2)} is VALID [2020-07-10 15:28:10,057 INFO L280 TraceCheckUtils]: 10: Hoare triple {3761#(<= main_~i~1 2)} assume !!(~i~1 < 8);assume -128 <= #t~nondet21 && #t~nondet21 <= 127;call write~int(#t~nondet21, ~#A~0.base, ~#A~0.offset + ~i~1, 1);havoc #t~nondet21; {3761#(<= main_~i~1 2)} is VALID [2020-07-10 15:28:10,058 INFO L280 TraceCheckUtils]: 11: Hoare triple {3761#(<= main_~i~1 2)} #t~post20 := ~i~1;~i~1 := 1 + #t~post20;havoc #t~post20; {3762#(<= main_~i~1 3)} is VALID [2020-07-10 15:28:10,058 INFO L280 TraceCheckUtils]: 12: Hoare triple {3762#(<= main_~i~1 3)} assume !!(~i~1 < 8);assume -128 <= #t~nondet21 && #t~nondet21 <= 127;call write~int(#t~nondet21, ~#A~0.base, ~#A~0.offset + ~i~1, 1);havoc #t~nondet21; {3762#(<= main_~i~1 3)} is VALID [2020-07-10 15:28:10,059 INFO L280 TraceCheckUtils]: 13: Hoare triple {3762#(<= main_~i~1 3)} #t~post20 := ~i~1;~i~1 := 1 + #t~post20;havoc #t~post20; {3763#(<= main_~i~1 4)} is VALID [2020-07-10 15:28:10,060 INFO L280 TraceCheckUtils]: 14: Hoare triple {3763#(<= main_~i~1 4)} assume !(~i~1 < 8); {3755#false} is VALID [2020-07-10 15:28:10,060 INFO L280 TraceCheckUtils]: 15: Hoare triple {3755#false} call write~int(0, ~#A~0.base, 8 + ~#A~0.offset, 1); {3755#false} is VALID [2020-07-10 15:28:10,060 INFO L263 TraceCheckUtils]: 16: Hoare triple {3755#false} call #t~ret22 := parse_expression_list(~#A~0.base, ~#A~0.offset); {3755#false} is VALID [2020-07-10 15:28:10,060 INFO L280 TraceCheckUtils]: 17: Hoare triple {3755#false} ~str.base, ~str.offset := #in~str.base, #in~str.offset;~start~0 := 0;~i~0 := -1;~j~0 := -1;call ~#str2~0.base, ~#str2~0.offset := #Ultimate.allocOnStack(2); {3755#false} is VALID [2020-07-10 15:28:10,060 INFO L280 TraceCheckUtils]: 18: Hoare triple {3755#false} assume !(~str.base == 0 && ~str.offset == 0); {3755#false} is VALID [2020-07-10 15:28:10,061 INFO L280 TraceCheckUtils]: 19: Hoare triple {3755#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2;call #t~mem3 := read~int(~str.base, ~str.offset + ~i~0, 1);#t~switch4 := 0 == #t~mem3; {3755#false} is VALID [2020-07-10 15:28:10,061 INFO L280 TraceCheckUtils]: 20: Hoare triple {3755#false} assume !#t~switch4; {3755#false} is VALID [2020-07-10 15:28:10,061 INFO L280 TraceCheckUtils]: 21: Hoare triple {3755#false} havoc #t~switch4;havoc #t~mem3; {3755#false} is VALID [2020-07-10 15:28:10,061 INFO L280 TraceCheckUtils]: 22: Hoare triple {3755#false} call #t~mem1 := read~int(~str.base, ~str.offset + ~i~0, 1); {3755#false} is VALID [2020-07-10 15:28:10,061 INFO L280 TraceCheckUtils]: 23: Hoare triple {3755#false} assume !!(0 != #t~mem1);havoc #t~mem1; {3755#false} is VALID [2020-07-10 15:28:10,061 INFO L280 TraceCheckUtils]: 24: Hoare triple {3755#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2;call #t~mem3 := read~int(~str.base, ~str.offset + ~i~0, 1);#t~switch4 := 0 == #t~mem3; {3755#false} is VALID [2020-07-10 15:28:10,062 INFO L280 TraceCheckUtils]: 25: Hoare triple {3755#false} assume #t~switch4; {3755#false} is VALID [2020-07-10 15:28:10,062 INFO L280 TraceCheckUtils]: 26: Hoare triple {3755#false} call #t~mem5 := read~int(~str.base, ~str.offset + ~start~0, 1);#t~short7 := 32 == #t~mem5; {3755#false} is VALID [2020-07-10 15:28:10,062 INFO L280 TraceCheckUtils]: 27: Hoare triple {3755#false} assume !#t~short7;call #t~mem6 := read~int(~str.base, ~str.offset + ~start~0, 1);#t~short7 := 9 == #t~mem6; {3755#false} is VALID [2020-07-10 15:28:10,062 INFO L280 TraceCheckUtils]: 28: Hoare triple {3755#false} assume !#t~short7;havoc #t~mem5;havoc #t~short7;havoc #t~mem6; {3755#false} is VALID [2020-07-10 15:28:10,062 INFO L280 TraceCheckUtils]: 29: Hoare triple {3755#false} call #t~mem9 := read~int(~str.base, ~str.offset + ~start~0, 1); {3755#false} is VALID [2020-07-10 15:28:10,063 INFO L280 TraceCheckUtils]: 30: Hoare triple {3755#false} assume 34 == #t~mem9;havoc #t~mem9;#t~post10 := ~start~0;~start~0 := 1 + #t~post10;havoc #t~post10; {3755#false} is VALID [2020-07-10 15:28:10,063 INFO L280 TraceCheckUtils]: 31: Hoare triple {3755#false} ~j~0 := ~i~0 - 1; {3755#false} is VALID [2020-07-10 15:28:10,063 INFO L280 TraceCheckUtils]: 32: Hoare triple {3755#false} #t~short14 := 0 < ~j~0; {3755#false} is VALID [2020-07-10 15:28:10,063 INFO L280 TraceCheckUtils]: 33: Hoare triple {3755#false} assume !#t~short14; {3755#false} is VALID [2020-07-10 15:28:10,063 INFO L280 TraceCheckUtils]: 34: Hoare triple {3755#false} assume !#t~short14;havoc #t~mem11;havoc #t~short13;havoc #t~short14;havoc #t~mem12; {3755#false} is VALID [2020-07-10 15:28:10,063 INFO L280 TraceCheckUtils]: 35: Hoare triple {3755#false} #t~short17 := 0 < ~j~0; {3755#false} is VALID [2020-07-10 15:28:10,064 INFO L280 TraceCheckUtils]: 36: Hoare triple {3755#false} assume !#t~short17; {3755#false} is VALID [2020-07-10 15:28:10,064 INFO L280 TraceCheckUtils]: 37: Hoare triple {3755#false} assume !#t~short17;havoc #t~mem16;havoc #t~short17; {3755#false} is VALID [2020-07-10 15:28:10,064 INFO L280 TraceCheckUtils]: 38: Hoare triple {3755#false} assume ~start~0 <= ~j~0; {3755#false} is VALID [2020-07-10 15:28:10,064 INFO L280 TraceCheckUtils]: 39: Hoare triple {3755#false} assume !(1 + (~j~0 - ~start~0) >= 2); {3755#false} is VALID [2020-07-10 15:28:10,064 INFO L263 TraceCheckUtils]: 40: Hoare triple {3755#false} call #t~ret19.base, #t~ret19.offset := r_strncpy(~#str2~0.base, ~#str2~0.offset, ~str.base, ~str.offset + ~start~0, 1 + (~j~0 - ~start~0)); {3754#true} is VALID [2020-07-10 15:28:10,065 INFO L280 TraceCheckUtils]: 41: Hoare triple {3754#true} ~dest.base, ~dest.offset := #in~dest.base, #in~dest.offset;~src.base, ~src.offset := #in~src.base, #in~src.offset;~n := #in~n;call #t~ret0.base, #t~ret0.offset := strncpy(~dest.base, ~dest.offset, ~src.base, ~src.offset, ~n);#res.base, #res.offset := #t~ret0.base, #t~ret0.offset;havoc #t~ret0.base, #t~ret0.offset; {3754#true} is VALID [2020-07-10 15:28:10,065 INFO L280 TraceCheckUtils]: 42: Hoare triple {3754#true} assume true; {3754#true} is VALID [2020-07-10 15:28:10,065 INFO L275 TraceCheckUtils]: 43: Hoare quadruple {3754#true} {3755#false} #147#return; {3755#false} is VALID [2020-07-10 15:28:10,065 INFO L280 TraceCheckUtils]: 44: Hoare triple {3755#false} havoc #t~ret19.base, #t~ret19.offset; {3755#false} is VALID [2020-07-10 15:28:10,065 INFO L263 TraceCheckUtils]: 45: Hoare triple {3755#false} call __VERIFIER_assert((if 1 + (~j~0 - ~start~0) < 2 then 1 else 0)); {3755#false} is VALID [2020-07-10 15:28:10,065 INFO L280 TraceCheckUtils]: 46: Hoare triple {3755#false} ~cond := #in~cond; {3755#false} is VALID [2020-07-10 15:28:10,066 INFO L280 TraceCheckUtils]: 47: Hoare triple {3755#false} assume 0 == ~cond; {3755#false} is VALID [2020-07-10 15:28:10,066 INFO L280 TraceCheckUtils]: 48: Hoare triple {3755#false} assume !false; {3755#false} is VALID [2020-07-10 15:28:10,068 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-10 15:28:10,068 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805741115] [2020-07-10 15:28:10,069 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [149168732] [2020-07-10 15:28:10,069 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:28:10,140 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2020-07-10 15:28:10,141 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-10 15:28:10,141 INFO L264 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-10 15:28:10,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:10,157 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:28:10,249 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-10 15:28:10,292 INFO L263 TraceCheckUtils]: 0: Hoare triple {3754#true} call ULTIMATE.init(); {3754#true} is VALID [2020-07-10 15:28:10,292 INFO L280 TraceCheckUtils]: 1: Hoare triple {3754#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {3754#true} is VALID [2020-07-10 15:28:10,292 INFO L280 TraceCheckUtils]: 2: Hoare triple {3754#true} assume true; {3754#true} is VALID [2020-07-10 15:28:10,292 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3754#true} {3754#true} #151#return; {3754#true} is VALID [2020-07-10 15:28:10,292 INFO L263 TraceCheckUtils]: 4: Hoare triple {3754#true} call #t~ret23 := main(); {3754#true} is VALID [2020-07-10 15:28:10,292 INFO L280 TraceCheckUtils]: 5: Hoare triple {3754#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(9);~i~1 := 0; {3754#true} is VALID [2020-07-10 15:28:10,293 INFO L280 TraceCheckUtils]: 6: Hoare triple {3754#true} assume !!(~i~1 < 8);assume -128 <= #t~nondet21 && #t~nondet21 <= 127;call write~int(#t~nondet21, ~#A~0.base, ~#A~0.offset + ~i~1, 1);havoc #t~nondet21; {3754#true} is VALID [2020-07-10 15:28:10,293 INFO L280 TraceCheckUtils]: 7: Hoare triple {3754#true} #t~post20 := ~i~1;~i~1 := 1 + #t~post20;havoc #t~post20; {3754#true} is VALID [2020-07-10 15:28:10,293 INFO L280 TraceCheckUtils]: 8: Hoare triple {3754#true} assume !!(~i~1 < 8);assume -128 <= #t~nondet21 && #t~nondet21 <= 127;call write~int(#t~nondet21, ~#A~0.base, ~#A~0.offset + ~i~1, 1);havoc #t~nondet21; {3754#true} is VALID [2020-07-10 15:28:10,293 INFO L280 TraceCheckUtils]: 9: Hoare triple {3754#true} #t~post20 := ~i~1;~i~1 := 1 + #t~post20;havoc #t~post20; {3754#true} is VALID [2020-07-10 15:28:10,293 INFO L280 TraceCheckUtils]: 10: Hoare triple {3754#true} assume !!(~i~1 < 8);assume -128 <= #t~nondet21 && #t~nondet21 <= 127;call write~int(#t~nondet21, ~#A~0.base, ~#A~0.offset + ~i~1, 1);havoc #t~nondet21; {3754#true} is VALID [2020-07-10 15:28:10,293 INFO L280 TraceCheckUtils]: 11: Hoare triple {3754#true} #t~post20 := ~i~1;~i~1 := 1 + #t~post20;havoc #t~post20; {3754#true} is VALID [2020-07-10 15:28:10,293 INFO L280 TraceCheckUtils]: 12: Hoare triple {3754#true} assume !!(~i~1 < 8);assume -128 <= #t~nondet21 && #t~nondet21 <= 127;call write~int(#t~nondet21, ~#A~0.base, ~#A~0.offset + ~i~1, 1);havoc #t~nondet21; {3754#true} is VALID [2020-07-10 15:28:10,293 INFO L280 TraceCheckUtils]: 13: Hoare triple {3754#true} #t~post20 := ~i~1;~i~1 := 1 + #t~post20;havoc #t~post20; {3754#true} is VALID [2020-07-10 15:28:10,294 INFO L280 TraceCheckUtils]: 14: Hoare triple {3754#true} assume !(~i~1 < 8); {3754#true} is VALID [2020-07-10 15:28:10,294 INFO L280 TraceCheckUtils]: 15: Hoare triple {3754#true} call write~int(0, ~#A~0.base, 8 + ~#A~0.offset, 1); {3754#true} is VALID [2020-07-10 15:28:10,294 INFO L263 TraceCheckUtils]: 16: Hoare triple {3754#true} call #t~ret22 := parse_expression_list(~#A~0.base, ~#A~0.offset); {3754#true} is VALID [2020-07-10 15:28:10,295 INFO L280 TraceCheckUtils]: 17: Hoare triple {3754#true} ~str.base, ~str.offset := #in~str.base, #in~str.offset;~start~0 := 0;~i~0 := -1;~j~0 := -1;call ~#str2~0.base, ~#str2~0.offset := #Ultimate.allocOnStack(2); {3822#(<= 0 parse_expression_list_~start~0)} is VALID [2020-07-10 15:28:10,295 INFO L280 TraceCheckUtils]: 18: Hoare triple {3822#(<= 0 parse_expression_list_~start~0)} assume !(~str.base == 0 && ~str.offset == 0); {3822#(<= 0 parse_expression_list_~start~0)} is VALID [2020-07-10 15:28:10,295 INFO L280 TraceCheckUtils]: 19: Hoare triple {3822#(<= 0 parse_expression_list_~start~0)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2;call #t~mem3 := read~int(~str.base, ~str.offset + ~i~0, 1);#t~switch4 := 0 == #t~mem3; {3822#(<= 0 parse_expression_list_~start~0)} is VALID [2020-07-10 15:28:10,296 INFO L280 TraceCheckUtils]: 20: Hoare triple {3822#(<= 0 parse_expression_list_~start~0)} assume !#t~switch4; {3822#(<= 0 parse_expression_list_~start~0)} is VALID [2020-07-10 15:28:10,296 INFO L280 TraceCheckUtils]: 21: Hoare triple {3822#(<= 0 parse_expression_list_~start~0)} havoc #t~switch4;havoc #t~mem3; {3822#(<= 0 parse_expression_list_~start~0)} is VALID [2020-07-10 15:28:10,296 INFO L280 TraceCheckUtils]: 22: Hoare triple {3822#(<= 0 parse_expression_list_~start~0)} call #t~mem1 := read~int(~str.base, ~str.offset + ~i~0, 1); {3822#(<= 0 parse_expression_list_~start~0)} is VALID [2020-07-10 15:28:10,297 INFO L280 TraceCheckUtils]: 23: Hoare triple {3822#(<= 0 parse_expression_list_~start~0)} assume !!(0 != #t~mem1);havoc #t~mem1; {3822#(<= 0 parse_expression_list_~start~0)} is VALID [2020-07-10 15:28:10,297 INFO L280 TraceCheckUtils]: 24: Hoare triple {3822#(<= 0 parse_expression_list_~start~0)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2;call #t~mem3 := read~int(~str.base, ~str.offset + ~i~0, 1);#t~switch4 := 0 == #t~mem3; {3822#(<= 0 parse_expression_list_~start~0)} is VALID [2020-07-10 15:28:10,298 INFO L280 TraceCheckUtils]: 25: Hoare triple {3822#(<= 0 parse_expression_list_~start~0)} assume #t~switch4; {3822#(<= 0 parse_expression_list_~start~0)} is VALID [2020-07-10 15:28:10,298 INFO L280 TraceCheckUtils]: 26: Hoare triple {3822#(<= 0 parse_expression_list_~start~0)} call #t~mem5 := read~int(~str.base, ~str.offset + ~start~0, 1);#t~short7 := 32 == #t~mem5; {3822#(<= 0 parse_expression_list_~start~0)} is VALID [2020-07-10 15:28:10,298 INFO L280 TraceCheckUtils]: 27: Hoare triple {3822#(<= 0 parse_expression_list_~start~0)} assume !#t~short7;call #t~mem6 := read~int(~str.base, ~str.offset + ~start~0, 1);#t~short7 := 9 == #t~mem6; {3822#(<= 0 parse_expression_list_~start~0)} is VALID [2020-07-10 15:28:10,299 INFO L280 TraceCheckUtils]: 28: Hoare triple {3822#(<= 0 parse_expression_list_~start~0)} assume !#t~short7;havoc #t~mem5;havoc #t~short7;havoc #t~mem6; {3822#(<= 0 parse_expression_list_~start~0)} is VALID [2020-07-10 15:28:10,299 INFO L280 TraceCheckUtils]: 29: Hoare triple {3822#(<= 0 parse_expression_list_~start~0)} call #t~mem9 := read~int(~str.base, ~str.offset + ~start~0, 1); {3822#(<= 0 parse_expression_list_~start~0)} is VALID [2020-07-10 15:28:10,300 INFO L280 TraceCheckUtils]: 30: Hoare triple {3822#(<= 0 parse_expression_list_~start~0)} assume 34 == #t~mem9;havoc #t~mem9;#t~post10 := ~start~0;~start~0 := 1 + #t~post10;havoc #t~post10; {3862#(<= 1 parse_expression_list_~start~0)} is VALID [2020-07-10 15:28:10,300 INFO L280 TraceCheckUtils]: 31: Hoare triple {3862#(<= 1 parse_expression_list_~start~0)} ~j~0 := ~i~0 - 1; {3862#(<= 1 parse_expression_list_~start~0)} is VALID [2020-07-10 15:28:10,301 INFO L280 TraceCheckUtils]: 32: Hoare triple {3862#(<= 1 parse_expression_list_~start~0)} #t~short14 := 0 < ~j~0; {3869#(and (<= 1 parse_expression_list_~start~0) (or (and (<= parse_expression_list_~j~0 0) (not |parse_expression_list_#t~short14|)) (and (< 0 parse_expression_list_~j~0) |parse_expression_list_#t~short14|)))} is VALID [2020-07-10 15:28:10,301 INFO L280 TraceCheckUtils]: 33: Hoare triple {3869#(and (<= 1 parse_expression_list_~start~0) (or (and (<= parse_expression_list_~j~0 0) (not |parse_expression_list_#t~short14|)) (and (< 0 parse_expression_list_~j~0) |parse_expression_list_#t~short14|)))} assume !#t~short14; {3873#(and (<= 1 parse_expression_list_~start~0) (<= parse_expression_list_~j~0 0))} is VALID [2020-07-10 15:28:10,302 INFO L280 TraceCheckUtils]: 34: Hoare triple {3873#(and (<= 1 parse_expression_list_~start~0) (<= parse_expression_list_~j~0 0))} assume !#t~short14;havoc #t~mem11;havoc #t~short13;havoc #t~short14;havoc #t~mem12; {3873#(and (<= 1 parse_expression_list_~start~0) (<= parse_expression_list_~j~0 0))} is VALID [2020-07-10 15:28:10,302 INFO L280 TraceCheckUtils]: 35: Hoare triple {3873#(and (<= 1 parse_expression_list_~start~0) (<= parse_expression_list_~j~0 0))} #t~short17 := 0 < ~j~0; {3873#(and (<= 1 parse_expression_list_~start~0) (<= parse_expression_list_~j~0 0))} is VALID [2020-07-10 15:28:10,302 INFO L280 TraceCheckUtils]: 36: Hoare triple {3873#(and (<= 1 parse_expression_list_~start~0) (<= parse_expression_list_~j~0 0))} assume !#t~short17; {3873#(and (<= 1 parse_expression_list_~start~0) (<= parse_expression_list_~j~0 0))} is VALID [2020-07-10 15:28:10,303 INFO L280 TraceCheckUtils]: 37: Hoare triple {3873#(and (<= 1 parse_expression_list_~start~0) (<= parse_expression_list_~j~0 0))} assume !#t~short17;havoc #t~mem16;havoc #t~short17; {3873#(and (<= 1 parse_expression_list_~start~0) (<= parse_expression_list_~j~0 0))} is VALID [2020-07-10 15:28:10,303 INFO L280 TraceCheckUtils]: 38: Hoare triple {3873#(and (<= 1 parse_expression_list_~start~0) (<= parse_expression_list_~j~0 0))} assume ~start~0 <= ~j~0; {3755#false} is VALID [2020-07-10 15:28:10,304 INFO L280 TraceCheckUtils]: 39: Hoare triple {3755#false} assume !(1 + (~j~0 - ~start~0) >= 2); {3755#false} is VALID [2020-07-10 15:28:10,304 INFO L263 TraceCheckUtils]: 40: Hoare triple {3755#false} call #t~ret19.base, #t~ret19.offset := r_strncpy(~#str2~0.base, ~#str2~0.offset, ~str.base, ~str.offset + ~start~0, 1 + (~j~0 - ~start~0)); {3755#false} is VALID [2020-07-10 15:28:10,304 INFO L280 TraceCheckUtils]: 41: Hoare triple {3755#false} ~dest.base, ~dest.offset := #in~dest.base, #in~dest.offset;~src.base, ~src.offset := #in~src.base, #in~src.offset;~n := #in~n;call #t~ret0.base, #t~ret0.offset := strncpy(~dest.base, ~dest.offset, ~src.base, ~src.offset, ~n);#res.base, #res.offset := #t~ret0.base, #t~ret0.offset;havoc #t~ret0.base, #t~ret0.offset; {3755#false} is VALID [2020-07-10 15:28:10,304 INFO L280 TraceCheckUtils]: 42: Hoare triple {3755#false} assume true; {3755#false} is VALID [2020-07-10 15:28:10,304 INFO L275 TraceCheckUtils]: 43: Hoare quadruple {3755#false} {3755#false} #147#return; {3755#false} is VALID [2020-07-10 15:28:10,304 INFO L280 TraceCheckUtils]: 44: Hoare triple {3755#false} havoc #t~ret19.base, #t~ret19.offset; {3755#false} is VALID [2020-07-10 15:28:10,304 INFO L263 TraceCheckUtils]: 45: Hoare triple {3755#false} call __VERIFIER_assert((if 1 + (~j~0 - ~start~0) < 2 then 1 else 0)); {3755#false} is VALID [2020-07-10 15:28:10,305 INFO L280 TraceCheckUtils]: 46: Hoare triple {3755#false} ~cond := #in~cond; {3755#false} is VALID [2020-07-10 15:28:10,305 INFO L280 TraceCheckUtils]: 47: Hoare triple {3755#false} assume 0 == ~cond; {3755#false} is VALID [2020-07-10 15:28:10,305 INFO L280 TraceCheckUtils]: 48: Hoare triple {3755#false} assume !false; {3755#false} is VALID [2020-07-10 15:28:10,307 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-07-10 15:28:10,307 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-10 15:28:10,308 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 12 [2020-07-10 15:28:10,308 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299821957] [2020-07-10 15:28:10,308 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 49 [2020-07-10 15:28:10,309 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:28:10,309 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-10 15:28:10,358 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:28:10,358 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-10 15:28:10,358 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:28:10,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-10 15:28:10,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2020-07-10 15:28:10,359 INFO L87 Difference]: Start difference. First operand 61 states and 71 transitions. Second operand 6 states. [2020-07-10 15:28:10,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:10,814 INFO L93 Difference]: Finished difference Result 160 states and 200 transitions. [2020-07-10 15:28:10,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-10 15:28:10,814 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 49 [2020-07-10 15:28:10,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:28:10,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 15:28:10,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 174 transitions. [2020-07-10 15:28:10,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 15:28:10,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 174 transitions. [2020-07-10 15:28:10,821 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 174 transitions. [2020-07-10 15:28:11,016 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 174 edges. 174 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:28:11,018 INFO L225 Difference]: With dead ends: 160 [2020-07-10 15:28:11,019 INFO L226 Difference]: Without dead ends: 115 [2020-07-10 15:28:11,019 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2020-07-10 15:28:11,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2020-07-10 15:28:11,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 83. [2020-07-10 15:28:11,061 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:28:11,061 INFO L82 GeneralOperation]: Start isEquivalent. First operand 115 states. Second operand 83 states. [2020-07-10 15:28:11,061 INFO L74 IsIncluded]: Start isIncluded. First operand 115 states. Second operand 83 states. [2020-07-10 15:28:11,061 INFO L87 Difference]: Start difference. First operand 115 states. Second operand 83 states. [2020-07-10 15:28:11,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:11,066 INFO L93 Difference]: Finished difference Result 115 states and 145 transitions. [2020-07-10 15:28:11,066 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 145 transitions. [2020-07-10 15:28:11,067 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:28:11,067 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:28:11,067 INFO L74 IsIncluded]: Start isIncluded. First operand 83 states. Second operand 115 states. [2020-07-10 15:28:11,067 INFO L87 Difference]: Start difference. First operand 83 states. Second operand 115 states. [2020-07-10 15:28:11,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:11,072 INFO L93 Difference]: Finished difference Result 115 states and 145 transitions. [2020-07-10 15:28:11,072 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 145 transitions. [2020-07-10 15:28:11,072 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:28:11,072 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:28:11,073 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:28:11,073 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:28:11,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2020-07-10 15:28:11,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 102 transitions. [2020-07-10 15:28:11,076 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 102 transitions. Word has length 49 [2020-07-10 15:28:11,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:28:11,076 INFO L479 AbstractCegarLoop]: Abstraction has 83 states and 102 transitions. [2020-07-10 15:28:11,076 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-10 15:28:11,076 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 102 transitions. [2020-07-10 15:28:11,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2020-07-10 15:28:11,077 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:28:11,077 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:28:11,293 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2020-07-10 15:28:11,293 INFO L427 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:28:11,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:28:11,294 INFO L82 PathProgramCache]: Analyzing trace with hash 1705682887, now seen corresponding path program 1 times [2020-07-10 15:28:11,294 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:28:11,294 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485646321] [2020-07-10 15:28:11,295 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:28:11,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:11,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:11,391 INFO L280 TraceCheckUtils]: 0: Hoare triple {4464#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {4451#true} is VALID [2020-07-10 15:28:11,391 INFO L280 TraceCheckUtils]: 1: Hoare triple {4451#true} assume true; {4451#true} is VALID [2020-07-10 15:28:11,391 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {4451#true} {4451#true} #151#return; {4451#true} is VALID [2020-07-10 15:28:11,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:11,396 INFO L280 TraceCheckUtils]: 0: Hoare triple {4451#true} ~dest.base, ~dest.offset := #in~dest.base, #in~dest.offset;~src.base, ~src.offset := #in~src.base, #in~src.offset;~n := #in~n;call #t~ret0.base, #t~ret0.offset := strncpy(~dest.base, ~dest.offset, ~src.base, ~src.offset, ~n);#res.base, #res.offset := #t~ret0.base, #t~ret0.offset;havoc #t~ret0.base, #t~ret0.offset; {4451#true} is VALID [2020-07-10 15:28:11,396 INFO L280 TraceCheckUtils]: 1: Hoare triple {4451#true} assume true; {4451#true} is VALID [2020-07-10 15:28:11,396 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {4451#true} {4452#false} #147#return; {4452#false} is VALID [2020-07-10 15:28:11,397 INFO L263 TraceCheckUtils]: 0: Hoare triple {4451#true} call ULTIMATE.init(); {4464#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 15:28:11,398 INFO L280 TraceCheckUtils]: 1: Hoare triple {4464#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {4451#true} is VALID [2020-07-10 15:28:11,398 INFO L280 TraceCheckUtils]: 2: Hoare triple {4451#true} assume true; {4451#true} is VALID [2020-07-10 15:28:11,398 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4451#true} {4451#true} #151#return; {4451#true} is VALID [2020-07-10 15:28:11,398 INFO L263 TraceCheckUtils]: 4: Hoare triple {4451#true} call #t~ret23 := main(); {4451#true} is VALID [2020-07-10 15:28:11,399 INFO L280 TraceCheckUtils]: 5: Hoare triple {4451#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(9);~i~1 := 0; {4456#(= 0 main_~i~1)} is VALID [2020-07-10 15:28:11,400 INFO L280 TraceCheckUtils]: 6: Hoare triple {4456#(= 0 main_~i~1)} assume !!(~i~1 < 8);assume -128 <= #t~nondet21 && #t~nondet21 <= 127;call write~int(#t~nondet21, ~#A~0.base, ~#A~0.offset + ~i~1, 1);havoc #t~nondet21; {4456#(= 0 main_~i~1)} is VALID [2020-07-10 15:28:11,401 INFO L280 TraceCheckUtils]: 7: Hoare triple {4456#(= 0 main_~i~1)} #t~post20 := ~i~1;~i~1 := 1 + #t~post20;havoc #t~post20; {4457#(<= main_~i~1 1)} is VALID [2020-07-10 15:28:11,401 INFO L280 TraceCheckUtils]: 8: Hoare triple {4457#(<= main_~i~1 1)} assume !!(~i~1 < 8);assume -128 <= #t~nondet21 && #t~nondet21 <= 127;call write~int(#t~nondet21, ~#A~0.base, ~#A~0.offset + ~i~1, 1);havoc #t~nondet21; {4457#(<= main_~i~1 1)} is VALID [2020-07-10 15:28:11,402 INFO L280 TraceCheckUtils]: 9: Hoare triple {4457#(<= main_~i~1 1)} #t~post20 := ~i~1;~i~1 := 1 + #t~post20;havoc #t~post20; {4458#(<= main_~i~1 2)} is VALID [2020-07-10 15:28:11,403 INFO L280 TraceCheckUtils]: 10: Hoare triple {4458#(<= main_~i~1 2)} assume !!(~i~1 < 8);assume -128 <= #t~nondet21 && #t~nondet21 <= 127;call write~int(#t~nondet21, ~#A~0.base, ~#A~0.offset + ~i~1, 1);havoc #t~nondet21; {4458#(<= main_~i~1 2)} is VALID [2020-07-10 15:28:11,404 INFO L280 TraceCheckUtils]: 11: Hoare triple {4458#(<= main_~i~1 2)} #t~post20 := ~i~1;~i~1 := 1 + #t~post20;havoc #t~post20; {4459#(<= main_~i~1 3)} is VALID [2020-07-10 15:28:11,404 INFO L280 TraceCheckUtils]: 12: Hoare triple {4459#(<= main_~i~1 3)} assume !!(~i~1 < 8);assume -128 <= #t~nondet21 && #t~nondet21 <= 127;call write~int(#t~nondet21, ~#A~0.base, ~#A~0.offset + ~i~1, 1);havoc #t~nondet21; {4459#(<= main_~i~1 3)} is VALID [2020-07-10 15:28:11,405 INFO L280 TraceCheckUtils]: 13: Hoare triple {4459#(<= main_~i~1 3)} #t~post20 := ~i~1;~i~1 := 1 + #t~post20;havoc #t~post20; {4460#(<= main_~i~1 4)} is VALID [2020-07-10 15:28:11,406 INFO L280 TraceCheckUtils]: 14: Hoare triple {4460#(<= main_~i~1 4)} assume !(~i~1 < 8); {4452#false} is VALID [2020-07-10 15:28:11,406 INFO L280 TraceCheckUtils]: 15: Hoare triple {4452#false} call write~int(0, ~#A~0.base, 8 + ~#A~0.offset, 1); {4452#false} is VALID [2020-07-10 15:28:11,407 INFO L263 TraceCheckUtils]: 16: Hoare triple {4452#false} call #t~ret22 := parse_expression_list(~#A~0.base, ~#A~0.offset); {4452#false} is VALID [2020-07-10 15:28:11,407 INFO L280 TraceCheckUtils]: 17: Hoare triple {4452#false} ~str.base, ~str.offset := #in~str.base, #in~str.offset;~start~0 := 0;~i~0 := -1;~j~0 := -1;call ~#str2~0.base, ~#str2~0.offset := #Ultimate.allocOnStack(2); {4452#false} is VALID [2020-07-10 15:28:11,407 INFO L280 TraceCheckUtils]: 18: Hoare triple {4452#false} assume !(~str.base == 0 && ~str.offset == 0); {4452#false} is VALID [2020-07-10 15:28:11,407 INFO L280 TraceCheckUtils]: 19: Hoare triple {4452#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2;call #t~mem3 := read~int(~str.base, ~str.offset + ~i~0, 1);#t~switch4 := 0 == #t~mem3; {4452#false} is VALID [2020-07-10 15:28:11,407 INFO L280 TraceCheckUtils]: 20: Hoare triple {4452#false} assume !#t~switch4; {4452#false} is VALID [2020-07-10 15:28:11,408 INFO L280 TraceCheckUtils]: 21: Hoare triple {4452#false} havoc #t~switch4;havoc #t~mem3; {4452#false} is VALID [2020-07-10 15:28:11,408 INFO L280 TraceCheckUtils]: 22: Hoare triple {4452#false} call #t~mem1 := read~int(~str.base, ~str.offset + ~i~0, 1); {4452#false} is VALID [2020-07-10 15:28:11,408 INFO L280 TraceCheckUtils]: 23: Hoare triple {4452#false} assume !!(0 != #t~mem1);havoc #t~mem1; {4452#false} is VALID [2020-07-10 15:28:11,408 INFO L280 TraceCheckUtils]: 24: Hoare triple {4452#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2;call #t~mem3 := read~int(~str.base, ~str.offset + ~i~0, 1);#t~switch4 := 0 == #t~mem3; {4452#false} is VALID [2020-07-10 15:28:11,408 INFO L280 TraceCheckUtils]: 25: Hoare triple {4452#false} assume #t~switch4; {4452#false} is VALID [2020-07-10 15:28:11,409 INFO L280 TraceCheckUtils]: 26: Hoare triple {4452#false} call #t~mem5 := read~int(~str.base, ~str.offset + ~start~0, 1);#t~short7 := 32 == #t~mem5; {4452#false} is VALID [2020-07-10 15:28:11,409 INFO L280 TraceCheckUtils]: 27: Hoare triple {4452#false} assume !#t~short7;call #t~mem6 := read~int(~str.base, ~str.offset + ~start~0, 1);#t~short7 := 9 == #t~mem6; {4452#false} is VALID [2020-07-10 15:28:11,409 INFO L280 TraceCheckUtils]: 28: Hoare triple {4452#false} assume !#t~short7;havoc #t~mem5;havoc #t~short7;havoc #t~mem6; {4452#false} is VALID [2020-07-10 15:28:11,409 INFO L280 TraceCheckUtils]: 29: Hoare triple {4452#false} call #t~mem9 := read~int(~str.base, ~str.offset + ~start~0, 1); {4452#false} is VALID [2020-07-10 15:28:11,409 INFO L280 TraceCheckUtils]: 30: Hoare triple {4452#false} assume !(34 == #t~mem9);havoc #t~mem9; {4452#false} is VALID [2020-07-10 15:28:11,409 INFO L280 TraceCheckUtils]: 31: Hoare triple {4452#false} ~j~0 := ~i~0 - 1; {4452#false} is VALID [2020-07-10 15:28:11,410 INFO L280 TraceCheckUtils]: 32: Hoare triple {4452#false} #t~short14 := 0 < ~j~0; {4452#false} is VALID [2020-07-10 15:28:11,410 INFO L280 TraceCheckUtils]: 33: Hoare triple {4452#false} assume !#t~short14; {4452#false} is VALID [2020-07-10 15:28:11,410 INFO L280 TraceCheckUtils]: 34: Hoare triple {4452#false} assume !#t~short14;havoc #t~mem11;havoc #t~short13;havoc #t~short14;havoc #t~mem12; {4452#false} is VALID [2020-07-10 15:28:11,410 INFO L280 TraceCheckUtils]: 35: Hoare triple {4452#false} #t~short17 := 0 < ~j~0; {4452#false} is VALID [2020-07-10 15:28:11,410 INFO L280 TraceCheckUtils]: 36: Hoare triple {4452#false} assume !#t~short17; {4452#false} is VALID [2020-07-10 15:28:11,411 INFO L280 TraceCheckUtils]: 37: Hoare triple {4452#false} assume !#t~short17;havoc #t~mem16;havoc #t~short17; {4452#false} is VALID [2020-07-10 15:28:11,411 INFO L280 TraceCheckUtils]: 38: Hoare triple {4452#false} assume ~start~0 <= ~j~0; {4452#false} is VALID [2020-07-10 15:28:11,411 INFO L280 TraceCheckUtils]: 39: Hoare triple {4452#false} assume !(1 + (~j~0 - ~start~0) >= 2); {4452#false} is VALID [2020-07-10 15:28:11,411 INFO L263 TraceCheckUtils]: 40: Hoare triple {4452#false} call #t~ret19.base, #t~ret19.offset := r_strncpy(~#str2~0.base, ~#str2~0.offset, ~str.base, ~str.offset + ~start~0, 1 + (~j~0 - ~start~0)); {4451#true} is VALID [2020-07-10 15:28:11,411 INFO L280 TraceCheckUtils]: 41: Hoare triple {4451#true} ~dest.base, ~dest.offset := #in~dest.base, #in~dest.offset;~src.base, ~src.offset := #in~src.base, #in~src.offset;~n := #in~n;call #t~ret0.base, #t~ret0.offset := strncpy(~dest.base, ~dest.offset, ~src.base, ~src.offset, ~n);#res.base, #res.offset := #t~ret0.base, #t~ret0.offset;havoc #t~ret0.base, #t~ret0.offset; {4451#true} is VALID [2020-07-10 15:28:11,411 INFO L280 TraceCheckUtils]: 42: Hoare triple {4451#true} assume true; {4451#true} is VALID [2020-07-10 15:28:11,412 INFO L275 TraceCheckUtils]: 43: Hoare quadruple {4451#true} {4452#false} #147#return; {4452#false} is VALID [2020-07-10 15:28:11,412 INFO L280 TraceCheckUtils]: 44: Hoare triple {4452#false} havoc #t~ret19.base, #t~ret19.offset; {4452#false} is VALID [2020-07-10 15:28:11,412 INFO L263 TraceCheckUtils]: 45: Hoare triple {4452#false} call __VERIFIER_assert((if 1 + (~j~0 - ~start~0) < 2 then 1 else 0)); {4452#false} is VALID [2020-07-10 15:28:11,412 INFO L280 TraceCheckUtils]: 46: Hoare triple {4452#false} ~cond := #in~cond; {4452#false} is VALID [2020-07-10 15:28:11,412 INFO L280 TraceCheckUtils]: 47: Hoare triple {4452#false} assume 0 == ~cond; {4452#false} is VALID [2020-07-10 15:28:11,412 INFO L280 TraceCheckUtils]: 48: Hoare triple {4452#false} assume !false; {4452#false} is VALID [2020-07-10 15:28:11,414 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-10 15:28:11,414 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485646321] [2020-07-10 15:28:11,415 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1770107737] [2020-07-10 15:28:11,415 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:28:11,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:11,489 INFO L264 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-10 15:28:11,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:11,503 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:28:11,587 INFO L263 TraceCheckUtils]: 0: Hoare triple {4451#true} call ULTIMATE.init(); {4451#true} is VALID [2020-07-10 15:28:11,587 INFO L280 TraceCheckUtils]: 1: Hoare triple {4451#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {4451#true} is VALID [2020-07-10 15:28:11,588 INFO L280 TraceCheckUtils]: 2: Hoare triple {4451#true} assume true; {4451#true} is VALID [2020-07-10 15:28:11,588 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4451#true} {4451#true} #151#return; {4451#true} is VALID [2020-07-10 15:28:11,588 INFO L263 TraceCheckUtils]: 4: Hoare triple {4451#true} call #t~ret23 := main(); {4451#true} is VALID [2020-07-10 15:28:11,589 INFO L280 TraceCheckUtils]: 5: Hoare triple {4451#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(9);~i~1 := 0; {4483#(<= main_~i~1 0)} is VALID [2020-07-10 15:28:11,590 INFO L280 TraceCheckUtils]: 6: Hoare triple {4483#(<= main_~i~1 0)} assume !!(~i~1 < 8);assume -128 <= #t~nondet21 && #t~nondet21 <= 127;call write~int(#t~nondet21, ~#A~0.base, ~#A~0.offset + ~i~1, 1);havoc #t~nondet21; {4483#(<= main_~i~1 0)} is VALID [2020-07-10 15:28:11,591 INFO L280 TraceCheckUtils]: 7: Hoare triple {4483#(<= main_~i~1 0)} #t~post20 := ~i~1;~i~1 := 1 + #t~post20;havoc #t~post20; {4457#(<= main_~i~1 1)} is VALID [2020-07-10 15:28:11,592 INFO L280 TraceCheckUtils]: 8: Hoare triple {4457#(<= main_~i~1 1)} assume !!(~i~1 < 8);assume -128 <= #t~nondet21 && #t~nondet21 <= 127;call write~int(#t~nondet21, ~#A~0.base, ~#A~0.offset + ~i~1, 1);havoc #t~nondet21; {4457#(<= main_~i~1 1)} is VALID [2020-07-10 15:28:11,593 INFO L280 TraceCheckUtils]: 9: Hoare triple {4457#(<= main_~i~1 1)} #t~post20 := ~i~1;~i~1 := 1 + #t~post20;havoc #t~post20; {4458#(<= main_~i~1 2)} is VALID [2020-07-10 15:28:11,593 INFO L280 TraceCheckUtils]: 10: Hoare triple {4458#(<= main_~i~1 2)} assume !!(~i~1 < 8);assume -128 <= #t~nondet21 && #t~nondet21 <= 127;call write~int(#t~nondet21, ~#A~0.base, ~#A~0.offset + ~i~1, 1);havoc #t~nondet21; {4458#(<= main_~i~1 2)} is VALID [2020-07-10 15:28:11,595 INFO L280 TraceCheckUtils]: 11: Hoare triple {4458#(<= main_~i~1 2)} #t~post20 := ~i~1;~i~1 := 1 + #t~post20;havoc #t~post20; {4459#(<= main_~i~1 3)} is VALID [2020-07-10 15:28:11,595 INFO L280 TraceCheckUtils]: 12: Hoare triple {4459#(<= main_~i~1 3)} assume !!(~i~1 < 8);assume -128 <= #t~nondet21 && #t~nondet21 <= 127;call write~int(#t~nondet21, ~#A~0.base, ~#A~0.offset + ~i~1, 1);havoc #t~nondet21; {4459#(<= main_~i~1 3)} is VALID [2020-07-10 15:28:11,596 INFO L280 TraceCheckUtils]: 13: Hoare triple {4459#(<= main_~i~1 3)} #t~post20 := ~i~1;~i~1 := 1 + #t~post20;havoc #t~post20; {4460#(<= main_~i~1 4)} is VALID [2020-07-10 15:28:11,597 INFO L280 TraceCheckUtils]: 14: Hoare triple {4460#(<= main_~i~1 4)} assume !(~i~1 < 8); {4452#false} is VALID [2020-07-10 15:28:11,597 INFO L280 TraceCheckUtils]: 15: Hoare triple {4452#false} call write~int(0, ~#A~0.base, 8 + ~#A~0.offset, 1); {4452#false} is VALID [2020-07-10 15:28:11,598 INFO L263 TraceCheckUtils]: 16: Hoare triple {4452#false} call #t~ret22 := parse_expression_list(~#A~0.base, ~#A~0.offset); {4452#false} is VALID [2020-07-10 15:28:11,598 INFO L280 TraceCheckUtils]: 17: Hoare triple {4452#false} ~str.base, ~str.offset := #in~str.base, #in~str.offset;~start~0 := 0;~i~0 := -1;~j~0 := -1;call ~#str2~0.base, ~#str2~0.offset := #Ultimate.allocOnStack(2); {4452#false} is VALID [2020-07-10 15:28:11,598 INFO L280 TraceCheckUtils]: 18: Hoare triple {4452#false} assume !(~str.base == 0 && ~str.offset == 0); {4452#false} is VALID [2020-07-10 15:28:11,599 INFO L280 TraceCheckUtils]: 19: Hoare triple {4452#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2;call #t~mem3 := read~int(~str.base, ~str.offset + ~i~0, 1);#t~switch4 := 0 == #t~mem3; {4452#false} is VALID [2020-07-10 15:28:11,599 INFO L280 TraceCheckUtils]: 20: Hoare triple {4452#false} assume !#t~switch4; {4452#false} is VALID [2020-07-10 15:28:11,599 INFO L280 TraceCheckUtils]: 21: Hoare triple {4452#false} havoc #t~switch4;havoc #t~mem3; {4452#false} is VALID [2020-07-10 15:28:11,599 INFO L280 TraceCheckUtils]: 22: Hoare triple {4452#false} call #t~mem1 := read~int(~str.base, ~str.offset + ~i~0, 1); {4452#false} is VALID [2020-07-10 15:28:11,600 INFO L280 TraceCheckUtils]: 23: Hoare triple {4452#false} assume !!(0 != #t~mem1);havoc #t~mem1; {4452#false} is VALID [2020-07-10 15:28:11,600 INFO L280 TraceCheckUtils]: 24: Hoare triple {4452#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2;call #t~mem3 := read~int(~str.base, ~str.offset + ~i~0, 1);#t~switch4 := 0 == #t~mem3; {4452#false} is VALID [2020-07-10 15:28:11,600 INFO L280 TraceCheckUtils]: 25: Hoare triple {4452#false} assume #t~switch4; {4452#false} is VALID [2020-07-10 15:28:11,600 INFO L280 TraceCheckUtils]: 26: Hoare triple {4452#false} call #t~mem5 := read~int(~str.base, ~str.offset + ~start~0, 1);#t~short7 := 32 == #t~mem5; {4452#false} is VALID [2020-07-10 15:28:11,601 INFO L280 TraceCheckUtils]: 27: Hoare triple {4452#false} assume !#t~short7;call #t~mem6 := read~int(~str.base, ~str.offset + ~start~0, 1);#t~short7 := 9 == #t~mem6; {4452#false} is VALID [2020-07-10 15:28:11,601 INFO L280 TraceCheckUtils]: 28: Hoare triple {4452#false} assume !#t~short7;havoc #t~mem5;havoc #t~short7;havoc #t~mem6; {4452#false} is VALID [2020-07-10 15:28:11,601 INFO L280 TraceCheckUtils]: 29: Hoare triple {4452#false} call #t~mem9 := read~int(~str.base, ~str.offset + ~start~0, 1); {4452#false} is VALID [2020-07-10 15:28:11,601 INFO L280 TraceCheckUtils]: 30: Hoare triple {4452#false} assume !(34 == #t~mem9);havoc #t~mem9; {4452#false} is VALID [2020-07-10 15:28:11,602 INFO L280 TraceCheckUtils]: 31: Hoare triple {4452#false} ~j~0 := ~i~0 - 1; {4452#false} is VALID [2020-07-10 15:28:11,602 INFO L280 TraceCheckUtils]: 32: Hoare triple {4452#false} #t~short14 := 0 < ~j~0; {4452#false} is VALID [2020-07-10 15:28:11,602 INFO L280 TraceCheckUtils]: 33: Hoare triple {4452#false} assume !#t~short14; {4452#false} is VALID [2020-07-10 15:28:11,602 INFO L280 TraceCheckUtils]: 34: Hoare triple {4452#false} assume !#t~short14;havoc #t~mem11;havoc #t~short13;havoc #t~short14;havoc #t~mem12; {4452#false} is VALID [2020-07-10 15:28:11,603 INFO L280 TraceCheckUtils]: 35: Hoare triple {4452#false} #t~short17 := 0 < ~j~0; {4452#false} is VALID [2020-07-10 15:28:11,603 INFO L280 TraceCheckUtils]: 36: Hoare triple {4452#false} assume !#t~short17; {4452#false} is VALID [2020-07-10 15:28:11,603 INFO L280 TraceCheckUtils]: 37: Hoare triple {4452#false} assume !#t~short17;havoc #t~mem16;havoc #t~short17; {4452#false} is VALID [2020-07-10 15:28:11,603 INFO L280 TraceCheckUtils]: 38: Hoare triple {4452#false} assume ~start~0 <= ~j~0; {4452#false} is VALID [2020-07-10 15:28:11,604 INFO L280 TraceCheckUtils]: 39: Hoare triple {4452#false} assume !(1 + (~j~0 - ~start~0) >= 2); {4452#false} is VALID [2020-07-10 15:28:11,604 INFO L263 TraceCheckUtils]: 40: Hoare triple {4452#false} call #t~ret19.base, #t~ret19.offset := r_strncpy(~#str2~0.base, ~#str2~0.offset, ~str.base, ~str.offset + ~start~0, 1 + (~j~0 - ~start~0)); {4452#false} is VALID [2020-07-10 15:28:11,604 INFO L280 TraceCheckUtils]: 41: Hoare triple {4452#false} ~dest.base, ~dest.offset := #in~dest.base, #in~dest.offset;~src.base, ~src.offset := #in~src.base, #in~src.offset;~n := #in~n;call #t~ret0.base, #t~ret0.offset := strncpy(~dest.base, ~dest.offset, ~src.base, ~src.offset, ~n);#res.base, #res.offset := #t~ret0.base, #t~ret0.offset;havoc #t~ret0.base, #t~ret0.offset; {4452#false} is VALID [2020-07-10 15:28:11,604 INFO L280 TraceCheckUtils]: 42: Hoare triple {4452#false} assume true; {4452#false} is VALID [2020-07-10 15:28:11,605 INFO L275 TraceCheckUtils]: 43: Hoare quadruple {4452#false} {4452#false} #147#return; {4452#false} is VALID [2020-07-10 15:28:11,605 INFO L280 TraceCheckUtils]: 44: Hoare triple {4452#false} havoc #t~ret19.base, #t~ret19.offset; {4452#false} is VALID [2020-07-10 15:28:11,605 INFO L263 TraceCheckUtils]: 45: Hoare triple {4452#false} call __VERIFIER_assert((if 1 + (~j~0 - ~start~0) < 2 then 1 else 0)); {4452#false} is VALID [2020-07-10 15:28:11,605 INFO L280 TraceCheckUtils]: 46: Hoare triple {4452#false} ~cond := #in~cond; {4452#false} is VALID [2020-07-10 15:28:11,606 INFO L280 TraceCheckUtils]: 47: Hoare triple {4452#false} assume 0 == ~cond; {4452#false} is VALID [2020-07-10 15:28:11,606 INFO L280 TraceCheckUtils]: 48: Hoare triple {4452#false} assume !false; {4452#false} is VALID [2020-07-10 15:28:11,608 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-10 15:28:11,608 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-10 15:28:11,608 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 9 [2020-07-10 15:28:11,609 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484706116] [2020-07-10 15:28:11,609 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 49 [2020-07-10 15:28:11,610 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:28:11,610 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-10 15:28:11,692 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:28:11,692 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-10 15:28:11,692 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:28:11,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-10 15:28:11,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-07-10 15:28:11,693 INFO L87 Difference]: Start difference. First operand 83 states and 102 transitions. Second operand 9 states. [2020-07-10 15:28:12,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:12,114 INFO L93 Difference]: Finished difference Result 154 states and 192 transitions. [2020-07-10 15:28:12,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-10 15:28:12,114 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 49 [2020-07-10 15:28:12,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:28:12,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-10 15:28:12,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 116 transitions. [2020-07-10 15:28:12,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-10 15:28:12,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 116 transitions. [2020-07-10 15:28:12,118 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 116 transitions. [2020-07-10 15:28:12,242 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 116 edges. 116 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:28:12,244 INFO L225 Difference]: With dead ends: 154 [2020-07-10 15:28:12,244 INFO L226 Difference]: Without dead ends: 86 [2020-07-10 15:28:12,245 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-07-10 15:28:12,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2020-07-10 15:28:12,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 85. [2020-07-10 15:28:12,269 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:28:12,270 INFO L82 GeneralOperation]: Start isEquivalent. First operand 86 states. Second operand 85 states. [2020-07-10 15:28:12,270 INFO L74 IsIncluded]: Start isIncluded. First operand 86 states. Second operand 85 states. [2020-07-10 15:28:12,270 INFO L87 Difference]: Start difference. First operand 86 states. Second operand 85 states. [2020-07-10 15:28:12,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:12,273 INFO L93 Difference]: Finished difference Result 86 states and 105 transitions. [2020-07-10 15:28:12,273 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 105 transitions. [2020-07-10 15:28:12,273 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:28:12,274 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:28:12,274 INFO L74 IsIncluded]: Start isIncluded. First operand 85 states. Second operand 86 states. [2020-07-10 15:28:12,274 INFO L87 Difference]: Start difference. First operand 85 states. Second operand 86 states. [2020-07-10 15:28:12,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:12,276 INFO L93 Difference]: Finished difference Result 86 states and 105 transitions. [2020-07-10 15:28:12,276 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 105 transitions. [2020-07-10 15:28:12,276 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:28:12,276 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:28:12,276 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:28:12,277 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:28:12,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2020-07-10 15:28:12,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 104 transitions. [2020-07-10 15:28:12,279 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 104 transitions. Word has length 49 [2020-07-10 15:28:12,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:28:12,279 INFO L479 AbstractCegarLoop]: Abstraction has 85 states and 104 transitions. [2020-07-10 15:28:12,279 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-10 15:28:12,279 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 104 transitions. [2020-07-10 15:28:12,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2020-07-10 15:28:12,280 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:28:12,280 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:28:12,493 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:28:12,494 INFO L427 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:28:12,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:28:12,494 INFO L82 PathProgramCache]: Analyzing trace with hash -1198571515, now seen corresponding path program 2 times [2020-07-10 15:28:12,494 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:28:12,495 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899614709] [2020-07-10 15:28:12,495 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:28:12,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:12,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:12,598 INFO L280 TraceCheckUtils]: 0: Hoare triple {5099#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {5085#true} is VALID [2020-07-10 15:28:12,598 INFO L280 TraceCheckUtils]: 1: Hoare triple {5085#true} assume true; {5085#true} is VALID [2020-07-10 15:28:12,598 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {5085#true} {5085#true} #151#return; {5085#true} is VALID [2020-07-10 15:28:12,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:12,602 INFO L280 TraceCheckUtils]: 0: Hoare triple {5085#true} ~dest.base, ~dest.offset := #in~dest.base, #in~dest.offset;~src.base, ~src.offset := #in~src.base, #in~src.offset;~n := #in~n;call #t~ret0.base, #t~ret0.offset := strncpy(~dest.base, ~dest.offset, ~src.base, ~src.offset, ~n);#res.base, #res.offset := #t~ret0.base, #t~ret0.offset;havoc #t~ret0.base, #t~ret0.offset; {5085#true} is VALID [2020-07-10 15:28:12,602 INFO L280 TraceCheckUtils]: 1: Hoare triple {5085#true} assume true; {5085#true} is VALID [2020-07-10 15:28:12,603 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {5085#true} {5086#false} #147#return; {5086#false} is VALID [2020-07-10 15:28:12,603 INFO L263 TraceCheckUtils]: 0: Hoare triple {5085#true} call ULTIMATE.init(); {5099#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 15:28:12,603 INFO L280 TraceCheckUtils]: 1: Hoare triple {5099#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {5085#true} is VALID [2020-07-10 15:28:12,603 INFO L280 TraceCheckUtils]: 2: Hoare triple {5085#true} assume true; {5085#true} is VALID [2020-07-10 15:28:12,604 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {5085#true} {5085#true} #151#return; {5085#true} is VALID [2020-07-10 15:28:12,604 INFO L263 TraceCheckUtils]: 4: Hoare triple {5085#true} call #t~ret23 := main(); {5085#true} is VALID [2020-07-10 15:28:12,604 INFO L280 TraceCheckUtils]: 5: Hoare triple {5085#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(9);~i~1 := 0; {5090#(= 0 main_~i~1)} is VALID [2020-07-10 15:28:12,605 INFO L280 TraceCheckUtils]: 6: Hoare triple {5090#(= 0 main_~i~1)} assume !!(~i~1 < 8);assume -128 <= #t~nondet21 && #t~nondet21 <= 127;call write~int(#t~nondet21, ~#A~0.base, ~#A~0.offset + ~i~1, 1);havoc #t~nondet21; {5090#(= 0 main_~i~1)} is VALID [2020-07-10 15:28:12,605 INFO L280 TraceCheckUtils]: 7: Hoare triple {5090#(= 0 main_~i~1)} #t~post20 := ~i~1;~i~1 := 1 + #t~post20;havoc #t~post20; {5091#(<= main_~i~1 1)} is VALID [2020-07-10 15:28:12,605 INFO L280 TraceCheckUtils]: 8: Hoare triple {5091#(<= main_~i~1 1)} assume !!(~i~1 < 8);assume -128 <= #t~nondet21 && #t~nondet21 <= 127;call write~int(#t~nondet21, ~#A~0.base, ~#A~0.offset + ~i~1, 1);havoc #t~nondet21; {5091#(<= main_~i~1 1)} is VALID [2020-07-10 15:28:12,606 INFO L280 TraceCheckUtils]: 9: Hoare triple {5091#(<= main_~i~1 1)} #t~post20 := ~i~1;~i~1 := 1 + #t~post20;havoc #t~post20; {5092#(<= main_~i~1 2)} is VALID [2020-07-10 15:28:12,607 INFO L280 TraceCheckUtils]: 10: Hoare triple {5092#(<= main_~i~1 2)} assume !!(~i~1 < 8);assume -128 <= #t~nondet21 && #t~nondet21 <= 127;call write~int(#t~nondet21, ~#A~0.base, ~#A~0.offset + ~i~1, 1);havoc #t~nondet21; {5092#(<= main_~i~1 2)} is VALID [2020-07-10 15:28:12,608 INFO L280 TraceCheckUtils]: 11: Hoare triple {5092#(<= main_~i~1 2)} #t~post20 := ~i~1;~i~1 := 1 + #t~post20;havoc #t~post20; {5093#(<= main_~i~1 3)} is VALID [2020-07-10 15:28:12,608 INFO L280 TraceCheckUtils]: 12: Hoare triple {5093#(<= main_~i~1 3)} assume !!(~i~1 < 8);assume -128 <= #t~nondet21 && #t~nondet21 <= 127;call write~int(#t~nondet21, ~#A~0.base, ~#A~0.offset + ~i~1, 1);havoc #t~nondet21; {5093#(<= main_~i~1 3)} is VALID [2020-07-10 15:28:12,609 INFO L280 TraceCheckUtils]: 13: Hoare triple {5093#(<= main_~i~1 3)} #t~post20 := ~i~1;~i~1 := 1 + #t~post20;havoc #t~post20; {5094#(<= main_~i~1 4)} is VALID [2020-07-10 15:28:12,610 INFO L280 TraceCheckUtils]: 14: Hoare triple {5094#(<= main_~i~1 4)} assume !!(~i~1 < 8);assume -128 <= #t~nondet21 && #t~nondet21 <= 127;call write~int(#t~nondet21, ~#A~0.base, ~#A~0.offset + ~i~1, 1);havoc #t~nondet21; {5094#(<= main_~i~1 4)} is VALID [2020-07-10 15:28:12,611 INFO L280 TraceCheckUtils]: 15: Hoare triple {5094#(<= main_~i~1 4)} #t~post20 := ~i~1;~i~1 := 1 + #t~post20;havoc #t~post20; {5095#(<= main_~i~1 5)} is VALID [2020-07-10 15:28:12,611 INFO L280 TraceCheckUtils]: 16: Hoare triple {5095#(<= main_~i~1 5)} assume !(~i~1 < 8); {5086#false} is VALID [2020-07-10 15:28:12,612 INFO L280 TraceCheckUtils]: 17: Hoare triple {5086#false} call write~int(0, ~#A~0.base, 8 + ~#A~0.offset, 1); {5086#false} is VALID [2020-07-10 15:28:12,612 INFO L263 TraceCheckUtils]: 18: Hoare triple {5086#false} call #t~ret22 := parse_expression_list(~#A~0.base, ~#A~0.offset); {5086#false} is VALID [2020-07-10 15:28:12,612 INFO L280 TraceCheckUtils]: 19: Hoare triple {5086#false} ~str.base, ~str.offset := #in~str.base, #in~str.offset;~start~0 := 0;~i~0 := -1;~j~0 := -1;call ~#str2~0.base, ~#str2~0.offset := #Ultimate.allocOnStack(2); {5086#false} is VALID [2020-07-10 15:28:12,612 INFO L280 TraceCheckUtils]: 20: Hoare triple {5086#false} assume !(~str.base == 0 && ~str.offset == 0); {5086#false} is VALID [2020-07-10 15:28:12,613 INFO L280 TraceCheckUtils]: 21: Hoare triple {5086#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2;call #t~mem3 := read~int(~str.base, ~str.offset + ~i~0, 1);#t~switch4 := 0 == #t~mem3; {5086#false} is VALID [2020-07-10 15:28:12,613 INFO L280 TraceCheckUtils]: 22: Hoare triple {5086#false} assume !#t~switch4; {5086#false} is VALID [2020-07-10 15:28:12,613 INFO L280 TraceCheckUtils]: 23: Hoare triple {5086#false} havoc #t~switch4;havoc #t~mem3; {5086#false} is VALID [2020-07-10 15:28:12,613 INFO L280 TraceCheckUtils]: 24: Hoare triple {5086#false} call #t~mem1 := read~int(~str.base, ~str.offset + ~i~0, 1); {5086#false} is VALID [2020-07-10 15:28:12,613 INFO L280 TraceCheckUtils]: 25: Hoare triple {5086#false} assume !!(0 != #t~mem1);havoc #t~mem1; {5086#false} is VALID [2020-07-10 15:28:12,614 INFO L280 TraceCheckUtils]: 26: Hoare triple {5086#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2;call #t~mem3 := read~int(~str.base, ~str.offset + ~i~0, 1);#t~switch4 := 0 == #t~mem3; {5086#false} is VALID [2020-07-10 15:28:12,614 INFO L280 TraceCheckUtils]: 27: Hoare triple {5086#false} assume #t~switch4; {5086#false} is VALID [2020-07-10 15:28:12,614 INFO L280 TraceCheckUtils]: 28: Hoare triple {5086#false} call #t~mem5 := read~int(~str.base, ~str.offset + ~start~0, 1);#t~short7 := 32 == #t~mem5; {5086#false} is VALID [2020-07-10 15:28:12,614 INFO L280 TraceCheckUtils]: 29: Hoare triple {5086#false} assume !#t~short7;call #t~mem6 := read~int(~str.base, ~str.offset + ~start~0, 1);#t~short7 := 9 == #t~mem6; {5086#false} is VALID [2020-07-10 15:28:12,614 INFO L280 TraceCheckUtils]: 30: Hoare triple {5086#false} assume !#t~short7;havoc #t~mem5;havoc #t~short7;havoc #t~mem6; {5086#false} is VALID [2020-07-10 15:28:12,614 INFO L280 TraceCheckUtils]: 31: Hoare triple {5086#false} call #t~mem9 := read~int(~str.base, ~str.offset + ~start~0, 1); {5086#false} is VALID [2020-07-10 15:28:12,615 INFO L280 TraceCheckUtils]: 32: Hoare triple {5086#false} assume !(34 == #t~mem9);havoc #t~mem9; {5086#false} is VALID [2020-07-10 15:28:12,615 INFO L280 TraceCheckUtils]: 33: Hoare triple {5086#false} ~j~0 := ~i~0 - 1; {5086#false} is VALID [2020-07-10 15:28:12,615 INFO L280 TraceCheckUtils]: 34: Hoare triple {5086#false} #t~short14 := 0 < ~j~0; {5086#false} is VALID [2020-07-10 15:28:12,615 INFO L280 TraceCheckUtils]: 35: Hoare triple {5086#false} assume !#t~short14; {5086#false} is VALID [2020-07-10 15:28:12,615 INFO L280 TraceCheckUtils]: 36: Hoare triple {5086#false} assume !#t~short14;havoc #t~mem11;havoc #t~short13;havoc #t~short14;havoc #t~mem12; {5086#false} is VALID [2020-07-10 15:28:12,615 INFO L280 TraceCheckUtils]: 37: Hoare triple {5086#false} #t~short17 := 0 < ~j~0; {5086#false} is VALID [2020-07-10 15:28:12,615 INFO L280 TraceCheckUtils]: 38: Hoare triple {5086#false} assume !#t~short17; {5086#false} is VALID [2020-07-10 15:28:12,616 INFO L280 TraceCheckUtils]: 39: Hoare triple {5086#false} assume !#t~short17;havoc #t~mem16;havoc #t~short17; {5086#false} is VALID [2020-07-10 15:28:12,616 INFO L280 TraceCheckUtils]: 40: Hoare triple {5086#false} assume ~start~0 <= ~j~0; {5086#false} is VALID [2020-07-10 15:28:12,616 INFO L280 TraceCheckUtils]: 41: Hoare triple {5086#false} assume !(1 + (~j~0 - ~start~0) >= 2); {5086#false} is VALID [2020-07-10 15:28:12,616 INFO L263 TraceCheckUtils]: 42: Hoare triple {5086#false} call #t~ret19.base, #t~ret19.offset := r_strncpy(~#str2~0.base, ~#str2~0.offset, ~str.base, ~str.offset + ~start~0, 1 + (~j~0 - ~start~0)); {5085#true} is VALID [2020-07-10 15:28:12,616 INFO L280 TraceCheckUtils]: 43: Hoare triple {5085#true} ~dest.base, ~dest.offset := #in~dest.base, #in~dest.offset;~src.base, ~src.offset := #in~src.base, #in~src.offset;~n := #in~n;call #t~ret0.base, #t~ret0.offset := strncpy(~dest.base, ~dest.offset, ~src.base, ~src.offset, ~n);#res.base, #res.offset := #t~ret0.base, #t~ret0.offset;havoc #t~ret0.base, #t~ret0.offset; {5085#true} is VALID [2020-07-10 15:28:12,616 INFO L280 TraceCheckUtils]: 44: Hoare triple {5085#true} assume true; {5085#true} is VALID [2020-07-10 15:28:12,617 INFO L275 TraceCheckUtils]: 45: Hoare quadruple {5085#true} {5086#false} #147#return; {5086#false} is VALID [2020-07-10 15:28:12,617 INFO L280 TraceCheckUtils]: 46: Hoare triple {5086#false} havoc #t~ret19.base, #t~ret19.offset; {5086#false} is VALID [2020-07-10 15:28:12,617 INFO L263 TraceCheckUtils]: 47: Hoare triple {5086#false} call __VERIFIER_assert((if 1 + (~j~0 - ~start~0) < 2 then 1 else 0)); {5086#false} is VALID [2020-07-10 15:28:12,617 INFO L280 TraceCheckUtils]: 48: Hoare triple {5086#false} ~cond := #in~cond; {5086#false} is VALID [2020-07-10 15:28:12,617 INFO L280 TraceCheckUtils]: 49: Hoare triple {5086#false} assume 0 == ~cond; {5086#false} is VALID [2020-07-10 15:28:12,617 INFO L280 TraceCheckUtils]: 50: Hoare triple {5086#false} assume !false; {5086#false} is VALID [2020-07-10 15:28:12,619 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-10 15:28:12,619 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899614709] [2020-07-10 15:28:12,619 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1476560149] [2020-07-10 15:28:12,619 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:28:12,668 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2020-07-10 15:28:12,668 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-10 15:28:12,669 INFO L264 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-10 15:28:12,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:12,683 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:28:12,760 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-10 15:28:12,801 INFO L263 TraceCheckUtils]: 0: Hoare triple {5085#true} call ULTIMATE.init(); {5085#true} is VALID [2020-07-10 15:28:12,801 INFO L280 TraceCheckUtils]: 1: Hoare triple {5085#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {5085#true} is VALID [2020-07-10 15:28:12,801 INFO L280 TraceCheckUtils]: 2: Hoare triple {5085#true} assume true; {5085#true} is VALID [2020-07-10 15:28:12,802 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {5085#true} {5085#true} #151#return; {5085#true} is VALID [2020-07-10 15:28:12,802 INFO L263 TraceCheckUtils]: 4: Hoare triple {5085#true} call #t~ret23 := main(); {5085#true} is VALID [2020-07-10 15:28:12,802 INFO L280 TraceCheckUtils]: 5: Hoare triple {5085#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(9);~i~1 := 0; {5085#true} is VALID [2020-07-10 15:28:12,802 INFO L280 TraceCheckUtils]: 6: Hoare triple {5085#true} assume !!(~i~1 < 8);assume -128 <= #t~nondet21 && #t~nondet21 <= 127;call write~int(#t~nondet21, ~#A~0.base, ~#A~0.offset + ~i~1, 1);havoc #t~nondet21; {5085#true} is VALID [2020-07-10 15:28:12,802 INFO L280 TraceCheckUtils]: 7: Hoare triple {5085#true} #t~post20 := ~i~1;~i~1 := 1 + #t~post20;havoc #t~post20; {5085#true} is VALID [2020-07-10 15:28:12,802 INFO L280 TraceCheckUtils]: 8: Hoare triple {5085#true} assume !!(~i~1 < 8);assume -128 <= #t~nondet21 && #t~nondet21 <= 127;call write~int(#t~nondet21, ~#A~0.base, ~#A~0.offset + ~i~1, 1);havoc #t~nondet21; {5085#true} is VALID [2020-07-10 15:28:12,802 INFO L280 TraceCheckUtils]: 9: Hoare triple {5085#true} #t~post20 := ~i~1;~i~1 := 1 + #t~post20;havoc #t~post20; {5085#true} is VALID [2020-07-10 15:28:12,802 INFO L280 TraceCheckUtils]: 10: Hoare triple {5085#true} assume !!(~i~1 < 8);assume -128 <= #t~nondet21 && #t~nondet21 <= 127;call write~int(#t~nondet21, ~#A~0.base, ~#A~0.offset + ~i~1, 1);havoc #t~nondet21; {5085#true} is VALID [2020-07-10 15:28:12,803 INFO L280 TraceCheckUtils]: 11: Hoare triple {5085#true} #t~post20 := ~i~1;~i~1 := 1 + #t~post20;havoc #t~post20; {5085#true} is VALID [2020-07-10 15:28:12,803 INFO L280 TraceCheckUtils]: 12: Hoare triple {5085#true} assume !!(~i~1 < 8);assume -128 <= #t~nondet21 && #t~nondet21 <= 127;call write~int(#t~nondet21, ~#A~0.base, ~#A~0.offset + ~i~1, 1);havoc #t~nondet21; {5085#true} is VALID [2020-07-10 15:28:12,803 INFO L280 TraceCheckUtils]: 13: Hoare triple {5085#true} #t~post20 := ~i~1;~i~1 := 1 + #t~post20;havoc #t~post20; {5085#true} is VALID [2020-07-10 15:28:12,803 INFO L280 TraceCheckUtils]: 14: Hoare triple {5085#true} assume !!(~i~1 < 8);assume -128 <= #t~nondet21 && #t~nondet21 <= 127;call write~int(#t~nondet21, ~#A~0.base, ~#A~0.offset + ~i~1, 1);havoc #t~nondet21; {5085#true} is VALID [2020-07-10 15:28:12,803 INFO L280 TraceCheckUtils]: 15: Hoare triple {5085#true} #t~post20 := ~i~1;~i~1 := 1 + #t~post20;havoc #t~post20; {5085#true} is VALID [2020-07-10 15:28:12,803 INFO L280 TraceCheckUtils]: 16: Hoare triple {5085#true} assume !(~i~1 < 8); {5085#true} is VALID [2020-07-10 15:28:12,804 INFO L280 TraceCheckUtils]: 17: Hoare triple {5085#true} call write~int(0, ~#A~0.base, 8 + ~#A~0.offset, 1); {5085#true} is VALID [2020-07-10 15:28:12,804 INFO L263 TraceCheckUtils]: 18: Hoare triple {5085#true} call #t~ret22 := parse_expression_list(~#A~0.base, ~#A~0.offset); {5085#true} is VALID [2020-07-10 15:28:12,804 INFO L280 TraceCheckUtils]: 19: Hoare triple {5085#true} ~str.base, ~str.offset := #in~str.base, #in~str.offset;~start~0 := 0;~i~0 := -1;~j~0 := -1;call ~#str2~0.base, ~#str2~0.offset := #Ultimate.allocOnStack(2); {5085#true} is VALID [2020-07-10 15:28:12,804 INFO L280 TraceCheckUtils]: 20: Hoare triple {5085#true} assume !(~str.base == 0 && ~str.offset == 0); {5085#true} is VALID [2020-07-10 15:28:12,804 INFO L280 TraceCheckUtils]: 21: Hoare triple {5085#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2;call #t~mem3 := read~int(~str.base, ~str.offset + ~i~0, 1);#t~switch4 := 0 == #t~mem3; {5085#true} is VALID [2020-07-10 15:28:12,805 INFO L280 TraceCheckUtils]: 22: Hoare triple {5085#true} assume !#t~switch4; {5085#true} is VALID [2020-07-10 15:28:12,805 INFO L280 TraceCheckUtils]: 23: Hoare triple {5085#true} havoc #t~switch4;havoc #t~mem3; {5085#true} is VALID [2020-07-10 15:28:12,805 INFO L280 TraceCheckUtils]: 24: Hoare triple {5085#true} call #t~mem1 := read~int(~str.base, ~str.offset + ~i~0, 1); {5085#true} is VALID [2020-07-10 15:28:12,806 INFO L280 TraceCheckUtils]: 25: Hoare triple {5085#true} assume !!(0 != #t~mem1);havoc #t~mem1; {5085#true} is VALID [2020-07-10 15:28:12,806 INFO L280 TraceCheckUtils]: 26: Hoare triple {5085#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2;call #t~mem3 := read~int(~str.base, ~str.offset + ~i~0, 1);#t~switch4 := 0 == #t~mem3; {5085#true} is VALID [2020-07-10 15:28:12,806 INFO L280 TraceCheckUtils]: 27: Hoare triple {5085#true} assume #t~switch4; {5085#true} is VALID [2020-07-10 15:28:12,806 INFO L280 TraceCheckUtils]: 28: Hoare triple {5085#true} call #t~mem5 := read~int(~str.base, ~str.offset + ~start~0, 1);#t~short7 := 32 == #t~mem5; {5085#true} is VALID [2020-07-10 15:28:12,806 INFO L280 TraceCheckUtils]: 29: Hoare triple {5085#true} assume !#t~short7;call #t~mem6 := read~int(~str.base, ~str.offset + ~start~0, 1);#t~short7 := 9 == #t~mem6; {5085#true} is VALID [2020-07-10 15:28:12,806 INFO L280 TraceCheckUtils]: 30: Hoare triple {5085#true} assume !#t~short7;havoc #t~mem5;havoc #t~short7;havoc #t~mem6; {5085#true} is VALID [2020-07-10 15:28:12,807 INFO L280 TraceCheckUtils]: 31: Hoare triple {5085#true} call #t~mem9 := read~int(~str.base, ~str.offset + ~start~0, 1); {5085#true} is VALID [2020-07-10 15:28:12,807 INFO L280 TraceCheckUtils]: 32: Hoare triple {5085#true} assume !(34 == #t~mem9);havoc #t~mem9; {5085#true} is VALID [2020-07-10 15:28:12,807 INFO L280 TraceCheckUtils]: 33: Hoare triple {5085#true} ~j~0 := ~i~0 - 1; {5085#true} is VALID [2020-07-10 15:28:12,807 INFO L280 TraceCheckUtils]: 34: Hoare triple {5085#true} #t~short14 := 0 < ~j~0; {5085#true} is VALID [2020-07-10 15:28:12,807 INFO L280 TraceCheckUtils]: 35: Hoare triple {5085#true} assume !#t~short14; {5085#true} is VALID [2020-07-10 15:28:12,807 INFO L280 TraceCheckUtils]: 36: Hoare triple {5085#true} assume !#t~short14;havoc #t~mem11;havoc #t~short13;havoc #t~short14;havoc #t~mem12; {5085#true} is VALID [2020-07-10 15:28:12,808 INFO L280 TraceCheckUtils]: 37: Hoare triple {5085#true} #t~short17 := 0 < ~j~0; {5085#true} is VALID [2020-07-10 15:28:12,808 INFO L280 TraceCheckUtils]: 38: Hoare triple {5085#true} assume !#t~short17; {5085#true} is VALID [2020-07-10 15:28:12,808 INFO L280 TraceCheckUtils]: 39: Hoare triple {5085#true} assume !#t~short17;havoc #t~mem16;havoc #t~short17; {5085#true} is VALID [2020-07-10 15:28:12,808 INFO L280 TraceCheckUtils]: 40: Hoare triple {5085#true} assume ~start~0 <= ~j~0; {5085#true} is VALID [2020-07-10 15:28:12,809 INFO L280 TraceCheckUtils]: 41: Hoare triple {5085#true} assume !(1 + (~j~0 - ~start~0) >= 2); {5226#(< parse_expression_list_~j~0 (+ parse_expression_list_~start~0 1))} is VALID [2020-07-10 15:28:12,809 INFO L263 TraceCheckUtils]: 42: Hoare triple {5226#(< parse_expression_list_~j~0 (+ parse_expression_list_~start~0 1))} call #t~ret19.base, #t~ret19.offset := r_strncpy(~#str2~0.base, ~#str2~0.offset, ~str.base, ~str.offset + ~start~0, 1 + (~j~0 - ~start~0)); {5085#true} is VALID [2020-07-10 15:28:12,809 INFO L280 TraceCheckUtils]: 43: Hoare triple {5085#true} ~dest.base, ~dest.offset := #in~dest.base, #in~dest.offset;~src.base, ~src.offset := #in~src.base, #in~src.offset;~n := #in~n;call #t~ret0.base, #t~ret0.offset := strncpy(~dest.base, ~dest.offset, ~src.base, ~src.offset, ~n);#res.base, #res.offset := #t~ret0.base, #t~ret0.offset;havoc #t~ret0.base, #t~ret0.offset; {5085#true} is VALID [2020-07-10 15:28:12,810 INFO L280 TraceCheckUtils]: 44: Hoare triple {5085#true} assume true; {5085#true} is VALID [2020-07-10 15:28:12,811 INFO L275 TraceCheckUtils]: 45: Hoare quadruple {5085#true} {5226#(< parse_expression_list_~j~0 (+ parse_expression_list_~start~0 1))} #147#return; {5226#(< parse_expression_list_~j~0 (+ parse_expression_list_~start~0 1))} is VALID [2020-07-10 15:28:12,811 INFO L280 TraceCheckUtils]: 46: Hoare triple {5226#(< parse_expression_list_~j~0 (+ parse_expression_list_~start~0 1))} havoc #t~ret19.base, #t~ret19.offset; {5226#(< parse_expression_list_~j~0 (+ parse_expression_list_~start~0 1))} is VALID [2020-07-10 15:28:12,812 INFO L263 TraceCheckUtils]: 47: Hoare triple {5226#(< parse_expression_list_~j~0 (+ parse_expression_list_~start~0 1))} call __VERIFIER_assert((if 1 + (~j~0 - ~start~0) < 2 then 1 else 0)); {5245#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2020-07-10 15:28:12,812 INFO L280 TraceCheckUtils]: 48: Hoare triple {5245#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5249#(<= 1 __VERIFIER_assert_~cond)} is VALID [2020-07-10 15:28:12,813 INFO L280 TraceCheckUtils]: 49: Hoare triple {5249#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5086#false} is VALID [2020-07-10 15:28:12,813 INFO L280 TraceCheckUtils]: 50: Hoare triple {5086#false} assume !false; {5086#false} is VALID [2020-07-10 15:28:12,814 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2020-07-10 15:28:12,815 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-10 15:28:12,815 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2020-07-10 15:28:12,815 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115278044] [2020-07-10 15:28:12,816 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 51 [2020-07-10 15:28:12,816 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:28:12,816 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-10 15:28:12,862 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:28:12,863 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-10 15:28:12,863 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:28:12,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-10 15:28:12,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2020-07-10 15:28:12,864 INFO L87 Difference]: Start difference. First operand 85 states and 104 transitions. Second operand 5 states. [2020-07-10 15:28:13,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:13,106 INFO L93 Difference]: Finished difference Result 86 states and 105 transitions. [2020-07-10 15:28:13,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-10 15:28:13,106 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 51 [2020-07-10 15:28:13,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:28:13,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 15:28:13,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 72 transitions. [2020-07-10 15:28:13,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 15:28:13,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 72 transitions. [2020-07-10 15:28:13,109 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 72 transitions. [2020-07-10 15:28:13,200 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:28:13,201 INFO L225 Difference]: With dead ends: 86 [2020-07-10 15:28:13,201 INFO L226 Difference]: Without dead ends: 0 [2020-07-10 15:28:13,202 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2020-07-10 15:28:13,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-10 15:28:13,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-10 15:28:13,202 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:28:13,203 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-10 15:28:13,203 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-10 15:28:13,203 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-10 15:28:13,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:13,203 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-10 15:28:13,203 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 15:28:13,203 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:28:13,204 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:28:13,204 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-10 15:28:13,204 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-10 15:28:13,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:13,204 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-10 15:28:13,204 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 15:28:13,204 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:28:13,204 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:28:13,204 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:28:13,204 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:28:13,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-10 15:28:13,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-10 15:28:13,205 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 51 [2020-07-10 15:28:13,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:28:13,205 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-10 15:28:13,205 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-10 15:28:13,205 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 15:28:13,205 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:28:13,406 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:28:13,410 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-10 15:28:13,545 INFO L268 CegarLoopResult]: For program point L60(line 60) no Hoare annotation was computed. [2020-07-10 15:28:13,545 INFO L268 CegarLoopResult]: For program point L60-2(line 60) no Hoare annotation was computed. [2020-07-10 15:28:13,546 INFO L268 CegarLoopResult]: For program point L60-4(lines 54 72) no Hoare annotation was computed. [2020-07-10 15:28:13,546 INFO L268 CegarLoopResult]: For program point L56-1(line 56) no Hoare annotation was computed. [2020-07-10 15:28:13,546 INFO L268 CegarLoopResult]: For program point L56-3(line 56) no Hoare annotation was computed. [2020-07-10 15:28:13,546 INFO L271 CegarLoopResult]: At program point L56-5(line 56) the Hoare annotation is: true [2020-07-10 15:28:13,547 INFO L268 CegarLoopResult]: For program point L52-1(lines 52 73) no Hoare annotation was computed. [2020-07-10 15:28:13,547 INFO L268 CegarLoopResult]: For program point L56-6(line 56) no Hoare annotation was computed. [2020-07-10 15:28:13,548 INFO L268 CegarLoopResult]: For program point L52-2(lines 52 73) no Hoare annotation was computed. [2020-07-10 15:28:13,548 INFO L271 CegarLoopResult]: At program point L52-4(lines 52 73) the Hoare annotation is: true [2020-07-10 15:28:13,548 INFO L268 CegarLoopResult]: For program point L52-5(lines 52 73) no Hoare annotation was computed. [2020-07-10 15:28:13,548 INFO L264 CegarLoopResult]: At program point L65(line 65) the Hoare annotation is: (< parse_expression_list_~j~0 (+ parse_expression_list_~start~0 1)) [2020-07-10 15:28:13,550 INFO L268 CegarLoopResult]: For program point L65-1(line 65) no Hoare annotation was computed. [2020-07-10 15:28:13,550 INFO L268 CegarLoopResult]: For program point L61(lines 61 70) no Hoare annotation was computed. [2020-07-10 15:28:13,550 INFO L268 CegarLoopResult]: For program point L57(line 57) no Hoare annotation was computed. [2020-07-10 15:28:13,550 INFO L268 CegarLoopResult]: For program point L57-2(line 57) no Hoare annotation was computed. [2020-07-10 15:28:13,550 INFO L264 CegarLoopResult]: At program point L66(line 66) the Hoare annotation is: (< parse_expression_list_~j~0 (+ parse_expression_list_~start~0 1)) [2020-07-10 15:28:13,550 INFO L268 CegarLoopResult]: For program point L66-1(line 66) no Hoare annotation was computed. [2020-07-10 15:28:13,551 INFO L268 CegarLoopResult]: For program point parse_expression_listFINAL(lines 47 75) no Hoare annotation was computed. [2020-07-10 15:28:13,551 INFO L268 CegarLoopResult]: For program point L62(lines 62 64) no Hoare annotation was computed. [2020-07-10 15:28:13,551 INFO L264 CegarLoopResult]: At program point parse_expression_listENTRY(lines 47 75) the Hoare annotation is: (= |#valid| |old(#valid)|) [2020-07-10 15:28:13,551 INFO L268 CegarLoopResult]: For program point L54(lines 54 72) no Hoare annotation was computed. [2020-07-10 15:28:13,551 INFO L268 CegarLoopResult]: For program point parse_expression_listEXIT(lines 47 75) no Hoare annotation was computed. [2020-07-10 15:28:13,552 INFO L268 CegarLoopResult]: For program point L59-1(line 59) no Hoare annotation was computed. [2020-07-10 15:28:13,552 INFO L268 CegarLoopResult]: For program point L59-2(line 59) no Hoare annotation was computed. [2020-07-10 15:28:13,552 INFO L268 CegarLoopResult]: For program point L55(line 55) no Hoare annotation was computed. [2020-07-10 15:28:13,552 INFO L268 CegarLoopResult]: For program point L59-4(line 59) no Hoare annotation was computed. [2020-07-10 15:28:13,552 INFO L268 CegarLoopResult]: For program point L59-6(line 59) no Hoare annotation was computed. [2020-07-10 15:28:13,552 INFO L268 CegarLoopResult]: For program point L51(line 51) no Hoare annotation was computed. [2020-07-10 15:28:13,552 INFO L271 CegarLoopResult]: At program point L59-8(line 59) the Hoare annotation is: true [2020-07-10 15:28:13,553 INFO L268 CegarLoopResult]: For program point L59-9(line 59) no Hoare annotation was computed. [2020-07-10 15:28:13,553 INFO L268 CegarLoopResult]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2020-07-10 15:28:13,553 INFO L264 CegarLoopResult]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2020-07-10 15:28:13,553 INFO L268 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-07-10 15:28:13,553 INFO L268 CegarLoopResult]: For program point r_strncpyFINAL(line 31) no Hoare annotation was computed. [2020-07-10 15:28:13,553 INFO L268 CegarLoopResult]: For program point r_strncpyEXIT(line 31) no Hoare annotation was computed. [2020-07-10 15:28:13,553 INFO L271 CegarLoopResult]: At program point r_strncpyENTRY(line 31) the Hoare annotation is: true [2020-07-10 15:28:13,554 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-10 15:28:13,554 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-10 15:28:13,554 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-10 15:28:13,554 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-10 15:28:13,554 INFO L264 CegarLoopResult]: At program point mainENTRY(lines 76 85) the Hoare annotation is: (= |#valid| |old(#valid)|) [2020-07-10 15:28:13,555 INFO L268 CegarLoopResult]: For program point mainEXIT(lines 76 85) no Hoare annotation was computed. [2020-07-10 15:28:13,555 INFO L271 CegarLoopResult]: At program point L83(line 83) the Hoare annotation is: true [2020-07-10 15:28:13,555 INFO L268 CegarLoopResult]: For program point L83-1(line 83) no Hoare annotation was computed. [2020-07-10 15:28:13,555 INFO L268 CegarLoopResult]: For program point L79-2(lines 79 81) no Hoare annotation was computed. [2020-07-10 15:28:13,555 INFO L268 CegarLoopResult]: For program point mainFINAL(lines 76 85) no Hoare annotation was computed. [2020-07-10 15:28:13,555 INFO L271 CegarLoopResult]: At program point L79-3(lines 79 81) the Hoare annotation is: true [2020-07-10 15:28:13,556 INFO L268 CegarLoopResult]: For program point L79-4(lines 79 81) no Hoare annotation was computed. [2020-07-10 15:28:13,556 INFO L271 CegarLoopResult]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2020-07-10 15:28:13,556 INFO L268 CegarLoopResult]: For program point __VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2020-07-10 15:28:13,556 INFO L268 CegarLoopResult]: For program point L5(line 5) no Hoare annotation was computed. [2020-07-10 15:28:13,556 INFO L268 CegarLoopResult]: For program point L4(lines 4 6) no Hoare annotation was computed. [2020-07-10 15:28:13,556 INFO L268 CegarLoopResult]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2020-07-10 15:28:13,556 INFO L268 CegarLoopResult]: For program point L4-2(lines 3 8) no Hoare annotation was computed. [2020-07-10 15:28:13,561 WARN L170 areAnnotationChecker]: L51 has no Hoare annotation [2020-07-10 15:28:13,562 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-10 15:28:13,562 WARN L170 areAnnotationChecker]: r_strncpyFINAL has no Hoare annotation [2020-07-10 15:28:13,564 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-10 15:28:13,565 WARN L170 areAnnotationChecker]: L51 has no Hoare annotation [2020-07-10 15:28:13,565 WARN L170 areAnnotationChecker]: L51 has no Hoare annotation [2020-07-10 15:28:13,565 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-10 15:28:13,565 WARN L170 areAnnotationChecker]: r_strncpyFINAL has no Hoare annotation [2020-07-10 15:28:13,565 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-10 15:28:13,566 WARN L170 areAnnotationChecker]: L79-4 has no Hoare annotation [2020-07-10 15:28:13,566 WARN L170 areAnnotationChecker]: L79-4 has no Hoare annotation [2020-07-10 15:28:13,566 WARN L170 areAnnotationChecker]: L79-2 has no Hoare annotation [2020-07-10 15:28:13,566 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-10 15:28:13,566 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-10 15:28:13,566 WARN L170 areAnnotationChecker]: parse_expression_listFINAL has no Hoare annotation [2020-07-10 15:28:13,566 WARN L170 areAnnotationChecker]: L55 has no Hoare annotation [2020-07-10 15:28:13,566 WARN L170 areAnnotationChecker]: L52-5 has no Hoare annotation [2020-07-10 15:28:13,567 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-10 15:28:13,567 WARN L170 areAnnotationChecker]: r_strncpyEXIT has no Hoare annotation [2020-07-10 15:28:13,567 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-10 15:28:13,567 WARN L170 areAnnotationChecker]: L79-4 has no Hoare annotation [2020-07-10 15:28:13,567 WARN L170 areAnnotationChecker]: L79-2 has no Hoare annotation [2020-07-10 15:28:13,567 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2020-07-10 15:28:13,567 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2020-07-10 15:28:13,567 WARN L170 areAnnotationChecker]: L4-2 has no Hoare annotation [2020-07-10 15:28:13,568 WARN L170 areAnnotationChecker]: parse_expression_listEXIT has no Hoare annotation [2020-07-10 15:28:13,568 WARN L170 areAnnotationChecker]: L55 has no Hoare annotation [2020-07-10 15:28:13,568 WARN L170 areAnnotationChecker]: L55 has no Hoare annotation [2020-07-10 15:28:13,568 WARN L170 areAnnotationChecker]: L52-5 has no Hoare annotation [2020-07-10 15:28:13,568 WARN L170 areAnnotationChecker]: L65-1 has no Hoare annotation [2020-07-10 15:28:13,568 WARN L170 areAnnotationChecker]: L83-1 has no Hoare annotation [2020-07-10 15:28:13,571 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-10 15:28:13,572 WARN L170 areAnnotationChecker]: L83-1 has no Hoare annotation [2020-07-10 15:28:13,572 WARN L170 areAnnotationChecker]: L56-6 has no Hoare annotation [2020-07-10 15:28:13,572 WARN L170 areAnnotationChecker]: L56-1 has no Hoare annotation [2020-07-10 15:28:13,572 WARN L170 areAnnotationChecker]: L54 has no Hoare annotation [2020-07-10 15:28:13,572 WARN L170 areAnnotationChecker]: L66-1 has no Hoare annotation [2020-07-10 15:28:13,572 WARN L170 areAnnotationChecker]: L66-1 has no Hoare annotation [2020-07-10 15:28:13,573 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-10 15:28:13,573 WARN L170 areAnnotationChecker]: L56-6 has no Hoare annotation [2020-07-10 15:28:13,573 WARN L170 areAnnotationChecker]: L56-1 has no Hoare annotation [2020-07-10 15:28:13,573 WARN L170 areAnnotationChecker]: L56-1 has no Hoare annotation [2020-07-10 15:28:13,573 WARN L170 areAnnotationChecker]: L52-1 has no Hoare annotation [2020-07-10 15:28:13,573 WARN L170 areAnnotationChecker]: L61 has no Hoare annotation [2020-07-10 15:28:13,573 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-10 15:28:13,574 WARN L170 areAnnotationChecker]: L57 has no Hoare annotation [2020-07-10 15:28:13,574 WARN L170 areAnnotationChecker]: L57 has no Hoare annotation [2020-07-10 15:28:13,574 WARN L170 areAnnotationChecker]: L56-3 has no Hoare annotation [2020-07-10 15:28:13,574 WARN L170 areAnnotationChecker]: L56-3 has no Hoare annotation [2020-07-10 15:28:13,574 WARN L170 areAnnotationChecker]: L52-2 has no Hoare annotation [2020-07-10 15:28:13,574 WARN L170 areAnnotationChecker]: L52-2 has no Hoare annotation [2020-07-10 15:28:13,574 WARN L170 areAnnotationChecker]: L57-2 has no Hoare annotation [2020-07-10 15:28:13,575 WARN L170 areAnnotationChecker]: L59-9 has no Hoare annotation [2020-07-10 15:28:13,575 WARN L170 areAnnotationChecker]: L59-1 has no Hoare annotation [2020-07-10 15:28:13,575 WARN L170 areAnnotationChecker]: L59-9 has no Hoare annotation [2020-07-10 15:28:13,575 WARN L170 areAnnotationChecker]: L59-1 has no Hoare annotation [2020-07-10 15:28:13,575 WARN L170 areAnnotationChecker]: L59-1 has no Hoare annotation [2020-07-10 15:28:13,575 WARN L170 areAnnotationChecker]: L60 has no Hoare annotation [2020-07-10 15:28:13,575 WARN L170 areAnnotationChecker]: L60 has no Hoare annotation [2020-07-10 15:28:13,576 WARN L170 areAnnotationChecker]: L59-2 has no Hoare annotation [2020-07-10 15:28:13,576 WARN L170 areAnnotationChecker]: L59-2 has no Hoare annotation [2020-07-10 15:28:13,576 WARN L170 areAnnotationChecker]: L59-6 has no Hoare annotation [2020-07-10 15:28:13,576 WARN L170 areAnnotationChecker]: L59-6 has no Hoare annotation [2020-07-10 15:28:13,576 WARN L170 areAnnotationChecker]: L60-2 has no Hoare annotation [2020-07-10 15:28:13,576 WARN L170 areAnnotationChecker]: L60-2 has no Hoare annotation [2020-07-10 15:28:13,577 WARN L170 areAnnotationChecker]: L59-4 has no Hoare annotation [2020-07-10 15:28:13,577 WARN L170 areAnnotationChecker]: L60-4 has no Hoare annotation [2020-07-10 15:28:13,577 WARN L170 areAnnotationChecker]: L60-4 has no Hoare annotation [2020-07-10 15:28:13,577 WARN L170 areAnnotationChecker]: L62 has no Hoare annotation [2020-07-10 15:28:13,577 WARN L170 areAnnotationChecker]: L62 has no Hoare annotation [2020-07-10 15:28:13,577 WARN L170 areAnnotationChecker]: L65-1 has no Hoare annotation [2020-07-10 15:28:13,577 INFO L163 areAnnotationChecker]: CFG has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-10 15:28:13,592 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.07 03:28:13 BoogieIcfgContainer [2020-07-10 15:28:13,592 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-10 15:28:13,599 INFO L168 Benchmark]: Toolchain (without parser) took 14137.62 ms. Allocated memory was 136.3 MB in the beginning and 385.4 MB in the end (delta: 249.0 MB). Free memory was 98.8 MB in the beginning and 314.8 MB in the end (delta: -215.9 MB). Peak memory consumption was 33.1 MB. Max. memory is 7.1 GB. [2020-07-10 15:28:13,600 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 136.3 MB. Free memory was 118.2 MB in the beginning and 117.9 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2020-07-10 15:28:13,601 INFO L168 Benchmark]: CACSL2BoogieTranslator took 479.28 ms. Allocated memory was 136.3 MB in the beginning and 200.3 MB in the end (delta: 64.0 MB). Free memory was 98.6 MB in the beginning and 176.6 MB in the end (delta: -78.0 MB). Peak memory consumption was 23.6 MB. Max. memory is 7.1 GB. [2020-07-10 15:28:13,612 INFO L168 Benchmark]: Boogie Preprocessor took 64.19 ms. Allocated memory is still 200.3 MB. Free memory was 176.6 MB in the beginning and 173.5 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 7.1 GB. [2020-07-10 15:28:13,613 INFO L168 Benchmark]: RCFGBuilder took 675.89 ms. Allocated memory is still 200.3 MB. Free memory was 173.5 MB in the beginning and 130.3 MB in the end (delta: 43.2 MB). Peak memory consumption was 43.2 MB. Max. memory is 7.1 GB. [2020-07-10 15:28:13,614 INFO L168 Benchmark]: TraceAbstraction took 12907.99 ms. Allocated memory was 200.3 MB in the beginning and 385.4 MB in the end (delta: 185.1 MB). Free memory was 130.3 MB in the beginning and 314.8 MB in the end (delta: -184.4 MB). Peak memory consumption was 635.9 kB. Max. memory is 7.1 GB. [2020-07-10 15:28:13,617 INFO L336 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.27 ms. Allocated memory is still 136.3 MB. Free memory was 118.2 MB in the beginning and 117.9 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 479.28 ms. Allocated memory was 136.3 MB in the beginning and 200.3 MB in the end (delta: 64.0 MB). Free memory was 98.6 MB in the beginning and 176.6 MB in the end (delta: -78.0 MB). Peak memory consumption was 23.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 64.19 ms. Allocated memory is still 200.3 MB. Free memory was 176.6 MB in the beginning and 173.5 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 675.89 ms. Allocated memory is still 200.3 MB. Free memory was 173.5 MB in the beginning and 130.3 MB in the end (delta: 43.2 MB). Peak memory consumption was 43.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 12907.99 ms. Allocated memory was 200.3 MB in the beginning and 385.4 MB in the end (delta: 185.1 MB). Free memory was 130.3 MB in the beginning and 314.8 MB in the end (delta: -184.4 MB). Peak memory consumption was 635.9 kB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 79]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 56]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 59]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 52]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 55 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 12.6s, OverallIterations: 11, TraceHistogramMax: 5, AutomataDifference: 5.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 562 SDtfs, 239 SDslu, 1419 SDs, 0 SdLazy, 787 SolverSat, 54 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 532 GetRequests, 455 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=85occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 11 MinimizatonAttempts, 97 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 14 LocationsWithAnnotation, 64 PreInvPairs, 94 NumberOfFragments, 35 HoareAnnotationTreeSize, 64 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 14 FomulaSimplificationsInter, 40 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 896 NumberOfCodeBlocks, 858 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 875 ConstructedInterpolants, 0 QuantifiedInterpolants, 62932 SizeOfPredicates, 17 NumberOfNonLiveVariables, 1443 ConjunctsInSsa, 44 ConjunctsInUnsatCore, 21 InterpolantComputations, 7 PerfectInterpolantSequences, 72/188 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...