/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 --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.use.separate.solver.for.trace.checks true -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/loops/verisec_OpenSER_cases1_stripFullBoth_arr.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-46f3038-m [2020-07-08 23:37:30,249 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-08 23:37:30,252 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-08 23:37:30,272 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-08 23:37:30,272 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-08 23:37:30,275 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-08 23:37:30,277 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-08 23:37:30,289 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-08 23:37:30,291 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-08 23:37:30,294 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-08 23:37:30,296 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-08 23:37:30,299 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-08 23:37:30,299 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-08 23:37:30,303 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-08 23:37:30,305 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-08 23:37:30,307 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-08 23:37:30,310 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-08 23:37:30,311 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-08 23:37:30,315 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-08 23:37:30,320 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-08 23:37:30,323 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-08 23:37:30,326 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-08 23:37:30,328 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-08 23:37:30,329 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-08 23:37:30,331 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-08 23:37:30,332 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-08 23:37:30,332 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-08 23:37:30,336 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-08 23:37:30,336 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-08 23:37:30,337 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-08 23:37:30,338 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-08 23:37:30,339 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-08 23:37:30,340 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-08 23:37:30,341 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-08 23:37:30,345 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-08 23:37:30,345 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-08 23:37:30,348 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-08 23:37:30,348 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-08 23:37:30,349 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-08 23:37:30,350 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-08 23:37:30,352 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-08 23:37:30,353 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-08 23:37:30,368 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-08 23:37:30,368 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-08 23:37:30,372 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-08 23:37:30,372 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-08 23:37:30,373 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-08 23:37:30,373 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-08 23:37:30,373 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-08 23:37:30,374 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-08 23:37:30,374 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-08 23:37:30,374 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-08 23:37:30,375 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-08 23:37:30,376 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-08 23:37:30,376 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-08 23:37:30,376 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-08 23:37:30,378 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-08 23:37:30,379 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-08 23:37:30,379 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-08 23:37:30,379 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-08 23:37:30,379 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-08 23:37:30,380 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-08 23:37:30,380 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-08 23:37:30,380 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-08 23:37:30,380 INFO L138 SettingsManager]: * Use separate solver for trace checks=false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use separate solver for trace checks -> true [2020-07-08 23:37:30,665 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-08 23:37:30,679 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-08 23:37:30,683 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-08 23:37:30,685 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-08 23:37:30,685 INFO L275 PluginConnector]: CDTParser initialized [2020-07-08 23:37:30,686 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/verisec_OpenSER_cases1_stripFullBoth_arr.i [2020-07-08 23:37:30,768 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eba4e96b8/75fc41a0c8a0428ea9c404c8112ef489/FLAG6f07eb1bf [2020-07-08 23:37:31,286 INFO L306 CDTParser]: Found 1 translation units. [2020-07-08 23:37:31,287 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/verisec_OpenSER_cases1_stripFullBoth_arr.i [2020-07-08 23:37:31,298 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eba4e96b8/75fc41a0c8a0428ea9c404c8112ef489/FLAG6f07eb1bf [2020-07-08 23:37:31,625 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eba4e96b8/75fc41a0c8a0428ea9c404c8112ef489 [2020-07-08 23:37:31,633 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-08 23:37:31,635 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-08 23:37:31,637 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-08 23:37:31,637 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-08 23:37:31,640 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-08 23:37:31,642 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 11:37:31" (1/1) ... [2020-07-08 23:37:31,644 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d9c3899 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:37:31, skipping insertion in model container [2020-07-08 23:37:31,644 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 11:37:31" (1/1) ... [2020-07-08 23:37:31,651 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-08 23:37:31,670 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-08 23:37:31,867 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 23:37:31,881 INFO L203 MainTranslator]: Completed pre-run [2020-07-08 23:37:32,011 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 23:37:32,045 INFO L208 MainTranslator]: Completed translation [2020-07-08 23:37:32,046 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:37:32 WrapperNode [2020-07-08 23:37:32,046 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-08 23:37:32,046 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-08 23:37:32,047 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-08 23:37:32,047 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-08 23:37:32,058 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:37:32" (1/1) ... [2020-07-08 23:37:32,058 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:37:32" (1/1) ... [2020-07-08 23:37:32,068 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:37:32" (1/1) ... [2020-07-08 23:37:32,069 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:37:32" (1/1) ... [2020-07-08 23:37:32,087 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:37:32" (1/1) ... [2020-07-08 23:37:32,095 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:37:32" (1/1) ... [2020-07-08 23:37:32,097 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:37:32" (1/1) ... [2020-07-08 23:37:32,101 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-08 23:37:32,102 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-08 23:37:32,102 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-08 23:37:32,102 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-08 23:37:32,103 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:37:32" (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-08 23:37:32,165 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-08 23:37:32,165 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-08 23:37:32,166 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-08 23:37:32,166 INFO L138 BoogieDeclarations]: Found implementation of procedure r_strncpy [2020-07-08 23:37:32,166 INFO L138 BoogieDeclarations]: Found implementation of procedure parse_expression_list [2020-07-08 23:37:32,166 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-08 23:37:32,166 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-08 23:37:32,167 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-08 23:37:32,167 INFO L130 BoogieDeclarations]: Found specification of procedure strchr [2020-07-08 23:37:32,167 INFO L130 BoogieDeclarations]: Found specification of procedure strrchr [2020-07-08 23:37:32,167 INFO L130 BoogieDeclarations]: Found specification of procedure strstr [2020-07-08 23:37:32,167 INFO L130 BoogieDeclarations]: Found specification of procedure strncpy [2020-07-08 23:37:32,167 INFO L130 BoogieDeclarations]: Found specification of procedure strncpy_ptr [2020-07-08 23:37:32,168 INFO L130 BoogieDeclarations]: Found specification of procedure strcpy [2020-07-08 23:37:32,168 INFO L130 BoogieDeclarations]: Found specification of procedure strlen [2020-07-08 23:37:32,168 INFO L130 BoogieDeclarations]: Found specification of procedure strncmp [2020-07-08 23:37:32,168 INFO L130 BoogieDeclarations]: Found specification of procedure strcmp [2020-07-08 23:37:32,168 INFO L130 BoogieDeclarations]: Found specification of procedure strcat [2020-07-08 23:37:32,169 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2020-07-08 23:37:32,169 INFO L130 BoogieDeclarations]: Found specification of procedure isascii [2020-07-08 23:37:32,169 INFO L130 BoogieDeclarations]: Found specification of procedure isspace [2020-07-08 23:37:32,169 INFO L130 BoogieDeclarations]: Found specification of procedure getc [2020-07-08 23:37:32,170 INFO L130 BoogieDeclarations]: Found specification of procedure strrand [2020-07-08 23:37:32,170 INFO L130 BoogieDeclarations]: Found specification of procedure istrrand [2020-07-08 23:37:32,171 INFO L130 BoogieDeclarations]: Found specification of procedure istrchr [2020-07-08 23:37:32,171 INFO L130 BoogieDeclarations]: Found specification of procedure istrrchr [2020-07-08 23:37:32,171 INFO L130 BoogieDeclarations]: Found specification of procedure istrncmp [2020-07-08 23:37:32,171 INFO L130 BoogieDeclarations]: Found specification of procedure istrstr [2020-07-08 23:37:32,171 INFO L130 BoogieDeclarations]: Found specification of procedure r_strncpy [2020-07-08 23:37:32,171 INFO L130 BoogieDeclarations]: Found specification of procedure r_strcpy [2020-07-08 23:37:32,172 INFO L130 BoogieDeclarations]: Found specification of procedure r_strcat [2020-07-08 23:37:32,172 INFO L130 BoogieDeclarations]: Found specification of procedure r_strncat [2020-07-08 23:37:32,172 INFO L130 BoogieDeclarations]: Found specification of procedure r_memcpy [2020-07-08 23:37:32,172 INFO L130 BoogieDeclarations]: Found specification of procedure parse_expression_list [2020-07-08 23:37:32,172 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-08 23:37:32,172 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-08 23:37:32,173 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-08 23:37:32,173 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-08 23:37:32,173 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-08 23:37:32,173 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-08 23:37:32,173 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-08 23:37:32,805 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-08 23:37:32,806 INFO L295 CfgBuilder]: Removed 3 assume(true) statements. [2020-07-08 23:37:32,812 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 11:37:32 BoogieIcfgContainer [2020-07-08 23:37:32,812 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-08 23:37:32,813 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-08 23:37:32,814 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-08 23:37:32,817 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-08 23:37:32,817 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.07 11:37:31" (1/3) ... [2020-07-08 23:37:32,818 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c488732 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 11:37:32, skipping insertion in model container [2020-07-08 23:37:32,819 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:37:32" (2/3) ... [2020-07-08 23:37:32,819 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c488732 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 11:37:32, skipping insertion in model container [2020-07-08 23:37:32,819 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 11:37:32" (3/3) ... [2020-07-08 23:37:32,821 INFO L109 eAbstractionObserver]: Analyzing ICFG verisec_OpenSER_cases1_stripFullBoth_arr.i [2020-07-08 23:37:32,833 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-08 23:37:32,843 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-08 23:37:32,857 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-08 23:37:32,880 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-08 23:37:32,880 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-08 23:37:32,881 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-07-08 23:37:32,881 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-08 23:37:32,881 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-08 23:37:32,881 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-08 23:37:32,882 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-08 23:37:32,882 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-08 23:37:32,901 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states. [2020-07-08 23:37:32,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2020-07-08 23:37:32,916 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 23:37:32,917 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 23:37:32,918 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 23:37:32,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 23:37:32,925 INFO L82 PathProgramCache]: Analyzing trace with hash 2116113079, now seen corresponding path program 1 times [2020-07-08 23:37:32,934 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 23:37:32,934 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1794250975] [2020-07-08 23:37:32,935 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 23:37:33,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:37:33,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:37:33,172 INFO L280 TraceCheckUtils]: 0: Hoare triple {141#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {126#true} is VALID [2020-07-08 23:37:33,173 INFO L280 TraceCheckUtils]: 1: Hoare triple {126#true} #valid := #valid[0 := 0]; {126#true} is VALID [2020-07-08 23:37:33,174 INFO L280 TraceCheckUtils]: 2: Hoare triple {126#true} assume 0 < #StackHeapBarrier; {126#true} is VALID [2020-07-08 23:37:33,174 INFO L280 TraceCheckUtils]: 3: Hoare triple {126#true} assume true; {126#true} is VALID [2020-07-08 23:37:33,178 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {126#true} {126#true} #205#return; {126#true} is VALID [2020-07-08 23:37:33,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:37:33,190 INFO L280 TraceCheckUtils]: 0: Hoare triple {126#true} ~dest.base, ~dest.offset := #in~dest.base, #in~dest.offset; {126#true} is VALID [2020-07-08 23:37:33,191 INFO L280 TraceCheckUtils]: 1: Hoare triple {126#true} ~src.base, ~src.offset := #in~src.base, #in~src.offset; {126#true} is VALID [2020-07-08 23:37:33,191 INFO L280 TraceCheckUtils]: 2: Hoare triple {126#true} ~n := #in~n; {126#true} is VALID [2020-07-08 23:37:33,192 INFO L280 TraceCheckUtils]: 3: Hoare triple {126#true} SUMMARY for call #t~ret0.base, #t~ret0.offset := strncpy(~dest.base, ~dest.offset, ~src.base, ~src.offset, ~n); srcloc: L30-2 {126#true} is VALID [2020-07-08 23:37:33,192 INFO L280 TraceCheckUtils]: 4: Hoare triple {126#true} #res.base, #res.offset := #t~ret0.base, #t~ret0.offset; {126#true} is VALID [2020-07-08 23:37:33,192 INFO L280 TraceCheckUtils]: 5: Hoare triple {126#true} havoc #t~ret0.base, #t~ret0.offset; {126#true} is VALID [2020-07-08 23:37:33,193 INFO L280 TraceCheckUtils]: 6: Hoare triple {126#true} assume true; {126#true} is VALID [2020-07-08 23:37:33,193 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {126#true} {127#false} #201#return; {127#false} is VALID [2020-07-08 23:37:33,196 INFO L263 TraceCheckUtils]: 0: Hoare triple {126#true} call ULTIMATE.init(); {141#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 23:37:33,196 INFO L280 TraceCheckUtils]: 1: Hoare triple {141#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {126#true} is VALID [2020-07-08 23:37:33,196 INFO L280 TraceCheckUtils]: 2: Hoare triple {126#true} #valid := #valid[0 := 0]; {126#true} is VALID [2020-07-08 23:37:33,197 INFO L280 TraceCheckUtils]: 3: Hoare triple {126#true} assume 0 < #StackHeapBarrier; {126#true} is VALID [2020-07-08 23:37:33,197 INFO L280 TraceCheckUtils]: 4: Hoare triple {126#true} assume true; {126#true} is VALID [2020-07-08 23:37:33,201 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {126#true} {126#true} #205#return; {126#true} is VALID [2020-07-08 23:37:33,202 INFO L263 TraceCheckUtils]: 6: Hoare triple {126#true} call #t~ret21 := main(); {126#true} is VALID [2020-07-08 23:37:33,202 INFO L280 TraceCheckUtils]: 7: Hoare triple {126#true} SUMMARY for call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(9); srcloc: mainENTRY {126#true} is VALID [2020-07-08 23:37:33,203 INFO L280 TraceCheckUtils]: 8: Hoare triple {126#true} SUMMARY for call write~int(0, ~#A~0.base, 8 + ~#A~0.offset, 1); srcloc: L74 {126#true} is VALID [2020-07-08 23:37:33,203 INFO L263 TraceCheckUtils]: 9: Hoare triple {126#true} call #t~ret20 := parse_expression_list(~#A~0.base, ~#A~0.offset); {126#true} is VALID [2020-07-08 23:37:33,204 INFO L280 TraceCheckUtils]: 10: Hoare triple {126#true} ~str.base, ~str.offset := #in~str.base, #in~str.offset; {126#true} is VALID [2020-07-08 23:37:33,204 INFO L280 TraceCheckUtils]: 11: Hoare triple {126#true} ~start~0 := 0; {126#true} is VALID [2020-07-08 23:37:33,204 INFO L280 TraceCheckUtils]: 12: Hoare triple {126#true} ~i~0 := -1; {126#true} is VALID [2020-07-08 23:37:33,205 INFO L280 TraceCheckUtils]: 13: Hoare triple {126#true} ~j~0 := -1; {126#true} is VALID [2020-07-08 23:37:33,205 INFO L280 TraceCheckUtils]: 14: Hoare triple {126#true} SUMMARY for call ~#str2~0.base, ~#str2~0.offset := #Ultimate.allocOnStack(2); srcloc: L49 {126#true} is VALID [2020-07-08 23:37:33,206 INFO L280 TraceCheckUtils]: 15: Hoare triple {126#true} assume !(~str.base == 0 && ~str.offset == 0); {126#true} is VALID [2020-07-08 23:37:33,206 INFO L280 TraceCheckUtils]: 16: Hoare triple {126#true} #t~post2 := ~i~0; {126#true} is VALID [2020-07-08 23:37:33,206 INFO L280 TraceCheckUtils]: 17: Hoare triple {126#true} ~i~0 := 1 + #t~post2; {126#true} is VALID [2020-07-08 23:37:33,207 INFO L280 TraceCheckUtils]: 18: Hoare triple {126#true} havoc #t~post2; {126#true} is VALID [2020-07-08 23:37:33,207 INFO L280 TraceCheckUtils]: 19: Hoare triple {126#true} SUMMARY for call #t~mem3 := read~int(~str.base, ~str.offset + ~i~0, 1); srcloc: L53 {126#true} is VALID [2020-07-08 23:37:33,208 INFO L280 TraceCheckUtils]: 20: Hoare triple {126#true} #t~switch4 := 0 == #t~mem3; {126#true} is VALID [2020-07-08 23:37:33,208 INFO L280 TraceCheckUtils]: 21: Hoare triple {126#true} assume #t~switch4; {126#true} is VALID [2020-07-08 23:37:33,209 INFO L280 TraceCheckUtils]: 22: Hoare triple {126#true} assume !true; {127#false} is VALID [2020-07-08 23:37:33,210 INFO L280 TraceCheckUtils]: 23: Hoare triple {127#false} SUMMARY for call #t~mem9 := read~int(~str.base, ~str.offset + ~start~0, 1); srcloc: L55-18 {127#false} is VALID [2020-07-08 23:37:33,210 INFO L280 TraceCheckUtils]: 24: Hoare triple {127#false} assume !(34 == #t~mem9); {127#false} is VALID [2020-07-08 23:37:33,210 INFO L280 TraceCheckUtils]: 25: Hoare triple {127#false} havoc #t~mem9; {127#false} is VALID [2020-07-08 23:37:33,211 INFO L280 TraceCheckUtils]: 26: Hoare triple {127#false} ~j~0 := ~i~0 - 1; {127#false} is VALID [2020-07-08 23:37:33,211 INFO L280 TraceCheckUtils]: 27: Hoare triple {127#false} assume !true; {127#false} is VALID [2020-07-08 23:37:33,212 INFO L280 TraceCheckUtils]: 28: Hoare triple {127#false} #t~short17 := 0 < ~j~0; {127#false} is VALID [2020-07-08 23:37:33,212 INFO L280 TraceCheckUtils]: 29: Hoare triple {127#false} assume !#t~short17; {127#false} is VALID [2020-07-08 23:37:33,212 INFO L280 TraceCheckUtils]: 30: Hoare triple {127#false} assume !#t~short17; {127#false} is VALID [2020-07-08 23:37:33,213 INFO L280 TraceCheckUtils]: 31: Hoare triple {127#false} havoc #t~short17; {127#false} is VALID [2020-07-08 23:37:33,213 INFO L280 TraceCheckUtils]: 32: Hoare triple {127#false} havoc #t~mem16; {127#false} is VALID [2020-07-08 23:37:33,213 INFO L280 TraceCheckUtils]: 33: Hoare triple {127#false} assume ~start~0 <= ~j~0; {127#false} is VALID [2020-07-08 23:37:33,214 INFO L263 TraceCheckUtils]: 34: Hoare triple {127#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)); {126#true} is VALID [2020-07-08 23:37:33,214 INFO L280 TraceCheckUtils]: 35: Hoare triple {126#true} ~dest.base, ~dest.offset := #in~dest.base, #in~dest.offset; {126#true} is VALID [2020-07-08 23:37:33,215 INFO L280 TraceCheckUtils]: 36: Hoare triple {126#true} ~src.base, ~src.offset := #in~src.base, #in~src.offset; {126#true} is VALID [2020-07-08 23:37:33,215 INFO L280 TraceCheckUtils]: 37: Hoare triple {126#true} ~n := #in~n; {126#true} is VALID [2020-07-08 23:37:33,215 INFO L280 TraceCheckUtils]: 38: Hoare triple {126#true} SUMMARY for call #t~ret0.base, #t~ret0.offset := strncpy(~dest.base, ~dest.offset, ~src.base, ~src.offset, ~n); srcloc: L30-2 {126#true} is VALID [2020-07-08 23:37:33,216 INFO L280 TraceCheckUtils]: 39: Hoare triple {126#true} #res.base, #res.offset := #t~ret0.base, #t~ret0.offset; {126#true} is VALID [2020-07-08 23:37:33,216 INFO L280 TraceCheckUtils]: 40: Hoare triple {126#true} havoc #t~ret0.base, #t~ret0.offset; {126#true} is VALID [2020-07-08 23:37:33,216 INFO L280 TraceCheckUtils]: 41: Hoare triple {126#true} assume true; {126#true} is VALID [2020-07-08 23:37:33,217 INFO L275 TraceCheckUtils]: 42: Hoare quadruple {126#true} {127#false} #201#return; {127#false} is VALID [2020-07-08 23:37:33,217 INFO L280 TraceCheckUtils]: 43: Hoare triple {127#false} havoc #t~ret19.base, #t~ret19.offset; {127#false} is VALID [2020-07-08 23:37:33,218 INFO L263 TraceCheckUtils]: 44: Hoare triple {127#false} call __VERIFIER_assert((if 1 + (~j~0 - ~start~0) < 2 then 1 else 0)); {127#false} is VALID [2020-07-08 23:37:33,218 INFO L280 TraceCheckUtils]: 45: Hoare triple {127#false} ~cond := #in~cond; {127#false} is VALID [2020-07-08 23:37:33,218 INFO L280 TraceCheckUtils]: 46: Hoare triple {127#false} assume 0 == ~cond; {127#false} is VALID [2020-07-08 23:37:33,219 INFO L280 TraceCheckUtils]: 47: Hoare triple {127#false} assume !false; {127#false} is VALID [2020-07-08 23:37:33,227 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-08 23:37:33,228 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1794250975] [2020-07-08 23:37:33,230 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 23:37:33,231 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-08 23:37:33,232 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325845361] [2020-07-08 23:37:33,239 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2020-07-08 23:37:33,243 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 23:37:33,247 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-08 23:37:33,338 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:37:33,338 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-08 23:37:33,338 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 23:37:33,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-08 23:37:33,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 23:37:33,351 INFO L87 Difference]: Start difference. First operand 123 states. Second operand 3 states. [2020-07-08 23:37:34,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:37:34,026 INFO L93 Difference]: Finished difference Result 227 states and 257 transitions. [2020-07-08 23:37:34,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-08 23:37:34,027 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2020-07-08 23:37:34,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 23:37:34,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 23:37:34,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 257 transitions. [2020-07-08 23:37:34,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 23:37:34,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 257 transitions. [2020-07-08 23:37:34,070 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 257 transitions. [2020-07-08 23:37:34,461 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 257 edges. 257 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:37:34,492 INFO L225 Difference]: With dead ends: 227 [2020-07-08 23:37:34,492 INFO L226 Difference]: Without dead ends: 102 [2020-07-08 23:37:34,497 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 23:37:34,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2020-07-08 23:37:34,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2020-07-08 23:37:34,609 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 23:37:34,610 INFO L82 GeneralOperation]: Start isEquivalent. First operand 102 states. Second operand 102 states. [2020-07-08 23:37:34,610 INFO L74 IsIncluded]: Start isIncluded. First operand 102 states. Second operand 102 states. [2020-07-08 23:37:34,611 INFO L87 Difference]: Start difference. First operand 102 states. Second operand 102 states. [2020-07-08 23:37:34,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:37:34,620 INFO L93 Difference]: Finished difference Result 102 states and 111 transitions. [2020-07-08 23:37:34,620 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 111 transitions. [2020-07-08 23:37:34,621 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:37:34,622 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:37:34,622 INFO L74 IsIncluded]: Start isIncluded. First operand 102 states. Second operand 102 states. [2020-07-08 23:37:34,622 INFO L87 Difference]: Start difference. First operand 102 states. Second operand 102 states. [2020-07-08 23:37:34,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:37:34,630 INFO L93 Difference]: Finished difference Result 102 states and 111 transitions. [2020-07-08 23:37:34,630 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 111 transitions. [2020-07-08 23:37:34,632 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:37:34,632 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:37:34,632 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 23:37:34,632 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 23:37:34,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2020-07-08 23:37:34,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 111 transitions. [2020-07-08 23:37:34,640 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 111 transitions. Word has length 48 [2020-07-08 23:37:34,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 23:37:34,640 INFO L479 AbstractCegarLoop]: Abstraction has 102 states and 111 transitions. [2020-07-08 23:37:34,640 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-08 23:37:34,641 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 102 states and 111 transitions. [2020-07-08 23:37:34,757 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:37:34,757 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 111 transitions. [2020-07-08 23:37:34,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2020-07-08 23:37:34,760 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 23:37:34,760 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 23:37:34,760 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-08 23:37:34,761 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 23:37:34,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 23:37:34,761 INFO L82 PathProgramCache]: Analyzing trace with hash 1227098254, now seen corresponding path program 1 times [2020-07-08 23:37:34,762 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 23:37:34,762 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1989510829] [2020-07-08 23:37:34,762 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 23:37:34,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:37:34,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:37:34,856 INFO L280 TraceCheckUtils]: 0: Hoare triple {1022#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {1006#true} is VALID [2020-07-08 23:37:34,856 INFO L280 TraceCheckUtils]: 1: Hoare triple {1006#true} #valid := #valid[0 := 0]; {1006#true} is VALID [2020-07-08 23:37:34,857 INFO L280 TraceCheckUtils]: 2: Hoare triple {1006#true} assume 0 < #StackHeapBarrier; {1006#true} is VALID [2020-07-08 23:37:34,857 INFO L280 TraceCheckUtils]: 3: Hoare triple {1006#true} assume true; {1006#true} is VALID [2020-07-08 23:37:34,857 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {1006#true} {1006#true} #205#return; {1006#true} is VALID [2020-07-08 23:37:34,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:37:34,865 INFO L280 TraceCheckUtils]: 0: Hoare triple {1006#true} ~dest.base, ~dest.offset := #in~dest.base, #in~dest.offset; {1006#true} is VALID [2020-07-08 23:37:34,865 INFO L280 TraceCheckUtils]: 1: Hoare triple {1006#true} ~src.base, ~src.offset := #in~src.base, #in~src.offset; {1006#true} is VALID [2020-07-08 23:37:34,866 INFO L280 TraceCheckUtils]: 2: Hoare triple {1006#true} ~n := #in~n; {1006#true} is VALID [2020-07-08 23:37:34,866 INFO L280 TraceCheckUtils]: 3: Hoare triple {1006#true} SUMMARY for call #t~ret0.base, #t~ret0.offset := strncpy(~dest.base, ~dest.offset, ~src.base, ~src.offset, ~n); srcloc: L30-2 {1006#true} is VALID [2020-07-08 23:37:34,866 INFO L280 TraceCheckUtils]: 4: Hoare triple {1006#true} #res.base, #res.offset := #t~ret0.base, #t~ret0.offset; {1006#true} is VALID [2020-07-08 23:37:34,866 INFO L280 TraceCheckUtils]: 5: Hoare triple {1006#true} havoc #t~ret0.base, #t~ret0.offset; {1006#true} is VALID [2020-07-08 23:37:34,867 INFO L280 TraceCheckUtils]: 6: Hoare triple {1006#true} assume true; {1006#true} is VALID [2020-07-08 23:37:34,867 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {1006#true} {1007#false} #201#return; {1007#false} is VALID [2020-07-08 23:37:34,868 INFO L263 TraceCheckUtils]: 0: Hoare triple {1006#true} call ULTIMATE.init(); {1022#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 23:37:34,868 INFO L280 TraceCheckUtils]: 1: Hoare triple {1022#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {1006#true} is VALID [2020-07-08 23:37:34,869 INFO L280 TraceCheckUtils]: 2: Hoare triple {1006#true} #valid := #valid[0 := 0]; {1006#true} is VALID [2020-07-08 23:37:34,869 INFO L280 TraceCheckUtils]: 3: Hoare triple {1006#true} assume 0 < #StackHeapBarrier; {1006#true} is VALID [2020-07-08 23:37:34,869 INFO L280 TraceCheckUtils]: 4: Hoare triple {1006#true} assume true; {1006#true} is VALID [2020-07-08 23:37:34,870 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {1006#true} {1006#true} #205#return; {1006#true} is VALID [2020-07-08 23:37:34,870 INFO L263 TraceCheckUtils]: 6: Hoare triple {1006#true} call #t~ret21 := main(); {1006#true} is VALID [2020-07-08 23:37:34,870 INFO L280 TraceCheckUtils]: 7: Hoare triple {1006#true} SUMMARY for call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(9); srcloc: mainENTRY {1006#true} is VALID [2020-07-08 23:37:34,870 INFO L280 TraceCheckUtils]: 8: Hoare triple {1006#true} SUMMARY for call write~int(0, ~#A~0.base, 8 + ~#A~0.offset, 1); srcloc: L74 {1006#true} is VALID [2020-07-08 23:37:34,871 INFO L263 TraceCheckUtils]: 9: Hoare triple {1006#true} call #t~ret20 := parse_expression_list(~#A~0.base, ~#A~0.offset); {1006#true} is VALID [2020-07-08 23:37:34,871 INFO L280 TraceCheckUtils]: 10: Hoare triple {1006#true} ~str.base, ~str.offset := #in~str.base, #in~str.offset; {1006#true} is VALID [2020-07-08 23:37:34,871 INFO L280 TraceCheckUtils]: 11: Hoare triple {1006#true} ~start~0 := 0; {1006#true} is VALID [2020-07-08 23:37:34,872 INFO L280 TraceCheckUtils]: 12: Hoare triple {1006#true} ~i~0 := -1; {1006#true} is VALID [2020-07-08 23:37:34,872 INFO L280 TraceCheckUtils]: 13: Hoare triple {1006#true} ~j~0 := -1; {1006#true} is VALID [2020-07-08 23:37:34,872 INFO L280 TraceCheckUtils]: 14: Hoare triple {1006#true} SUMMARY for call ~#str2~0.base, ~#str2~0.offset := #Ultimate.allocOnStack(2); srcloc: L49 {1006#true} is VALID [2020-07-08 23:37:34,872 INFO L280 TraceCheckUtils]: 15: Hoare triple {1006#true} assume !(~str.base == 0 && ~str.offset == 0); {1006#true} is VALID [2020-07-08 23:37:34,873 INFO L280 TraceCheckUtils]: 16: Hoare triple {1006#true} #t~post2 := ~i~0; {1006#true} is VALID [2020-07-08 23:37:34,873 INFO L280 TraceCheckUtils]: 17: Hoare triple {1006#true} ~i~0 := 1 + #t~post2; {1006#true} is VALID [2020-07-08 23:37:34,873 INFO L280 TraceCheckUtils]: 18: Hoare triple {1006#true} havoc #t~post2; {1006#true} is VALID [2020-07-08 23:37:34,874 INFO L280 TraceCheckUtils]: 19: Hoare triple {1006#true} SUMMARY for call #t~mem3 := read~int(~str.base, ~str.offset + ~i~0, 1); srcloc: L53 {1006#true} is VALID [2020-07-08 23:37:34,874 INFO L280 TraceCheckUtils]: 20: Hoare triple {1006#true} #t~switch4 := 0 == #t~mem3; {1006#true} is VALID [2020-07-08 23:37:34,874 INFO L280 TraceCheckUtils]: 21: Hoare triple {1006#true} assume #t~switch4; {1006#true} is VALID [2020-07-08 23:37:34,875 INFO L280 TraceCheckUtils]: 22: Hoare triple {1006#true} SUMMARY for call #t~mem5 := read~int(~str.base, ~str.offset + ~start~0, 1); srcloc: L55-17 {1006#true} is VALID [2020-07-08 23:37:34,875 INFO L280 TraceCheckUtils]: 23: Hoare triple {1006#true} #t~short7 := 32 == #t~mem5; {1006#true} is VALID [2020-07-08 23:37:34,876 INFO L280 TraceCheckUtils]: 24: Hoare triple {1006#true} assume #t~short7; {1013#|parse_expression_list_#t~short7|} is VALID [2020-07-08 23:37:34,876 INFO L280 TraceCheckUtils]: 25: Hoare triple {1013#|parse_expression_list_#t~short7|} assume !#t~short7; {1007#false} is VALID [2020-07-08 23:37:34,877 INFO L280 TraceCheckUtils]: 26: Hoare triple {1007#false} havoc #t~mem5; {1007#false} is VALID [2020-07-08 23:37:34,877 INFO L280 TraceCheckUtils]: 27: Hoare triple {1007#false} havoc #t~mem6; {1007#false} is VALID [2020-07-08 23:37:34,877 INFO L280 TraceCheckUtils]: 28: Hoare triple {1007#false} havoc #t~short7; {1007#false} is VALID [2020-07-08 23:37:34,877 INFO L280 TraceCheckUtils]: 29: Hoare triple {1007#false} SUMMARY for call #t~mem9 := read~int(~str.base, ~str.offset + ~start~0, 1); srcloc: L55-18 {1007#false} is VALID [2020-07-08 23:37:34,878 INFO L280 TraceCheckUtils]: 30: Hoare triple {1007#false} assume !(34 == #t~mem9); {1007#false} is VALID [2020-07-08 23:37:34,878 INFO L280 TraceCheckUtils]: 31: Hoare triple {1007#false} havoc #t~mem9; {1007#false} is VALID [2020-07-08 23:37:34,878 INFO L280 TraceCheckUtils]: 32: Hoare triple {1007#false} ~j~0 := ~i~0 - 1; {1007#false} is VALID [2020-07-08 23:37:34,879 INFO L280 TraceCheckUtils]: 33: Hoare triple {1007#false} #t~short14 := 0 < ~j~0; {1007#false} is VALID [2020-07-08 23:37:34,879 INFO L280 TraceCheckUtils]: 34: Hoare triple {1007#false} assume !#t~short14; {1007#false} is VALID [2020-07-08 23:37:34,879 INFO L280 TraceCheckUtils]: 35: Hoare triple {1007#false} assume !#t~short14; {1007#false} is VALID [2020-07-08 23:37:34,879 INFO L280 TraceCheckUtils]: 36: Hoare triple {1007#false} havoc #t~mem11; {1007#false} is VALID [2020-07-08 23:37:34,880 INFO L280 TraceCheckUtils]: 37: Hoare triple {1007#false} havoc #t~short13; {1007#false} is VALID [2020-07-08 23:37:34,880 INFO L280 TraceCheckUtils]: 38: Hoare triple {1007#false} havoc #t~short14; {1007#false} is VALID [2020-07-08 23:37:34,880 INFO L280 TraceCheckUtils]: 39: Hoare triple {1007#false} havoc #t~mem12; {1007#false} is VALID [2020-07-08 23:37:34,881 INFO L280 TraceCheckUtils]: 40: Hoare triple {1007#false} #t~short17 := 0 < ~j~0; {1007#false} is VALID [2020-07-08 23:37:34,881 INFO L280 TraceCheckUtils]: 41: Hoare triple {1007#false} assume !#t~short17; {1007#false} is VALID [2020-07-08 23:37:34,881 INFO L280 TraceCheckUtils]: 42: Hoare triple {1007#false} assume !#t~short17; {1007#false} is VALID [2020-07-08 23:37:34,881 INFO L280 TraceCheckUtils]: 43: Hoare triple {1007#false} havoc #t~short17; {1007#false} is VALID [2020-07-08 23:37:34,882 INFO L280 TraceCheckUtils]: 44: Hoare triple {1007#false} havoc #t~mem16; {1007#false} is VALID [2020-07-08 23:37:34,882 INFO L280 TraceCheckUtils]: 45: Hoare triple {1007#false} assume ~start~0 <= ~j~0; {1007#false} is VALID [2020-07-08 23:37:34,882 INFO L263 TraceCheckUtils]: 46: Hoare triple {1007#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)); {1006#true} is VALID [2020-07-08 23:37:34,883 INFO L280 TraceCheckUtils]: 47: Hoare triple {1006#true} ~dest.base, ~dest.offset := #in~dest.base, #in~dest.offset; {1006#true} is VALID [2020-07-08 23:37:34,883 INFO L280 TraceCheckUtils]: 48: Hoare triple {1006#true} ~src.base, ~src.offset := #in~src.base, #in~src.offset; {1006#true} is VALID [2020-07-08 23:37:34,883 INFO L280 TraceCheckUtils]: 49: Hoare triple {1006#true} ~n := #in~n; {1006#true} is VALID [2020-07-08 23:37:34,883 INFO L280 TraceCheckUtils]: 50: Hoare triple {1006#true} SUMMARY for call #t~ret0.base, #t~ret0.offset := strncpy(~dest.base, ~dest.offset, ~src.base, ~src.offset, ~n); srcloc: L30-2 {1006#true} is VALID [2020-07-08 23:37:34,884 INFO L280 TraceCheckUtils]: 51: Hoare triple {1006#true} #res.base, #res.offset := #t~ret0.base, #t~ret0.offset; {1006#true} is VALID [2020-07-08 23:37:34,884 INFO L280 TraceCheckUtils]: 52: Hoare triple {1006#true} havoc #t~ret0.base, #t~ret0.offset; {1006#true} is VALID [2020-07-08 23:37:34,884 INFO L280 TraceCheckUtils]: 53: Hoare triple {1006#true} assume true; {1006#true} is VALID [2020-07-08 23:37:34,885 INFO L275 TraceCheckUtils]: 54: Hoare quadruple {1006#true} {1007#false} #201#return; {1007#false} is VALID [2020-07-08 23:37:34,885 INFO L280 TraceCheckUtils]: 55: Hoare triple {1007#false} havoc #t~ret19.base, #t~ret19.offset; {1007#false} is VALID [2020-07-08 23:37:34,885 INFO L263 TraceCheckUtils]: 56: Hoare triple {1007#false} call __VERIFIER_assert((if 1 + (~j~0 - ~start~0) < 2 then 1 else 0)); {1007#false} is VALID [2020-07-08 23:37:34,885 INFO L280 TraceCheckUtils]: 57: Hoare triple {1007#false} ~cond := #in~cond; {1007#false} is VALID [2020-07-08 23:37:34,886 INFO L280 TraceCheckUtils]: 58: Hoare triple {1007#false} assume 0 == ~cond; {1007#false} is VALID [2020-07-08 23:37:34,886 INFO L280 TraceCheckUtils]: 59: Hoare triple {1007#false} assume !false; {1007#false} is VALID [2020-07-08 23:37:34,890 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-08 23:37:34,891 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1989510829] [2020-07-08 23:37:34,891 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 23:37:34,891 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-08 23:37:34,892 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113189946] [2020-07-08 23:37:34,894 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2020-07-08 23:37:34,894 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 23:37:34,894 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-08 23:37:34,951 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:37:34,951 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-08 23:37:34,951 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 23:37:34,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-08 23:37:34,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-08 23:37:34,952 INFO L87 Difference]: Start difference. First operand 102 states and 111 transitions. Second operand 4 states. [2020-07-08 23:37:35,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:37:35,487 INFO L93 Difference]: Finished difference Result 189 states and 208 transitions. [2020-07-08 23:37:35,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-08 23:37:35,487 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2020-07-08 23:37:35,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 23:37:35,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-08 23:37:35,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 208 transitions. [2020-07-08 23:37:35,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-08 23:37:35,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 208 transitions. [2020-07-08 23:37:35,498 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 208 transitions. [2020-07-08 23:37:35,709 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 208 edges. 208 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:37:35,719 INFO L225 Difference]: With dead ends: 189 [2020-07-08 23:37:35,719 INFO L226 Difference]: Without dead ends: 103 [2020-07-08 23:37:35,721 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-08 23:37:35,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2020-07-08 23:37:35,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2020-07-08 23:37:35,797 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 23:37:35,797 INFO L82 GeneralOperation]: Start isEquivalent. First operand 103 states. Second operand 103 states. [2020-07-08 23:37:35,797 INFO L74 IsIncluded]: Start isIncluded. First operand 103 states. Second operand 103 states. [2020-07-08 23:37:35,798 INFO L87 Difference]: Start difference. First operand 103 states. Second operand 103 states. [2020-07-08 23:37:35,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:37:35,803 INFO L93 Difference]: Finished difference Result 103 states and 112 transitions. [2020-07-08 23:37:35,803 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 112 transitions. [2020-07-08 23:37:35,807 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:37:35,808 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:37:35,808 INFO L74 IsIncluded]: Start isIncluded. First operand 103 states. Second operand 103 states. [2020-07-08 23:37:35,808 INFO L87 Difference]: Start difference. First operand 103 states. Second operand 103 states. [2020-07-08 23:37:35,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:37:35,819 INFO L93 Difference]: Finished difference Result 103 states and 112 transitions. [2020-07-08 23:37:35,819 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 112 transitions. [2020-07-08 23:37:35,819 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:37:35,820 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:37:35,820 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 23:37:35,820 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 23:37:35,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2020-07-08 23:37:35,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 112 transitions. [2020-07-08 23:37:35,827 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 112 transitions. Word has length 60 [2020-07-08 23:37:35,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 23:37:35,829 INFO L479 AbstractCegarLoop]: Abstraction has 103 states and 112 transitions. [2020-07-08 23:37:35,829 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-08 23:37:35,830 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 103 states and 112 transitions. [2020-07-08 23:37:35,938 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-08 23:37:35,939 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 112 transitions. [2020-07-08 23:37:35,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2020-07-08 23:37:35,941 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 23:37:35,941 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, 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-08 23:37:35,942 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-08 23:37:35,942 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 23:37:35,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 23:37:35,942 INFO L82 PathProgramCache]: Analyzing trace with hash 1578191403, now seen corresponding path program 1 times [2020-07-08 23:37:35,942 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 23:37:35,943 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1856328709] [2020-07-08 23:37:35,943 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 23:37:35,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:37:36,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:37:36,176 INFO L280 TraceCheckUtils]: 0: Hoare triple {1835#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {1815#true} is VALID [2020-07-08 23:37:36,176 INFO L280 TraceCheckUtils]: 1: Hoare triple {1815#true} #valid := #valid[0 := 0]; {1815#true} is VALID [2020-07-08 23:37:36,177 INFO L280 TraceCheckUtils]: 2: Hoare triple {1815#true} assume 0 < #StackHeapBarrier; {1815#true} is VALID [2020-07-08 23:37:36,177 INFO L280 TraceCheckUtils]: 3: Hoare triple {1815#true} assume true; {1815#true} is VALID [2020-07-08 23:37:36,177 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {1815#true} {1815#true} #205#return; {1815#true} is VALID [2020-07-08 23:37:36,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:37:36,183 INFO L280 TraceCheckUtils]: 0: Hoare triple {1815#true} ~dest.base, ~dest.offset := #in~dest.base, #in~dest.offset; {1815#true} is VALID [2020-07-08 23:37:36,184 INFO L280 TraceCheckUtils]: 1: Hoare triple {1815#true} ~src.base, ~src.offset := #in~src.base, #in~src.offset; {1815#true} is VALID [2020-07-08 23:37:36,184 INFO L280 TraceCheckUtils]: 2: Hoare triple {1815#true} ~n := #in~n; {1815#true} is VALID [2020-07-08 23:37:36,184 INFO L280 TraceCheckUtils]: 3: Hoare triple {1815#true} SUMMARY for call #t~ret0.base, #t~ret0.offset := strncpy(~dest.base, ~dest.offset, ~src.base, ~src.offset, ~n); srcloc: L30-2 {1815#true} is VALID [2020-07-08 23:37:36,184 INFO L280 TraceCheckUtils]: 4: Hoare triple {1815#true} #res.base, #res.offset := #t~ret0.base, #t~ret0.offset; {1815#true} is VALID [2020-07-08 23:37:36,185 INFO L280 TraceCheckUtils]: 5: Hoare triple {1815#true} havoc #t~ret0.base, #t~ret0.offset; {1815#true} is VALID [2020-07-08 23:37:36,185 INFO L280 TraceCheckUtils]: 6: Hoare triple {1815#true} assume true; {1815#true} is VALID [2020-07-08 23:37:36,185 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {1815#true} {1816#false} #201#return; {1816#false} is VALID [2020-07-08 23:37:36,186 INFO L263 TraceCheckUtils]: 0: Hoare triple {1815#true} call ULTIMATE.init(); {1835#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 23:37:36,187 INFO L280 TraceCheckUtils]: 1: Hoare triple {1835#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {1815#true} is VALID [2020-07-08 23:37:36,187 INFO L280 TraceCheckUtils]: 2: Hoare triple {1815#true} #valid := #valid[0 := 0]; {1815#true} is VALID [2020-07-08 23:37:36,187 INFO L280 TraceCheckUtils]: 3: Hoare triple {1815#true} assume 0 < #StackHeapBarrier; {1815#true} is VALID [2020-07-08 23:37:36,188 INFO L280 TraceCheckUtils]: 4: Hoare triple {1815#true} assume true; {1815#true} is VALID [2020-07-08 23:37:36,188 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {1815#true} {1815#true} #205#return; {1815#true} is VALID [2020-07-08 23:37:36,188 INFO L263 TraceCheckUtils]: 6: Hoare triple {1815#true} call #t~ret21 := main(); {1815#true} is VALID [2020-07-08 23:37:36,188 INFO L280 TraceCheckUtils]: 7: Hoare triple {1815#true} SUMMARY for call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(9); srcloc: mainENTRY {1815#true} is VALID [2020-07-08 23:37:36,189 INFO L280 TraceCheckUtils]: 8: Hoare triple {1815#true} SUMMARY for call write~int(0, ~#A~0.base, 8 + ~#A~0.offset, 1); srcloc: L74 {1815#true} is VALID [2020-07-08 23:37:36,189 INFO L263 TraceCheckUtils]: 9: Hoare triple {1815#true} call #t~ret20 := parse_expression_list(~#A~0.base, ~#A~0.offset); {1815#true} is VALID [2020-07-08 23:37:36,189 INFO L280 TraceCheckUtils]: 10: Hoare triple {1815#true} ~str.base, ~str.offset := #in~str.base, #in~str.offset; {1815#true} is VALID [2020-07-08 23:37:36,190 INFO L280 TraceCheckUtils]: 11: Hoare triple {1815#true} ~start~0 := 0; {1822#(= 0 parse_expression_list_~start~0)} is VALID [2020-07-08 23:37:36,191 INFO L280 TraceCheckUtils]: 12: Hoare triple {1822#(= 0 parse_expression_list_~start~0)} ~i~0 := -1; {1823#(and (= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~i~0 1) 0))} is VALID [2020-07-08 23:37:36,191 INFO L280 TraceCheckUtils]: 13: Hoare triple {1823#(and (= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~i~0 1) 0))} ~j~0 := -1; {1823#(and (= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~i~0 1) 0))} is VALID [2020-07-08 23:37:36,192 INFO L280 TraceCheckUtils]: 14: Hoare triple {1823#(and (= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~i~0 1) 0))} SUMMARY for call ~#str2~0.base, ~#str2~0.offset := #Ultimate.allocOnStack(2); srcloc: L49 {1823#(and (= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~i~0 1) 0))} is VALID [2020-07-08 23:37:36,193 INFO L280 TraceCheckUtils]: 15: Hoare triple {1823#(and (= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~i~0 1) 0))} assume !(~str.base == 0 && ~str.offset == 0); {1823#(and (= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~i~0 1) 0))} is VALID [2020-07-08 23:37:36,194 INFO L280 TraceCheckUtils]: 16: Hoare triple {1823#(and (= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~i~0 1) 0))} #t~post2 := ~i~0; {1824#(and (<= (+ |parse_expression_list_#t~post2| 1) 0) (= 0 parse_expression_list_~start~0))} is VALID [2020-07-08 23:37:36,195 INFO L280 TraceCheckUtils]: 17: Hoare triple {1824#(and (<= (+ |parse_expression_list_#t~post2| 1) 0) (= 0 parse_expression_list_~start~0))} ~i~0 := 1 + #t~post2; {1825#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} is VALID [2020-07-08 23:37:36,196 INFO L280 TraceCheckUtils]: 18: Hoare triple {1825#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} havoc #t~post2; {1825#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} is VALID [2020-07-08 23:37:36,197 INFO L280 TraceCheckUtils]: 19: Hoare triple {1825#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} SUMMARY for call #t~mem3 := read~int(~str.base, ~str.offset + ~i~0, 1); srcloc: L53 {1825#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} is VALID [2020-07-08 23:37:36,197 INFO L280 TraceCheckUtils]: 20: Hoare triple {1825#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} #t~switch4 := 0 == #t~mem3; {1825#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} is VALID [2020-07-08 23:37:36,198 INFO L280 TraceCheckUtils]: 21: Hoare triple {1825#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} assume #t~switch4; {1825#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} is VALID [2020-07-08 23:37:36,199 INFO L280 TraceCheckUtils]: 22: Hoare triple {1825#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} SUMMARY for call #t~mem5 := read~int(~str.base, ~str.offset + ~start~0, 1); srcloc: L55-17 {1825#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} is VALID [2020-07-08 23:37:36,200 INFO L280 TraceCheckUtils]: 23: Hoare triple {1825#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} #t~short7 := 32 == #t~mem5; {1825#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} is VALID [2020-07-08 23:37:36,200 INFO L280 TraceCheckUtils]: 24: Hoare triple {1825#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} assume !#t~short7; {1825#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} is VALID [2020-07-08 23:37:36,201 INFO L280 TraceCheckUtils]: 25: Hoare triple {1825#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} SUMMARY for call #t~mem6 := read~int(~str.base, ~str.offset + ~start~0, 1); srcloc: L55-4 {1825#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} is VALID [2020-07-08 23:37:36,202 INFO L280 TraceCheckUtils]: 26: Hoare triple {1825#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} #t~short7 := 9 == #t~mem6; {1825#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} is VALID [2020-07-08 23:37:36,203 INFO L280 TraceCheckUtils]: 27: Hoare triple {1825#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} assume !#t~short7; {1825#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} is VALID [2020-07-08 23:37:36,204 INFO L280 TraceCheckUtils]: 28: Hoare triple {1825#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} havoc #t~mem5; {1825#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} is VALID [2020-07-08 23:37:36,205 INFO L280 TraceCheckUtils]: 29: Hoare triple {1825#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} havoc #t~mem6; {1825#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} is VALID [2020-07-08 23:37:36,205 INFO L280 TraceCheckUtils]: 30: Hoare triple {1825#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} havoc #t~short7; {1825#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} is VALID [2020-07-08 23:37:36,206 INFO L280 TraceCheckUtils]: 31: Hoare triple {1825#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} SUMMARY for call #t~mem9 := read~int(~str.base, ~str.offset + ~start~0, 1); srcloc: L55-18 {1825#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} is VALID [2020-07-08 23:37:36,207 INFO L280 TraceCheckUtils]: 32: Hoare triple {1825#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} assume !(34 == #t~mem9); {1825#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} is VALID [2020-07-08 23:37:36,208 INFO L280 TraceCheckUtils]: 33: Hoare triple {1825#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} havoc #t~mem9; {1825#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} is VALID [2020-07-08 23:37:36,209 INFO L280 TraceCheckUtils]: 34: Hoare triple {1825#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} ~j~0 := ~i~0 - 1; {1826#(and (= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~j~0 1) 0))} is VALID [2020-07-08 23:37:36,210 INFO L280 TraceCheckUtils]: 35: Hoare triple {1826#(and (= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~j~0 1) 0))} #t~short14 := 0 < ~j~0; {1826#(and (= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~j~0 1) 0))} is VALID [2020-07-08 23:37:36,210 INFO L280 TraceCheckUtils]: 36: Hoare triple {1826#(and (= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~j~0 1) 0))} assume !#t~short14; {1826#(and (= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~j~0 1) 0))} is VALID [2020-07-08 23:37:36,211 INFO L280 TraceCheckUtils]: 37: Hoare triple {1826#(and (= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~j~0 1) 0))} assume !#t~short14; {1826#(and (= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~j~0 1) 0))} is VALID [2020-07-08 23:37:36,212 INFO L280 TraceCheckUtils]: 38: Hoare triple {1826#(and (= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~j~0 1) 0))} havoc #t~mem11; {1826#(and (= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~j~0 1) 0))} is VALID [2020-07-08 23:37:36,213 INFO L280 TraceCheckUtils]: 39: Hoare triple {1826#(and (= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~j~0 1) 0))} havoc #t~short13; {1826#(and (= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~j~0 1) 0))} is VALID [2020-07-08 23:37:36,214 INFO L280 TraceCheckUtils]: 40: Hoare triple {1826#(and (= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~j~0 1) 0))} havoc #t~short14; {1826#(and (= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~j~0 1) 0))} is VALID [2020-07-08 23:37:36,215 INFO L280 TraceCheckUtils]: 41: Hoare triple {1826#(and (= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~j~0 1) 0))} havoc #t~mem12; {1826#(and (= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~j~0 1) 0))} is VALID [2020-07-08 23:37:36,215 INFO L280 TraceCheckUtils]: 42: Hoare triple {1826#(and (= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~j~0 1) 0))} #t~short17 := 0 < ~j~0; {1826#(and (= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~j~0 1) 0))} is VALID [2020-07-08 23:37:36,216 INFO L280 TraceCheckUtils]: 43: Hoare triple {1826#(and (= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~j~0 1) 0))} assume !#t~short17; {1826#(and (= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~j~0 1) 0))} is VALID [2020-07-08 23:37:36,217 INFO L280 TraceCheckUtils]: 44: Hoare triple {1826#(and (= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~j~0 1) 0))} assume !#t~short17; {1826#(and (= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~j~0 1) 0))} is VALID [2020-07-08 23:37:36,218 INFO L280 TraceCheckUtils]: 45: Hoare triple {1826#(and (= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~j~0 1) 0))} havoc #t~short17; {1826#(and (= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~j~0 1) 0))} is VALID [2020-07-08 23:37:36,218 INFO L280 TraceCheckUtils]: 46: Hoare triple {1826#(and (= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~j~0 1) 0))} havoc #t~mem16; {1826#(and (= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~j~0 1) 0))} is VALID [2020-07-08 23:37:36,219 INFO L280 TraceCheckUtils]: 47: Hoare triple {1826#(and (= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~j~0 1) 0))} assume ~start~0 <= ~j~0; {1816#false} is VALID [2020-07-08 23:37:36,220 INFO L263 TraceCheckUtils]: 48: Hoare triple {1816#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)); {1815#true} is VALID [2020-07-08 23:37:36,220 INFO L280 TraceCheckUtils]: 49: Hoare triple {1815#true} ~dest.base, ~dest.offset := #in~dest.base, #in~dest.offset; {1815#true} is VALID [2020-07-08 23:37:36,220 INFO L280 TraceCheckUtils]: 50: Hoare triple {1815#true} ~src.base, ~src.offset := #in~src.base, #in~src.offset; {1815#true} is VALID [2020-07-08 23:37:36,220 INFO L280 TraceCheckUtils]: 51: Hoare triple {1815#true} ~n := #in~n; {1815#true} is VALID [2020-07-08 23:37:36,221 INFO L280 TraceCheckUtils]: 52: Hoare triple {1815#true} SUMMARY for call #t~ret0.base, #t~ret0.offset := strncpy(~dest.base, ~dest.offset, ~src.base, ~src.offset, ~n); srcloc: L30-2 {1815#true} is VALID [2020-07-08 23:37:36,221 INFO L280 TraceCheckUtils]: 53: Hoare triple {1815#true} #res.base, #res.offset := #t~ret0.base, #t~ret0.offset; {1815#true} is VALID [2020-07-08 23:37:36,221 INFO L280 TraceCheckUtils]: 54: Hoare triple {1815#true} havoc #t~ret0.base, #t~ret0.offset; {1815#true} is VALID [2020-07-08 23:37:36,221 INFO L280 TraceCheckUtils]: 55: Hoare triple {1815#true} assume true; {1815#true} is VALID [2020-07-08 23:37:36,222 INFO L275 TraceCheckUtils]: 56: Hoare quadruple {1815#true} {1816#false} #201#return; {1816#false} is VALID [2020-07-08 23:37:36,222 INFO L280 TraceCheckUtils]: 57: Hoare triple {1816#false} havoc #t~ret19.base, #t~ret19.offset; {1816#false} is VALID [2020-07-08 23:37:36,222 INFO L263 TraceCheckUtils]: 58: Hoare triple {1816#false} call __VERIFIER_assert((if 1 + (~j~0 - ~start~0) < 2 then 1 else 0)); {1816#false} is VALID [2020-07-08 23:37:36,222 INFO L280 TraceCheckUtils]: 59: Hoare triple {1816#false} ~cond := #in~cond; {1816#false} is VALID [2020-07-08 23:37:36,223 INFO L280 TraceCheckUtils]: 60: Hoare triple {1816#false} assume 0 == ~cond; {1816#false} is VALID [2020-07-08 23:37:36,223 INFO L280 TraceCheckUtils]: 61: Hoare triple {1816#false} assume !false; {1816#false} is VALID [2020-07-08 23:37:36,233 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-08 23:37:36,234 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1856328709] [2020-07-08 23:37:36,234 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 23:37:36,234 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-07-08 23:37:36,235 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015873353] [2020-07-08 23:37:36,235 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 62 [2020-07-08 23:37:36,235 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 23:37:36,236 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-08 23:37:36,298 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:37:36,298 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-08 23:37:36,299 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 23:37:36,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-08 23:37:36,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2020-07-08 23:37:36,299 INFO L87 Difference]: Start difference. First operand 103 states and 112 transitions. Second operand 8 states. [2020-07-08 23:37:37,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:37:37,982 INFO L93 Difference]: Finished difference Result 365 states and 410 transitions. [2020-07-08 23:37:37,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-07-08 23:37:37,982 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 62 [2020-07-08 23:37:37,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 23:37:37,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-08 23:37:37,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 406 transitions. [2020-07-08 23:37:37,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-08 23:37:38,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 406 transitions. [2020-07-08 23:37:38,005 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 406 transitions. [2020-07-08 23:37:38,395 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 406 edges. 406 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:37:38,403 INFO L225 Difference]: With dead ends: 365 [2020-07-08 23:37:38,403 INFO L226 Difference]: Without dead ends: 275 [2020-07-08 23:37:38,404 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2020-07-08 23:37:38,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2020-07-08 23:37:38,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 140. [2020-07-08 23:37:38,554 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 23:37:38,554 INFO L82 GeneralOperation]: Start isEquivalent. First operand 275 states. Second operand 140 states. [2020-07-08 23:37:38,554 INFO L74 IsIncluded]: Start isIncluded. First operand 275 states. Second operand 140 states. [2020-07-08 23:37:38,555 INFO L87 Difference]: Start difference. First operand 275 states. Second operand 140 states. [2020-07-08 23:37:38,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:37:38,568 INFO L93 Difference]: Finished difference Result 275 states and 310 transitions. [2020-07-08 23:37:38,568 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 310 transitions. [2020-07-08 23:37:38,569 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:37:38,569 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:37:38,569 INFO L74 IsIncluded]: Start isIncluded. First operand 140 states. Second operand 275 states. [2020-07-08 23:37:38,569 INFO L87 Difference]: Start difference. First operand 140 states. Second operand 275 states. [2020-07-08 23:37:38,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:37:38,580 INFO L93 Difference]: Finished difference Result 275 states and 310 transitions. [2020-07-08 23:37:38,581 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 310 transitions. [2020-07-08 23:37:38,581 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:37:38,582 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:37:38,582 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 23:37:38,582 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 23:37:38,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2020-07-08 23:37:38,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 157 transitions. [2020-07-08 23:37:38,587 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 157 transitions. Word has length 62 [2020-07-08 23:37:38,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 23:37:38,587 INFO L479 AbstractCegarLoop]: Abstraction has 140 states and 157 transitions. [2020-07-08 23:37:38,587 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-08 23:37:38,587 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 140 states and 157 transitions. [2020-07-08 23:37:38,783 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 157 edges. 157 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:37:38,784 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 157 transitions. [2020-07-08 23:37:38,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2020-07-08 23:37:38,785 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 23:37:38,786 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, 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-08 23:37:38,786 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-08 23:37:38,786 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 23:37:38,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 23:37:38,787 INFO L82 PathProgramCache]: Analyzing trace with hash 1116699365, now seen corresponding path program 1 times [2020-07-08 23:37:38,787 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 23:37:38,787 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [405171157] [2020-07-08 23:37:38,787 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 23:37:38,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:37:39,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:37:39,020 INFO L280 TraceCheckUtils]: 0: Hoare triple {3434#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {3412#true} is VALID [2020-07-08 23:37:39,020 INFO L280 TraceCheckUtils]: 1: Hoare triple {3412#true} #valid := #valid[0 := 0]; {3412#true} is VALID [2020-07-08 23:37:39,020 INFO L280 TraceCheckUtils]: 2: Hoare triple {3412#true} assume 0 < #StackHeapBarrier; {3412#true} is VALID [2020-07-08 23:37:39,021 INFO L280 TraceCheckUtils]: 3: Hoare triple {3412#true} assume true; {3412#true} is VALID [2020-07-08 23:37:39,021 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {3412#true} {3412#true} #205#return; {3412#true} is VALID [2020-07-08 23:37:39,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:37:39,026 INFO L280 TraceCheckUtils]: 0: Hoare triple {3412#true} ~dest.base, ~dest.offset := #in~dest.base, #in~dest.offset; {3412#true} is VALID [2020-07-08 23:37:39,026 INFO L280 TraceCheckUtils]: 1: Hoare triple {3412#true} ~src.base, ~src.offset := #in~src.base, #in~src.offset; {3412#true} is VALID [2020-07-08 23:37:39,026 INFO L280 TraceCheckUtils]: 2: Hoare triple {3412#true} ~n := #in~n; {3412#true} is VALID [2020-07-08 23:37:39,026 INFO L280 TraceCheckUtils]: 3: Hoare triple {3412#true} SUMMARY for call #t~ret0.base, #t~ret0.offset := strncpy(~dest.base, ~dest.offset, ~src.base, ~src.offset, ~n); srcloc: L30-2 {3412#true} is VALID [2020-07-08 23:37:39,026 INFO L280 TraceCheckUtils]: 4: Hoare triple {3412#true} #res.base, #res.offset := #t~ret0.base, #t~ret0.offset; {3412#true} is VALID [2020-07-08 23:37:39,027 INFO L280 TraceCheckUtils]: 5: Hoare triple {3412#true} havoc #t~ret0.base, #t~ret0.offset; {3412#true} is VALID [2020-07-08 23:37:39,027 INFO L280 TraceCheckUtils]: 6: Hoare triple {3412#true} assume true; {3412#true} is VALID [2020-07-08 23:37:39,027 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {3412#true} {3413#false} #201#return; {3413#false} is VALID [2020-07-08 23:37:39,028 INFO L263 TraceCheckUtils]: 0: Hoare triple {3412#true} call ULTIMATE.init(); {3434#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 23:37:39,028 INFO L280 TraceCheckUtils]: 1: Hoare triple {3434#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {3412#true} is VALID [2020-07-08 23:37:39,028 INFO L280 TraceCheckUtils]: 2: Hoare triple {3412#true} #valid := #valid[0 := 0]; {3412#true} is VALID [2020-07-08 23:37:39,028 INFO L280 TraceCheckUtils]: 3: Hoare triple {3412#true} assume 0 < #StackHeapBarrier; {3412#true} is VALID [2020-07-08 23:37:39,028 INFO L280 TraceCheckUtils]: 4: Hoare triple {3412#true} assume true; {3412#true} is VALID [2020-07-08 23:37:39,029 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {3412#true} {3412#true} #205#return; {3412#true} is VALID [2020-07-08 23:37:39,029 INFO L263 TraceCheckUtils]: 6: Hoare triple {3412#true} call #t~ret21 := main(); {3412#true} is VALID [2020-07-08 23:37:39,029 INFO L280 TraceCheckUtils]: 7: Hoare triple {3412#true} SUMMARY for call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(9); srcloc: mainENTRY {3412#true} is VALID [2020-07-08 23:37:39,029 INFO L280 TraceCheckUtils]: 8: Hoare triple {3412#true} SUMMARY for call write~int(0, ~#A~0.base, 8 + ~#A~0.offset, 1); srcloc: L74 {3412#true} is VALID [2020-07-08 23:37:39,029 INFO L263 TraceCheckUtils]: 9: Hoare triple {3412#true} call #t~ret20 := parse_expression_list(~#A~0.base, ~#A~0.offset); {3412#true} is VALID [2020-07-08 23:37:39,030 INFO L280 TraceCheckUtils]: 10: Hoare triple {3412#true} ~str.base, ~str.offset := #in~str.base, #in~str.offset; {3412#true} is VALID [2020-07-08 23:37:39,030 INFO L280 TraceCheckUtils]: 11: Hoare triple {3412#true} ~start~0 := 0; {3419#(= 0 parse_expression_list_~start~0)} is VALID [2020-07-08 23:37:39,036 INFO L280 TraceCheckUtils]: 12: Hoare triple {3419#(= 0 parse_expression_list_~start~0)} ~i~0 := -1; {3420#(and (= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~i~0 1) 0))} is VALID [2020-07-08 23:37:39,037 INFO L280 TraceCheckUtils]: 13: Hoare triple {3420#(and (= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~i~0 1) 0))} ~j~0 := -1; {3420#(and (= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~i~0 1) 0))} is VALID [2020-07-08 23:37:39,038 INFO L280 TraceCheckUtils]: 14: Hoare triple {3420#(and (= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~i~0 1) 0))} SUMMARY for call ~#str2~0.base, ~#str2~0.offset := #Ultimate.allocOnStack(2); srcloc: L49 {3420#(and (= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~i~0 1) 0))} is VALID [2020-07-08 23:37:39,039 INFO L280 TraceCheckUtils]: 15: Hoare triple {3420#(and (= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~i~0 1) 0))} assume !(~str.base == 0 && ~str.offset == 0); {3420#(and (= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~i~0 1) 0))} is VALID [2020-07-08 23:37:39,040 INFO L280 TraceCheckUtils]: 16: Hoare triple {3420#(and (= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~i~0 1) 0))} #t~post2 := ~i~0; {3421#(and (<= (+ |parse_expression_list_#t~post2| 1) 0) (= 0 parse_expression_list_~start~0))} is VALID [2020-07-08 23:37:39,040 INFO L280 TraceCheckUtils]: 17: Hoare triple {3421#(and (<= (+ |parse_expression_list_#t~post2| 1) 0) (= 0 parse_expression_list_~start~0))} ~i~0 := 1 + #t~post2; {3422#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} is VALID [2020-07-08 23:37:39,041 INFO L280 TraceCheckUtils]: 18: Hoare triple {3422#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} havoc #t~post2; {3422#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} is VALID [2020-07-08 23:37:39,042 INFO L280 TraceCheckUtils]: 19: Hoare triple {3422#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} SUMMARY for call #t~mem3 := read~int(~str.base, ~str.offset + ~i~0, 1); srcloc: L53 {3422#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} is VALID [2020-07-08 23:37:39,042 INFO L280 TraceCheckUtils]: 20: Hoare triple {3422#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} #t~switch4 := 0 == #t~mem3; {3422#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} is VALID [2020-07-08 23:37:39,043 INFO L280 TraceCheckUtils]: 21: Hoare triple {3422#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} assume #t~switch4; {3422#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} is VALID [2020-07-08 23:37:39,044 INFO L280 TraceCheckUtils]: 22: Hoare triple {3422#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} SUMMARY for call #t~mem5 := read~int(~str.base, ~str.offset + ~start~0, 1); srcloc: L55-17 {3422#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} is VALID [2020-07-08 23:37:39,044 INFO L280 TraceCheckUtils]: 23: Hoare triple {3422#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} #t~short7 := 32 == #t~mem5; {3422#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} is VALID [2020-07-08 23:37:39,048 INFO L280 TraceCheckUtils]: 24: Hoare triple {3422#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} assume !#t~short7; {3422#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} is VALID [2020-07-08 23:37:39,050 INFO L280 TraceCheckUtils]: 25: Hoare triple {3422#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} SUMMARY for call #t~mem6 := read~int(~str.base, ~str.offset + ~start~0, 1); srcloc: L55-4 {3422#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} is VALID [2020-07-08 23:37:39,050 INFO L280 TraceCheckUtils]: 26: Hoare triple {3422#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} #t~short7 := 9 == #t~mem6; {3422#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} is VALID [2020-07-08 23:37:39,051 INFO L280 TraceCheckUtils]: 27: Hoare triple {3422#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} assume !#t~short7; {3422#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} is VALID [2020-07-08 23:37:39,053 INFO L280 TraceCheckUtils]: 28: Hoare triple {3422#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} havoc #t~mem5; {3422#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} is VALID [2020-07-08 23:37:39,058 INFO L280 TraceCheckUtils]: 29: Hoare triple {3422#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} havoc #t~mem6; {3422#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} is VALID [2020-07-08 23:37:39,062 INFO L280 TraceCheckUtils]: 30: Hoare triple {3422#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} havoc #t~short7; {3422#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} is VALID [2020-07-08 23:37:39,066 INFO L280 TraceCheckUtils]: 31: Hoare triple {3422#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} SUMMARY for call #t~mem9 := read~int(~str.base, ~str.offset + ~start~0, 1); srcloc: L55-18 {3422#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} is VALID [2020-07-08 23:37:39,069 INFO L280 TraceCheckUtils]: 32: Hoare triple {3422#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} assume 34 == #t~mem9; {3422#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} is VALID [2020-07-08 23:37:39,073 INFO L280 TraceCheckUtils]: 33: Hoare triple {3422#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} havoc #t~mem9; {3422#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} is VALID [2020-07-08 23:37:39,079 INFO L280 TraceCheckUtils]: 34: Hoare triple {3422#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} #t~post10 := ~start~0; {3423#(and (= 0 |parse_expression_list_#t~post10|) (<= parse_expression_list_~i~0 0))} is VALID [2020-07-08 23:37:39,080 INFO L280 TraceCheckUtils]: 35: Hoare triple {3423#(and (= 0 |parse_expression_list_#t~post10|) (<= parse_expression_list_~i~0 0))} ~start~0 := 1 + #t~post10; {3424#(<= (+ parse_expression_list_~i~0 1) parse_expression_list_~start~0)} is VALID [2020-07-08 23:37:39,080 INFO L280 TraceCheckUtils]: 36: Hoare triple {3424#(<= (+ parse_expression_list_~i~0 1) parse_expression_list_~start~0)} havoc #t~post10; {3424#(<= (+ parse_expression_list_~i~0 1) parse_expression_list_~start~0)} is VALID [2020-07-08 23:37:39,081 INFO L280 TraceCheckUtils]: 37: Hoare triple {3424#(<= (+ parse_expression_list_~i~0 1) parse_expression_list_~start~0)} ~j~0 := ~i~0 - 1; {3425#(<= (+ parse_expression_list_~j~0 2) parse_expression_list_~start~0)} is VALID [2020-07-08 23:37:39,083 INFO L280 TraceCheckUtils]: 38: Hoare triple {3425#(<= (+ parse_expression_list_~j~0 2) parse_expression_list_~start~0)} #t~short14 := 0 < ~j~0; {3425#(<= (+ parse_expression_list_~j~0 2) parse_expression_list_~start~0)} is VALID [2020-07-08 23:37:39,085 INFO L280 TraceCheckUtils]: 39: Hoare triple {3425#(<= (+ parse_expression_list_~j~0 2) parse_expression_list_~start~0)} assume !#t~short14; {3425#(<= (+ parse_expression_list_~j~0 2) parse_expression_list_~start~0)} is VALID [2020-07-08 23:37:39,086 INFO L280 TraceCheckUtils]: 40: Hoare triple {3425#(<= (+ parse_expression_list_~j~0 2) parse_expression_list_~start~0)} assume !#t~short14; {3425#(<= (+ parse_expression_list_~j~0 2) parse_expression_list_~start~0)} is VALID [2020-07-08 23:37:39,087 INFO L280 TraceCheckUtils]: 41: Hoare triple {3425#(<= (+ parse_expression_list_~j~0 2) parse_expression_list_~start~0)} havoc #t~mem11; {3425#(<= (+ parse_expression_list_~j~0 2) parse_expression_list_~start~0)} is VALID [2020-07-08 23:37:39,087 INFO L280 TraceCheckUtils]: 42: Hoare triple {3425#(<= (+ parse_expression_list_~j~0 2) parse_expression_list_~start~0)} havoc #t~short13; {3425#(<= (+ parse_expression_list_~j~0 2) parse_expression_list_~start~0)} is VALID [2020-07-08 23:37:39,088 INFO L280 TraceCheckUtils]: 43: Hoare triple {3425#(<= (+ parse_expression_list_~j~0 2) parse_expression_list_~start~0)} havoc #t~short14; {3425#(<= (+ parse_expression_list_~j~0 2) parse_expression_list_~start~0)} is VALID [2020-07-08 23:37:39,088 INFO L280 TraceCheckUtils]: 44: Hoare triple {3425#(<= (+ parse_expression_list_~j~0 2) parse_expression_list_~start~0)} havoc #t~mem12; {3425#(<= (+ parse_expression_list_~j~0 2) parse_expression_list_~start~0)} is VALID [2020-07-08 23:37:39,089 INFO L280 TraceCheckUtils]: 45: Hoare triple {3425#(<= (+ parse_expression_list_~j~0 2) parse_expression_list_~start~0)} #t~short17 := 0 < ~j~0; {3425#(<= (+ parse_expression_list_~j~0 2) parse_expression_list_~start~0)} is VALID [2020-07-08 23:37:39,090 INFO L280 TraceCheckUtils]: 46: Hoare triple {3425#(<= (+ parse_expression_list_~j~0 2) parse_expression_list_~start~0)} assume !#t~short17; {3425#(<= (+ parse_expression_list_~j~0 2) parse_expression_list_~start~0)} is VALID [2020-07-08 23:37:39,090 INFO L280 TraceCheckUtils]: 47: Hoare triple {3425#(<= (+ parse_expression_list_~j~0 2) parse_expression_list_~start~0)} assume !#t~short17; {3425#(<= (+ parse_expression_list_~j~0 2) parse_expression_list_~start~0)} is VALID [2020-07-08 23:37:39,091 INFO L280 TraceCheckUtils]: 48: Hoare triple {3425#(<= (+ parse_expression_list_~j~0 2) parse_expression_list_~start~0)} havoc #t~short17; {3425#(<= (+ parse_expression_list_~j~0 2) parse_expression_list_~start~0)} is VALID [2020-07-08 23:37:39,091 INFO L280 TraceCheckUtils]: 49: Hoare triple {3425#(<= (+ parse_expression_list_~j~0 2) parse_expression_list_~start~0)} havoc #t~mem16; {3425#(<= (+ parse_expression_list_~j~0 2) parse_expression_list_~start~0)} is VALID [2020-07-08 23:37:39,092 INFO L280 TraceCheckUtils]: 50: Hoare triple {3425#(<= (+ parse_expression_list_~j~0 2) parse_expression_list_~start~0)} assume ~start~0 <= ~j~0; {3413#false} is VALID [2020-07-08 23:37:39,092 INFO L263 TraceCheckUtils]: 51: Hoare triple {3413#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)); {3412#true} is VALID [2020-07-08 23:37:39,093 INFO L280 TraceCheckUtils]: 52: Hoare triple {3412#true} ~dest.base, ~dest.offset := #in~dest.base, #in~dest.offset; {3412#true} is VALID [2020-07-08 23:37:39,093 INFO L280 TraceCheckUtils]: 53: Hoare triple {3412#true} ~src.base, ~src.offset := #in~src.base, #in~src.offset; {3412#true} is VALID [2020-07-08 23:37:39,093 INFO L280 TraceCheckUtils]: 54: Hoare triple {3412#true} ~n := #in~n; {3412#true} is VALID [2020-07-08 23:37:39,093 INFO L280 TraceCheckUtils]: 55: Hoare triple {3412#true} SUMMARY for call #t~ret0.base, #t~ret0.offset := strncpy(~dest.base, ~dest.offset, ~src.base, ~src.offset, ~n); srcloc: L30-2 {3412#true} is VALID [2020-07-08 23:37:39,093 INFO L280 TraceCheckUtils]: 56: Hoare triple {3412#true} #res.base, #res.offset := #t~ret0.base, #t~ret0.offset; {3412#true} is VALID [2020-07-08 23:37:39,094 INFO L280 TraceCheckUtils]: 57: Hoare triple {3412#true} havoc #t~ret0.base, #t~ret0.offset; {3412#true} is VALID [2020-07-08 23:37:39,094 INFO L280 TraceCheckUtils]: 58: Hoare triple {3412#true} assume true; {3412#true} is VALID [2020-07-08 23:37:39,095 INFO L275 TraceCheckUtils]: 59: Hoare quadruple {3412#true} {3413#false} #201#return; {3413#false} is VALID [2020-07-08 23:37:39,095 INFO L280 TraceCheckUtils]: 60: Hoare triple {3413#false} havoc #t~ret19.base, #t~ret19.offset; {3413#false} is VALID [2020-07-08 23:37:39,095 INFO L263 TraceCheckUtils]: 61: Hoare triple {3413#false} call __VERIFIER_assert((if 1 + (~j~0 - ~start~0) < 2 then 1 else 0)); {3413#false} is VALID [2020-07-08 23:37:39,096 INFO L280 TraceCheckUtils]: 62: Hoare triple {3413#false} ~cond := #in~cond; {3413#false} is VALID [2020-07-08 23:37:39,096 INFO L280 TraceCheckUtils]: 63: Hoare triple {3413#false} assume 0 == ~cond; {3413#false} is VALID [2020-07-08 23:37:39,096 INFO L280 TraceCheckUtils]: 64: Hoare triple {3413#false} assume !false; {3413#false} is VALID [2020-07-08 23:37:39,103 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-08 23:37:39,104 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [405171157] [2020-07-08 23:37:39,104 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 23:37:39,104 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-07-08 23:37:39,105 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179325261] [2020-07-08 23:37:39,105 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 65 [2020-07-08 23:37:39,107 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 23:37:39,107 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-08 23:37:39,174 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:37:39,174 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-08 23:37:39,175 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 23:37:39,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-08 23:37:39,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2020-07-08 23:37:39,176 INFO L87 Difference]: Start difference. First operand 140 states and 157 transitions. Second operand 10 states. [2020-07-08 23:37:41,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:37:41,149 INFO L93 Difference]: Finished difference Result 430 states and 486 transitions. [2020-07-08 23:37:41,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-07-08 23:37:41,150 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 65 [2020-07-08 23:37:41,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 23:37:41,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-08 23:37:41,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 460 transitions. [2020-07-08 23:37:41,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-08 23:37:41,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 460 transitions. [2020-07-08 23:37:41,176 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 460 transitions. [2020-07-08 23:37:41,651 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 460 edges. 460 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:37:41,660 INFO L225 Difference]: With dead ends: 430 [2020-07-08 23:37:41,660 INFO L226 Difference]: Without dead ends: 340 [2020-07-08 23:37:41,661 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2020-07-08 23:37:41,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2020-07-08 23:37:41,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 144. [2020-07-08 23:37:41,824 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 23:37:41,825 INFO L82 GeneralOperation]: Start isEquivalent. First operand 340 states. Second operand 144 states. [2020-07-08 23:37:41,825 INFO L74 IsIncluded]: Start isIncluded. First operand 340 states. Second operand 144 states. [2020-07-08 23:37:41,825 INFO L87 Difference]: Start difference. First operand 340 states. Second operand 144 states. [2020-07-08 23:37:41,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:37:41,838 INFO L93 Difference]: Finished difference Result 340 states and 386 transitions. [2020-07-08 23:37:41,838 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 386 transitions. [2020-07-08 23:37:41,839 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:37:41,839 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:37:41,839 INFO L74 IsIncluded]: Start isIncluded. First operand 144 states. Second operand 340 states. [2020-07-08 23:37:41,840 INFO L87 Difference]: Start difference. First operand 144 states. Second operand 340 states. [2020-07-08 23:37:41,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:37:41,853 INFO L93 Difference]: Finished difference Result 340 states and 386 transitions. [2020-07-08 23:37:41,853 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 386 transitions. [2020-07-08 23:37:41,854 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:37:41,854 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:37:41,855 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 23:37:41,855 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 23:37:41,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2020-07-08 23:37:41,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 161 transitions. [2020-07-08 23:37:41,860 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 161 transitions. Word has length 65 [2020-07-08 23:37:41,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 23:37:41,860 INFO L479 AbstractCegarLoop]: Abstraction has 144 states and 161 transitions. [2020-07-08 23:37:41,860 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-08 23:37:41,860 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 144 states and 161 transitions. [2020-07-08 23:37:42,060 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 161 edges. 161 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:37:42,061 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 161 transitions. [2020-07-08 23:37:42,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2020-07-08 23:37:42,062 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 23:37:42,062 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, 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-08 23:37:42,063 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-08 23:37:42,063 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 23:37:42,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 23:37:42,063 INFO L82 PathProgramCache]: Analyzing trace with hash 1492663361, now seen corresponding path program 1 times [2020-07-08 23:37:42,063 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 23:37:42,064 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [570783145] [2020-07-08 23:37:42,064 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 23:37:42,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:37:42,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:37:42,128 INFO L280 TraceCheckUtils]: 0: Hoare triple {5295#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {5279#true} is VALID [2020-07-08 23:37:42,128 INFO L280 TraceCheckUtils]: 1: Hoare triple {5279#true} #valid := #valid[0 := 0]; {5279#true} is VALID [2020-07-08 23:37:42,128 INFO L280 TraceCheckUtils]: 2: Hoare triple {5279#true} assume 0 < #StackHeapBarrier; {5279#true} is VALID [2020-07-08 23:37:42,129 INFO L280 TraceCheckUtils]: 3: Hoare triple {5279#true} assume true; {5279#true} is VALID [2020-07-08 23:37:42,129 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {5279#true} {5279#true} #205#return; {5279#true} is VALID [2020-07-08 23:37:42,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:37:42,133 INFO L280 TraceCheckUtils]: 0: Hoare triple {5279#true} ~dest.base, ~dest.offset := #in~dest.base, #in~dest.offset; {5279#true} is VALID [2020-07-08 23:37:42,134 INFO L280 TraceCheckUtils]: 1: Hoare triple {5279#true} ~src.base, ~src.offset := #in~src.base, #in~src.offset; {5279#true} is VALID [2020-07-08 23:37:42,134 INFO L280 TraceCheckUtils]: 2: Hoare triple {5279#true} ~n := #in~n; {5279#true} is VALID [2020-07-08 23:37:42,134 INFO L280 TraceCheckUtils]: 3: Hoare triple {5279#true} SUMMARY for call #t~ret0.base, #t~ret0.offset := strncpy(~dest.base, ~dest.offset, ~src.base, ~src.offset, ~n); srcloc: L30-2 {5279#true} is VALID [2020-07-08 23:37:42,134 INFO L280 TraceCheckUtils]: 4: Hoare triple {5279#true} #res.base, #res.offset := #t~ret0.base, #t~ret0.offset; {5279#true} is VALID [2020-07-08 23:37:42,134 INFO L280 TraceCheckUtils]: 5: Hoare triple {5279#true} havoc #t~ret0.base, #t~ret0.offset; {5279#true} is VALID [2020-07-08 23:37:42,135 INFO L280 TraceCheckUtils]: 6: Hoare triple {5279#true} assume true; {5279#true} is VALID [2020-07-08 23:37:42,135 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {5279#true} {5280#false} #201#return; {5280#false} is VALID [2020-07-08 23:37:42,136 INFO L263 TraceCheckUtils]: 0: Hoare triple {5279#true} call ULTIMATE.init(); {5295#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 23:37:42,136 INFO L280 TraceCheckUtils]: 1: Hoare triple {5295#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {5279#true} is VALID [2020-07-08 23:37:42,136 INFO L280 TraceCheckUtils]: 2: Hoare triple {5279#true} #valid := #valid[0 := 0]; {5279#true} is VALID [2020-07-08 23:37:42,137 INFO L280 TraceCheckUtils]: 3: Hoare triple {5279#true} assume 0 < #StackHeapBarrier; {5279#true} is VALID [2020-07-08 23:37:42,137 INFO L280 TraceCheckUtils]: 4: Hoare triple {5279#true} assume true; {5279#true} is VALID [2020-07-08 23:37:42,137 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {5279#true} {5279#true} #205#return; {5279#true} is VALID [2020-07-08 23:37:42,137 INFO L263 TraceCheckUtils]: 6: Hoare triple {5279#true} call #t~ret21 := main(); {5279#true} is VALID [2020-07-08 23:37:42,138 INFO L280 TraceCheckUtils]: 7: Hoare triple {5279#true} SUMMARY for call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(9); srcloc: mainENTRY {5279#true} is VALID [2020-07-08 23:37:42,138 INFO L280 TraceCheckUtils]: 8: Hoare triple {5279#true} SUMMARY for call write~int(0, ~#A~0.base, 8 + ~#A~0.offset, 1); srcloc: L74 {5279#true} is VALID [2020-07-08 23:37:42,138 INFO L263 TraceCheckUtils]: 9: Hoare triple {5279#true} call #t~ret20 := parse_expression_list(~#A~0.base, ~#A~0.offset); {5279#true} is VALID [2020-07-08 23:37:42,138 INFO L280 TraceCheckUtils]: 10: Hoare triple {5279#true} ~str.base, ~str.offset := #in~str.base, #in~str.offset; {5279#true} is VALID [2020-07-08 23:37:42,139 INFO L280 TraceCheckUtils]: 11: Hoare triple {5279#true} ~start~0 := 0; {5279#true} is VALID [2020-07-08 23:37:42,139 INFO L280 TraceCheckUtils]: 12: Hoare triple {5279#true} ~i~0 := -1; {5279#true} is VALID [2020-07-08 23:37:42,139 INFO L280 TraceCheckUtils]: 13: Hoare triple {5279#true} ~j~0 := -1; {5279#true} is VALID [2020-07-08 23:37:42,139 INFO L280 TraceCheckUtils]: 14: Hoare triple {5279#true} SUMMARY for call ~#str2~0.base, ~#str2~0.offset := #Ultimate.allocOnStack(2); srcloc: L49 {5279#true} is VALID [2020-07-08 23:37:42,139 INFO L280 TraceCheckUtils]: 15: Hoare triple {5279#true} assume !(~str.base == 0 && ~str.offset == 0); {5279#true} is VALID [2020-07-08 23:37:42,140 INFO L280 TraceCheckUtils]: 16: Hoare triple {5279#true} #t~post2 := ~i~0; {5279#true} is VALID [2020-07-08 23:37:42,140 INFO L280 TraceCheckUtils]: 17: Hoare triple {5279#true} ~i~0 := 1 + #t~post2; {5279#true} is VALID [2020-07-08 23:37:42,140 INFO L280 TraceCheckUtils]: 18: Hoare triple {5279#true} havoc #t~post2; {5279#true} is VALID [2020-07-08 23:37:42,140 INFO L280 TraceCheckUtils]: 19: Hoare triple {5279#true} SUMMARY for call #t~mem3 := read~int(~str.base, ~str.offset + ~i~0, 1); srcloc: L53 {5279#true} is VALID [2020-07-08 23:37:42,141 INFO L280 TraceCheckUtils]: 20: Hoare triple {5279#true} #t~switch4 := 0 == #t~mem3; {5279#true} is VALID [2020-07-08 23:37:42,141 INFO L280 TraceCheckUtils]: 21: Hoare triple {5279#true} assume #t~switch4; {5279#true} is VALID [2020-07-08 23:37:42,141 INFO L280 TraceCheckUtils]: 22: Hoare triple {5279#true} SUMMARY for call #t~mem5 := read~int(~str.base, ~str.offset + ~start~0, 1); srcloc: L55-17 {5279#true} is VALID [2020-07-08 23:37:42,141 INFO L280 TraceCheckUtils]: 23: Hoare triple {5279#true} #t~short7 := 32 == #t~mem5; {5279#true} is VALID [2020-07-08 23:37:42,142 INFO L280 TraceCheckUtils]: 24: Hoare triple {5279#true} assume !#t~short7; {5279#true} is VALID [2020-07-08 23:37:42,142 INFO L280 TraceCheckUtils]: 25: Hoare triple {5279#true} SUMMARY for call #t~mem6 := read~int(~str.base, ~str.offset + ~start~0, 1); srcloc: L55-4 {5279#true} is VALID [2020-07-08 23:37:42,142 INFO L280 TraceCheckUtils]: 26: Hoare triple {5279#true} #t~short7 := 9 == #t~mem6; {5279#true} is VALID [2020-07-08 23:37:42,142 INFO L280 TraceCheckUtils]: 27: Hoare triple {5279#true} assume !#t~short7; {5279#true} is VALID [2020-07-08 23:37:42,142 INFO L280 TraceCheckUtils]: 28: Hoare triple {5279#true} havoc #t~mem5; {5279#true} is VALID [2020-07-08 23:37:42,143 INFO L280 TraceCheckUtils]: 29: Hoare triple {5279#true} havoc #t~mem6; {5279#true} is VALID [2020-07-08 23:37:42,143 INFO L280 TraceCheckUtils]: 30: Hoare triple {5279#true} havoc #t~short7; {5279#true} is VALID [2020-07-08 23:37:42,143 INFO L280 TraceCheckUtils]: 31: Hoare triple {5279#true} SUMMARY for call #t~mem9 := read~int(~str.base, ~str.offset + ~start~0, 1); srcloc: L55-18 {5279#true} is VALID [2020-07-08 23:37:42,143 INFO L280 TraceCheckUtils]: 32: Hoare triple {5279#true} assume !(34 == #t~mem9); {5279#true} is VALID [2020-07-08 23:37:42,143 INFO L280 TraceCheckUtils]: 33: Hoare triple {5279#true} havoc #t~mem9; {5279#true} is VALID [2020-07-08 23:37:42,144 INFO L280 TraceCheckUtils]: 34: Hoare triple {5279#true} ~j~0 := ~i~0 - 1; {5279#true} is VALID [2020-07-08 23:37:42,144 INFO L280 TraceCheckUtils]: 35: Hoare triple {5279#true} #t~short14 := 0 < ~j~0; {5279#true} is VALID [2020-07-08 23:37:42,144 INFO L280 TraceCheckUtils]: 36: Hoare triple {5279#true} assume !#t~short14; {5279#true} is VALID [2020-07-08 23:37:42,144 INFO L280 TraceCheckUtils]: 37: Hoare triple {5279#true} assume !#t~short14; {5279#true} is VALID [2020-07-08 23:37:42,145 INFO L280 TraceCheckUtils]: 38: Hoare triple {5279#true} havoc #t~mem11; {5279#true} is VALID [2020-07-08 23:37:42,145 INFO L280 TraceCheckUtils]: 39: Hoare triple {5279#true} havoc #t~short13; {5279#true} is VALID [2020-07-08 23:37:42,145 INFO L280 TraceCheckUtils]: 40: Hoare triple {5279#true} havoc #t~short14; {5279#true} is VALID [2020-07-08 23:37:42,145 INFO L280 TraceCheckUtils]: 41: Hoare triple {5279#true} havoc #t~mem12; {5279#true} is VALID [2020-07-08 23:37:42,145 INFO L280 TraceCheckUtils]: 42: Hoare triple {5279#true} #t~short17 := 0 < ~j~0; {5279#true} is VALID [2020-07-08 23:37:42,149 INFO L280 TraceCheckUtils]: 43: Hoare triple {5279#true} assume !#t~short17; {5286#(not |parse_expression_list_#t~short17|)} is VALID [2020-07-08 23:37:42,156 INFO L280 TraceCheckUtils]: 44: Hoare triple {5286#(not |parse_expression_list_#t~short17|)} assume #t~short17; {5280#false} is VALID [2020-07-08 23:37:42,156 INFO L280 TraceCheckUtils]: 45: Hoare triple {5280#false} havoc #t~short17; {5280#false} is VALID [2020-07-08 23:37:42,157 INFO L280 TraceCheckUtils]: 46: Hoare triple {5280#false} havoc #t~mem16; {5280#false} is VALID [2020-07-08 23:37:42,157 INFO L280 TraceCheckUtils]: 47: Hoare triple {5280#false} #t~post18 := ~j~0; {5280#false} is VALID [2020-07-08 23:37:42,157 INFO L280 TraceCheckUtils]: 48: Hoare triple {5280#false} ~j~0 := #t~post18 - 1; {5280#false} is VALID [2020-07-08 23:37:42,157 INFO L280 TraceCheckUtils]: 49: Hoare triple {5280#false} havoc #t~post18; {5280#false} is VALID [2020-07-08 23:37:42,157 INFO L280 TraceCheckUtils]: 50: Hoare triple {5280#false} assume ~start~0 <= ~j~0; {5280#false} is VALID [2020-07-08 23:37:42,158 INFO L263 TraceCheckUtils]: 51: Hoare triple {5280#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)); {5279#true} is VALID [2020-07-08 23:37:42,158 INFO L280 TraceCheckUtils]: 52: Hoare triple {5279#true} ~dest.base, ~dest.offset := #in~dest.base, #in~dest.offset; {5279#true} is VALID [2020-07-08 23:37:42,158 INFO L280 TraceCheckUtils]: 53: Hoare triple {5279#true} ~src.base, ~src.offset := #in~src.base, #in~src.offset; {5279#true} is VALID [2020-07-08 23:37:42,158 INFO L280 TraceCheckUtils]: 54: Hoare triple {5279#true} ~n := #in~n; {5279#true} is VALID [2020-07-08 23:37:42,158 INFO L280 TraceCheckUtils]: 55: Hoare triple {5279#true} SUMMARY for call #t~ret0.base, #t~ret0.offset := strncpy(~dest.base, ~dest.offset, ~src.base, ~src.offset, ~n); srcloc: L30-2 {5279#true} is VALID [2020-07-08 23:37:42,159 INFO L280 TraceCheckUtils]: 56: Hoare triple {5279#true} #res.base, #res.offset := #t~ret0.base, #t~ret0.offset; {5279#true} is VALID [2020-07-08 23:37:42,159 INFO L280 TraceCheckUtils]: 57: Hoare triple {5279#true} havoc #t~ret0.base, #t~ret0.offset; {5279#true} is VALID [2020-07-08 23:37:42,159 INFO L280 TraceCheckUtils]: 58: Hoare triple {5279#true} assume true; {5279#true} is VALID [2020-07-08 23:37:42,159 INFO L275 TraceCheckUtils]: 59: Hoare quadruple {5279#true} {5280#false} #201#return; {5280#false} is VALID [2020-07-08 23:37:42,160 INFO L280 TraceCheckUtils]: 60: Hoare triple {5280#false} havoc #t~ret19.base, #t~ret19.offset; {5280#false} is VALID [2020-07-08 23:37:42,160 INFO L263 TraceCheckUtils]: 61: Hoare triple {5280#false} call __VERIFIER_assert((if 1 + (~j~0 - ~start~0) < 2 then 1 else 0)); {5280#false} is VALID [2020-07-08 23:37:42,160 INFO L280 TraceCheckUtils]: 62: Hoare triple {5280#false} ~cond := #in~cond; {5280#false} is VALID [2020-07-08 23:37:42,160 INFO L280 TraceCheckUtils]: 63: Hoare triple {5280#false} assume 0 == ~cond; {5280#false} is VALID [2020-07-08 23:37:42,161 INFO L280 TraceCheckUtils]: 64: Hoare triple {5280#false} assume !false; {5280#false} is VALID [2020-07-08 23:37:42,164 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-08 23:37:42,164 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [570783145] [2020-07-08 23:37:42,164 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 23:37:42,164 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-08 23:37:42,165 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832500103] [2020-07-08 23:37:42,167 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2020-07-08 23:37:42,167 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 23:37:42,167 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-08 23:37:42,224 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:37:42,225 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-08 23:37:42,225 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 23:37:42,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-08 23:37:42,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-08 23:37:42,226 INFO L87 Difference]: Start difference. First operand 144 states and 161 transitions. Second operand 4 states. [2020-07-08 23:37:42,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:37:42,751 INFO L93 Difference]: Finished difference Result 233 states and 260 transitions. [2020-07-08 23:37:42,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-08 23:37:42,751 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2020-07-08 23:37:42,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 23:37:42,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-08 23:37:42,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 208 transitions. [2020-07-08 23:37:42,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-08 23:37:42,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 208 transitions. [2020-07-08 23:37:42,761 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 208 transitions. [2020-07-08 23:37:42,967 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 208 edges. 208 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:37:42,971 INFO L225 Difference]: With dead ends: 233 [2020-07-08 23:37:42,971 INFO L226 Difference]: Without dead ends: 145 [2020-07-08 23:37:42,972 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-08 23:37:42,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2020-07-08 23:37:43,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2020-07-08 23:37:43,143 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 23:37:43,144 INFO L82 GeneralOperation]: Start isEquivalent. First operand 145 states. Second operand 145 states. [2020-07-08 23:37:43,144 INFO L74 IsIncluded]: Start isIncluded. First operand 145 states. Second operand 145 states. [2020-07-08 23:37:43,144 INFO L87 Difference]: Start difference. First operand 145 states. Second operand 145 states. [2020-07-08 23:37:43,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:37:43,150 INFO L93 Difference]: Finished difference Result 145 states and 161 transitions. [2020-07-08 23:37:43,150 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 161 transitions. [2020-07-08 23:37:43,151 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:37:43,151 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:37:43,151 INFO L74 IsIncluded]: Start isIncluded. First operand 145 states. Second operand 145 states. [2020-07-08 23:37:43,152 INFO L87 Difference]: Start difference. First operand 145 states. Second operand 145 states. [2020-07-08 23:37:43,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:37:43,173 INFO L93 Difference]: Finished difference Result 145 states and 161 transitions. [2020-07-08 23:37:43,173 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 161 transitions. [2020-07-08 23:37:43,174 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:37:43,174 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:37:43,174 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 23:37:43,174 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 23:37:43,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2020-07-08 23:37:43,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 161 transitions. [2020-07-08 23:37:43,180 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 161 transitions. Word has length 65 [2020-07-08 23:37:43,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 23:37:43,180 INFO L479 AbstractCegarLoop]: Abstraction has 145 states and 161 transitions. [2020-07-08 23:37:43,180 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-08 23:37:43,180 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 145 states and 161 transitions. [2020-07-08 23:37:43,341 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 161 edges. 161 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:37:43,341 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 161 transitions. [2020-07-08 23:37:43,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2020-07-08 23:37:43,342 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 23:37:43,343 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, 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-08 23:37:43,343 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-08 23:37:43,343 INFO L427 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 23:37:43,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 23:37:43,343 INFO L82 PathProgramCache]: Analyzing trace with hash -1492389340, now seen corresponding path program 1 times [2020-07-08 23:37:43,344 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 23:37:43,344 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [763484680] [2020-07-08 23:37:43,344 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 23:37:43,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:37:43,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:37:43,544 INFO L280 TraceCheckUtils]: 0: Hoare triple {6366#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {6344#true} is VALID [2020-07-08 23:37:43,544 INFO L280 TraceCheckUtils]: 1: Hoare triple {6344#true} #valid := #valid[0 := 0]; {6344#true} is VALID [2020-07-08 23:37:43,544 INFO L280 TraceCheckUtils]: 2: Hoare triple {6344#true} assume 0 < #StackHeapBarrier; {6344#true} is VALID [2020-07-08 23:37:43,544 INFO L280 TraceCheckUtils]: 3: Hoare triple {6344#true} assume true; {6344#true} is VALID [2020-07-08 23:37:43,545 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {6344#true} {6344#true} #205#return; {6344#true} is VALID [2020-07-08 23:37:43,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:37:43,559 INFO L280 TraceCheckUtils]: 0: Hoare triple {6344#true} ~dest.base, ~dest.offset := #in~dest.base, #in~dest.offset; {6344#true} is VALID [2020-07-08 23:37:43,559 INFO L280 TraceCheckUtils]: 1: Hoare triple {6344#true} ~src.base, ~src.offset := #in~src.base, #in~src.offset; {6344#true} is VALID [2020-07-08 23:37:43,559 INFO L280 TraceCheckUtils]: 2: Hoare triple {6344#true} ~n := #in~n; {6344#true} is VALID [2020-07-08 23:37:43,559 INFO L280 TraceCheckUtils]: 3: Hoare triple {6344#true} SUMMARY for call #t~ret0.base, #t~ret0.offset := strncpy(~dest.base, ~dest.offset, ~src.base, ~src.offset, ~n); srcloc: L30-2 {6344#true} is VALID [2020-07-08 23:37:43,560 INFO L280 TraceCheckUtils]: 4: Hoare triple {6344#true} #res.base, #res.offset := #t~ret0.base, #t~ret0.offset; {6344#true} is VALID [2020-07-08 23:37:43,560 INFO L280 TraceCheckUtils]: 5: Hoare triple {6344#true} havoc #t~ret0.base, #t~ret0.offset; {6344#true} is VALID [2020-07-08 23:37:43,560 INFO L280 TraceCheckUtils]: 6: Hoare triple {6344#true} assume true; {6344#true} is VALID [2020-07-08 23:37:43,560 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {6344#true} {6345#false} #201#return; {6345#false} is VALID [2020-07-08 23:37:43,562 INFO L263 TraceCheckUtils]: 0: Hoare triple {6344#true} call ULTIMATE.init(); {6366#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 23:37:43,562 INFO L280 TraceCheckUtils]: 1: Hoare triple {6366#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {6344#true} is VALID [2020-07-08 23:37:43,562 INFO L280 TraceCheckUtils]: 2: Hoare triple {6344#true} #valid := #valid[0 := 0]; {6344#true} is VALID [2020-07-08 23:37:43,562 INFO L280 TraceCheckUtils]: 3: Hoare triple {6344#true} assume 0 < #StackHeapBarrier; {6344#true} is VALID [2020-07-08 23:37:43,562 INFO L280 TraceCheckUtils]: 4: Hoare triple {6344#true} assume true; {6344#true} is VALID [2020-07-08 23:37:43,563 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {6344#true} {6344#true} #205#return; {6344#true} is VALID [2020-07-08 23:37:43,563 INFO L263 TraceCheckUtils]: 6: Hoare triple {6344#true} call #t~ret21 := main(); {6344#true} is VALID [2020-07-08 23:37:43,563 INFO L280 TraceCheckUtils]: 7: Hoare triple {6344#true} SUMMARY for call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(9); srcloc: mainENTRY {6344#true} is VALID [2020-07-08 23:37:43,563 INFO L280 TraceCheckUtils]: 8: Hoare triple {6344#true} SUMMARY for call write~int(0, ~#A~0.base, 8 + ~#A~0.offset, 1); srcloc: L74 {6344#true} is VALID [2020-07-08 23:37:43,563 INFO L263 TraceCheckUtils]: 9: Hoare triple {6344#true} call #t~ret20 := parse_expression_list(~#A~0.base, ~#A~0.offset); {6344#true} is VALID [2020-07-08 23:37:43,564 INFO L280 TraceCheckUtils]: 10: Hoare triple {6344#true} ~str.base, ~str.offset := #in~str.base, #in~str.offset; {6344#true} is VALID [2020-07-08 23:37:43,568 INFO L280 TraceCheckUtils]: 11: Hoare triple {6344#true} ~start~0 := 0; {6351#(= 0 parse_expression_list_~start~0)} is VALID [2020-07-08 23:37:43,569 INFO L280 TraceCheckUtils]: 12: Hoare triple {6351#(= 0 parse_expression_list_~start~0)} ~i~0 := -1; {6352#(and (= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~i~0 1) 0))} is VALID [2020-07-08 23:37:43,570 INFO L280 TraceCheckUtils]: 13: Hoare triple {6352#(and (= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~i~0 1) 0))} ~j~0 := -1; {6352#(and (= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~i~0 1) 0))} is VALID [2020-07-08 23:37:43,570 INFO L280 TraceCheckUtils]: 14: Hoare triple {6352#(and (= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~i~0 1) 0))} SUMMARY for call ~#str2~0.base, ~#str2~0.offset := #Ultimate.allocOnStack(2); srcloc: L49 {6352#(and (= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~i~0 1) 0))} is VALID [2020-07-08 23:37:43,571 INFO L280 TraceCheckUtils]: 15: Hoare triple {6352#(and (= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~i~0 1) 0))} assume !(~str.base == 0 && ~str.offset == 0); {6352#(and (= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~i~0 1) 0))} is VALID [2020-07-08 23:37:43,571 INFO L280 TraceCheckUtils]: 16: Hoare triple {6352#(and (= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~i~0 1) 0))} #t~post2 := ~i~0; {6353#(and (<= (+ |parse_expression_list_#t~post2| 1) 0) (= 0 parse_expression_list_~start~0))} is VALID [2020-07-08 23:37:43,572 INFO L280 TraceCheckUtils]: 17: Hoare triple {6353#(and (<= (+ |parse_expression_list_#t~post2| 1) 0) (= 0 parse_expression_list_~start~0))} ~i~0 := 1 + #t~post2; {6354#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} is VALID [2020-07-08 23:37:43,573 INFO L280 TraceCheckUtils]: 18: Hoare triple {6354#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} havoc #t~post2; {6354#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} is VALID [2020-07-08 23:37:43,573 INFO L280 TraceCheckUtils]: 19: Hoare triple {6354#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} SUMMARY for call #t~mem3 := read~int(~str.base, ~str.offset + ~i~0, 1); srcloc: L53 {6354#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} is VALID [2020-07-08 23:37:43,574 INFO L280 TraceCheckUtils]: 20: Hoare triple {6354#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} #t~switch4 := 0 == #t~mem3; {6354#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} is VALID [2020-07-08 23:37:43,574 INFO L280 TraceCheckUtils]: 21: Hoare triple {6354#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} assume #t~switch4; {6354#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} is VALID [2020-07-08 23:37:43,575 INFO L280 TraceCheckUtils]: 22: Hoare triple {6354#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} SUMMARY for call #t~mem5 := read~int(~str.base, ~str.offset + ~start~0, 1); srcloc: L55-17 {6354#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} is VALID [2020-07-08 23:37:43,575 INFO L280 TraceCheckUtils]: 23: Hoare triple {6354#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} #t~short7 := 32 == #t~mem5; {6354#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} is VALID [2020-07-08 23:37:43,576 INFO L280 TraceCheckUtils]: 24: Hoare triple {6354#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} assume !#t~short7; {6354#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} is VALID [2020-07-08 23:37:43,576 INFO L280 TraceCheckUtils]: 25: Hoare triple {6354#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} SUMMARY for call #t~mem6 := read~int(~str.base, ~str.offset + ~start~0, 1); srcloc: L55-4 {6354#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} is VALID [2020-07-08 23:37:43,577 INFO L280 TraceCheckUtils]: 26: Hoare triple {6354#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} #t~short7 := 9 == #t~mem6; {6354#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} is VALID [2020-07-08 23:37:43,578 INFO L280 TraceCheckUtils]: 27: Hoare triple {6354#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} assume !#t~short7; {6354#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} is VALID [2020-07-08 23:37:43,578 INFO L280 TraceCheckUtils]: 28: Hoare triple {6354#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} havoc #t~mem5; {6354#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} is VALID [2020-07-08 23:37:43,579 INFO L280 TraceCheckUtils]: 29: Hoare triple {6354#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} havoc #t~mem6; {6354#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} is VALID [2020-07-08 23:37:43,579 INFO L280 TraceCheckUtils]: 30: Hoare triple {6354#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} havoc #t~short7; {6354#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} is VALID [2020-07-08 23:37:43,580 INFO L280 TraceCheckUtils]: 31: Hoare triple {6354#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} SUMMARY for call #t~mem9 := read~int(~str.base, ~str.offset + ~start~0, 1); srcloc: L55-18 {6354#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} is VALID [2020-07-08 23:37:43,580 INFO L280 TraceCheckUtils]: 32: Hoare triple {6354#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} assume !(34 == #t~mem9); {6354#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} is VALID [2020-07-08 23:37:43,581 INFO L280 TraceCheckUtils]: 33: Hoare triple {6354#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} havoc #t~mem9; {6354#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} is VALID [2020-07-08 23:37:43,581 INFO L280 TraceCheckUtils]: 34: Hoare triple {6354#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} ~j~0 := ~i~0 - 1; {6355#(and (= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~j~0 1) 0))} is VALID [2020-07-08 23:37:43,582 INFO L280 TraceCheckUtils]: 35: Hoare triple {6355#(and (= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~j~0 1) 0))} #t~short14 := 0 < ~j~0; {6355#(and (= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~j~0 1) 0))} is VALID [2020-07-08 23:37:43,582 INFO L280 TraceCheckUtils]: 36: Hoare triple {6355#(and (= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~j~0 1) 0))} assume !#t~short14; {6355#(and (= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~j~0 1) 0))} is VALID [2020-07-08 23:37:43,583 INFO L280 TraceCheckUtils]: 37: Hoare triple {6355#(and (= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~j~0 1) 0))} assume !#t~short14; {6355#(and (= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~j~0 1) 0))} is VALID [2020-07-08 23:37:43,583 INFO L280 TraceCheckUtils]: 38: Hoare triple {6355#(and (= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~j~0 1) 0))} havoc #t~mem11; {6355#(and (= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~j~0 1) 0))} is VALID [2020-07-08 23:37:43,584 INFO L280 TraceCheckUtils]: 39: Hoare triple {6355#(and (= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~j~0 1) 0))} havoc #t~short13; {6355#(and (= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~j~0 1) 0))} is VALID [2020-07-08 23:37:43,584 INFO L280 TraceCheckUtils]: 40: Hoare triple {6355#(and (= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~j~0 1) 0))} havoc #t~short14; {6355#(and (= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~j~0 1) 0))} is VALID [2020-07-08 23:37:43,592 INFO L280 TraceCheckUtils]: 41: Hoare triple {6355#(and (= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~j~0 1) 0))} havoc #t~mem12; {6355#(and (= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~j~0 1) 0))} is VALID [2020-07-08 23:37:43,593 INFO L280 TraceCheckUtils]: 42: Hoare triple {6355#(and (= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~j~0 1) 0))} #t~short17 := 0 < ~j~0; {6355#(and (= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~j~0 1) 0))} is VALID [2020-07-08 23:37:43,595 INFO L280 TraceCheckUtils]: 43: Hoare triple {6355#(and (= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~j~0 1) 0))} assume #t~short17; {6355#(and (= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~j~0 1) 0))} is VALID [2020-07-08 23:37:43,596 INFO L280 TraceCheckUtils]: 44: Hoare triple {6355#(and (= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~j~0 1) 0))} SUMMARY for call #t~mem16 := read~int(~str.base, ~str.offset + ~j~0, 1); srcloc: L59-1 {6355#(and (= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~j~0 1) 0))} is VALID [2020-07-08 23:37:43,596 INFO L280 TraceCheckUtils]: 45: Hoare triple {6355#(and (= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~j~0 1) 0))} #t~short17 := 34 == #t~mem16; {6355#(and (= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~j~0 1) 0))} is VALID [2020-07-08 23:37:43,597 INFO L280 TraceCheckUtils]: 46: Hoare triple {6355#(and (= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~j~0 1) 0))} assume #t~short17; {6355#(and (= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~j~0 1) 0))} is VALID [2020-07-08 23:37:43,598 INFO L280 TraceCheckUtils]: 47: Hoare triple {6355#(and (= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~j~0 1) 0))} havoc #t~short17; {6355#(and (= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~j~0 1) 0))} is VALID [2020-07-08 23:37:43,598 INFO L280 TraceCheckUtils]: 48: Hoare triple {6355#(and (= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~j~0 1) 0))} havoc #t~mem16; {6355#(and (= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~j~0 1) 0))} is VALID [2020-07-08 23:37:43,599 INFO L280 TraceCheckUtils]: 49: Hoare triple {6355#(and (= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~j~0 1) 0))} #t~post18 := ~j~0; {6356#(and (= 0 parse_expression_list_~start~0) (<= (+ |parse_expression_list_#t~post18| 1) 0))} is VALID [2020-07-08 23:37:43,600 INFO L280 TraceCheckUtils]: 50: Hoare triple {6356#(and (= 0 parse_expression_list_~start~0) (<= (+ |parse_expression_list_#t~post18| 1) 0))} ~j~0 := #t~post18 - 1; {6357#(and (= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~j~0 2) 0))} is VALID [2020-07-08 23:37:43,601 INFO L280 TraceCheckUtils]: 51: Hoare triple {6357#(and (= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~j~0 2) 0))} havoc #t~post18; {6357#(and (= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~j~0 2) 0))} is VALID [2020-07-08 23:37:43,601 INFO L280 TraceCheckUtils]: 52: Hoare triple {6357#(and (= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~j~0 2) 0))} assume ~start~0 <= ~j~0; {6345#false} is VALID [2020-07-08 23:37:43,602 INFO L263 TraceCheckUtils]: 53: Hoare triple {6345#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)); {6344#true} is VALID [2020-07-08 23:37:43,602 INFO L280 TraceCheckUtils]: 54: Hoare triple {6344#true} ~dest.base, ~dest.offset := #in~dest.base, #in~dest.offset; {6344#true} is VALID [2020-07-08 23:37:43,602 INFO L280 TraceCheckUtils]: 55: Hoare triple {6344#true} ~src.base, ~src.offset := #in~src.base, #in~src.offset; {6344#true} is VALID [2020-07-08 23:37:43,602 INFO L280 TraceCheckUtils]: 56: Hoare triple {6344#true} ~n := #in~n; {6344#true} is VALID [2020-07-08 23:37:43,602 INFO L280 TraceCheckUtils]: 57: Hoare triple {6344#true} SUMMARY for call #t~ret0.base, #t~ret0.offset := strncpy(~dest.base, ~dest.offset, ~src.base, ~src.offset, ~n); srcloc: L30-2 {6344#true} is VALID [2020-07-08 23:37:43,603 INFO L280 TraceCheckUtils]: 58: Hoare triple {6344#true} #res.base, #res.offset := #t~ret0.base, #t~ret0.offset; {6344#true} is VALID [2020-07-08 23:37:43,603 INFO L280 TraceCheckUtils]: 59: Hoare triple {6344#true} havoc #t~ret0.base, #t~ret0.offset; {6344#true} is VALID [2020-07-08 23:37:43,603 INFO L280 TraceCheckUtils]: 60: Hoare triple {6344#true} assume true; {6344#true} is VALID [2020-07-08 23:37:43,603 INFO L275 TraceCheckUtils]: 61: Hoare quadruple {6344#true} {6345#false} #201#return; {6345#false} is VALID [2020-07-08 23:37:43,604 INFO L280 TraceCheckUtils]: 62: Hoare triple {6345#false} havoc #t~ret19.base, #t~ret19.offset; {6345#false} is VALID [2020-07-08 23:37:43,604 INFO L263 TraceCheckUtils]: 63: Hoare triple {6345#false} call __VERIFIER_assert((if 1 + (~j~0 - ~start~0) < 2 then 1 else 0)); {6345#false} is VALID [2020-07-08 23:37:43,604 INFO L280 TraceCheckUtils]: 64: Hoare triple {6345#false} ~cond := #in~cond; {6345#false} is VALID [2020-07-08 23:37:43,604 INFO L280 TraceCheckUtils]: 65: Hoare triple {6345#false} assume 0 == ~cond; {6345#false} is VALID [2020-07-08 23:37:43,605 INFO L280 TraceCheckUtils]: 66: Hoare triple {6345#false} assume !false; {6345#false} is VALID [2020-07-08 23:37:43,612 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-08 23:37:43,612 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [763484680] [2020-07-08 23:37:43,614 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 23:37:43,614 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-07-08 23:37:43,614 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140779267] [2020-07-08 23:37:43,614 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 67 [2020-07-08 23:37:43,615 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 23:37:43,615 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-08 23:37:43,680 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:37:43,680 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-08 23:37:43,680 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 23:37:43,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-08 23:37:43,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2020-07-08 23:37:43,681 INFO L87 Difference]: Start difference. First operand 145 states and 161 transitions. Second operand 10 states. [2020-07-08 23:37:45,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:37:45,770 INFO L93 Difference]: Finished difference Result 388 states and 434 transitions. [2020-07-08 23:37:45,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-07-08 23:37:45,770 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 67 [2020-07-08 23:37:45,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 23:37:45,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-08 23:37:45,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 403 transitions. [2020-07-08 23:37:45,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-08 23:37:45,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 403 transitions. [2020-07-08 23:37:45,783 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 403 transitions. [2020-07-08 23:37:46,219 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 403 edges. 403 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:37:46,227 INFO L225 Difference]: With dead ends: 388 [2020-07-08 23:37:46,227 INFO L226 Difference]: Without dead ends: 285 [2020-07-08 23:37:46,228 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=280, Unknown=0, NotChecked=0, Total=380 [2020-07-08 23:37:46,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2020-07-08 23:37:46,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 155. [2020-07-08 23:37:46,395 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 23:37:46,395 INFO L82 GeneralOperation]: Start isEquivalent. First operand 285 states. Second operand 155 states. [2020-07-08 23:37:46,395 INFO L74 IsIncluded]: Start isIncluded. First operand 285 states. Second operand 155 states. [2020-07-08 23:37:46,395 INFO L87 Difference]: Start difference. First operand 285 states. Second operand 155 states. [2020-07-08 23:37:46,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:37:46,404 INFO L93 Difference]: Finished difference Result 285 states and 321 transitions. [2020-07-08 23:37:46,404 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 321 transitions. [2020-07-08 23:37:46,405 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:37:46,405 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:37:46,405 INFO L74 IsIncluded]: Start isIncluded. First operand 155 states. Second operand 285 states. [2020-07-08 23:37:46,406 INFO L87 Difference]: Start difference. First operand 155 states. Second operand 285 states. [2020-07-08 23:37:46,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:37:46,414 INFO L93 Difference]: Finished difference Result 285 states and 321 transitions. [2020-07-08 23:37:46,414 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 321 transitions. [2020-07-08 23:37:46,415 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:37:46,415 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:37:46,415 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 23:37:46,416 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 23:37:46,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2020-07-08 23:37:46,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 173 transitions. [2020-07-08 23:37:46,419 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 173 transitions. Word has length 67 [2020-07-08 23:37:46,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 23:37:46,420 INFO L479 AbstractCegarLoop]: Abstraction has 155 states and 173 transitions. [2020-07-08 23:37:46,420 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-08 23:37:46,420 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 155 states and 173 transitions. [2020-07-08 23:37:46,617 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 173 edges. 173 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:37:46,617 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 173 transitions. [2020-07-08 23:37:46,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2020-07-08 23:37:46,618 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 23:37:46,618 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, 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-08 23:37:46,619 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-08 23:37:46,619 INFO L427 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 23:37:46,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 23:37:46,619 INFO L82 PathProgramCache]: Analyzing trace with hash 122758570, now seen corresponding path program 1 times [2020-07-08 23:37:46,620 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 23:37:46,620 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1591847601] [2020-07-08 23:37:46,620 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 23:37:46,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:37:46,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:37:46,801 INFO L280 TraceCheckUtils]: 0: Hoare triple {8069#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {8045#true} is VALID [2020-07-08 23:37:46,801 INFO L280 TraceCheckUtils]: 1: Hoare triple {8045#true} #valid := #valid[0 := 0]; {8045#true} is VALID [2020-07-08 23:37:46,802 INFO L280 TraceCheckUtils]: 2: Hoare triple {8045#true} assume 0 < #StackHeapBarrier; {8045#true} is VALID [2020-07-08 23:37:46,802 INFO L280 TraceCheckUtils]: 3: Hoare triple {8045#true} assume true; {8045#true} is VALID [2020-07-08 23:37:46,802 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {8045#true} {8045#true} #205#return; {8045#true} is VALID [2020-07-08 23:37:46,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:37:46,816 INFO L280 TraceCheckUtils]: 0: Hoare triple {8045#true} ~dest.base, ~dest.offset := #in~dest.base, #in~dest.offset; {8045#true} is VALID [2020-07-08 23:37:46,816 INFO L280 TraceCheckUtils]: 1: Hoare triple {8045#true} ~src.base, ~src.offset := #in~src.base, #in~src.offset; {8045#true} is VALID [2020-07-08 23:37:46,817 INFO L280 TraceCheckUtils]: 2: Hoare triple {8045#true} ~n := #in~n; {8045#true} is VALID [2020-07-08 23:37:46,817 INFO L280 TraceCheckUtils]: 3: Hoare triple {8045#true} SUMMARY for call #t~ret0.base, #t~ret0.offset := strncpy(~dest.base, ~dest.offset, ~src.base, ~src.offset, ~n); srcloc: L30-2 {8045#true} is VALID [2020-07-08 23:37:46,817 INFO L280 TraceCheckUtils]: 4: Hoare triple {8045#true} #res.base, #res.offset := #t~ret0.base, #t~ret0.offset; {8045#true} is VALID [2020-07-08 23:37:46,818 INFO L280 TraceCheckUtils]: 5: Hoare triple {8045#true} havoc #t~ret0.base, #t~ret0.offset; {8045#true} is VALID [2020-07-08 23:37:46,818 INFO L280 TraceCheckUtils]: 6: Hoare triple {8045#true} assume true; {8045#true} is VALID [2020-07-08 23:37:46,818 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {8045#true} {8046#false} #201#return; {8046#false} is VALID [2020-07-08 23:37:46,819 INFO L263 TraceCheckUtils]: 0: Hoare triple {8045#true} call ULTIMATE.init(); {8069#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 23:37:46,820 INFO L280 TraceCheckUtils]: 1: Hoare triple {8069#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {8045#true} is VALID [2020-07-08 23:37:46,820 INFO L280 TraceCheckUtils]: 2: Hoare triple {8045#true} #valid := #valid[0 := 0]; {8045#true} is VALID [2020-07-08 23:37:46,820 INFO L280 TraceCheckUtils]: 3: Hoare triple {8045#true} assume 0 < #StackHeapBarrier; {8045#true} is VALID [2020-07-08 23:37:46,821 INFO L280 TraceCheckUtils]: 4: Hoare triple {8045#true} assume true; {8045#true} is VALID [2020-07-08 23:37:46,821 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {8045#true} {8045#true} #205#return; {8045#true} is VALID [2020-07-08 23:37:46,821 INFO L263 TraceCheckUtils]: 6: Hoare triple {8045#true} call #t~ret21 := main(); {8045#true} is VALID [2020-07-08 23:37:46,821 INFO L280 TraceCheckUtils]: 7: Hoare triple {8045#true} SUMMARY for call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(9); srcloc: mainENTRY {8045#true} is VALID [2020-07-08 23:37:46,822 INFO L280 TraceCheckUtils]: 8: Hoare triple {8045#true} SUMMARY for call write~int(0, ~#A~0.base, 8 + ~#A~0.offset, 1); srcloc: L74 {8045#true} is VALID [2020-07-08 23:37:46,822 INFO L263 TraceCheckUtils]: 9: Hoare triple {8045#true} call #t~ret20 := parse_expression_list(~#A~0.base, ~#A~0.offset); {8045#true} is VALID [2020-07-08 23:37:46,822 INFO L280 TraceCheckUtils]: 10: Hoare triple {8045#true} ~str.base, ~str.offset := #in~str.base, #in~str.offset; {8045#true} is VALID [2020-07-08 23:37:46,826 INFO L280 TraceCheckUtils]: 11: Hoare triple {8045#true} ~start~0 := 0; {8052#(= 0 parse_expression_list_~start~0)} is VALID [2020-07-08 23:37:46,827 INFO L280 TraceCheckUtils]: 12: Hoare triple {8052#(= 0 parse_expression_list_~start~0)} ~i~0 := -1; {8053#(and (= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~i~0 1) 0))} is VALID [2020-07-08 23:37:46,828 INFO L280 TraceCheckUtils]: 13: Hoare triple {8053#(and (= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~i~0 1) 0))} ~j~0 := -1; {8053#(and (= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~i~0 1) 0))} is VALID [2020-07-08 23:37:46,830 INFO L280 TraceCheckUtils]: 14: Hoare triple {8053#(and (= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~i~0 1) 0))} SUMMARY for call ~#str2~0.base, ~#str2~0.offset := #Ultimate.allocOnStack(2); srcloc: L49 {8053#(and (= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~i~0 1) 0))} is VALID [2020-07-08 23:37:46,830 INFO L280 TraceCheckUtils]: 15: Hoare triple {8053#(and (= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~i~0 1) 0))} assume !(~str.base == 0 && ~str.offset == 0); {8053#(and (= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~i~0 1) 0))} is VALID [2020-07-08 23:37:46,831 INFO L280 TraceCheckUtils]: 16: Hoare triple {8053#(and (= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~i~0 1) 0))} #t~post2 := ~i~0; {8054#(and (<= (+ |parse_expression_list_#t~post2| 1) 0) (= 0 parse_expression_list_~start~0))} is VALID [2020-07-08 23:37:46,832 INFO L280 TraceCheckUtils]: 17: Hoare triple {8054#(and (<= (+ |parse_expression_list_#t~post2| 1) 0) (= 0 parse_expression_list_~start~0))} ~i~0 := 1 + #t~post2; {8055#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} is VALID [2020-07-08 23:37:46,833 INFO L280 TraceCheckUtils]: 18: Hoare triple {8055#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} havoc #t~post2; {8055#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} is VALID [2020-07-08 23:37:46,833 INFO L280 TraceCheckUtils]: 19: Hoare triple {8055#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} SUMMARY for call #t~mem3 := read~int(~str.base, ~str.offset + ~i~0, 1); srcloc: L53 {8055#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} is VALID [2020-07-08 23:37:46,834 INFO L280 TraceCheckUtils]: 20: Hoare triple {8055#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} #t~switch4 := 0 == #t~mem3; {8055#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} is VALID [2020-07-08 23:37:46,835 INFO L280 TraceCheckUtils]: 21: Hoare triple {8055#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} assume #t~switch4; {8055#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} is VALID [2020-07-08 23:37:46,836 INFO L280 TraceCheckUtils]: 22: Hoare triple {8055#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} SUMMARY for call #t~mem5 := read~int(~str.base, ~str.offset + ~start~0, 1); srcloc: L55-17 {8055#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} is VALID [2020-07-08 23:37:46,836 INFO L280 TraceCheckUtils]: 23: Hoare triple {8055#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} #t~short7 := 32 == #t~mem5; {8055#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} is VALID [2020-07-08 23:37:46,837 INFO L280 TraceCheckUtils]: 24: Hoare triple {8055#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} assume !#t~short7; {8055#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} is VALID [2020-07-08 23:37:46,838 INFO L280 TraceCheckUtils]: 25: Hoare triple {8055#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} SUMMARY for call #t~mem6 := read~int(~str.base, ~str.offset + ~start~0, 1); srcloc: L55-4 {8055#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} is VALID [2020-07-08 23:37:46,839 INFO L280 TraceCheckUtils]: 26: Hoare triple {8055#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} #t~short7 := 9 == #t~mem6; {8055#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} is VALID [2020-07-08 23:37:46,839 INFO L280 TraceCheckUtils]: 27: Hoare triple {8055#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} assume !#t~short7; {8055#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} is VALID [2020-07-08 23:37:46,840 INFO L280 TraceCheckUtils]: 28: Hoare triple {8055#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} havoc #t~mem5; {8055#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} is VALID [2020-07-08 23:37:46,841 INFO L280 TraceCheckUtils]: 29: Hoare triple {8055#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} havoc #t~mem6; {8055#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} is VALID [2020-07-08 23:37:46,841 INFO L280 TraceCheckUtils]: 30: Hoare triple {8055#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} havoc #t~short7; {8055#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} is VALID [2020-07-08 23:37:46,842 INFO L280 TraceCheckUtils]: 31: Hoare triple {8055#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} SUMMARY for call #t~mem9 := read~int(~str.base, ~str.offset + ~start~0, 1); srcloc: L55-18 {8055#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} is VALID [2020-07-08 23:37:46,843 INFO L280 TraceCheckUtils]: 32: Hoare triple {8055#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} assume 34 == #t~mem9; {8055#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} is VALID [2020-07-08 23:37:46,844 INFO L280 TraceCheckUtils]: 33: Hoare triple {8055#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} havoc #t~mem9; {8055#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} is VALID [2020-07-08 23:37:46,845 INFO L280 TraceCheckUtils]: 34: Hoare triple {8055#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} #t~post10 := ~start~0; {8056#(and (= 0 |parse_expression_list_#t~post10|) (<= parse_expression_list_~i~0 0))} is VALID [2020-07-08 23:37:46,845 INFO L280 TraceCheckUtils]: 35: Hoare triple {8056#(and (= 0 |parse_expression_list_#t~post10|) (<= parse_expression_list_~i~0 0))} ~start~0 := 1 + #t~post10; {8057#(<= (+ parse_expression_list_~i~0 1) parse_expression_list_~start~0)} is VALID [2020-07-08 23:37:46,846 INFO L280 TraceCheckUtils]: 36: Hoare triple {8057#(<= (+ parse_expression_list_~i~0 1) parse_expression_list_~start~0)} havoc #t~post10; {8057#(<= (+ parse_expression_list_~i~0 1) parse_expression_list_~start~0)} is VALID [2020-07-08 23:37:46,847 INFO L280 TraceCheckUtils]: 37: Hoare triple {8057#(<= (+ parse_expression_list_~i~0 1) parse_expression_list_~start~0)} ~j~0 := ~i~0 - 1; {8058#(<= (+ parse_expression_list_~j~0 2) parse_expression_list_~start~0)} is VALID [2020-07-08 23:37:46,848 INFO L280 TraceCheckUtils]: 38: Hoare triple {8058#(<= (+ parse_expression_list_~j~0 2) parse_expression_list_~start~0)} #t~short14 := 0 < ~j~0; {8058#(<= (+ parse_expression_list_~j~0 2) parse_expression_list_~start~0)} is VALID [2020-07-08 23:37:46,849 INFO L280 TraceCheckUtils]: 39: Hoare triple {8058#(<= (+ parse_expression_list_~j~0 2) parse_expression_list_~start~0)} assume !#t~short14; {8058#(<= (+ parse_expression_list_~j~0 2) parse_expression_list_~start~0)} is VALID [2020-07-08 23:37:46,849 INFO L280 TraceCheckUtils]: 40: Hoare triple {8058#(<= (+ parse_expression_list_~j~0 2) parse_expression_list_~start~0)} assume !#t~short14; {8058#(<= (+ parse_expression_list_~j~0 2) parse_expression_list_~start~0)} is VALID [2020-07-08 23:37:46,850 INFO L280 TraceCheckUtils]: 41: Hoare triple {8058#(<= (+ parse_expression_list_~j~0 2) parse_expression_list_~start~0)} havoc #t~mem11; {8058#(<= (+ parse_expression_list_~j~0 2) parse_expression_list_~start~0)} is VALID [2020-07-08 23:37:46,851 INFO L280 TraceCheckUtils]: 42: Hoare triple {8058#(<= (+ parse_expression_list_~j~0 2) parse_expression_list_~start~0)} havoc #t~short13; {8058#(<= (+ parse_expression_list_~j~0 2) parse_expression_list_~start~0)} is VALID [2020-07-08 23:37:46,852 INFO L280 TraceCheckUtils]: 43: Hoare triple {8058#(<= (+ parse_expression_list_~j~0 2) parse_expression_list_~start~0)} havoc #t~short14; {8058#(<= (+ parse_expression_list_~j~0 2) parse_expression_list_~start~0)} is VALID [2020-07-08 23:37:46,852 INFO L280 TraceCheckUtils]: 44: Hoare triple {8058#(<= (+ parse_expression_list_~j~0 2) parse_expression_list_~start~0)} havoc #t~mem12; {8058#(<= (+ parse_expression_list_~j~0 2) parse_expression_list_~start~0)} is VALID [2020-07-08 23:37:46,853 INFO L280 TraceCheckUtils]: 45: Hoare triple {8058#(<= (+ parse_expression_list_~j~0 2) parse_expression_list_~start~0)} #t~short17 := 0 < ~j~0; {8058#(<= (+ parse_expression_list_~j~0 2) parse_expression_list_~start~0)} is VALID [2020-07-08 23:37:46,854 INFO L280 TraceCheckUtils]: 46: Hoare triple {8058#(<= (+ parse_expression_list_~j~0 2) parse_expression_list_~start~0)} assume #t~short17; {8058#(<= (+ parse_expression_list_~j~0 2) parse_expression_list_~start~0)} is VALID [2020-07-08 23:37:46,854 INFO L280 TraceCheckUtils]: 47: Hoare triple {8058#(<= (+ parse_expression_list_~j~0 2) parse_expression_list_~start~0)} SUMMARY for call #t~mem16 := read~int(~str.base, ~str.offset + ~j~0, 1); srcloc: L59-1 {8058#(<= (+ parse_expression_list_~j~0 2) parse_expression_list_~start~0)} is VALID [2020-07-08 23:37:46,855 INFO L280 TraceCheckUtils]: 48: Hoare triple {8058#(<= (+ parse_expression_list_~j~0 2) parse_expression_list_~start~0)} #t~short17 := 34 == #t~mem16; {8058#(<= (+ parse_expression_list_~j~0 2) parse_expression_list_~start~0)} is VALID [2020-07-08 23:37:46,855 INFO L280 TraceCheckUtils]: 49: Hoare triple {8058#(<= (+ parse_expression_list_~j~0 2) parse_expression_list_~start~0)} assume #t~short17; {8058#(<= (+ parse_expression_list_~j~0 2) parse_expression_list_~start~0)} is VALID [2020-07-08 23:37:46,856 INFO L280 TraceCheckUtils]: 50: Hoare triple {8058#(<= (+ parse_expression_list_~j~0 2) parse_expression_list_~start~0)} havoc #t~short17; {8058#(<= (+ parse_expression_list_~j~0 2) parse_expression_list_~start~0)} is VALID [2020-07-08 23:37:46,857 INFO L280 TraceCheckUtils]: 51: Hoare triple {8058#(<= (+ parse_expression_list_~j~0 2) parse_expression_list_~start~0)} havoc #t~mem16; {8058#(<= (+ parse_expression_list_~j~0 2) parse_expression_list_~start~0)} is VALID [2020-07-08 23:37:46,858 INFO L280 TraceCheckUtils]: 52: Hoare triple {8058#(<= (+ parse_expression_list_~j~0 2) parse_expression_list_~start~0)} #t~post18 := ~j~0; {8059#(<= (+ |parse_expression_list_#t~post18| 2) parse_expression_list_~start~0)} is VALID [2020-07-08 23:37:46,859 INFO L280 TraceCheckUtils]: 53: Hoare triple {8059#(<= (+ |parse_expression_list_#t~post18| 2) parse_expression_list_~start~0)} ~j~0 := #t~post18 - 1; {8060#(<= (+ parse_expression_list_~j~0 3) parse_expression_list_~start~0)} is VALID [2020-07-08 23:37:46,860 INFO L280 TraceCheckUtils]: 54: Hoare triple {8060#(<= (+ parse_expression_list_~j~0 3) parse_expression_list_~start~0)} havoc #t~post18; {8060#(<= (+ parse_expression_list_~j~0 3) parse_expression_list_~start~0)} is VALID [2020-07-08 23:37:46,861 INFO L280 TraceCheckUtils]: 55: Hoare triple {8060#(<= (+ parse_expression_list_~j~0 3) parse_expression_list_~start~0)} assume ~start~0 <= ~j~0; {8046#false} is VALID [2020-07-08 23:37:46,861 INFO L263 TraceCheckUtils]: 56: Hoare triple {8046#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)); {8045#true} is VALID [2020-07-08 23:37:46,861 INFO L280 TraceCheckUtils]: 57: Hoare triple {8045#true} ~dest.base, ~dest.offset := #in~dest.base, #in~dest.offset; {8045#true} is VALID [2020-07-08 23:37:46,861 INFO L280 TraceCheckUtils]: 58: Hoare triple {8045#true} ~src.base, ~src.offset := #in~src.base, #in~src.offset; {8045#true} is VALID [2020-07-08 23:37:46,861 INFO L280 TraceCheckUtils]: 59: Hoare triple {8045#true} ~n := #in~n; {8045#true} is VALID [2020-07-08 23:37:46,862 INFO L280 TraceCheckUtils]: 60: Hoare triple {8045#true} SUMMARY for call #t~ret0.base, #t~ret0.offset := strncpy(~dest.base, ~dest.offset, ~src.base, ~src.offset, ~n); srcloc: L30-2 {8045#true} is VALID [2020-07-08 23:37:46,862 INFO L280 TraceCheckUtils]: 61: Hoare triple {8045#true} #res.base, #res.offset := #t~ret0.base, #t~ret0.offset; {8045#true} is VALID [2020-07-08 23:37:46,862 INFO L280 TraceCheckUtils]: 62: Hoare triple {8045#true} havoc #t~ret0.base, #t~ret0.offset; {8045#true} is VALID [2020-07-08 23:37:46,862 INFO L280 TraceCheckUtils]: 63: Hoare triple {8045#true} assume true; {8045#true} is VALID [2020-07-08 23:37:46,862 INFO L275 TraceCheckUtils]: 64: Hoare quadruple {8045#true} {8046#false} #201#return; {8046#false} is VALID [2020-07-08 23:37:46,863 INFO L280 TraceCheckUtils]: 65: Hoare triple {8046#false} havoc #t~ret19.base, #t~ret19.offset; {8046#false} is VALID [2020-07-08 23:37:46,863 INFO L263 TraceCheckUtils]: 66: Hoare triple {8046#false} call __VERIFIER_assert((if 1 + (~j~0 - ~start~0) < 2 then 1 else 0)); {8046#false} is VALID [2020-07-08 23:37:46,863 INFO L280 TraceCheckUtils]: 67: Hoare triple {8046#false} ~cond := #in~cond; {8046#false} is VALID [2020-07-08 23:37:46,863 INFO L280 TraceCheckUtils]: 68: Hoare triple {8046#false} assume 0 == ~cond; {8046#false} is VALID [2020-07-08 23:37:46,863 INFO L280 TraceCheckUtils]: 69: Hoare triple {8046#false} assume !false; {8046#false} is VALID [2020-07-08 23:37:46,870 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-08 23:37:46,870 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1591847601] [2020-07-08 23:37:46,870 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 23:37:46,871 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-07-08 23:37:46,871 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276084468] [2020-07-08 23:37:46,871 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 70 [2020-07-08 23:37:46,872 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 23:37:46,872 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2020-07-08 23:37:46,959 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:37:46,959 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-07-08 23:37:46,959 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 23:37:46,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-08 23:37:46,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2020-07-08 23:37:46,960 INFO L87 Difference]: Start difference. First operand 155 states and 173 transitions. Second operand 12 states. [2020-07-08 23:37:49,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:37:49,473 INFO L93 Difference]: Finished difference Result 425 states and 477 transitions. [2020-07-08 23:37:49,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-07-08 23:37:49,474 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 70 [2020-07-08 23:37:49,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 23:37:49,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-08 23:37:49,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 457 transitions. [2020-07-08 23:37:49,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-08 23:37:49,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 457 transitions. [2020-07-08 23:37:49,490 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 457 transitions. [2020-07-08 23:37:49,976 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 457 edges. 457 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:37:49,985 INFO L225 Difference]: With dead ends: 425 [2020-07-08 23:37:49,985 INFO L226 Difference]: Without dead ends: 322 [2020-07-08 23:37:49,986 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=376, Unknown=0, NotChecked=0, Total=462 [2020-07-08 23:37:49,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2020-07-08 23:37:50,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 136. [2020-07-08 23:37:50,112 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 23:37:50,112 INFO L82 GeneralOperation]: Start isEquivalent. First operand 322 states. Second operand 136 states. [2020-07-08 23:37:50,112 INFO L74 IsIncluded]: Start isIncluded. First operand 322 states. Second operand 136 states. [2020-07-08 23:37:50,112 INFO L87 Difference]: Start difference. First operand 322 states. Second operand 136 states. [2020-07-08 23:37:50,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:37:50,123 INFO L93 Difference]: Finished difference Result 322 states and 364 transitions. [2020-07-08 23:37:50,123 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 364 transitions. [2020-07-08 23:37:50,124 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:37:50,125 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:37:50,125 INFO L74 IsIncluded]: Start isIncluded. First operand 136 states. Second operand 322 states. [2020-07-08 23:37:50,125 INFO L87 Difference]: Start difference. First operand 136 states. Second operand 322 states. [2020-07-08 23:37:50,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:37:50,135 INFO L93 Difference]: Finished difference Result 322 states and 364 transitions. [2020-07-08 23:37:50,135 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 364 transitions. [2020-07-08 23:37:50,136 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:37:50,137 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:37:50,137 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 23:37:50,137 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 23:37:50,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2020-07-08 23:37:50,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 151 transitions. [2020-07-08 23:37:50,140 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 151 transitions. Word has length 70 [2020-07-08 23:37:50,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 23:37:50,141 INFO L479 AbstractCegarLoop]: Abstraction has 136 states and 151 transitions. [2020-07-08 23:37:50,141 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-07-08 23:37:50,141 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 136 states and 151 transitions. [2020-07-08 23:37:50,315 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 151 edges. 151 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:37:50,315 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 151 transitions. [2020-07-08 23:37:50,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2020-07-08 23:37:50,316 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 23:37:50,316 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, 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-08 23:37:50,317 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-08 23:37:50,317 INFO L427 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 23:37:50,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 23:37:50,317 INFO L82 PathProgramCache]: Analyzing trace with hash -272178825, now seen corresponding path program 1 times [2020-07-08 23:37:50,317 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 23:37:50,318 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [738336129] [2020-07-08 23:37:50,318 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 23:37:50,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:37:50,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:37:50,383 INFO L280 TraceCheckUtils]: 0: Hoare triple {9874#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {9858#true} is VALID [2020-07-08 23:37:50,383 INFO L280 TraceCheckUtils]: 1: Hoare triple {9858#true} #valid := #valid[0 := 0]; {9858#true} is VALID [2020-07-08 23:37:50,384 INFO L280 TraceCheckUtils]: 2: Hoare triple {9858#true} assume 0 < #StackHeapBarrier; {9858#true} is VALID [2020-07-08 23:37:50,384 INFO L280 TraceCheckUtils]: 3: Hoare triple {9858#true} assume true; {9858#true} is VALID [2020-07-08 23:37:50,384 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {9858#true} {9858#true} #205#return; {9858#true} is VALID [2020-07-08 23:37:50,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:37:50,388 INFO L280 TraceCheckUtils]: 0: Hoare triple {9858#true} ~dest.base, ~dest.offset := #in~dest.base, #in~dest.offset; {9858#true} is VALID [2020-07-08 23:37:50,389 INFO L280 TraceCheckUtils]: 1: Hoare triple {9858#true} ~src.base, ~src.offset := #in~src.base, #in~src.offset; {9858#true} is VALID [2020-07-08 23:37:50,389 INFO L280 TraceCheckUtils]: 2: Hoare triple {9858#true} ~n := #in~n; {9858#true} is VALID [2020-07-08 23:37:50,389 INFO L280 TraceCheckUtils]: 3: Hoare triple {9858#true} SUMMARY for call #t~ret0.base, #t~ret0.offset := strncpy(~dest.base, ~dest.offset, ~src.base, ~src.offset, ~n); srcloc: L30-2 {9858#true} is VALID [2020-07-08 23:37:50,389 INFO L280 TraceCheckUtils]: 4: Hoare triple {9858#true} #res.base, #res.offset := #t~ret0.base, #t~ret0.offset; {9858#true} is VALID [2020-07-08 23:37:50,390 INFO L280 TraceCheckUtils]: 5: Hoare triple {9858#true} havoc #t~ret0.base, #t~ret0.offset; {9858#true} is VALID [2020-07-08 23:37:50,390 INFO L280 TraceCheckUtils]: 6: Hoare triple {9858#true} assume true; {9858#true} is VALID [2020-07-08 23:37:50,390 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {9858#true} {9859#false} #201#return; {9859#false} is VALID [2020-07-08 23:37:50,391 INFO L263 TraceCheckUtils]: 0: Hoare triple {9858#true} call ULTIMATE.init(); {9874#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 23:37:50,392 INFO L280 TraceCheckUtils]: 1: Hoare triple {9874#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {9858#true} is VALID [2020-07-08 23:37:50,392 INFO L280 TraceCheckUtils]: 2: Hoare triple {9858#true} #valid := #valid[0 := 0]; {9858#true} is VALID [2020-07-08 23:37:50,392 INFO L280 TraceCheckUtils]: 3: Hoare triple {9858#true} assume 0 < #StackHeapBarrier; {9858#true} is VALID [2020-07-08 23:37:50,392 INFO L280 TraceCheckUtils]: 4: Hoare triple {9858#true} assume true; {9858#true} is VALID [2020-07-08 23:37:50,393 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {9858#true} {9858#true} #205#return; {9858#true} is VALID [2020-07-08 23:37:50,393 INFO L263 TraceCheckUtils]: 6: Hoare triple {9858#true} call #t~ret21 := main(); {9858#true} is VALID [2020-07-08 23:37:50,393 INFO L280 TraceCheckUtils]: 7: Hoare triple {9858#true} SUMMARY for call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(9); srcloc: mainENTRY {9858#true} is VALID [2020-07-08 23:37:50,393 INFO L280 TraceCheckUtils]: 8: Hoare triple {9858#true} SUMMARY for call write~int(0, ~#A~0.base, 8 + ~#A~0.offset, 1); srcloc: L74 {9858#true} is VALID [2020-07-08 23:37:50,393 INFO L263 TraceCheckUtils]: 9: Hoare triple {9858#true} call #t~ret20 := parse_expression_list(~#A~0.base, ~#A~0.offset); {9858#true} is VALID [2020-07-08 23:37:50,394 INFO L280 TraceCheckUtils]: 10: Hoare triple {9858#true} ~str.base, ~str.offset := #in~str.base, #in~str.offset; {9858#true} is VALID [2020-07-08 23:37:50,394 INFO L280 TraceCheckUtils]: 11: Hoare triple {9858#true} ~start~0 := 0; {9858#true} is VALID [2020-07-08 23:37:50,394 INFO L280 TraceCheckUtils]: 12: Hoare triple {9858#true} ~i~0 := -1; {9858#true} is VALID [2020-07-08 23:37:50,394 INFO L280 TraceCheckUtils]: 13: Hoare triple {9858#true} ~j~0 := -1; {9858#true} is VALID [2020-07-08 23:37:50,395 INFO L280 TraceCheckUtils]: 14: Hoare triple {9858#true} SUMMARY for call ~#str2~0.base, ~#str2~0.offset := #Ultimate.allocOnStack(2); srcloc: L49 {9858#true} is VALID [2020-07-08 23:37:50,395 INFO L280 TraceCheckUtils]: 15: Hoare triple {9858#true} assume !(~str.base == 0 && ~str.offset == 0); {9858#true} is VALID [2020-07-08 23:37:50,395 INFO L280 TraceCheckUtils]: 16: Hoare triple {9858#true} #t~post2 := ~i~0; {9858#true} is VALID [2020-07-08 23:37:50,395 INFO L280 TraceCheckUtils]: 17: Hoare triple {9858#true} ~i~0 := 1 + #t~post2; {9858#true} is VALID [2020-07-08 23:37:50,395 INFO L280 TraceCheckUtils]: 18: Hoare triple {9858#true} havoc #t~post2; {9858#true} is VALID [2020-07-08 23:37:50,395 INFO L280 TraceCheckUtils]: 19: Hoare triple {9858#true} SUMMARY for call #t~mem3 := read~int(~str.base, ~str.offset + ~i~0, 1); srcloc: L53 {9858#true} is VALID [2020-07-08 23:37:50,396 INFO L280 TraceCheckUtils]: 20: Hoare triple {9858#true} #t~switch4 := 0 == #t~mem3; {9858#true} is VALID [2020-07-08 23:37:50,396 INFO L280 TraceCheckUtils]: 21: Hoare triple {9858#true} assume #t~switch4; {9858#true} is VALID [2020-07-08 23:37:50,418 INFO L280 TraceCheckUtils]: 22: Hoare triple {9858#true} SUMMARY for call #t~mem5 := read~int(~str.base, ~str.offset + ~start~0, 1); srcloc: L55-17 {9858#true} is VALID [2020-07-08 23:37:50,418 INFO L280 TraceCheckUtils]: 23: Hoare triple {9858#true} #t~short7 := 32 == #t~mem5; {9858#true} is VALID [2020-07-08 23:37:50,419 INFO L280 TraceCheckUtils]: 24: Hoare triple {9858#true} assume !#t~short7; {9858#true} is VALID [2020-07-08 23:37:50,419 INFO L280 TraceCheckUtils]: 25: Hoare triple {9858#true} SUMMARY for call #t~mem6 := read~int(~str.base, ~str.offset + ~start~0, 1); srcloc: L55-4 {9858#true} is VALID [2020-07-08 23:37:50,419 INFO L280 TraceCheckUtils]: 26: Hoare triple {9858#true} #t~short7 := 9 == #t~mem6; {9858#true} is VALID [2020-07-08 23:37:50,419 INFO L280 TraceCheckUtils]: 27: Hoare triple {9858#true} assume !#t~short7; {9858#true} is VALID [2020-07-08 23:37:50,419 INFO L280 TraceCheckUtils]: 28: Hoare triple {9858#true} havoc #t~mem5; {9858#true} is VALID [2020-07-08 23:37:50,419 INFO L280 TraceCheckUtils]: 29: Hoare triple {9858#true} havoc #t~mem6; {9858#true} is VALID [2020-07-08 23:37:50,420 INFO L280 TraceCheckUtils]: 30: Hoare triple {9858#true} havoc #t~short7; {9858#true} is VALID [2020-07-08 23:37:50,420 INFO L280 TraceCheckUtils]: 31: Hoare triple {9858#true} SUMMARY for call #t~mem9 := read~int(~str.base, ~str.offset + ~start~0, 1); srcloc: L55-18 {9858#true} is VALID [2020-07-08 23:37:50,420 INFO L280 TraceCheckUtils]: 32: Hoare triple {9858#true} assume !(34 == #t~mem9); {9858#true} is VALID [2020-07-08 23:37:50,420 INFO L280 TraceCheckUtils]: 33: Hoare triple {9858#true} havoc #t~mem9; {9858#true} is VALID [2020-07-08 23:37:50,420 INFO L280 TraceCheckUtils]: 34: Hoare triple {9858#true} ~j~0 := ~i~0 - 1; {9858#true} is VALID [2020-07-08 23:37:50,421 INFO L280 TraceCheckUtils]: 35: Hoare triple {9858#true} #t~short14 := 0 < ~j~0; {9858#true} is VALID [2020-07-08 23:37:50,421 INFO L280 TraceCheckUtils]: 36: Hoare triple {9858#true} assume !#t~short14; {9865#(not |parse_expression_list_#t~short14|)} is VALID [2020-07-08 23:37:50,422 INFO L280 TraceCheckUtils]: 37: Hoare triple {9865#(not |parse_expression_list_#t~short14|)} assume !!#t~short14; {9859#false} is VALID [2020-07-08 23:37:50,422 INFO L280 TraceCheckUtils]: 38: Hoare triple {9859#false} havoc #t~mem11; {9859#false} is VALID [2020-07-08 23:37:50,423 INFO L280 TraceCheckUtils]: 39: Hoare triple {9859#false} havoc #t~short13; {9859#false} is VALID [2020-07-08 23:37:50,423 INFO L280 TraceCheckUtils]: 40: Hoare triple {9859#false} havoc #t~short14; {9859#false} is VALID [2020-07-08 23:37:50,423 INFO L280 TraceCheckUtils]: 41: Hoare triple {9859#false} havoc #t~mem12; {9859#false} is VALID [2020-07-08 23:37:50,423 INFO L280 TraceCheckUtils]: 42: Hoare triple {9859#false} #t~post15 := ~j~0; {9859#false} is VALID [2020-07-08 23:37:50,423 INFO L280 TraceCheckUtils]: 43: Hoare triple {9859#false} ~j~0 := #t~post15 - 1; {9859#false} is VALID [2020-07-08 23:37:50,424 INFO L280 TraceCheckUtils]: 44: Hoare triple {9859#false} havoc #t~post15; {9859#false} is VALID [2020-07-08 23:37:50,424 INFO L280 TraceCheckUtils]: 45: Hoare triple {9859#false} #t~short14 := 0 < ~j~0; {9859#false} is VALID [2020-07-08 23:37:50,424 INFO L280 TraceCheckUtils]: 46: Hoare triple {9859#false} assume !#t~short14; {9859#false} is VALID [2020-07-08 23:37:50,424 INFO L280 TraceCheckUtils]: 47: Hoare triple {9859#false} assume !#t~short14; {9859#false} is VALID [2020-07-08 23:37:50,424 INFO L280 TraceCheckUtils]: 48: Hoare triple {9859#false} havoc #t~mem11; {9859#false} is VALID [2020-07-08 23:37:50,424 INFO L280 TraceCheckUtils]: 49: Hoare triple {9859#false} havoc #t~short13; {9859#false} is VALID [2020-07-08 23:37:50,425 INFO L280 TraceCheckUtils]: 50: Hoare triple {9859#false} havoc #t~short14; {9859#false} is VALID [2020-07-08 23:37:50,425 INFO L280 TraceCheckUtils]: 51: Hoare triple {9859#false} havoc #t~mem12; {9859#false} is VALID [2020-07-08 23:37:50,425 INFO L280 TraceCheckUtils]: 52: Hoare triple {9859#false} #t~short17 := 0 < ~j~0; {9859#false} is VALID [2020-07-08 23:37:50,425 INFO L280 TraceCheckUtils]: 53: Hoare triple {9859#false} assume !#t~short17; {9859#false} is VALID [2020-07-08 23:37:50,425 INFO L280 TraceCheckUtils]: 54: Hoare triple {9859#false} assume !#t~short17; {9859#false} is VALID [2020-07-08 23:37:50,426 INFO L280 TraceCheckUtils]: 55: Hoare triple {9859#false} havoc #t~short17; {9859#false} is VALID [2020-07-08 23:37:50,426 INFO L280 TraceCheckUtils]: 56: Hoare triple {9859#false} havoc #t~mem16; {9859#false} is VALID [2020-07-08 23:37:50,426 INFO L280 TraceCheckUtils]: 57: Hoare triple {9859#false} assume ~start~0 <= ~j~0; {9859#false} is VALID [2020-07-08 23:37:50,426 INFO L263 TraceCheckUtils]: 58: Hoare triple {9859#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)); {9858#true} is VALID [2020-07-08 23:37:50,426 INFO L280 TraceCheckUtils]: 59: Hoare triple {9858#true} ~dest.base, ~dest.offset := #in~dest.base, #in~dest.offset; {9858#true} is VALID [2020-07-08 23:37:50,427 INFO L280 TraceCheckUtils]: 60: Hoare triple {9858#true} ~src.base, ~src.offset := #in~src.base, #in~src.offset; {9858#true} is VALID [2020-07-08 23:37:50,427 INFO L280 TraceCheckUtils]: 61: Hoare triple {9858#true} ~n := #in~n; {9858#true} is VALID [2020-07-08 23:37:50,427 INFO L280 TraceCheckUtils]: 62: Hoare triple {9858#true} SUMMARY for call #t~ret0.base, #t~ret0.offset := strncpy(~dest.base, ~dest.offset, ~src.base, ~src.offset, ~n); srcloc: L30-2 {9858#true} is VALID [2020-07-08 23:37:50,427 INFO L280 TraceCheckUtils]: 63: Hoare triple {9858#true} #res.base, #res.offset := #t~ret0.base, #t~ret0.offset; {9858#true} is VALID [2020-07-08 23:37:50,427 INFO L280 TraceCheckUtils]: 64: Hoare triple {9858#true} havoc #t~ret0.base, #t~ret0.offset; {9858#true} is VALID [2020-07-08 23:37:50,428 INFO L280 TraceCheckUtils]: 65: Hoare triple {9858#true} assume true; {9858#true} is VALID [2020-07-08 23:37:50,428 INFO L275 TraceCheckUtils]: 66: Hoare quadruple {9858#true} {9859#false} #201#return; {9859#false} is VALID [2020-07-08 23:37:50,428 INFO L280 TraceCheckUtils]: 67: Hoare triple {9859#false} havoc #t~ret19.base, #t~ret19.offset; {9859#false} is VALID [2020-07-08 23:37:50,428 INFO L263 TraceCheckUtils]: 68: Hoare triple {9859#false} call __VERIFIER_assert((if 1 + (~j~0 - ~start~0) < 2 then 1 else 0)); {9859#false} is VALID [2020-07-08 23:37:50,428 INFO L280 TraceCheckUtils]: 69: Hoare triple {9859#false} ~cond := #in~cond; {9859#false} is VALID [2020-07-08 23:37:50,429 INFO L280 TraceCheckUtils]: 70: Hoare triple {9859#false} assume 0 == ~cond; {9859#false} is VALID [2020-07-08 23:37:50,429 INFO L280 TraceCheckUtils]: 71: Hoare triple {9859#false} assume !false; {9859#false} is VALID [2020-07-08 23:37:50,433 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 23:37:50,433 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [738336129] [2020-07-08 23:37:50,433 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 23:37:50,433 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-08 23:37:50,434 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553898747] [2020-07-08 23:37:50,435 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 72 [2020-07-08 23:37:50,435 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 23:37:50,435 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-08 23:37:50,505 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-08 23:37:50,505 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-08 23:37:50,506 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 23:37:50,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-08 23:37:50,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-08 23:37:50,506 INFO L87 Difference]: Start difference. First operand 136 states and 151 transitions. Second operand 4 states. [2020-07-08 23:37:50,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:37:50,982 INFO L93 Difference]: Finished difference Result 226 states and 251 transitions. [2020-07-08 23:37:50,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-08 23:37:50,982 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 72 [2020-07-08 23:37:50,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 23:37:50,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-08 23:37:50,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 208 transitions. [2020-07-08 23:37:50,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-08 23:37:50,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 208 transitions. [2020-07-08 23:37:50,986 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 208 transitions. [2020-07-08 23:37:51,168 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 208 edges. 208 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:37:51,171 INFO L225 Difference]: With dead ends: 226 [2020-07-08 23:37:51,171 INFO L226 Difference]: Without dead ends: 137 [2020-07-08 23:37:51,172 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-08 23:37:51,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2020-07-08 23:37:51,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2020-07-08 23:37:51,297 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 23:37:51,297 INFO L82 GeneralOperation]: Start isEquivalent. First operand 137 states. Second operand 137 states. [2020-07-08 23:37:51,297 INFO L74 IsIncluded]: Start isIncluded. First operand 137 states. Second operand 137 states. [2020-07-08 23:37:51,297 INFO L87 Difference]: Start difference. First operand 137 states. Second operand 137 states. [2020-07-08 23:37:51,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:37:51,303 INFO L93 Difference]: Finished difference Result 137 states and 151 transitions. [2020-07-08 23:37:51,303 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 151 transitions. [2020-07-08 23:37:51,303 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:37:51,304 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:37:51,304 INFO L74 IsIncluded]: Start isIncluded. First operand 137 states. Second operand 137 states. [2020-07-08 23:37:51,304 INFO L87 Difference]: Start difference. First operand 137 states. Second operand 137 states. [2020-07-08 23:37:51,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:37:51,308 INFO L93 Difference]: Finished difference Result 137 states and 151 transitions. [2020-07-08 23:37:51,308 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 151 transitions. [2020-07-08 23:37:51,308 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:37:51,309 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:37:51,309 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 23:37:51,309 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 23:37:51,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2020-07-08 23:37:51,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 151 transitions. [2020-07-08 23:37:51,313 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 151 transitions. Word has length 72 [2020-07-08 23:37:51,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 23:37:51,313 INFO L479 AbstractCegarLoop]: Abstraction has 137 states and 151 transitions. [2020-07-08 23:37:51,313 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-08 23:37:51,314 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 137 states and 151 transitions. [2020-07-08 23:37:51,467 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 151 edges. 151 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:37:51,468 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 151 transitions. [2020-07-08 23:37:51,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2020-07-08 23:37:51,469 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 23:37:51,469 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, 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-08 23:37:51,469 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-08 23:37:51,469 INFO L427 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 23:37:51,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 23:37:51,470 INFO L82 PathProgramCache]: Analyzing trace with hash 588909148, now seen corresponding path program 1 times [2020-07-08 23:37:51,470 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 23:37:51,470 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [997450200] [2020-07-08 23:37:51,470 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 23:37:51,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:37:51,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:37:51,697 INFO L280 TraceCheckUtils]: 0: Hoare triple {10900#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {10877#true} is VALID [2020-07-08 23:37:51,698 INFO L280 TraceCheckUtils]: 1: Hoare triple {10877#true} #valid := #valid[0 := 0]; {10877#true} is VALID [2020-07-08 23:37:51,698 INFO L280 TraceCheckUtils]: 2: Hoare triple {10877#true} assume 0 < #StackHeapBarrier; {10877#true} is VALID [2020-07-08 23:37:51,698 INFO L280 TraceCheckUtils]: 3: Hoare triple {10877#true} assume true; {10877#true} is VALID [2020-07-08 23:37:51,698 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {10877#true} {10877#true} #205#return; {10877#true} is VALID [2020-07-08 23:37:51,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:37:51,704 INFO L280 TraceCheckUtils]: 0: Hoare triple {10877#true} ~dest.base, ~dest.offset := #in~dest.base, #in~dest.offset; {10877#true} is VALID [2020-07-08 23:37:51,705 INFO L280 TraceCheckUtils]: 1: Hoare triple {10877#true} ~src.base, ~src.offset := #in~src.base, #in~src.offset; {10877#true} is VALID [2020-07-08 23:37:51,705 INFO L280 TraceCheckUtils]: 2: Hoare triple {10877#true} ~n := #in~n; {10877#true} is VALID [2020-07-08 23:37:51,705 INFO L280 TraceCheckUtils]: 3: Hoare triple {10877#true} SUMMARY for call #t~ret0.base, #t~ret0.offset := strncpy(~dest.base, ~dest.offset, ~src.base, ~src.offset, ~n); srcloc: L30-2 {10877#true} is VALID [2020-07-08 23:37:51,705 INFO L280 TraceCheckUtils]: 4: Hoare triple {10877#true} #res.base, #res.offset := #t~ret0.base, #t~ret0.offset; {10877#true} is VALID [2020-07-08 23:37:51,706 INFO L280 TraceCheckUtils]: 5: Hoare triple {10877#true} havoc #t~ret0.base, #t~ret0.offset; {10877#true} is VALID [2020-07-08 23:37:51,706 INFO L280 TraceCheckUtils]: 6: Hoare triple {10877#true} assume true; {10877#true} is VALID [2020-07-08 23:37:51,707 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {10877#true} {10889#(<= (+ parse_expression_list_~j~0 1) parse_expression_list_~start~0)} #201#return; {10889#(<= (+ parse_expression_list_~j~0 1) parse_expression_list_~start~0)} is VALID [2020-07-08 23:37:51,708 INFO L263 TraceCheckUtils]: 0: Hoare triple {10877#true} call ULTIMATE.init(); {10900#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 23:37:51,708 INFO L280 TraceCheckUtils]: 1: Hoare triple {10900#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {10877#true} is VALID [2020-07-08 23:37:51,708 INFO L280 TraceCheckUtils]: 2: Hoare triple {10877#true} #valid := #valid[0 := 0]; {10877#true} is VALID [2020-07-08 23:37:51,709 INFO L280 TraceCheckUtils]: 3: Hoare triple {10877#true} assume 0 < #StackHeapBarrier; {10877#true} is VALID [2020-07-08 23:37:51,709 INFO L280 TraceCheckUtils]: 4: Hoare triple {10877#true} assume true; {10877#true} is VALID [2020-07-08 23:37:51,709 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {10877#true} {10877#true} #205#return; {10877#true} is VALID [2020-07-08 23:37:51,709 INFO L263 TraceCheckUtils]: 6: Hoare triple {10877#true} call #t~ret21 := main(); {10877#true} is VALID [2020-07-08 23:37:51,709 INFO L280 TraceCheckUtils]: 7: Hoare triple {10877#true} SUMMARY for call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(9); srcloc: mainENTRY {10877#true} is VALID [2020-07-08 23:37:51,709 INFO L280 TraceCheckUtils]: 8: Hoare triple {10877#true} SUMMARY for call write~int(0, ~#A~0.base, 8 + ~#A~0.offset, 1); srcloc: L74 {10877#true} is VALID [2020-07-08 23:37:51,710 INFO L263 TraceCheckUtils]: 9: Hoare triple {10877#true} call #t~ret20 := parse_expression_list(~#A~0.base, ~#A~0.offset); {10877#true} is VALID [2020-07-08 23:37:51,710 INFO L280 TraceCheckUtils]: 10: Hoare triple {10877#true} ~str.base, ~str.offset := #in~str.base, #in~str.offset; {10877#true} is VALID [2020-07-08 23:37:51,710 INFO L280 TraceCheckUtils]: 11: Hoare triple {10877#true} ~start~0 := 0; {10884#(= 0 parse_expression_list_~start~0)} is VALID [2020-07-08 23:37:51,711 INFO L280 TraceCheckUtils]: 12: Hoare triple {10884#(= 0 parse_expression_list_~start~0)} ~i~0 := -1; {10884#(= 0 parse_expression_list_~start~0)} is VALID [2020-07-08 23:37:51,712 INFO L280 TraceCheckUtils]: 13: Hoare triple {10884#(= 0 parse_expression_list_~start~0)} ~j~0 := -1; {10884#(= 0 parse_expression_list_~start~0)} is VALID [2020-07-08 23:37:51,712 INFO L280 TraceCheckUtils]: 14: Hoare triple {10884#(= 0 parse_expression_list_~start~0)} SUMMARY for call ~#str2~0.base, ~#str2~0.offset := #Ultimate.allocOnStack(2); srcloc: L49 {10884#(= 0 parse_expression_list_~start~0)} is VALID [2020-07-08 23:37:51,713 INFO L280 TraceCheckUtils]: 15: Hoare triple {10884#(= 0 parse_expression_list_~start~0)} assume !(~str.base == 0 && ~str.offset == 0); {10884#(= 0 parse_expression_list_~start~0)} is VALID [2020-07-08 23:37:51,713 INFO L280 TraceCheckUtils]: 16: Hoare triple {10884#(= 0 parse_expression_list_~start~0)} #t~post2 := ~i~0; {10884#(= 0 parse_expression_list_~start~0)} is VALID [2020-07-08 23:37:51,714 INFO L280 TraceCheckUtils]: 17: Hoare triple {10884#(= 0 parse_expression_list_~start~0)} ~i~0 := 1 + #t~post2; {10884#(= 0 parse_expression_list_~start~0)} is VALID [2020-07-08 23:37:51,714 INFO L280 TraceCheckUtils]: 18: Hoare triple {10884#(= 0 parse_expression_list_~start~0)} havoc #t~post2; {10884#(= 0 parse_expression_list_~start~0)} is VALID [2020-07-08 23:37:51,715 INFO L280 TraceCheckUtils]: 19: Hoare triple {10884#(= 0 parse_expression_list_~start~0)} SUMMARY for call #t~mem3 := read~int(~str.base, ~str.offset + ~i~0, 1); srcloc: L53 {10884#(= 0 parse_expression_list_~start~0)} is VALID [2020-07-08 23:37:51,715 INFO L280 TraceCheckUtils]: 20: Hoare triple {10884#(= 0 parse_expression_list_~start~0)} #t~switch4 := 0 == #t~mem3; {10884#(= 0 parse_expression_list_~start~0)} is VALID [2020-07-08 23:37:51,716 INFO L280 TraceCheckUtils]: 21: Hoare triple {10884#(= 0 parse_expression_list_~start~0)} assume #t~switch4; {10884#(= 0 parse_expression_list_~start~0)} is VALID [2020-07-08 23:37:51,716 INFO L280 TraceCheckUtils]: 22: Hoare triple {10884#(= 0 parse_expression_list_~start~0)} SUMMARY for call #t~mem5 := read~int(~str.base, ~str.offset + ~start~0, 1); srcloc: L55-17 {10884#(= 0 parse_expression_list_~start~0)} is VALID [2020-07-08 23:37:51,717 INFO L280 TraceCheckUtils]: 23: Hoare triple {10884#(= 0 parse_expression_list_~start~0)} #t~short7 := 32 == #t~mem5; {10884#(= 0 parse_expression_list_~start~0)} is VALID [2020-07-08 23:37:51,717 INFO L280 TraceCheckUtils]: 24: Hoare triple {10884#(= 0 parse_expression_list_~start~0)} assume #t~short7; {10884#(= 0 parse_expression_list_~start~0)} is VALID [2020-07-08 23:37:51,718 INFO L280 TraceCheckUtils]: 25: Hoare triple {10884#(= 0 parse_expression_list_~start~0)} assume !!#t~short7; {10884#(= 0 parse_expression_list_~start~0)} is VALID [2020-07-08 23:37:51,718 INFO L280 TraceCheckUtils]: 26: Hoare triple {10884#(= 0 parse_expression_list_~start~0)} havoc #t~mem5; {10884#(= 0 parse_expression_list_~start~0)} is VALID [2020-07-08 23:37:51,719 INFO L280 TraceCheckUtils]: 27: Hoare triple {10884#(= 0 parse_expression_list_~start~0)} havoc #t~mem6; {10884#(= 0 parse_expression_list_~start~0)} is VALID [2020-07-08 23:37:51,719 INFO L280 TraceCheckUtils]: 28: Hoare triple {10884#(= 0 parse_expression_list_~start~0)} havoc #t~short7; {10884#(= 0 parse_expression_list_~start~0)} is VALID [2020-07-08 23:37:51,720 INFO L280 TraceCheckUtils]: 29: Hoare triple {10884#(= 0 parse_expression_list_~start~0)} #t~post8 := ~start~0; {10885#(= 0 |parse_expression_list_#t~post8|)} is VALID [2020-07-08 23:37:51,721 INFO L280 TraceCheckUtils]: 30: Hoare triple {10885#(= 0 |parse_expression_list_#t~post8|)} ~start~0 := 1 + #t~post8; {10886#(<= 1 parse_expression_list_~start~0)} is VALID [2020-07-08 23:37:51,721 INFO L280 TraceCheckUtils]: 31: Hoare triple {10886#(<= 1 parse_expression_list_~start~0)} havoc #t~post8; {10886#(<= 1 parse_expression_list_~start~0)} is VALID [2020-07-08 23:37:51,722 INFO L280 TraceCheckUtils]: 32: Hoare triple {10886#(<= 1 parse_expression_list_~start~0)} SUMMARY for call #t~mem5 := read~int(~str.base, ~str.offset + ~start~0, 1); srcloc: L55-17 {10886#(<= 1 parse_expression_list_~start~0)} is VALID [2020-07-08 23:37:51,722 INFO L280 TraceCheckUtils]: 33: Hoare triple {10886#(<= 1 parse_expression_list_~start~0)} #t~short7 := 32 == #t~mem5; {10886#(<= 1 parse_expression_list_~start~0)} is VALID [2020-07-08 23:37:51,723 INFO L280 TraceCheckUtils]: 34: Hoare triple {10886#(<= 1 parse_expression_list_~start~0)} assume !#t~short7; {10886#(<= 1 parse_expression_list_~start~0)} is VALID [2020-07-08 23:37:51,724 INFO L280 TraceCheckUtils]: 35: Hoare triple {10886#(<= 1 parse_expression_list_~start~0)} SUMMARY for call #t~mem6 := read~int(~str.base, ~str.offset + ~start~0, 1); srcloc: L55-4 {10886#(<= 1 parse_expression_list_~start~0)} is VALID [2020-07-08 23:37:51,724 INFO L280 TraceCheckUtils]: 36: Hoare triple {10886#(<= 1 parse_expression_list_~start~0)} #t~short7 := 9 == #t~mem6; {10886#(<= 1 parse_expression_list_~start~0)} is VALID [2020-07-08 23:37:51,745 INFO L280 TraceCheckUtils]: 37: Hoare triple {10886#(<= 1 parse_expression_list_~start~0)} assume !#t~short7; {10886#(<= 1 parse_expression_list_~start~0)} is VALID [2020-07-08 23:37:51,746 INFO L280 TraceCheckUtils]: 38: Hoare triple {10886#(<= 1 parse_expression_list_~start~0)} havoc #t~mem5; {10886#(<= 1 parse_expression_list_~start~0)} is VALID [2020-07-08 23:37:51,747 INFO L280 TraceCheckUtils]: 39: Hoare triple {10886#(<= 1 parse_expression_list_~start~0)} havoc #t~mem6; {10886#(<= 1 parse_expression_list_~start~0)} is VALID [2020-07-08 23:37:51,747 INFO L280 TraceCheckUtils]: 40: Hoare triple {10886#(<= 1 parse_expression_list_~start~0)} havoc #t~short7; {10886#(<= 1 parse_expression_list_~start~0)} is VALID [2020-07-08 23:37:51,748 INFO L280 TraceCheckUtils]: 41: Hoare triple {10886#(<= 1 parse_expression_list_~start~0)} SUMMARY for call #t~mem9 := read~int(~str.base, ~str.offset + ~start~0, 1); srcloc: L55-18 {10886#(<= 1 parse_expression_list_~start~0)} is VALID [2020-07-08 23:37:51,749 INFO L280 TraceCheckUtils]: 42: Hoare triple {10886#(<= 1 parse_expression_list_~start~0)} assume !(34 == #t~mem9); {10886#(<= 1 parse_expression_list_~start~0)} is VALID [2020-07-08 23:37:51,749 INFO L280 TraceCheckUtils]: 43: Hoare triple {10886#(<= 1 parse_expression_list_~start~0)} havoc #t~mem9; {10886#(<= 1 parse_expression_list_~start~0)} is VALID [2020-07-08 23:37:51,750 INFO L280 TraceCheckUtils]: 44: Hoare triple {10886#(<= 1 parse_expression_list_~start~0)} ~j~0 := ~i~0 - 1; {10886#(<= 1 parse_expression_list_~start~0)} is VALID [2020-07-08 23:37:51,751 INFO L280 TraceCheckUtils]: 45: Hoare triple {10886#(<= 1 parse_expression_list_~start~0)} #t~short14 := 0 < ~j~0; {10887#(and (or (<= parse_expression_list_~j~0 0) |parse_expression_list_#t~short14|) (or (<= 1 parse_expression_list_~start~0) (< 0 parse_expression_list_~j~0)))} is VALID [2020-07-08 23:37:51,751 INFO L280 TraceCheckUtils]: 46: Hoare triple {10887#(and (or (<= parse_expression_list_~j~0 0) |parse_expression_list_#t~short14|) (or (<= 1 parse_expression_list_~start~0) (< 0 parse_expression_list_~j~0)))} assume !#t~short14; {10888#(and (<= 1 parse_expression_list_~start~0) (<= parse_expression_list_~j~0 0))} is VALID [2020-07-08 23:37:51,752 INFO L280 TraceCheckUtils]: 47: Hoare triple {10888#(and (<= 1 parse_expression_list_~start~0) (<= parse_expression_list_~j~0 0))} assume !#t~short14; {10888#(and (<= 1 parse_expression_list_~start~0) (<= parse_expression_list_~j~0 0))} is VALID [2020-07-08 23:37:51,752 INFO L280 TraceCheckUtils]: 48: Hoare triple {10888#(and (<= 1 parse_expression_list_~start~0) (<= parse_expression_list_~j~0 0))} havoc #t~mem11; {10888#(and (<= 1 parse_expression_list_~start~0) (<= parse_expression_list_~j~0 0))} is VALID [2020-07-08 23:37:51,753 INFO L280 TraceCheckUtils]: 49: Hoare triple {10888#(and (<= 1 parse_expression_list_~start~0) (<= parse_expression_list_~j~0 0))} havoc #t~short13; {10888#(and (<= 1 parse_expression_list_~start~0) (<= parse_expression_list_~j~0 0))} is VALID [2020-07-08 23:37:51,754 INFO L280 TraceCheckUtils]: 50: Hoare triple {10888#(and (<= 1 parse_expression_list_~start~0) (<= parse_expression_list_~j~0 0))} havoc #t~short14; {10888#(and (<= 1 parse_expression_list_~start~0) (<= parse_expression_list_~j~0 0))} is VALID [2020-07-08 23:37:51,754 INFO L280 TraceCheckUtils]: 51: Hoare triple {10888#(and (<= 1 parse_expression_list_~start~0) (<= parse_expression_list_~j~0 0))} havoc #t~mem12; {10888#(and (<= 1 parse_expression_list_~start~0) (<= parse_expression_list_~j~0 0))} is VALID [2020-07-08 23:37:51,755 INFO L280 TraceCheckUtils]: 52: Hoare triple {10888#(and (<= 1 parse_expression_list_~start~0) (<= parse_expression_list_~j~0 0))} #t~short17 := 0 < ~j~0; {10889#(<= (+ parse_expression_list_~j~0 1) parse_expression_list_~start~0)} is VALID [2020-07-08 23:37:51,756 INFO L280 TraceCheckUtils]: 53: Hoare triple {10889#(<= (+ parse_expression_list_~j~0 1) parse_expression_list_~start~0)} assume !#t~short17; {10889#(<= (+ parse_expression_list_~j~0 1) parse_expression_list_~start~0)} is VALID [2020-07-08 23:37:51,756 INFO L280 TraceCheckUtils]: 54: Hoare triple {10889#(<= (+ parse_expression_list_~j~0 1) parse_expression_list_~start~0)} assume !#t~short17; {10889#(<= (+ parse_expression_list_~j~0 1) parse_expression_list_~start~0)} is VALID [2020-07-08 23:37:51,757 INFO L280 TraceCheckUtils]: 55: Hoare triple {10889#(<= (+ parse_expression_list_~j~0 1) parse_expression_list_~start~0)} havoc #t~short17; {10889#(<= (+ parse_expression_list_~j~0 1) parse_expression_list_~start~0)} is VALID [2020-07-08 23:37:51,757 INFO L280 TraceCheckUtils]: 56: Hoare triple {10889#(<= (+ parse_expression_list_~j~0 1) parse_expression_list_~start~0)} havoc #t~mem16; {10889#(<= (+ parse_expression_list_~j~0 1) parse_expression_list_~start~0)} is VALID [2020-07-08 23:37:51,758 INFO L280 TraceCheckUtils]: 57: Hoare triple {10889#(<= (+ parse_expression_list_~j~0 1) parse_expression_list_~start~0)} assume ~start~0 <= ~j~0; {10889#(<= (+ parse_expression_list_~j~0 1) parse_expression_list_~start~0)} is VALID [2020-07-08 23:37:51,758 INFO L263 TraceCheckUtils]: 58: Hoare triple {10889#(<= (+ parse_expression_list_~j~0 1) parse_expression_list_~start~0)} 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)); {10877#true} is VALID [2020-07-08 23:37:51,758 INFO L280 TraceCheckUtils]: 59: Hoare triple {10877#true} ~dest.base, ~dest.offset := #in~dest.base, #in~dest.offset; {10877#true} is VALID [2020-07-08 23:37:51,758 INFO L280 TraceCheckUtils]: 60: Hoare triple {10877#true} ~src.base, ~src.offset := #in~src.base, #in~src.offset; {10877#true} is VALID [2020-07-08 23:37:51,758 INFO L280 TraceCheckUtils]: 61: Hoare triple {10877#true} ~n := #in~n; {10877#true} is VALID [2020-07-08 23:37:51,759 INFO L280 TraceCheckUtils]: 62: Hoare triple {10877#true} SUMMARY for call #t~ret0.base, #t~ret0.offset := strncpy(~dest.base, ~dest.offset, ~src.base, ~src.offset, ~n); srcloc: L30-2 {10877#true} is VALID [2020-07-08 23:37:51,759 INFO L280 TraceCheckUtils]: 63: Hoare triple {10877#true} #res.base, #res.offset := #t~ret0.base, #t~ret0.offset; {10877#true} is VALID [2020-07-08 23:37:51,759 INFO L280 TraceCheckUtils]: 64: Hoare triple {10877#true} havoc #t~ret0.base, #t~ret0.offset; {10877#true} is VALID [2020-07-08 23:37:51,760 INFO L280 TraceCheckUtils]: 65: Hoare triple {10877#true} assume true; {10877#true} is VALID [2020-07-08 23:37:51,761 INFO L275 TraceCheckUtils]: 66: Hoare quadruple {10877#true} {10889#(<= (+ parse_expression_list_~j~0 1) parse_expression_list_~start~0)} #201#return; {10889#(<= (+ parse_expression_list_~j~0 1) parse_expression_list_~start~0)} is VALID [2020-07-08 23:37:51,761 INFO L280 TraceCheckUtils]: 67: Hoare triple {10889#(<= (+ parse_expression_list_~j~0 1) parse_expression_list_~start~0)} havoc #t~ret19.base, #t~ret19.offset; {10889#(<= (+ parse_expression_list_~j~0 1) parse_expression_list_~start~0)} is VALID [2020-07-08 23:37:51,762 INFO L263 TraceCheckUtils]: 68: Hoare triple {10889#(<= (+ parse_expression_list_~j~0 1) parse_expression_list_~start~0)} call __VERIFIER_assert((if 1 + (~j~0 - ~start~0) < 2 then 1 else 0)); {10898#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-08 23:37:51,763 INFO L280 TraceCheckUtils]: 69: Hoare triple {10898#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {10899#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-08 23:37:51,764 INFO L280 TraceCheckUtils]: 70: Hoare triple {10899#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {10878#false} is VALID [2020-07-08 23:37:51,764 INFO L280 TraceCheckUtils]: 71: Hoare triple {10878#false} assume !false; {10878#false} is VALID [2020-07-08 23:37:51,769 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-08 23:37:51,770 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [997450200] [2020-07-08 23:37:51,770 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-08 23:37:51,770 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-07-08 23:37:51,774 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616726965] [2020-07-08 23:37:51,774 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 72 [2020-07-08 23:37:51,775 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 23:37:51,775 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2020-07-08 23:37:51,854 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-08 23:37:51,854 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-08 23:37:51,855 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 23:37:51,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-08 23:37:51,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2020-07-08 23:37:51,855 INFO L87 Difference]: Start difference. First operand 137 states and 151 transitions. Second operand 11 states. [2020-07-08 23:37:54,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:37:54,333 INFO L93 Difference]: Finished difference Result 389 states and 436 transitions. [2020-07-08 23:37:54,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-07-08 23:37:54,334 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 72 [2020-07-08 23:37:54,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 23:37:54,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-08 23:37:54,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 376 transitions. [2020-07-08 23:37:54,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-08 23:37:54,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 376 transitions. [2020-07-08 23:37:54,347 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 376 transitions. [2020-07-08 23:37:54,889 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 376 edges. 376 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:37:54,902 INFO L225 Difference]: With dead ends: 389 [2020-07-08 23:37:54,902 INFO L226 Difference]: Without dead ends: 296 [2020-07-08 23:37:54,904 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2020-07-08 23:37:54,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2020-07-08 23:37:55,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 200. [2020-07-08 23:37:55,259 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 23:37:55,260 INFO L82 GeneralOperation]: Start isEquivalent. First operand 296 states. Second operand 200 states. [2020-07-08 23:37:55,260 INFO L74 IsIncluded]: Start isIncluded. First operand 296 states. Second operand 200 states. [2020-07-08 23:37:55,260 INFO L87 Difference]: Start difference. First operand 296 states. Second operand 200 states. [2020-07-08 23:37:55,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:37:55,276 INFO L93 Difference]: Finished difference Result 296 states and 332 transitions. [2020-07-08 23:37:55,277 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 332 transitions. [2020-07-08 23:37:55,278 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:37:55,278 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:37:55,279 INFO L74 IsIncluded]: Start isIncluded. First operand 200 states. Second operand 296 states. [2020-07-08 23:37:55,279 INFO L87 Difference]: Start difference. First operand 200 states. Second operand 296 states. [2020-07-08 23:37:55,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:37:55,296 INFO L93 Difference]: Finished difference Result 296 states and 332 transitions. [2020-07-08 23:37:55,296 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 332 transitions. [2020-07-08 23:37:55,297 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:37:55,298 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:37:55,298 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 23:37:55,298 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 23:37:55,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2020-07-08 23:37:55,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 223 transitions. [2020-07-08 23:37:55,306 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 223 transitions. Word has length 72 [2020-07-08 23:37:55,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 23:37:55,306 INFO L479 AbstractCegarLoop]: Abstraction has 200 states and 223 transitions. [2020-07-08 23:37:55,307 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-08 23:37:55,307 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 200 states and 223 transitions. [2020-07-08 23:37:55,684 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 223 edges. 223 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:37:55,684 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 223 transitions. [2020-07-08 23:37:55,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2020-07-08 23:37:55,686 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 23:37:55,686 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 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, 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-08 23:37:55,687 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-08 23:37:55,687 INFO L427 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 23:37:55,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 23:37:55,687 INFO L82 PathProgramCache]: Analyzing trace with hash 69190993, now seen corresponding path program 1 times [2020-07-08 23:37:55,687 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 23:37:55,688 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1688003709] [2020-07-08 23:37:55,688 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 23:37:55,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:37:55,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:37:55,841 INFO L280 TraceCheckUtils]: 0: Hoare triple {12707#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {12687#true} is VALID [2020-07-08 23:37:55,841 INFO L280 TraceCheckUtils]: 1: Hoare triple {12687#true} #valid := #valid[0 := 0]; {12687#true} is VALID [2020-07-08 23:37:55,841 INFO L280 TraceCheckUtils]: 2: Hoare triple {12687#true} assume 0 < #StackHeapBarrier; {12687#true} is VALID [2020-07-08 23:37:55,841 INFO L280 TraceCheckUtils]: 3: Hoare triple {12687#true} assume true; {12687#true} is VALID [2020-07-08 23:37:55,842 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {12687#true} {12687#true} #205#return; {12687#true} is VALID [2020-07-08 23:37:55,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:37:55,851 INFO L280 TraceCheckUtils]: 0: Hoare triple {12687#true} ~dest.base, ~dest.offset := #in~dest.base, #in~dest.offset; {12687#true} is VALID [2020-07-08 23:37:55,852 INFO L280 TraceCheckUtils]: 1: Hoare triple {12687#true} ~src.base, ~src.offset := #in~src.base, #in~src.offset; {12687#true} is VALID [2020-07-08 23:37:55,852 INFO L280 TraceCheckUtils]: 2: Hoare triple {12687#true} ~n := #in~n; {12687#true} is VALID [2020-07-08 23:37:55,852 INFO L280 TraceCheckUtils]: 3: Hoare triple {12687#true} SUMMARY for call #t~ret0.base, #t~ret0.offset := strncpy(~dest.base, ~dest.offset, ~src.base, ~src.offset, ~n); srcloc: L30-2 {12687#true} is VALID [2020-07-08 23:37:55,852 INFO L280 TraceCheckUtils]: 4: Hoare triple {12687#true} #res.base, #res.offset := #t~ret0.base, #t~ret0.offset; {12687#true} is VALID [2020-07-08 23:37:55,852 INFO L280 TraceCheckUtils]: 5: Hoare triple {12687#true} havoc #t~ret0.base, #t~ret0.offset; {12687#true} is VALID [2020-07-08 23:37:55,853 INFO L280 TraceCheckUtils]: 6: Hoare triple {12687#true} assume true; {12687#true} is VALID [2020-07-08 23:37:55,854 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {12687#true} {12696#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~j~0 0))} #201#return; {12696#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~j~0 0))} is VALID [2020-07-08 23:37:55,856 INFO L263 TraceCheckUtils]: 0: Hoare triple {12687#true} call ULTIMATE.init(); {12707#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 23:37:55,856 INFO L280 TraceCheckUtils]: 1: Hoare triple {12707#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {12687#true} is VALID [2020-07-08 23:37:55,856 INFO L280 TraceCheckUtils]: 2: Hoare triple {12687#true} #valid := #valid[0 := 0]; {12687#true} is VALID [2020-07-08 23:37:55,856 INFO L280 TraceCheckUtils]: 3: Hoare triple {12687#true} assume 0 < #StackHeapBarrier; {12687#true} is VALID [2020-07-08 23:37:55,856 INFO L280 TraceCheckUtils]: 4: Hoare triple {12687#true} assume true; {12687#true} is VALID [2020-07-08 23:37:55,857 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {12687#true} {12687#true} #205#return; {12687#true} is VALID [2020-07-08 23:37:55,857 INFO L263 TraceCheckUtils]: 6: Hoare triple {12687#true} call #t~ret21 := main(); {12687#true} is VALID [2020-07-08 23:37:55,857 INFO L280 TraceCheckUtils]: 7: Hoare triple {12687#true} SUMMARY for call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(9); srcloc: mainENTRY {12687#true} is VALID [2020-07-08 23:37:55,857 INFO L280 TraceCheckUtils]: 8: Hoare triple {12687#true} SUMMARY for call write~int(0, ~#A~0.base, 8 + ~#A~0.offset, 1); srcloc: L74 {12687#true} is VALID [2020-07-08 23:37:55,857 INFO L263 TraceCheckUtils]: 9: Hoare triple {12687#true} call #t~ret20 := parse_expression_list(~#A~0.base, ~#A~0.offset); {12687#true} is VALID [2020-07-08 23:37:55,858 INFO L280 TraceCheckUtils]: 10: Hoare triple {12687#true} ~str.base, ~str.offset := #in~str.base, #in~str.offset; {12687#true} is VALID [2020-07-08 23:37:55,858 INFO L280 TraceCheckUtils]: 11: Hoare triple {12687#true} ~start~0 := 0; {12694#(= 0 parse_expression_list_~start~0)} is VALID [2020-07-08 23:37:55,859 INFO L280 TraceCheckUtils]: 12: Hoare triple {12694#(= 0 parse_expression_list_~start~0)} ~i~0 := -1; {12694#(= 0 parse_expression_list_~start~0)} is VALID [2020-07-08 23:37:55,859 INFO L280 TraceCheckUtils]: 13: Hoare triple {12694#(= 0 parse_expression_list_~start~0)} ~j~0 := -1; {12694#(= 0 parse_expression_list_~start~0)} is VALID [2020-07-08 23:37:55,860 INFO L280 TraceCheckUtils]: 14: Hoare triple {12694#(= 0 parse_expression_list_~start~0)} SUMMARY for call ~#str2~0.base, ~#str2~0.offset := #Ultimate.allocOnStack(2); srcloc: L49 {12694#(= 0 parse_expression_list_~start~0)} is VALID [2020-07-08 23:37:55,860 INFO L280 TraceCheckUtils]: 15: Hoare triple {12694#(= 0 parse_expression_list_~start~0)} assume !(~str.base == 0 && ~str.offset == 0); {12694#(= 0 parse_expression_list_~start~0)} is VALID [2020-07-08 23:37:55,861 INFO L280 TraceCheckUtils]: 16: Hoare triple {12694#(= 0 parse_expression_list_~start~0)} #t~post2 := ~i~0; {12694#(= 0 parse_expression_list_~start~0)} is VALID [2020-07-08 23:37:55,862 INFO L280 TraceCheckUtils]: 17: Hoare triple {12694#(= 0 parse_expression_list_~start~0)} ~i~0 := 1 + #t~post2; {12694#(= 0 parse_expression_list_~start~0)} is VALID [2020-07-08 23:37:55,862 INFO L280 TraceCheckUtils]: 18: Hoare triple {12694#(= 0 parse_expression_list_~start~0)} havoc #t~post2; {12694#(= 0 parse_expression_list_~start~0)} is VALID [2020-07-08 23:37:55,863 INFO L280 TraceCheckUtils]: 19: Hoare triple {12694#(= 0 parse_expression_list_~start~0)} SUMMARY for call #t~mem3 := read~int(~str.base, ~str.offset + ~i~0, 1); srcloc: L53 {12694#(= 0 parse_expression_list_~start~0)} is VALID [2020-07-08 23:37:55,863 INFO L280 TraceCheckUtils]: 20: Hoare triple {12694#(= 0 parse_expression_list_~start~0)} #t~switch4 := 0 == #t~mem3; {12694#(= 0 parse_expression_list_~start~0)} is VALID [2020-07-08 23:37:55,864 INFO L280 TraceCheckUtils]: 21: Hoare triple {12694#(= 0 parse_expression_list_~start~0)} assume !#t~switch4; {12694#(= 0 parse_expression_list_~start~0)} is VALID [2020-07-08 23:37:55,864 INFO L280 TraceCheckUtils]: 22: Hoare triple {12694#(= 0 parse_expression_list_~start~0)} havoc #t~mem3; {12694#(= 0 parse_expression_list_~start~0)} is VALID [2020-07-08 23:37:55,865 INFO L280 TraceCheckUtils]: 23: Hoare triple {12694#(= 0 parse_expression_list_~start~0)} havoc #t~switch4; {12694#(= 0 parse_expression_list_~start~0)} is VALID [2020-07-08 23:37:55,865 INFO L280 TraceCheckUtils]: 24: Hoare triple {12694#(= 0 parse_expression_list_~start~0)} SUMMARY for call #t~mem1 := read~int(~str.base, ~str.offset + ~i~0, 1); srcloc: L51-1 {12694#(= 0 parse_expression_list_~start~0)} is VALID [2020-07-08 23:37:55,866 INFO L280 TraceCheckUtils]: 25: Hoare triple {12694#(= 0 parse_expression_list_~start~0)} assume !!(0 != #t~mem1); {12694#(= 0 parse_expression_list_~start~0)} is VALID [2020-07-08 23:37:55,866 INFO L280 TraceCheckUtils]: 26: Hoare triple {12694#(= 0 parse_expression_list_~start~0)} havoc #t~mem1; {12694#(= 0 parse_expression_list_~start~0)} is VALID [2020-07-08 23:37:55,867 INFO L280 TraceCheckUtils]: 27: Hoare triple {12694#(= 0 parse_expression_list_~start~0)} #t~post2 := ~i~0; {12694#(= 0 parse_expression_list_~start~0)} is VALID [2020-07-08 23:37:55,867 INFO L280 TraceCheckUtils]: 28: Hoare triple {12694#(= 0 parse_expression_list_~start~0)} ~i~0 := 1 + #t~post2; {12694#(= 0 parse_expression_list_~start~0)} is VALID [2020-07-08 23:37:55,868 INFO L280 TraceCheckUtils]: 29: Hoare triple {12694#(= 0 parse_expression_list_~start~0)} havoc #t~post2; {12694#(= 0 parse_expression_list_~start~0)} is VALID [2020-07-08 23:37:55,868 INFO L280 TraceCheckUtils]: 30: Hoare triple {12694#(= 0 parse_expression_list_~start~0)} SUMMARY for call #t~mem3 := read~int(~str.base, ~str.offset + ~i~0, 1); srcloc: L53 {12694#(= 0 parse_expression_list_~start~0)} is VALID [2020-07-08 23:37:55,869 INFO L280 TraceCheckUtils]: 31: Hoare triple {12694#(= 0 parse_expression_list_~start~0)} #t~switch4 := 0 == #t~mem3; {12694#(= 0 parse_expression_list_~start~0)} is VALID [2020-07-08 23:37:55,869 INFO L280 TraceCheckUtils]: 32: Hoare triple {12694#(= 0 parse_expression_list_~start~0)} assume #t~switch4; {12694#(= 0 parse_expression_list_~start~0)} is VALID [2020-07-08 23:37:55,870 INFO L280 TraceCheckUtils]: 33: Hoare triple {12694#(= 0 parse_expression_list_~start~0)} SUMMARY for call #t~mem5 := read~int(~str.base, ~str.offset + ~start~0, 1); srcloc: L55-17 {12694#(= 0 parse_expression_list_~start~0)} is VALID [2020-07-08 23:37:55,870 INFO L280 TraceCheckUtils]: 34: Hoare triple {12694#(= 0 parse_expression_list_~start~0)} #t~short7 := 32 == #t~mem5; {12694#(= 0 parse_expression_list_~start~0)} is VALID [2020-07-08 23:37:55,871 INFO L280 TraceCheckUtils]: 35: Hoare triple {12694#(= 0 parse_expression_list_~start~0)} assume !#t~short7; {12694#(= 0 parse_expression_list_~start~0)} is VALID [2020-07-08 23:37:55,871 INFO L280 TraceCheckUtils]: 36: Hoare triple {12694#(= 0 parse_expression_list_~start~0)} SUMMARY for call #t~mem6 := read~int(~str.base, ~str.offset + ~start~0, 1); srcloc: L55-4 {12694#(= 0 parse_expression_list_~start~0)} is VALID [2020-07-08 23:37:55,872 INFO L280 TraceCheckUtils]: 37: Hoare triple {12694#(= 0 parse_expression_list_~start~0)} #t~short7 := 9 == #t~mem6; {12694#(= 0 parse_expression_list_~start~0)} is VALID [2020-07-08 23:37:55,872 INFO L280 TraceCheckUtils]: 38: Hoare triple {12694#(= 0 parse_expression_list_~start~0)} assume !#t~short7; {12694#(= 0 parse_expression_list_~start~0)} is VALID [2020-07-08 23:37:55,873 INFO L280 TraceCheckUtils]: 39: Hoare triple {12694#(= 0 parse_expression_list_~start~0)} havoc #t~mem5; {12694#(= 0 parse_expression_list_~start~0)} is VALID [2020-07-08 23:37:55,873 INFO L280 TraceCheckUtils]: 40: Hoare triple {12694#(= 0 parse_expression_list_~start~0)} havoc #t~mem6; {12694#(= 0 parse_expression_list_~start~0)} is VALID [2020-07-08 23:37:55,874 INFO L280 TraceCheckUtils]: 41: Hoare triple {12694#(= 0 parse_expression_list_~start~0)} havoc #t~short7; {12694#(= 0 parse_expression_list_~start~0)} is VALID [2020-07-08 23:37:55,875 INFO L280 TraceCheckUtils]: 42: Hoare triple {12694#(= 0 parse_expression_list_~start~0)} SUMMARY for call #t~mem9 := read~int(~str.base, ~str.offset + ~start~0, 1); srcloc: L55-18 {12694#(= 0 parse_expression_list_~start~0)} is VALID [2020-07-08 23:37:55,875 INFO L280 TraceCheckUtils]: 43: Hoare triple {12694#(= 0 parse_expression_list_~start~0)} assume !(34 == #t~mem9); {12694#(= 0 parse_expression_list_~start~0)} is VALID [2020-07-08 23:37:55,876 INFO L280 TraceCheckUtils]: 44: Hoare triple {12694#(= 0 parse_expression_list_~start~0)} havoc #t~mem9; {12694#(= 0 parse_expression_list_~start~0)} is VALID [2020-07-08 23:37:55,876 INFO L280 TraceCheckUtils]: 45: Hoare triple {12694#(= 0 parse_expression_list_~start~0)} ~j~0 := ~i~0 - 1; {12694#(= 0 parse_expression_list_~start~0)} is VALID [2020-07-08 23:37:55,877 INFO L280 TraceCheckUtils]: 46: Hoare triple {12694#(= 0 parse_expression_list_~start~0)} #t~short14 := 0 < ~j~0; {12695#(and (or (<= parse_expression_list_~j~0 0) |parse_expression_list_#t~short14|) (= 0 parse_expression_list_~start~0))} is VALID [2020-07-08 23:37:55,878 INFO L280 TraceCheckUtils]: 47: Hoare triple {12695#(and (or (<= parse_expression_list_~j~0 0) |parse_expression_list_#t~short14|) (= 0 parse_expression_list_~start~0))} assume !#t~short14; {12696#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~j~0 0))} is VALID [2020-07-08 23:37:55,878 INFO L280 TraceCheckUtils]: 48: Hoare triple {12696#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~j~0 0))} assume !#t~short14; {12696#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~j~0 0))} is VALID [2020-07-08 23:37:55,879 INFO L280 TraceCheckUtils]: 49: Hoare triple {12696#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~j~0 0))} havoc #t~mem11; {12696#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~j~0 0))} is VALID [2020-07-08 23:37:55,880 INFO L280 TraceCheckUtils]: 50: Hoare triple {12696#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~j~0 0))} havoc #t~short13; {12696#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~j~0 0))} is VALID [2020-07-08 23:37:55,880 INFO L280 TraceCheckUtils]: 51: Hoare triple {12696#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~j~0 0))} havoc #t~short14; {12696#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~j~0 0))} is VALID [2020-07-08 23:37:55,881 INFO L280 TraceCheckUtils]: 52: Hoare triple {12696#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~j~0 0))} havoc #t~mem12; {12696#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~j~0 0))} is VALID [2020-07-08 23:37:55,882 INFO L280 TraceCheckUtils]: 53: Hoare triple {12696#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~j~0 0))} #t~short17 := 0 < ~j~0; {12696#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~j~0 0))} is VALID [2020-07-08 23:37:55,883 INFO L280 TraceCheckUtils]: 54: Hoare triple {12696#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~j~0 0))} assume !#t~short17; {12696#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~j~0 0))} is VALID [2020-07-08 23:37:55,883 INFO L280 TraceCheckUtils]: 55: Hoare triple {12696#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~j~0 0))} assume !#t~short17; {12696#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~j~0 0))} is VALID [2020-07-08 23:37:55,884 INFO L280 TraceCheckUtils]: 56: Hoare triple {12696#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~j~0 0))} havoc #t~short17; {12696#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~j~0 0))} is VALID [2020-07-08 23:37:55,885 INFO L280 TraceCheckUtils]: 57: Hoare triple {12696#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~j~0 0))} havoc #t~mem16; {12696#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~j~0 0))} is VALID [2020-07-08 23:37:55,885 INFO L280 TraceCheckUtils]: 58: Hoare triple {12696#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~j~0 0))} assume ~start~0 <= ~j~0; {12696#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~j~0 0))} is VALID [2020-07-08 23:37:55,885 INFO L263 TraceCheckUtils]: 59: Hoare triple {12696#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~j~0 0))} 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)); {12687#true} is VALID [2020-07-08 23:37:55,886 INFO L280 TraceCheckUtils]: 60: Hoare triple {12687#true} ~dest.base, ~dest.offset := #in~dest.base, #in~dest.offset; {12687#true} is VALID [2020-07-08 23:37:55,886 INFO L280 TraceCheckUtils]: 61: Hoare triple {12687#true} ~src.base, ~src.offset := #in~src.base, #in~src.offset; {12687#true} is VALID [2020-07-08 23:37:55,886 INFO L280 TraceCheckUtils]: 62: Hoare triple {12687#true} ~n := #in~n; {12687#true} is VALID [2020-07-08 23:37:55,886 INFO L280 TraceCheckUtils]: 63: Hoare triple {12687#true} SUMMARY for call #t~ret0.base, #t~ret0.offset := strncpy(~dest.base, ~dest.offset, ~src.base, ~src.offset, ~n); srcloc: L30-2 {12687#true} is VALID [2020-07-08 23:37:55,886 INFO L280 TraceCheckUtils]: 64: Hoare triple {12687#true} #res.base, #res.offset := #t~ret0.base, #t~ret0.offset; {12687#true} is VALID [2020-07-08 23:37:55,887 INFO L280 TraceCheckUtils]: 65: Hoare triple {12687#true} havoc #t~ret0.base, #t~ret0.offset; {12687#true} is VALID [2020-07-08 23:37:55,887 INFO L280 TraceCheckUtils]: 66: Hoare triple {12687#true} assume true; {12687#true} is VALID [2020-07-08 23:37:55,888 INFO L275 TraceCheckUtils]: 67: Hoare quadruple {12687#true} {12696#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~j~0 0))} #201#return; {12696#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~j~0 0))} is VALID [2020-07-08 23:37:55,889 INFO L280 TraceCheckUtils]: 68: Hoare triple {12696#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~j~0 0))} havoc #t~ret19.base, #t~ret19.offset; {12696#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~j~0 0))} is VALID [2020-07-08 23:37:55,890 INFO L263 TraceCheckUtils]: 69: Hoare triple {12696#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~j~0 0))} call __VERIFIER_assert((if 1 + (~j~0 - ~start~0) < 2 then 1 else 0)); {12705#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-08 23:37:55,890 INFO L280 TraceCheckUtils]: 70: Hoare triple {12705#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {12706#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-08 23:37:55,891 INFO L280 TraceCheckUtils]: 71: Hoare triple {12706#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {12688#false} is VALID [2020-07-08 23:37:55,891 INFO L280 TraceCheckUtils]: 72: Hoare triple {12688#false} assume !false; {12688#false} is VALID [2020-07-08 23:37:55,901 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-07-08 23:37:55,902 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1688003709] [2020-07-08 23:37:55,902 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 23:37:55,902 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-07-08 23:37:55,903 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050754441] [2020-07-08 23:37:55,903 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 73 [2020-07-08 23:37:55,904 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 23:37:55,904 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-08 23:37:55,986 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:37:55,987 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-08 23:37:55,987 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 23:37:55,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-08 23:37:55,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-07-08 23:37:55,988 INFO L87 Difference]: Start difference. First operand 200 states and 223 transitions. Second operand 8 states. [2020-07-08 23:37:57,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:37:57,303 INFO L93 Difference]: Finished difference Result 288 states and 323 transitions. [2020-07-08 23:37:57,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-08 23:37:57,304 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 73 [2020-07-08 23:37:57,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 23:37:57,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-08 23:37:57,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 223 transitions. [2020-07-08 23:37:57,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-08 23:37:57,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 223 transitions. [2020-07-08 23:37:57,309 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 223 transitions. [2020-07-08 23:37:57,548 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 223 edges. 223 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:37:57,556 INFO L225 Difference]: With dead ends: 288 [2020-07-08 23:37:57,556 INFO L226 Difference]: Without dead ends: 286 [2020-07-08 23:37:57,557 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2020-07-08 23:37:57,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2020-07-08 23:37:57,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 254. [2020-07-08 23:37:57,956 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 23:37:57,956 INFO L82 GeneralOperation]: Start isEquivalent. First operand 286 states. Second operand 254 states. [2020-07-08 23:37:57,957 INFO L74 IsIncluded]: Start isIncluded. First operand 286 states. Second operand 254 states. [2020-07-08 23:37:57,957 INFO L87 Difference]: Start difference. First operand 286 states. Second operand 254 states. [2020-07-08 23:37:57,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:37:57,969 INFO L93 Difference]: Finished difference Result 286 states and 321 transitions. [2020-07-08 23:37:57,969 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 321 transitions. [2020-07-08 23:37:57,970 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:37:57,971 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:37:57,971 INFO L74 IsIncluded]: Start isIncluded. First operand 254 states. Second operand 286 states. [2020-07-08 23:37:57,971 INFO L87 Difference]: Start difference. First operand 254 states. Second operand 286 states. [2020-07-08 23:37:57,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:37:57,981 INFO L93 Difference]: Finished difference Result 286 states and 321 transitions. [2020-07-08 23:37:57,981 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 321 transitions. [2020-07-08 23:37:57,982 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:37:57,982 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:37:57,982 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 23:37:57,982 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 23:37:57,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2020-07-08 23:37:57,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 285 transitions. [2020-07-08 23:37:57,990 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 285 transitions. Word has length 73 [2020-07-08 23:37:57,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 23:37:57,990 INFO L479 AbstractCegarLoop]: Abstraction has 254 states and 285 transitions. [2020-07-08 23:37:57,990 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-08 23:37:57,990 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 254 states and 285 transitions. [2020-07-08 23:37:58,299 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 285 edges. 285 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:37:58,299 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 285 transitions. [2020-07-08 23:37:58,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2020-07-08 23:37:58,300 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 23:37:58,301 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, 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-08 23:37:58,301 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-07-08 23:37:58,301 INFO L427 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 23:37:58,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 23:37:58,301 INFO L82 PathProgramCache]: Analyzing trace with hash 1474625812, now seen corresponding path program 1 times [2020-07-08 23:37:58,301 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 23:37:58,302 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [804551834] [2020-07-08 23:37:58,302 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 23:37:58,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:37:58,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:37:58,485 INFO L280 TraceCheckUtils]: 0: Hoare triple {14401#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {14376#true} is VALID [2020-07-08 23:37:58,486 INFO L280 TraceCheckUtils]: 1: Hoare triple {14376#true} #valid := #valid[0 := 0]; {14376#true} is VALID [2020-07-08 23:37:58,486 INFO L280 TraceCheckUtils]: 2: Hoare triple {14376#true} assume 0 < #StackHeapBarrier; {14376#true} is VALID [2020-07-08 23:37:58,486 INFO L280 TraceCheckUtils]: 3: Hoare triple {14376#true} assume true; {14376#true} is VALID [2020-07-08 23:37:58,486 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {14376#true} {14376#true} #205#return; {14376#true} is VALID [2020-07-08 23:37:58,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:37:58,491 INFO L280 TraceCheckUtils]: 0: Hoare triple {14376#true} ~dest.base, ~dest.offset := #in~dest.base, #in~dest.offset; {14376#true} is VALID [2020-07-08 23:37:58,491 INFO L280 TraceCheckUtils]: 1: Hoare triple {14376#true} ~src.base, ~src.offset := #in~src.base, #in~src.offset; {14376#true} is VALID [2020-07-08 23:37:58,491 INFO L280 TraceCheckUtils]: 2: Hoare triple {14376#true} ~n := #in~n; {14376#true} is VALID [2020-07-08 23:37:58,491 INFO L280 TraceCheckUtils]: 3: Hoare triple {14376#true} SUMMARY for call #t~ret0.base, #t~ret0.offset := strncpy(~dest.base, ~dest.offset, ~src.base, ~src.offset, ~n); srcloc: L30-2 {14376#true} is VALID [2020-07-08 23:37:58,491 INFO L280 TraceCheckUtils]: 4: Hoare triple {14376#true} #res.base, #res.offset := #t~ret0.base, #t~ret0.offset; {14376#true} is VALID [2020-07-08 23:37:58,492 INFO L280 TraceCheckUtils]: 5: Hoare triple {14376#true} havoc #t~ret0.base, #t~ret0.offset; {14376#true} is VALID [2020-07-08 23:37:58,492 INFO L280 TraceCheckUtils]: 6: Hoare triple {14376#true} assume true; {14376#true} is VALID [2020-07-08 23:37:58,493 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {14376#true} {14390#(<= (+ parse_expression_list_~j~0 2) parse_expression_list_~start~0)} #201#return; {14390#(<= (+ parse_expression_list_~j~0 2) parse_expression_list_~start~0)} is VALID [2020-07-08 23:37:58,494 INFO L263 TraceCheckUtils]: 0: Hoare triple {14376#true} call ULTIMATE.init(); {14401#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 23:37:58,494 INFO L280 TraceCheckUtils]: 1: Hoare triple {14401#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {14376#true} is VALID [2020-07-08 23:37:58,494 INFO L280 TraceCheckUtils]: 2: Hoare triple {14376#true} #valid := #valid[0 := 0]; {14376#true} is VALID [2020-07-08 23:37:58,494 INFO L280 TraceCheckUtils]: 3: Hoare triple {14376#true} assume 0 < #StackHeapBarrier; {14376#true} is VALID [2020-07-08 23:37:58,495 INFO L280 TraceCheckUtils]: 4: Hoare triple {14376#true} assume true; {14376#true} is VALID [2020-07-08 23:37:58,495 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {14376#true} {14376#true} #205#return; {14376#true} is VALID [2020-07-08 23:37:58,495 INFO L263 TraceCheckUtils]: 6: Hoare triple {14376#true} call #t~ret21 := main(); {14376#true} is VALID [2020-07-08 23:37:58,495 INFO L280 TraceCheckUtils]: 7: Hoare triple {14376#true} SUMMARY for call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(9); srcloc: mainENTRY {14376#true} is VALID [2020-07-08 23:37:58,495 INFO L280 TraceCheckUtils]: 8: Hoare triple {14376#true} SUMMARY for call write~int(0, ~#A~0.base, 8 + ~#A~0.offset, 1); srcloc: L74 {14376#true} is VALID [2020-07-08 23:37:58,495 INFO L263 TraceCheckUtils]: 9: Hoare triple {14376#true} call #t~ret20 := parse_expression_list(~#A~0.base, ~#A~0.offset); {14376#true} is VALID [2020-07-08 23:37:58,496 INFO L280 TraceCheckUtils]: 10: Hoare triple {14376#true} ~str.base, ~str.offset := #in~str.base, #in~str.offset; {14376#true} is VALID [2020-07-08 23:37:58,496 INFO L280 TraceCheckUtils]: 11: Hoare triple {14376#true} ~start~0 := 0; {14383#(= 0 parse_expression_list_~start~0)} is VALID [2020-07-08 23:37:58,497 INFO L280 TraceCheckUtils]: 12: Hoare triple {14383#(= 0 parse_expression_list_~start~0)} ~i~0 := -1; {14383#(= 0 parse_expression_list_~start~0)} is VALID [2020-07-08 23:37:58,497 INFO L280 TraceCheckUtils]: 13: Hoare triple {14383#(= 0 parse_expression_list_~start~0)} ~j~0 := -1; {14383#(= 0 parse_expression_list_~start~0)} is VALID [2020-07-08 23:37:58,498 INFO L280 TraceCheckUtils]: 14: Hoare triple {14383#(= 0 parse_expression_list_~start~0)} SUMMARY for call ~#str2~0.base, ~#str2~0.offset := #Ultimate.allocOnStack(2); srcloc: L49 {14383#(= 0 parse_expression_list_~start~0)} is VALID [2020-07-08 23:37:58,498 INFO L280 TraceCheckUtils]: 15: Hoare triple {14383#(= 0 parse_expression_list_~start~0)} assume !(~str.base == 0 && ~str.offset == 0); {14383#(= 0 parse_expression_list_~start~0)} is VALID [2020-07-08 23:37:58,499 INFO L280 TraceCheckUtils]: 16: Hoare triple {14383#(= 0 parse_expression_list_~start~0)} #t~post2 := ~i~0; {14383#(= 0 parse_expression_list_~start~0)} is VALID [2020-07-08 23:37:58,499 INFO L280 TraceCheckUtils]: 17: Hoare triple {14383#(= 0 parse_expression_list_~start~0)} ~i~0 := 1 + #t~post2; {14383#(= 0 parse_expression_list_~start~0)} is VALID [2020-07-08 23:37:58,500 INFO L280 TraceCheckUtils]: 18: Hoare triple {14383#(= 0 parse_expression_list_~start~0)} havoc #t~post2; {14383#(= 0 parse_expression_list_~start~0)} is VALID [2020-07-08 23:37:58,500 INFO L280 TraceCheckUtils]: 19: Hoare triple {14383#(= 0 parse_expression_list_~start~0)} SUMMARY for call #t~mem3 := read~int(~str.base, ~str.offset + ~i~0, 1); srcloc: L53 {14383#(= 0 parse_expression_list_~start~0)} is VALID [2020-07-08 23:37:58,501 INFO L280 TraceCheckUtils]: 20: Hoare triple {14383#(= 0 parse_expression_list_~start~0)} #t~switch4 := 0 == #t~mem3; {14383#(= 0 parse_expression_list_~start~0)} is VALID [2020-07-08 23:37:58,501 INFO L280 TraceCheckUtils]: 21: Hoare triple {14383#(= 0 parse_expression_list_~start~0)} assume #t~switch4; {14383#(= 0 parse_expression_list_~start~0)} is VALID [2020-07-08 23:37:58,502 INFO L280 TraceCheckUtils]: 22: Hoare triple {14383#(= 0 parse_expression_list_~start~0)} SUMMARY for call #t~mem5 := read~int(~str.base, ~str.offset + ~start~0, 1); srcloc: L55-17 {14383#(= 0 parse_expression_list_~start~0)} is VALID [2020-07-08 23:37:58,502 INFO L280 TraceCheckUtils]: 23: Hoare triple {14383#(= 0 parse_expression_list_~start~0)} #t~short7 := 32 == #t~mem5; {14383#(= 0 parse_expression_list_~start~0)} is VALID [2020-07-08 23:37:58,503 INFO L280 TraceCheckUtils]: 24: Hoare triple {14383#(= 0 parse_expression_list_~start~0)} assume #t~short7; {14383#(= 0 parse_expression_list_~start~0)} is VALID [2020-07-08 23:37:58,503 INFO L280 TraceCheckUtils]: 25: Hoare triple {14383#(= 0 parse_expression_list_~start~0)} assume !!#t~short7; {14383#(= 0 parse_expression_list_~start~0)} is VALID [2020-07-08 23:37:58,504 INFO L280 TraceCheckUtils]: 26: Hoare triple {14383#(= 0 parse_expression_list_~start~0)} havoc #t~mem5; {14383#(= 0 parse_expression_list_~start~0)} is VALID [2020-07-08 23:37:58,504 INFO L280 TraceCheckUtils]: 27: Hoare triple {14383#(= 0 parse_expression_list_~start~0)} havoc #t~mem6; {14383#(= 0 parse_expression_list_~start~0)} is VALID [2020-07-08 23:37:58,505 INFO L280 TraceCheckUtils]: 28: Hoare triple {14383#(= 0 parse_expression_list_~start~0)} havoc #t~short7; {14383#(= 0 parse_expression_list_~start~0)} is VALID [2020-07-08 23:37:58,505 INFO L280 TraceCheckUtils]: 29: Hoare triple {14383#(= 0 parse_expression_list_~start~0)} #t~post8 := ~start~0; {14384#(= 0 |parse_expression_list_#t~post8|)} is VALID [2020-07-08 23:37:58,506 INFO L280 TraceCheckUtils]: 30: Hoare triple {14384#(= 0 |parse_expression_list_#t~post8|)} ~start~0 := 1 + #t~post8; {14385#(<= 1 parse_expression_list_~start~0)} is VALID [2020-07-08 23:37:58,506 INFO L280 TraceCheckUtils]: 31: Hoare triple {14385#(<= 1 parse_expression_list_~start~0)} havoc #t~post8; {14385#(<= 1 parse_expression_list_~start~0)} is VALID [2020-07-08 23:37:58,507 INFO L280 TraceCheckUtils]: 32: Hoare triple {14385#(<= 1 parse_expression_list_~start~0)} SUMMARY for call #t~mem5 := read~int(~str.base, ~str.offset + ~start~0, 1); srcloc: L55-17 {14385#(<= 1 parse_expression_list_~start~0)} is VALID [2020-07-08 23:37:58,507 INFO L280 TraceCheckUtils]: 33: Hoare triple {14385#(<= 1 parse_expression_list_~start~0)} #t~short7 := 32 == #t~mem5; {14385#(<= 1 parse_expression_list_~start~0)} is VALID [2020-07-08 23:37:58,508 INFO L280 TraceCheckUtils]: 34: Hoare triple {14385#(<= 1 parse_expression_list_~start~0)} assume !#t~short7; {14385#(<= 1 parse_expression_list_~start~0)} is VALID [2020-07-08 23:37:58,508 INFO L280 TraceCheckUtils]: 35: Hoare triple {14385#(<= 1 parse_expression_list_~start~0)} SUMMARY for call #t~mem6 := read~int(~str.base, ~str.offset + ~start~0, 1); srcloc: L55-4 {14385#(<= 1 parse_expression_list_~start~0)} is VALID [2020-07-08 23:37:58,509 INFO L280 TraceCheckUtils]: 36: Hoare triple {14385#(<= 1 parse_expression_list_~start~0)} #t~short7 := 9 == #t~mem6; {14385#(<= 1 parse_expression_list_~start~0)} is VALID [2020-07-08 23:37:58,509 INFO L280 TraceCheckUtils]: 37: Hoare triple {14385#(<= 1 parse_expression_list_~start~0)} assume !#t~short7; {14385#(<= 1 parse_expression_list_~start~0)} is VALID [2020-07-08 23:37:58,510 INFO L280 TraceCheckUtils]: 38: Hoare triple {14385#(<= 1 parse_expression_list_~start~0)} havoc #t~mem5; {14385#(<= 1 parse_expression_list_~start~0)} is VALID [2020-07-08 23:37:58,510 INFO L280 TraceCheckUtils]: 39: Hoare triple {14385#(<= 1 parse_expression_list_~start~0)} havoc #t~mem6; {14385#(<= 1 parse_expression_list_~start~0)} is VALID [2020-07-08 23:37:58,511 INFO L280 TraceCheckUtils]: 40: Hoare triple {14385#(<= 1 parse_expression_list_~start~0)} havoc #t~short7; {14385#(<= 1 parse_expression_list_~start~0)} is VALID [2020-07-08 23:37:58,512 INFO L280 TraceCheckUtils]: 41: Hoare triple {14385#(<= 1 parse_expression_list_~start~0)} SUMMARY for call #t~mem9 := read~int(~str.base, ~str.offset + ~start~0, 1); srcloc: L55-18 {14385#(<= 1 parse_expression_list_~start~0)} is VALID [2020-07-08 23:37:58,512 INFO L280 TraceCheckUtils]: 42: Hoare triple {14385#(<= 1 parse_expression_list_~start~0)} assume 34 == #t~mem9; {14385#(<= 1 parse_expression_list_~start~0)} is VALID [2020-07-08 23:37:58,513 INFO L280 TraceCheckUtils]: 43: Hoare triple {14385#(<= 1 parse_expression_list_~start~0)} havoc #t~mem9; {14385#(<= 1 parse_expression_list_~start~0)} is VALID [2020-07-08 23:37:58,513 INFO L280 TraceCheckUtils]: 44: Hoare triple {14385#(<= 1 parse_expression_list_~start~0)} #t~post10 := ~start~0; {14386#(<= 1 |parse_expression_list_#t~post10|)} is VALID [2020-07-08 23:37:58,514 INFO L280 TraceCheckUtils]: 45: Hoare triple {14386#(<= 1 |parse_expression_list_#t~post10|)} ~start~0 := 1 + #t~post10; {14387#(<= 2 parse_expression_list_~start~0)} is VALID [2020-07-08 23:37:58,515 INFO L280 TraceCheckUtils]: 46: Hoare triple {14387#(<= 2 parse_expression_list_~start~0)} havoc #t~post10; {14387#(<= 2 parse_expression_list_~start~0)} is VALID [2020-07-08 23:37:58,515 INFO L280 TraceCheckUtils]: 47: Hoare triple {14387#(<= 2 parse_expression_list_~start~0)} ~j~0 := ~i~0 - 1; {14387#(<= 2 parse_expression_list_~start~0)} is VALID [2020-07-08 23:37:58,516 INFO L280 TraceCheckUtils]: 48: Hoare triple {14387#(<= 2 parse_expression_list_~start~0)} #t~short14 := 0 < ~j~0; {14388#(and (or (< 0 parse_expression_list_~j~0) (<= 2 parse_expression_list_~start~0)) (or (<= parse_expression_list_~j~0 0) |parse_expression_list_#t~short14|))} is VALID [2020-07-08 23:37:58,517 INFO L280 TraceCheckUtils]: 49: Hoare triple {14388#(and (or (< 0 parse_expression_list_~j~0) (<= 2 parse_expression_list_~start~0)) (or (<= parse_expression_list_~j~0 0) |parse_expression_list_#t~short14|))} assume !#t~short14; {14389#(and (<= parse_expression_list_~j~0 0) (<= 2 parse_expression_list_~start~0))} is VALID [2020-07-08 23:37:58,518 INFO L280 TraceCheckUtils]: 50: Hoare triple {14389#(and (<= parse_expression_list_~j~0 0) (<= 2 parse_expression_list_~start~0))} assume !#t~short14; {14389#(and (<= parse_expression_list_~j~0 0) (<= 2 parse_expression_list_~start~0))} is VALID [2020-07-08 23:37:58,518 INFO L280 TraceCheckUtils]: 51: Hoare triple {14389#(and (<= parse_expression_list_~j~0 0) (<= 2 parse_expression_list_~start~0))} havoc #t~mem11; {14389#(and (<= parse_expression_list_~j~0 0) (<= 2 parse_expression_list_~start~0))} is VALID [2020-07-08 23:37:58,519 INFO L280 TraceCheckUtils]: 52: Hoare triple {14389#(and (<= parse_expression_list_~j~0 0) (<= 2 parse_expression_list_~start~0))} havoc #t~short13; {14389#(and (<= parse_expression_list_~j~0 0) (<= 2 parse_expression_list_~start~0))} is VALID [2020-07-08 23:37:58,520 INFO L280 TraceCheckUtils]: 53: Hoare triple {14389#(and (<= parse_expression_list_~j~0 0) (<= 2 parse_expression_list_~start~0))} havoc #t~short14; {14389#(and (<= parse_expression_list_~j~0 0) (<= 2 parse_expression_list_~start~0))} is VALID [2020-07-08 23:37:58,520 INFO L280 TraceCheckUtils]: 54: Hoare triple {14389#(and (<= parse_expression_list_~j~0 0) (<= 2 parse_expression_list_~start~0))} havoc #t~mem12; {14389#(and (<= parse_expression_list_~j~0 0) (<= 2 parse_expression_list_~start~0))} is VALID [2020-07-08 23:37:58,521 INFO L280 TraceCheckUtils]: 55: Hoare triple {14389#(and (<= parse_expression_list_~j~0 0) (<= 2 parse_expression_list_~start~0))} #t~short17 := 0 < ~j~0; {14390#(<= (+ parse_expression_list_~j~0 2) parse_expression_list_~start~0)} is VALID [2020-07-08 23:37:58,521 INFO L280 TraceCheckUtils]: 56: Hoare triple {14390#(<= (+ parse_expression_list_~j~0 2) parse_expression_list_~start~0)} assume !#t~short17; {14390#(<= (+ parse_expression_list_~j~0 2) parse_expression_list_~start~0)} is VALID [2020-07-08 23:37:58,522 INFO L280 TraceCheckUtils]: 57: Hoare triple {14390#(<= (+ parse_expression_list_~j~0 2) parse_expression_list_~start~0)} assume !#t~short17; {14390#(<= (+ parse_expression_list_~j~0 2) parse_expression_list_~start~0)} is VALID [2020-07-08 23:37:58,523 INFO L280 TraceCheckUtils]: 58: Hoare triple {14390#(<= (+ parse_expression_list_~j~0 2) parse_expression_list_~start~0)} havoc #t~short17; {14390#(<= (+ parse_expression_list_~j~0 2) parse_expression_list_~start~0)} is VALID [2020-07-08 23:37:58,523 INFO L280 TraceCheckUtils]: 59: Hoare triple {14390#(<= (+ parse_expression_list_~j~0 2) parse_expression_list_~start~0)} havoc #t~mem16; {14390#(<= (+ parse_expression_list_~j~0 2) parse_expression_list_~start~0)} is VALID [2020-07-08 23:37:58,524 INFO L280 TraceCheckUtils]: 60: Hoare triple {14390#(<= (+ parse_expression_list_~j~0 2) parse_expression_list_~start~0)} assume ~start~0 <= ~j~0; {14390#(<= (+ parse_expression_list_~j~0 2) parse_expression_list_~start~0)} is VALID [2020-07-08 23:37:58,524 INFO L263 TraceCheckUtils]: 61: Hoare triple {14390#(<= (+ parse_expression_list_~j~0 2) parse_expression_list_~start~0)} 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)); {14376#true} is VALID [2020-07-08 23:37:58,524 INFO L280 TraceCheckUtils]: 62: Hoare triple {14376#true} ~dest.base, ~dest.offset := #in~dest.base, #in~dest.offset; {14376#true} is VALID [2020-07-08 23:37:58,524 INFO L280 TraceCheckUtils]: 63: Hoare triple {14376#true} ~src.base, ~src.offset := #in~src.base, #in~src.offset; {14376#true} is VALID [2020-07-08 23:37:58,524 INFO L280 TraceCheckUtils]: 64: Hoare triple {14376#true} ~n := #in~n; {14376#true} is VALID [2020-07-08 23:37:58,525 INFO L280 TraceCheckUtils]: 65: Hoare triple {14376#true} SUMMARY for call #t~ret0.base, #t~ret0.offset := strncpy(~dest.base, ~dest.offset, ~src.base, ~src.offset, ~n); srcloc: L30-2 {14376#true} is VALID [2020-07-08 23:37:58,525 INFO L280 TraceCheckUtils]: 66: Hoare triple {14376#true} #res.base, #res.offset := #t~ret0.base, #t~ret0.offset; {14376#true} is VALID [2020-07-08 23:37:58,525 INFO L280 TraceCheckUtils]: 67: Hoare triple {14376#true} havoc #t~ret0.base, #t~ret0.offset; {14376#true} is VALID [2020-07-08 23:37:58,525 INFO L280 TraceCheckUtils]: 68: Hoare triple {14376#true} assume true; {14376#true} is VALID [2020-07-08 23:37:58,526 INFO L275 TraceCheckUtils]: 69: Hoare quadruple {14376#true} {14390#(<= (+ parse_expression_list_~j~0 2) parse_expression_list_~start~0)} #201#return; {14390#(<= (+ parse_expression_list_~j~0 2) parse_expression_list_~start~0)} is VALID [2020-07-08 23:37:58,527 INFO L280 TraceCheckUtils]: 70: Hoare triple {14390#(<= (+ parse_expression_list_~j~0 2) parse_expression_list_~start~0)} havoc #t~ret19.base, #t~ret19.offset; {14390#(<= (+ parse_expression_list_~j~0 2) parse_expression_list_~start~0)} is VALID [2020-07-08 23:37:58,528 INFO L263 TraceCheckUtils]: 71: Hoare triple {14390#(<= (+ parse_expression_list_~j~0 2) parse_expression_list_~start~0)} call __VERIFIER_assert((if 1 + (~j~0 - ~start~0) < 2 then 1 else 0)); {14399#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-08 23:37:58,529 INFO L280 TraceCheckUtils]: 72: Hoare triple {14399#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {14400#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-08 23:37:58,529 INFO L280 TraceCheckUtils]: 73: Hoare triple {14400#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {14377#false} is VALID [2020-07-08 23:37:58,529 INFO L280 TraceCheckUtils]: 74: Hoare triple {14377#false} assume !false; {14377#false} is VALID [2020-07-08 23:37:58,535 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-08 23:37:58,536 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [804551834] [2020-07-08 23:37:58,536 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-08 23:37:58,536 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2020-07-08 23:37:58,536 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076939790] [2020-07-08 23:37:58,537 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 75 [2020-07-08 23:37:58,537 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 23:37:58,537 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2020-07-08 23:37:58,614 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:37:58,615 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-07-08 23:37:58,615 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 23:37:58,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-08 23:37:58,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2020-07-08 23:37:58,615 INFO L87 Difference]: Start difference. First operand 254 states and 285 transitions. Second operand 13 states. [2020-07-08 23:38:01,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:38:01,604 INFO L93 Difference]: Finished difference Result 460 states and 517 transitions. [2020-07-08 23:38:01,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-07-08 23:38:01,604 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 75 [2020-07-08 23:38:01,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 23:38:01,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-08 23:38:01,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 423 transitions. [2020-07-08 23:38:01,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-08 23:38:01,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 423 transitions. [2020-07-08 23:38:01,618 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 423 transitions. [2020-07-08 23:38:02,140 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 423 edges. 423 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:38:02,155 INFO L225 Difference]: With dead ends: 460 [2020-07-08 23:38:02,155 INFO L226 Difference]: Without dead ends: 367 [2020-07-08 23:38:02,156 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=320, Unknown=0, NotChecked=0, Total=380 [2020-07-08 23:38:02,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2020-07-08 23:38:02,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 258. [2020-07-08 23:38:02,656 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 23:38:02,656 INFO L82 GeneralOperation]: Start isEquivalent. First operand 367 states. Second operand 258 states. [2020-07-08 23:38:02,656 INFO L74 IsIncluded]: Start isIncluded. First operand 367 states. Second operand 258 states. [2020-07-08 23:38:02,656 INFO L87 Difference]: Start difference. First operand 367 states. Second operand 258 states. [2020-07-08 23:38:02,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:38:02,681 INFO L93 Difference]: Finished difference Result 367 states and 413 transitions. [2020-07-08 23:38:02,681 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 413 transitions. [2020-07-08 23:38:02,683 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:38:02,683 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:38:02,683 INFO L74 IsIncluded]: Start isIncluded. First operand 258 states. Second operand 367 states. [2020-07-08 23:38:02,684 INFO L87 Difference]: Start difference. First operand 258 states. Second operand 367 states. [2020-07-08 23:38:02,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:38:02,710 INFO L93 Difference]: Finished difference Result 367 states and 413 transitions. [2020-07-08 23:38:02,710 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 413 transitions. [2020-07-08 23:38:02,712 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:38:02,712 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:38:02,712 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 23:38:02,712 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 23:38:02,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2020-07-08 23:38:02,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 289 transitions. [2020-07-08 23:38:02,727 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 289 transitions. Word has length 75 [2020-07-08 23:38:02,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 23:38:02,727 INFO L479 AbstractCegarLoop]: Abstraction has 258 states and 289 transitions. [2020-07-08 23:38:02,727 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-07-08 23:38:02,727 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 258 states and 289 transitions. [2020-07-08 23:38:03,121 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 289 edges. 289 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:38:03,121 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 289 transitions. [2020-07-08 23:38:03,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2020-07-08 23:38:03,123 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 23:38:03,123 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 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, 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-08 23:38:03,123 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-07-08 23:38:03,123 INFO L427 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 23:38:03,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 23:38:03,124 INFO L82 PathProgramCache]: Analyzing trace with hash 1908172287, now seen corresponding path program 1 times [2020-07-08 23:38:03,124 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 23:38:03,124 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2075751882] [2020-07-08 23:38:03,124 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 23:38:03,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:38:03,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:38:03,260 INFO L280 TraceCheckUtils]: 0: Hoare triple {16609#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {16588#true} is VALID [2020-07-08 23:38:03,261 INFO L280 TraceCheckUtils]: 1: Hoare triple {16588#true} #valid := #valid[0 := 0]; {16588#true} is VALID [2020-07-08 23:38:03,261 INFO L280 TraceCheckUtils]: 2: Hoare triple {16588#true} assume 0 < #StackHeapBarrier; {16588#true} is VALID [2020-07-08 23:38:03,261 INFO L280 TraceCheckUtils]: 3: Hoare triple {16588#true} assume true; {16588#true} is VALID [2020-07-08 23:38:03,261 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {16588#true} {16588#true} #205#return; {16588#true} is VALID [2020-07-08 23:38:03,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:38:03,264 INFO L280 TraceCheckUtils]: 0: Hoare triple {16588#true} ~dest.base, ~dest.offset := #in~dest.base, #in~dest.offset; {16588#true} is VALID [2020-07-08 23:38:03,265 INFO L280 TraceCheckUtils]: 1: Hoare triple {16588#true} ~src.base, ~src.offset := #in~src.base, #in~src.offset; {16588#true} is VALID [2020-07-08 23:38:03,265 INFO L280 TraceCheckUtils]: 2: Hoare triple {16588#true} ~n := #in~n; {16588#true} is VALID [2020-07-08 23:38:03,265 INFO L280 TraceCheckUtils]: 3: Hoare triple {16588#true} SUMMARY for call #t~ret0.base, #t~ret0.offset := strncpy(~dest.base, ~dest.offset, ~src.base, ~src.offset, ~n); srcloc: L30-2 {16588#true} is VALID [2020-07-08 23:38:03,265 INFO L280 TraceCheckUtils]: 4: Hoare triple {16588#true} #res.base, #res.offset := #t~ret0.base, #t~ret0.offset; {16588#true} is VALID [2020-07-08 23:38:03,265 INFO L280 TraceCheckUtils]: 5: Hoare triple {16588#true} havoc #t~ret0.base, #t~ret0.offset; {16588#true} is VALID [2020-07-08 23:38:03,266 INFO L280 TraceCheckUtils]: 6: Hoare triple {16588#true} assume true; {16588#true} is VALID [2020-07-08 23:38:03,266 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {16588#true} {16589#false} #201#return; {16589#false} is VALID [2020-07-08 23:38:03,267 INFO L263 TraceCheckUtils]: 0: Hoare triple {16588#true} call ULTIMATE.init(); {16609#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 23:38:03,267 INFO L280 TraceCheckUtils]: 1: Hoare triple {16609#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {16588#true} is VALID [2020-07-08 23:38:03,267 INFO L280 TraceCheckUtils]: 2: Hoare triple {16588#true} #valid := #valid[0 := 0]; {16588#true} is VALID [2020-07-08 23:38:03,267 INFO L280 TraceCheckUtils]: 3: Hoare triple {16588#true} assume 0 < #StackHeapBarrier; {16588#true} is VALID [2020-07-08 23:38:03,267 INFO L280 TraceCheckUtils]: 4: Hoare triple {16588#true} assume true; {16588#true} is VALID [2020-07-08 23:38:03,268 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {16588#true} {16588#true} #205#return; {16588#true} is VALID [2020-07-08 23:38:03,268 INFO L263 TraceCheckUtils]: 6: Hoare triple {16588#true} call #t~ret21 := main(); {16588#true} is VALID [2020-07-08 23:38:03,268 INFO L280 TraceCheckUtils]: 7: Hoare triple {16588#true} SUMMARY for call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(9); srcloc: mainENTRY {16588#true} is VALID [2020-07-08 23:38:03,268 INFO L280 TraceCheckUtils]: 8: Hoare triple {16588#true} SUMMARY for call write~int(0, ~#A~0.base, 8 + ~#A~0.offset, 1); srcloc: L74 {16588#true} is VALID [2020-07-08 23:38:03,268 INFO L263 TraceCheckUtils]: 9: Hoare triple {16588#true} call #t~ret20 := parse_expression_list(~#A~0.base, ~#A~0.offset); {16588#true} is VALID [2020-07-08 23:38:03,269 INFO L280 TraceCheckUtils]: 10: Hoare triple {16588#true} ~str.base, ~str.offset := #in~str.base, #in~str.offset; {16588#true} is VALID [2020-07-08 23:38:03,269 INFO L280 TraceCheckUtils]: 11: Hoare triple {16588#true} ~start~0 := 0; {16595#(= 0 parse_expression_list_~start~0)} is VALID [2020-07-08 23:38:03,270 INFO L280 TraceCheckUtils]: 12: Hoare triple {16595#(= 0 parse_expression_list_~start~0)} ~i~0 := -1; {16595#(= 0 parse_expression_list_~start~0)} is VALID [2020-07-08 23:38:03,270 INFO L280 TraceCheckUtils]: 13: Hoare triple {16595#(= 0 parse_expression_list_~start~0)} ~j~0 := -1; {16595#(= 0 parse_expression_list_~start~0)} is VALID [2020-07-08 23:38:03,271 INFO L280 TraceCheckUtils]: 14: Hoare triple {16595#(= 0 parse_expression_list_~start~0)} SUMMARY for call ~#str2~0.base, ~#str2~0.offset := #Ultimate.allocOnStack(2); srcloc: L49 {16595#(= 0 parse_expression_list_~start~0)} is VALID [2020-07-08 23:38:03,272 INFO L280 TraceCheckUtils]: 15: Hoare triple {16595#(= 0 parse_expression_list_~start~0)} assume !(~str.base == 0 && ~str.offset == 0); {16595#(= 0 parse_expression_list_~start~0)} is VALID [2020-07-08 23:38:03,272 INFO L280 TraceCheckUtils]: 16: Hoare triple {16595#(= 0 parse_expression_list_~start~0)} #t~post2 := ~i~0; {16595#(= 0 parse_expression_list_~start~0)} is VALID [2020-07-08 23:38:03,273 INFO L280 TraceCheckUtils]: 17: Hoare triple {16595#(= 0 parse_expression_list_~start~0)} ~i~0 := 1 + #t~post2; {16595#(= 0 parse_expression_list_~start~0)} is VALID [2020-07-08 23:38:03,273 INFO L280 TraceCheckUtils]: 18: Hoare triple {16595#(= 0 parse_expression_list_~start~0)} havoc #t~post2; {16595#(= 0 parse_expression_list_~start~0)} is VALID [2020-07-08 23:38:03,274 INFO L280 TraceCheckUtils]: 19: Hoare triple {16595#(= 0 parse_expression_list_~start~0)} SUMMARY for call #t~mem3 := read~int(~str.base, ~str.offset + ~i~0, 1); srcloc: L53 {16595#(= 0 parse_expression_list_~start~0)} is VALID [2020-07-08 23:38:03,274 INFO L280 TraceCheckUtils]: 20: Hoare triple {16595#(= 0 parse_expression_list_~start~0)} #t~switch4 := 0 == #t~mem3; {16595#(= 0 parse_expression_list_~start~0)} is VALID [2020-07-08 23:38:03,275 INFO L280 TraceCheckUtils]: 21: Hoare triple {16595#(= 0 parse_expression_list_~start~0)} assume !#t~switch4; {16595#(= 0 parse_expression_list_~start~0)} is VALID [2020-07-08 23:38:03,275 INFO L280 TraceCheckUtils]: 22: Hoare triple {16595#(= 0 parse_expression_list_~start~0)} havoc #t~mem3; {16595#(= 0 parse_expression_list_~start~0)} is VALID [2020-07-08 23:38:03,276 INFO L280 TraceCheckUtils]: 23: Hoare triple {16595#(= 0 parse_expression_list_~start~0)} havoc #t~switch4; {16595#(= 0 parse_expression_list_~start~0)} is VALID [2020-07-08 23:38:03,276 INFO L280 TraceCheckUtils]: 24: Hoare triple {16595#(= 0 parse_expression_list_~start~0)} SUMMARY for call #t~mem1 := read~int(~str.base, ~str.offset + ~i~0, 1); srcloc: L51-1 {16595#(= 0 parse_expression_list_~start~0)} is VALID [2020-07-08 23:38:03,277 INFO L280 TraceCheckUtils]: 25: Hoare triple {16595#(= 0 parse_expression_list_~start~0)} assume !!(0 != #t~mem1); {16595#(= 0 parse_expression_list_~start~0)} is VALID [2020-07-08 23:38:03,278 INFO L280 TraceCheckUtils]: 26: Hoare triple {16595#(= 0 parse_expression_list_~start~0)} havoc #t~mem1; {16595#(= 0 parse_expression_list_~start~0)} is VALID [2020-07-08 23:38:03,278 INFO L280 TraceCheckUtils]: 27: Hoare triple {16595#(= 0 parse_expression_list_~start~0)} #t~post2 := ~i~0; {16595#(= 0 parse_expression_list_~start~0)} is VALID [2020-07-08 23:38:03,279 INFO L280 TraceCheckUtils]: 28: Hoare triple {16595#(= 0 parse_expression_list_~start~0)} ~i~0 := 1 + #t~post2; {16595#(= 0 parse_expression_list_~start~0)} is VALID [2020-07-08 23:38:03,279 INFO L280 TraceCheckUtils]: 29: Hoare triple {16595#(= 0 parse_expression_list_~start~0)} havoc #t~post2; {16595#(= 0 parse_expression_list_~start~0)} is VALID [2020-07-08 23:38:03,280 INFO L280 TraceCheckUtils]: 30: Hoare triple {16595#(= 0 parse_expression_list_~start~0)} SUMMARY for call #t~mem3 := read~int(~str.base, ~str.offset + ~i~0, 1); srcloc: L53 {16595#(= 0 parse_expression_list_~start~0)} is VALID [2020-07-08 23:38:03,280 INFO L280 TraceCheckUtils]: 31: Hoare triple {16595#(= 0 parse_expression_list_~start~0)} #t~switch4 := 0 == #t~mem3; {16595#(= 0 parse_expression_list_~start~0)} is VALID [2020-07-08 23:38:03,281 INFO L280 TraceCheckUtils]: 32: Hoare triple {16595#(= 0 parse_expression_list_~start~0)} assume #t~switch4; {16595#(= 0 parse_expression_list_~start~0)} is VALID [2020-07-08 23:38:03,281 INFO L280 TraceCheckUtils]: 33: Hoare triple {16595#(= 0 parse_expression_list_~start~0)} SUMMARY for call #t~mem5 := read~int(~str.base, ~str.offset + ~start~0, 1); srcloc: L55-17 {16595#(= 0 parse_expression_list_~start~0)} is VALID [2020-07-08 23:38:03,282 INFO L280 TraceCheckUtils]: 34: Hoare triple {16595#(= 0 parse_expression_list_~start~0)} #t~short7 := 32 == #t~mem5; {16595#(= 0 parse_expression_list_~start~0)} is VALID [2020-07-08 23:38:03,282 INFO L280 TraceCheckUtils]: 35: Hoare triple {16595#(= 0 parse_expression_list_~start~0)} assume !#t~short7; {16595#(= 0 parse_expression_list_~start~0)} is VALID [2020-07-08 23:38:03,283 INFO L280 TraceCheckUtils]: 36: Hoare triple {16595#(= 0 parse_expression_list_~start~0)} SUMMARY for call #t~mem6 := read~int(~str.base, ~str.offset + ~start~0, 1); srcloc: L55-4 {16595#(= 0 parse_expression_list_~start~0)} is VALID [2020-07-08 23:38:03,283 INFO L280 TraceCheckUtils]: 37: Hoare triple {16595#(= 0 parse_expression_list_~start~0)} #t~short7 := 9 == #t~mem6; {16595#(= 0 parse_expression_list_~start~0)} is VALID [2020-07-08 23:38:03,284 INFO L280 TraceCheckUtils]: 38: Hoare triple {16595#(= 0 parse_expression_list_~start~0)} assume !#t~short7; {16595#(= 0 parse_expression_list_~start~0)} is VALID [2020-07-08 23:38:03,284 INFO L280 TraceCheckUtils]: 39: Hoare triple {16595#(= 0 parse_expression_list_~start~0)} havoc #t~mem5; {16595#(= 0 parse_expression_list_~start~0)} is VALID [2020-07-08 23:38:03,285 INFO L280 TraceCheckUtils]: 40: Hoare triple {16595#(= 0 parse_expression_list_~start~0)} havoc #t~mem6; {16595#(= 0 parse_expression_list_~start~0)} is VALID [2020-07-08 23:38:03,285 INFO L280 TraceCheckUtils]: 41: Hoare triple {16595#(= 0 parse_expression_list_~start~0)} havoc #t~short7; {16595#(= 0 parse_expression_list_~start~0)} is VALID [2020-07-08 23:38:03,286 INFO L280 TraceCheckUtils]: 42: Hoare triple {16595#(= 0 parse_expression_list_~start~0)} SUMMARY for call #t~mem9 := read~int(~str.base, ~str.offset + ~start~0, 1); srcloc: L55-18 {16595#(= 0 parse_expression_list_~start~0)} is VALID [2020-07-08 23:38:03,286 INFO L280 TraceCheckUtils]: 43: Hoare triple {16595#(= 0 parse_expression_list_~start~0)} assume 34 == #t~mem9; {16595#(= 0 parse_expression_list_~start~0)} is VALID [2020-07-08 23:38:03,287 INFO L280 TraceCheckUtils]: 44: Hoare triple {16595#(= 0 parse_expression_list_~start~0)} havoc #t~mem9; {16595#(= 0 parse_expression_list_~start~0)} is VALID [2020-07-08 23:38:03,287 INFO L280 TraceCheckUtils]: 45: Hoare triple {16595#(= 0 parse_expression_list_~start~0)} #t~post10 := ~start~0; {16596#(= 0 |parse_expression_list_#t~post10|)} is VALID [2020-07-08 23:38:03,288 INFO L280 TraceCheckUtils]: 46: Hoare triple {16596#(= 0 |parse_expression_list_#t~post10|)} ~start~0 := 1 + #t~post10; {16597#(<= 1 parse_expression_list_~start~0)} is VALID [2020-07-08 23:38:03,289 INFO L280 TraceCheckUtils]: 47: Hoare triple {16597#(<= 1 parse_expression_list_~start~0)} havoc #t~post10; {16597#(<= 1 parse_expression_list_~start~0)} is VALID [2020-07-08 23:38:03,289 INFO L280 TraceCheckUtils]: 48: Hoare triple {16597#(<= 1 parse_expression_list_~start~0)} ~j~0 := ~i~0 - 1; {16597#(<= 1 parse_expression_list_~start~0)} is VALID [2020-07-08 23:38:03,290 INFO L280 TraceCheckUtils]: 49: Hoare triple {16597#(<= 1 parse_expression_list_~start~0)} #t~short14 := 0 < ~j~0; {16598#(and (or (<= parse_expression_list_~j~0 0) |parse_expression_list_#t~short14|) (or (<= 1 parse_expression_list_~start~0) (< 0 parse_expression_list_~j~0)))} is VALID [2020-07-08 23:38:03,291 INFO L280 TraceCheckUtils]: 50: Hoare triple {16598#(and (or (<= parse_expression_list_~j~0 0) |parse_expression_list_#t~short14|) (or (<= 1 parse_expression_list_~start~0) (< 0 parse_expression_list_~j~0)))} assume !#t~short14; {16599#(and (<= 1 parse_expression_list_~start~0) (<= parse_expression_list_~j~0 0))} is VALID [2020-07-08 23:38:03,291 INFO L280 TraceCheckUtils]: 51: Hoare triple {16599#(and (<= 1 parse_expression_list_~start~0) (<= parse_expression_list_~j~0 0))} assume !#t~short14; {16599#(and (<= 1 parse_expression_list_~start~0) (<= parse_expression_list_~j~0 0))} is VALID [2020-07-08 23:38:03,292 INFO L280 TraceCheckUtils]: 52: Hoare triple {16599#(and (<= 1 parse_expression_list_~start~0) (<= parse_expression_list_~j~0 0))} havoc #t~mem11; {16599#(and (<= 1 parse_expression_list_~start~0) (<= parse_expression_list_~j~0 0))} is VALID [2020-07-08 23:38:03,293 INFO L280 TraceCheckUtils]: 53: Hoare triple {16599#(and (<= 1 parse_expression_list_~start~0) (<= parse_expression_list_~j~0 0))} havoc #t~short13; {16599#(and (<= 1 parse_expression_list_~start~0) (<= parse_expression_list_~j~0 0))} is VALID [2020-07-08 23:38:03,293 INFO L280 TraceCheckUtils]: 54: Hoare triple {16599#(and (<= 1 parse_expression_list_~start~0) (<= parse_expression_list_~j~0 0))} havoc #t~short14; {16599#(and (<= 1 parse_expression_list_~start~0) (<= parse_expression_list_~j~0 0))} is VALID [2020-07-08 23:38:03,294 INFO L280 TraceCheckUtils]: 55: Hoare triple {16599#(and (<= 1 parse_expression_list_~start~0) (<= parse_expression_list_~j~0 0))} havoc #t~mem12; {16599#(and (<= 1 parse_expression_list_~start~0) (<= parse_expression_list_~j~0 0))} is VALID [2020-07-08 23:38:03,295 INFO L280 TraceCheckUtils]: 56: Hoare triple {16599#(and (<= 1 parse_expression_list_~start~0) (<= parse_expression_list_~j~0 0))} #t~short17 := 0 < ~j~0; {16600#(<= (+ parse_expression_list_~j~0 1) parse_expression_list_~start~0)} is VALID [2020-07-08 23:38:03,295 INFO L280 TraceCheckUtils]: 57: Hoare triple {16600#(<= (+ parse_expression_list_~j~0 1) parse_expression_list_~start~0)} assume !#t~short17; {16600#(<= (+ parse_expression_list_~j~0 1) parse_expression_list_~start~0)} is VALID [2020-07-08 23:38:03,296 INFO L280 TraceCheckUtils]: 58: Hoare triple {16600#(<= (+ parse_expression_list_~j~0 1) parse_expression_list_~start~0)} assume !#t~short17; {16600#(<= (+ parse_expression_list_~j~0 1) parse_expression_list_~start~0)} is VALID [2020-07-08 23:38:03,296 INFO L280 TraceCheckUtils]: 59: Hoare triple {16600#(<= (+ parse_expression_list_~j~0 1) parse_expression_list_~start~0)} havoc #t~short17; {16600#(<= (+ parse_expression_list_~j~0 1) parse_expression_list_~start~0)} is VALID [2020-07-08 23:38:03,297 INFO L280 TraceCheckUtils]: 60: Hoare triple {16600#(<= (+ parse_expression_list_~j~0 1) parse_expression_list_~start~0)} havoc #t~mem16; {16600#(<= (+ parse_expression_list_~j~0 1) parse_expression_list_~start~0)} is VALID [2020-07-08 23:38:03,297 INFO L280 TraceCheckUtils]: 61: Hoare triple {16600#(<= (+ parse_expression_list_~j~0 1) parse_expression_list_~start~0)} assume ~start~0 <= ~j~0; {16589#false} is VALID [2020-07-08 23:38:03,298 INFO L263 TraceCheckUtils]: 62: Hoare triple {16589#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)); {16588#true} is VALID [2020-07-08 23:38:03,298 INFO L280 TraceCheckUtils]: 63: Hoare triple {16588#true} ~dest.base, ~dest.offset := #in~dest.base, #in~dest.offset; {16588#true} is VALID [2020-07-08 23:38:03,298 INFO L280 TraceCheckUtils]: 64: Hoare triple {16588#true} ~src.base, ~src.offset := #in~src.base, #in~src.offset; {16588#true} is VALID [2020-07-08 23:38:03,298 INFO L280 TraceCheckUtils]: 65: Hoare triple {16588#true} ~n := #in~n; {16588#true} is VALID [2020-07-08 23:38:03,298 INFO L280 TraceCheckUtils]: 66: Hoare triple {16588#true} SUMMARY for call #t~ret0.base, #t~ret0.offset := strncpy(~dest.base, ~dest.offset, ~src.base, ~src.offset, ~n); srcloc: L30-2 {16588#true} is VALID [2020-07-08 23:38:03,298 INFO L280 TraceCheckUtils]: 67: Hoare triple {16588#true} #res.base, #res.offset := #t~ret0.base, #t~ret0.offset; {16588#true} is VALID [2020-07-08 23:38:03,299 INFO L280 TraceCheckUtils]: 68: Hoare triple {16588#true} havoc #t~ret0.base, #t~ret0.offset; {16588#true} is VALID [2020-07-08 23:38:03,299 INFO L280 TraceCheckUtils]: 69: Hoare triple {16588#true} assume true; {16588#true} is VALID [2020-07-08 23:38:03,299 INFO L275 TraceCheckUtils]: 70: Hoare quadruple {16588#true} {16589#false} #201#return; {16589#false} is VALID [2020-07-08 23:38:03,299 INFO L280 TraceCheckUtils]: 71: Hoare triple {16589#false} havoc #t~ret19.base, #t~ret19.offset; {16589#false} is VALID [2020-07-08 23:38:03,299 INFO L263 TraceCheckUtils]: 72: Hoare triple {16589#false} call __VERIFIER_assert((if 1 + (~j~0 - ~start~0) < 2 then 1 else 0)); {16589#false} is VALID [2020-07-08 23:38:03,299 INFO L280 TraceCheckUtils]: 73: Hoare triple {16589#false} ~cond := #in~cond; {16589#false} is VALID [2020-07-08 23:38:03,300 INFO L280 TraceCheckUtils]: 74: Hoare triple {16589#false} assume 0 == ~cond; {16589#false} is VALID [2020-07-08 23:38:03,300 INFO L280 TraceCheckUtils]: 75: Hoare triple {16589#false} assume !false; {16589#false} is VALID [2020-07-08 23:38:03,305 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-07-08 23:38:03,306 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2075751882] [2020-07-08 23:38:03,306 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 23:38:03,306 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-07-08 23:38:03,306 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319313966] [2020-07-08 23:38:03,307 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 76 [2020-07-08 23:38:03,307 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 23:38:03,307 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-08 23:38:03,384 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:38:03,384 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-08 23:38:03,384 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 23:38:03,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-08 23:38:03,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-07-08 23:38:03,385 INFO L87 Difference]: Start difference. First operand 258 states and 289 transitions. Second operand 9 states. [2020-07-08 23:38:05,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:38:05,444 INFO L93 Difference]: Finished difference Result 432 states and 485 transitions. [2020-07-08 23:38:05,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-08 23:38:05,445 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 76 [2020-07-08 23:38:05,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 23:38:05,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-08 23:38:05,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 353 transitions. [2020-07-08 23:38:05,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-08 23:38:05,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 353 transitions. [2020-07-08 23:38:05,454 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 353 transitions. [2020-07-08 23:38:05,823 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 353 edges. 353 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:38:05,832 INFO L225 Difference]: With dead ends: 432 [2020-07-08 23:38:05,833 INFO L226 Difference]: Without dead ends: 339 [2020-07-08 23:38:05,833 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2020-07-08 23:38:05,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2020-07-08 23:38:06,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 258. [2020-07-08 23:38:06,206 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 23:38:06,206 INFO L82 GeneralOperation]: Start isEquivalent. First operand 339 states. Second operand 258 states. [2020-07-08 23:38:06,206 INFO L74 IsIncluded]: Start isIncluded. First operand 339 states. Second operand 258 states. [2020-07-08 23:38:06,206 INFO L87 Difference]: Start difference. First operand 339 states. Second operand 258 states. [2020-07-08 23:38:06,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:38:06,217 INFO L93 Difference]: Finished difference Result 339 states and 381 transitions. [2020-07-08 23:38:06,217 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 381 transitions. [2020-07-08 23:38:06,218 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:38:06,219 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:38:06,219 INFO L74 IsIncluded]: Start isIncluded. First operand 258 states. Second operand 339 states. [2020-07-08 23:38:06,219 INFO L87 Difference]: Start difference. First operand 258 states. Second operand 339 states. [2020-07-08 23:38:06,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:38:06,229 INFO L93 Difference]: Finished difference Result 339 states and 381 transitions. [2020-07-08 23:38:06,229 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 381 transitions. [2020-07-08 23:38:06,230 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:38:06,231 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:38:06,231 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 23:38:06,231 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 23:38:06,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2020-07-08 23:38:06,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 289 transitions. [2020-07-08 23:38:06,237 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 289 transitions. Word has length 76 [2020-07-08 23:38:06,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 23:38:06,237 INFO L479 AbstractCegarLoop]: Abstraction has 258 states and 289 transitions. [2020-07-08 23:38:06,237 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-08 23:38:06,237 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 258 states and 289 transitions. [2020-07-08 23:38:06,607 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 289 edges. 289 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:38:06,608 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 289 transitions. [2020-07-08 23:38:06,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2020-07-08 23:38:06,609 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 23:38:06,612 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, 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-08 23:38:06,613 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-07-08 23:38:06,613 INFO L427 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 23:38:06,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 23:38:06,613 INFO L82 PathProgramCache]: Analyzing trace with hash 116425250, now seen corresponding path program 1 times [2020-07-08 23:38:06,613 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 23:38:06,614 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [404894789] [2020-07-08 23:38:06,614 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 23:38:06,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:38:06,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:38:06,671 INFO L280 TraceCheckUtils]: 0: Hoare triple {18699#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {18682#true} is VALID [2020-07-08 23:38:06,672 INFO L280 TraceCheckUtils]: 1: Hoare triple {18682#true} #valid := #valid[0 := 0]; {18682#true} is VALID [2020-07-08 23:38:06,672 INFO L280 TraceCheckUtils]: 2: Hoare triple {18682#true} assume 0 < #StackHeapBarrier; {18682#true} is VALID [2020-07-08 23:38:06,672 INFO L280 TraceCheckUtils]: 3: Hoare triple {18682#true} assume true; {18682#true} is VALID [2020-07-08 23:38:06,672 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {18682#true} {18682#true} #205#return; {18682#true} is VALID [2020-07-08 23:38:06,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:38:06,675 INFO L280 TraceCheckUtils]: 0: Hoare triple {18682#true} ~dest.base, ~dest.offset := #in~dest.base, #in~dest.offset; {18682#true} is VALID [2020-07-08 23:38:06,676 INFO L280 TraceCheckUtils]: 1: Hoare triple {18682#true} ~src.base, ~src.offset := #in~src.base, #in~src.offset; {18682#true} is VALID [2020-07-08 23:38:06,676 INFO L280 TraceCheckUtils]: 2: Hoare triple {18682#true} ~n := #in~n; {18682#true} is VALID [2020-07-08 23:38:06,676 INFO L280 TraceCheckUtils]: 3: Hoare triple {18682#true} SUMMARY for call #t~ret0.base, #t~ret0.offset := strncpy(~dest.base, ~dest.offset, ~src.base, ~src.offset, ~n); srcloc: L30-2 {18682#true} is VALID [2020-07-08 23:38:06,676 INFO L280 TraceCheckUtils]: 4: Hoare triple {18682#true} #res.base, #res.offset := #t~ret0.base, #t~ret0.offset; {18682#true} is VALID [2020-07-08 23:38:06,677 INFO L280 TraceCheckUtils]: 5: Hoare triple {18682#true} havoc #t~ret0.base, #t~ret0.offset; {18682#true} is VALID [2020-07-08 23:38:06,677 INFO L280 TraceCheckUtils]: 6: Hoare triple {18682#true} assume true; {18682#true} is VALID [2020-07-08 23:38:06,677 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {18682#true} {18683#false} #201#return; {18683#false} is VALID [2020-07-08 23:38:06,678 INFO L263 TraceCheckUtils]: 0: Hoare triple {18682#true} call ULTIMATE.init(); {18699#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 23:38:06,678 INFO L280 TraceCheckUtils]: 1: Hoare triple {18699#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {18682#true} is VALID [2020-07-08 23:38:06,678 INFO L280 TraceCheckUtils]: 2: Hoare triple {18682#true} #valid := #valid[0 := 0]; {18682#true} is VALID [2020-07-08 23:38:06,678 INFO L280 TraceCheckUtils]: 3: Hoare triple {18682#true} assume 0 < #StackHeapBarrier; {18682#true} is VALID [2020-07-08 23:38:06,679 INFO L280 TraceCheckUtils]: 4: Hoare triple {18682#true} assume true; {18682#true} is VALID [2020-07-08 23:38:06,679 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {18682#true} {18682#true} #205#return; {18682#true} is VALID [2020-07-08 23:38:06,679 INFO L263 TraceCheckUtils]: 6: Hoare triple {18682#true} call #t~ret21 := main(); {18682#true} is VALID [2020-07-08 23:38:06,679 INFO L280 TraceCheckUtils]: 7: Hoare triple {18682#true} SUMMARY for call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(9); srcloc: mainENTRY {18682#true} is VALID [2020-07-08 23:38:06,679 INFO L280 TraceCheckUtils]: 8: Hoare triple {18682#true} SUMMARY for call write~int(0, ~#A~0.base, 8 + ~#A~0.offset, 1); srcloc: L74 {18682#true} is VALID [2020-07-08 23:38:06,679 INFO L263 TraceCheckUtils]: 9: Hoare triple {18682#true} call #t~ret20 := parse_expression_list(~#A~0.base, ~#A~0.offset); {18682#true} is VALID [2020-07-08 23:38:06,680 INFO L280 TraceCheckUtils]: 10: Hoare triple {18682#true} ~str.base, ~str.offset := #in~str.base, #in~str.offset; {18682#true} is VALID [2020-07-08 23:38:06,680 INFO L280 TraceCheckUtils]: 11: Hoare triple {18682#true} ~start~0 := 0; {18682#true} is VALID [2020-07-08 23:38:06,680 INFO L280 TraceCheckUtils]: 12: Hoare triple {18682#true} ~i~0 := -1; {18682#true} is VALID [2020-07-08 23:38:06,680 INFO L280 TraceCheckUtils]: 13: Hoare triple {18682#true} ~j~0 := -1; {18682#true} is VALID [2020-07-08 23:38:06,680 INFO L280 TraceCheckUtils]: 14: Hoare triple {18682#true} SUMMARY for call ~#str2~0.base, ~#str2~0.offset := #Ultimate.allocOnStack(2); srcloc: L49 {18682#true} is VALID [2020-07-08 23:38:06,680 INFO L280 TraceCheckUtils]: 15: Hoare triple {18682#true} assume !(~str.base == 0 && ~str.offset == 0); {18682#true} is VALID [2020-07-08 23:38:06,681 INFO L280 TraceCheckUtils]: 16: Hoare triple {18682#true} #t~post2 := ~i~0; {18682#true} is VALID [2020-07-08 23:38:06,681 INFO L280 TraceCheckUtils]: 17: Hoare triple {18682#true} ~i~0 := 1 + #t~post2; {18682#true} is VALID [2020-07-08 23:38:06,681 INFO L280 TraceCheckUtils]: 18: Hoare triple {18682#true} havoc #t~post2; {18682#true} is VALID [2020-07-08 23:38:06,681 INFO L280 TraceCheckUtils]: 19: Hoare triple {18682#true} SUMMARY for call #t~mem3 := read~int(~str.base, ~str.offset + ~i~0, 1); srcloc: L53 {18682#true} is VALID [2020-07-08 23:38:06,681 INFO L280 TraceCheckUtils]: 20: Hoare triple {18682#true} #t~switch4 := 0 == #t~mem3; {18682#true} is VALID [2020-07-08 23:38:06,681 INFO L280 TraceCheckUtils]: 21: Hoare triple {18682#true} assume #t~switch4; {18682#true} is VALID [2020-07-08 23:38:06,682 INFO L280 TraceCheckUtils]: 22: Hoare triple {18682#true} SUMMARY for call #t~mem5 := read~int(~str.base, ~str.offset + ~start~0, 1); srcloc: L55-17 {18682#true} is VALID [2020-07-08 23:38:06,682 INFO L280 TraceCheckUtils]: 23: Hoare triple {18682#true} #t~short7 := 32 == #t~mem5; {18682#true} is VALID [2020-07-08 23:38:06,682 INFO L280 TraceCheckUtils]: 24: Hoare triple {18682#true} assume #t~short7; {18682#true} is VALID [2020-07-08 23:38:06,682 INFO L280 TraceCheckUtils]: 25: Hoare triple {18682#true} assume !!#t~short7; {18682#true} is VALID [2020-07-08 23:38:06,682 INFO L280 TraceCheckUtils]: 26: Hoare triple {18682#true} havoc #t~mem5; {18682#true} is VALID [2020-07-08 23:38:06,683 INFO L280 TraceCheckUtils]: 27: Hoare triple {18682#true} havoc #t~mem6; {18682#true} is VALID [2020-07-08 23:38:06,683 INFO L280 TraceCheckUtils]: 28: Hoare triple {18682#true} havoc #t~short7; {18682#true} is VALID [2020-07-08 23:38:06,683 INFO L280 TraceCheckUtils]: 29: Hoare triple {18682#true} #t~post8 := ~start~0; {18682#true} is VALID [2020-07-08 23:38:06,683 INFO L280 TraceCheckUtils]: 30: Hoare triple {18682#true} ~start~0 := 1 + #t~post8; {18682#true} is VALID [2020-07-08 23:38:06,683 INFO L280 TraceCheckUtils]: 31: Hoare triple {18682#true} havoc #t~post8; {18682#true} is VALID [2020-07-08 23:38:06,683 INFO L280 TraceCheckUtils]: 32: Hoare triple {18682#true} SUMMARY for call #t~mem5 := read~int(~str.base, ~str.offset + ~start~0, 1); srcloc: L55-17 {18682#true} is VALID [2020-07-08 23:38:06,684 INFO L280 TraceCheckUtils]: 33: Hoare triple {18682#true} #t~short7 := 32 == #t~mem5; {18682#true} is VALID [2020-07-08 23:38:06,684 INFO L280 TraceCheckUtils]: 34: Hoare triple {18682#true} assume !#t~short7; {18682#true} is VALID [2020-07-08 23:38:06,684 INFO L280 TraceCheckUtils]: 35: Hoare triple {18682#true} SUMMARY for call #t~mem6 := read~int(~str.base, ~str.offset + ~start~0, 1); srcloc: L55-4 {18682#true} is VALID [2020-07-08 23:38:06,684 INFO L280 TraceCheckUtils]: 36: Hoare triple {18682#true} #t~short7 := 9 == #t~mem6; {18682#true} is VALID [2020-07-08 23:38:06,684 INFO L280 TraceCheckUtils]: 37: Hoare triple {18682#true} assume !#t~short7; {18682#true} is VALID [2020-07-08 23:38:06,684 INFO L280 TraceCheckUtils]: 38: Hoare triple {18682#true} havoc #t~mem5; {18682#true} is VALID [2020-07-08 23:38:06,685 INFO L280 TraceCheckUtils]: 39: Hoare triple {18682#true} havoc #t~mem6; {18682#true} is VALID [2020-07-08 23:38:06,685 INFO L280 TraceCheckUtils]: 40: Hoare triple {18682#true} havoc #t~short7; {18682#true} is VALID [2020-07-08 23:38:06,685 INFO L280 TraceCheckUtils]: 41: Hoare triple {18682#true} SUMMARY for call #t~mem9 := read~int(~str.base, ~str.offset + ~start~0, 1); srcloc: L55-18 {18682#true} is VALID [2020-07-08 23:38:06,685 INFO L280 TraceCheckUtils]: 42: Hoare triple {18682#true} assume !(34 == #t~mem9); {18682#true} is VALID [2020-07-08 23:38:06,685 INFO L280 TraceCheckUtils]: 43: Hoare triple {18682#true} havoc #t~mem9; {18682#true} is VALID [2020-07-08 23:38:06,686 INFO L280 TraceCheckUtils]: 44: Hoare triple {18682#true} ~j~0 := ~i~0 - 1; {18682#true} is VALID [2020-07-08 23:38:06,686 INFO L280 TraceCheckUtils]: 45: Hoare triple {18682#true} #t~short14 := 0 < ~j~0; {18682#true} is VALID [2020-07-08 23:38:06,686 INFO L280 TraceCheckUtils]: 46: Hoare triple {18682#true} assume #t~short14; {18682#true} is VALID [2020-07-08 23:38:06,686 INFO L280 TraceCheckUtils]: 47: Hoare triple {18682#true} SUMMARY for call #t~mem11 := read~int(~str.base, ~str.offset + ~j~0, 1); srcloc: L58-2 {18682#true} is VALID [2020-07-08 23:38:06,686 INFO L280 TraceCheckUtils]: 48: Hoare triple {18682#true} #t~short13 := 32 == #t~mem11; {18682#true} is VALID [2020-07-08 23:38:06,687 INFO L280 TraceCheckUtils]: 49: Hoare triple {18682#true} assume #t~short13; {18689#|parse_expression_list_#t~short13|} is VALID [2020-07-08 23:38:06,688 INFO L280 TraceCheckUtils]: 50: Hoare triple {18689#|parse_expression_list_#t~short13|} #t~short14 := #t~short13; {18690#|parse_expression_list_#t~short14|} is VALID [2020-07-08 23:38:06,688 INFO L280 TraceCheckUtils]: 51: Hoare triple {18690#|parse_expression_list_#t~short14|} assume !#t~short14; {18683#false} is VALID [2020-07-08 23:38:06,688 INFO L280 TraceCheckUtils]: 52: Hoare triple {18683#false} havoc #t~mem11; {18683#false} is VALID [2020-07-08 23:38:06,689 INFO L280 TraceCheckUtils]: 53: Hoare triple {18683#false} havoc #t~short13; {18683#false} is VALID [2020-07-08 23:38:06,689 INFO L280 TraceCheckUtils]: 54: Hoare triple {18683#false} havoc #t~short14; {18683#false} is VALID [2020-07-08 23:38:06,689 INFO L280 TraceCheckUtils]: 55: Hoare triple {18683#false} havoc #t~mem12; {18683#false} is VALID [2020-07-08 23:38:06,689 INFO L280 TraceCheckUtils]: 56: Hoare triple {18683#false} #t~short17 := 0 < ~j~0; {18683#false} is VALID [2020-07-08 23:38:06,689 INFO L280 TraceCheckUtils]: 57: Hoare triple {18683#false} assume !#t~short17; {18683#false} is VALID [2020-07-08 23:38:06,689 INFO L280 TraceCheckUtils]: 58: Hoare triple {18683#false} assume !#t~short17; {18683#false} is VALID [2020-07-08 23:38:06,690 INFO L280 TraceCheckUtils]: 59: Hoare triple {18683#false} havoc #t~short17; {18683#false} is VALID [2020-07-08 23:38:06,690 INFO L280 TraceCheckUtils]: 60: Hoare triple {18683#false} havoc #t~mem16; {18683#false} is VALID [2020-07-08 23:38:06,690 INFO L280 TraceCheckUtils]: 61: Hoare triple {18683#false} assume ~start~0 <= ~j~0; {18683#false} is VALID [2020-07-08 23:38:06,690 INFO L263 TraceCheckUtils]: 62: Hoare triple {18683#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)); {18682#true} is VALID [2020-07-08 23:38:06,690 INFO L280 TraceCheckUtils]: 63: Hoare triple {18682#true} ~dest.base, ~dest.offset := #in~dest.base, #in~dest.offset; {18682#true} is VALID [2020-07-08 23:38:06,690 INFO L280 TraceCheckUtils]: 64: Hoare triple {18682#true} ~src.base, ~src.offset := #in~src.base, #in~src.offset; {18682#true} is VALID [2020-07-08 23:38:06,691 INFO L280 TraceCheckUtils]: 65: Hoare triple {18682#true} ~n := #in~n; {18682#true} is VALID [2020-07-08 23:38:06,691 INFO L280 TraceCheckUtils]: 66: Hoare triple {18682#true} SUMMARY for call #t~ret0.base, #t~ret0.offset := strncpy(~dest.base, ~dest.offset, ~src.base, ~src.offset, ~n); srcloc: L30-2 {18682#true} is VALID [2020-07-08 23:38:06,691 INFO L280 TraceCheckUtils]: 67: Hoare triple {18682#true} #res.base, #res.offset := #t~ret0.base, #t~ret0.offset; {18682#true} is VALID [2020-07-08 23:38:06,691 INFO L280 TraceCheckUtils]: 68: Hoare triple {18682#true} havoc #t~ret0.base, #t~ret0.offset; {18682#true} is VALID [2020-07-08 23:38:06,691 INFO L280 TraceCheckUtils]: 69: Hoare triple {18682#true} assume true; {18682#true} is VALID [2020-07-08 23:38:06,692 INFO L275 TraceCheckUtils]: 70: Hoare quadruple {18682#true} {18683#false} #201#return; {18683#false} is VALID [2020-07-08 23:38:06,692 INFO L280 TraceCheckUtils]: 71: Hoare triple {18683#false} havoc #t~ret19.base, #t~ret19.offset; {18683#false} is VALID [2020-07-08 23:38:06,692 INFO L263 TraceCheckUtils]: 72: Hoare triple {18683#false} call __VERIFIER_assert((if 1 + (~j~0 - ~start~0) < 2 then 1 else 0)); {18683#false} is VALID [2020-07-08 23:38:06,692 INFO L280 TraceCheckUtils]: 73: Hoare triple {18683#false} ~cond := #in~cond; {18683#false} is VALID [2020-07-08 23:38:06,692 INFO L280 TraceCheckUtils]: 74: Hoare triple {18683#false} assume 0 == ~cond; {18683#false} is VALID [2020-07-08 23:38:06,692 INFO L280 TraceCheckUtils]: 75: Hoare triple {18683#false} assume !false; {18683#false} is VALID [2020-07-08 23:38:06,695 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-08 23:38:06,696 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [404894789] [2020-07-08 23:38:06,696 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 23:38:06,696 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-08 23:38:06,696 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751085650] [2020-07-08 23:38:06,697 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 76 [2020-07-08 23:38:06,697 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 23:38:06,697 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-08 23:38:06,775 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:38:06,775 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-08 23:38:06,775 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 23:38:06,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-08 23:38:06,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-08 23:38:06,776 INFO L87 Difference]: Start difference. First operand 258 states and 289 transitions. Second operand 5 states. [2020-07-08 23:38:07,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:38:07,687 INFO L93 Difference]: Finished difference Result 363 states and 406 transitions. [2020-07-08 23:38:07,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-08 23:38:07,687 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 76 [2020-07-08 23:38:07,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 23:38:07,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-08 23:38:07,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 211 transitions. [2020-07-08 23:38:07,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-08 23:38:07,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 211 transitions. [2020-07-08 23:38:07,691 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 211 transitions. [2020-07-08 23:38:07,880 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 211 edges. 211 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:38:07,888 INFO L225 Difference]: With dead ends: 363 [2020-07-08 23:38:07,888 INFO L226 Difference]: Without dead ends: 274 [2020-07-08 23:38:07,889 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-08 23:38:07,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2020-07-08 23:38:08,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 260. [2020-07-08 23:38:08,288 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 23:38:08,288 INFO L82 GeneralOperation]: Start isEquivalent. First operand 274 states. Second operand 260 states. [2020-07-08 23:38:08,288 INFO L74 IsIncluded]: Start isIncluded. First operand 274 states. Second operand 260 states. [2020-07-08 23:38:08,289 INFO L87 Difference]: Start difference. First operand 274 states. Second operand 260 states. [2020-07-08 23:38:08,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:38:08,298 INFO L93 Difference]: Finished difference Result 274 states and 305 transitions. [2020-07-08 23:38:08,298 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 305 transitions. [2020-07-08 23:38:08,299 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:38:08,299 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:38:08,299 INFO L74 IsIncluded]: Start isIncluded. First operand 260 states. Second operand 274 states. [2020-07-08 23:38:08,299 INFO L87 Difference]: Start difference. First operand 260 states. Second operand 274 states. [2020-07-08 23:38:08,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:38:08,307 INFO L93 Difference]: Finished difference Result 274 states and 305 transitions. [2020-07-08 23:38:08,307 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 305 transitions. [2020-07-08 23:38:08,308 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:38:08,308 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:38:08,308 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 23:38:08,309 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 23:38:08,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2020-07-08 23:38:08,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 291 transitions. [2020-07-08 23:38:08,316 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 291 transitions. Word has length 76 [2020-07-08 23:38:08,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 23:38:08,317 INFO L479 AbstractCegarLoop]: Abstraction has 260 states and 291 transitions. [2020-07-08 23:38:08,317 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-08 23:38:08,317 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 260 states and 291 transitions. [2020-07-08 23:38:08,684 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 291 edges. 291 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:38:08,685 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 291 transitions. [2020-07-08 23:38:08,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2020-07-08 23:38:08,689 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 23:38:08,689 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, 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-08 23:38:08,690 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-07-08 23:38:08,690 INFO L427 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 23:38:08,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 23:38:08,690 INFO L82 PathProgramCache]: Analyzing trace with hash -1122457453, now seen corresponding path program 1 times [2020-07-08 23:38:08,690 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 23:38:08,690 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1923609842] [2020-07-08 23:38:08,691 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 23:38:08,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:38:08,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:38:08,770 INFO L280 TraceCheckUtils]: 0: Hoare triple {20516#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {20498#true} is VALID [2020-07-08 23:38:08,770 INFO L280 TraceCheckUtils]: 1: Hoare triple {20498#true} #valid := #valid[0 := 0]; {20498#true} is VALID [2020-07-08 23:38:08,771 INFO L280 TraceCheckUtils]: 2: Hoare triple {20498#true} assume 0 < #StackHeapBarrier; {20498#true} is VALID [2020-07-08 23:38:08,771 INFO L280 TraceCheckUtils]: 3: Hoare triple {20498#true} assume true; {20498#true} is VALID [2020-07-08 23:38:08,771 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {20498#true} {20498#true} #205#return; {20498#true} is VALID [2020-07-08 23:38:08,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:38:08,775 INFO L280 TraceCheckUtils]: 0: Hoare triple {20498#true} ~dest.base, ~dest.offset := #in~dest.base, #in~dest.offset; {20498#true} is VALID [2020-07-08 23:38:08,775 INFO L280 TraceCheckUtils]: 1: Hoare triple {20498#true} ~src.base, ~src.offset := #in~src.base, #in~src.offset; {20498#true} is VALID [2020-07-08 23:38:08,775 INFO L280 TraceCheckUtils]: 2: Hoare triple {20498#true} ~n := #in~n; {20498#true} is VALID [2020-07-08 23:38:08,775 INFO L280 TraceCheckUtils]: 3: Hoare triple {20498#true} SUMMARY for call #t~ret0.base, #t~ret0.offset := strncpy(~dest.base, ~dest.offset, ~src.base, ~src.offset, ~n); srcloc: L30-2 {20498#true} is VALID [2020-07-08 23:38:08,775 INFO L280 TraceCheckUtils]: 4: Hoare triple {20498#true} #res.base, #res.offset := #t~ret0.base, #t~ret0.offset; {20498#true} is VALID [2020-07-08 23:38:08,776 INFO L280 TraceCheckUtils]: 5: Hoare triple {20498#true} havoc #t~ret0.base, #t~ret0.offset; {20498#true} is VALID [2020-07-08 23:38:08,776 INFO L280 TraceCheckUtils]: 6: Hoare triple {20498#true} assume true; {20498#true} is VALID [2020-07-08 23:38:08,776 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {20498#true} {20499#false} #201#return; {20499#false} is VALID [2020-07-08 23:38:08,777 INFO L263 TraceCheckUtils]: 0: Hoare triple {20498#true} call ULTIMATE.init(); {20516#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 23:38:08,777 INFO L280 TraceCheckUtils]: 1: Hoare triple {20516#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {20498#true} is VALID [2020-07-08 23:38:08,777 INFO L280 TraceCheckUtils]: 2: Hoare triple {20498#true} #valid := #valid[0 := 0]; {20498#true} is VALID [2020-07-08 23:38:08,778 INFO L280 TraceCheckUtils]: 3: Hoare triple {20498#true} assume 0 < #StackHeapBarrier; {20498#true} is VALID [2020-07-08 23:38:08,778 INFO L280 TraceCheckUtils]: 4: Hoare triple {20498#true} assume true; {20498#true} is VALID [2020-07-08 23:38:08,778 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {20498#true} {20498#true} #205#return; {20498#true} is VALID [2020-07-08 23:38:08,778 INFO L263 TraceCheckUtils]: 6: Hoare triple {20498#true} call #t~ret21 := main(); {20498#true} is VALID [2020-07-08 23:38:08,778 INFO L280 TraceCheckUtils]: 7: Hoare triple {20498#true} SUMMARY for call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(9); srcloc: mainENTRY {20498#true} is VALID [2020-07-08 23:38:08,778 INFO L280 TraceCheckUtils]: 8: Hoare triple {20498#true} SUMMARY for call write~int(0, ~#A~0.base, 8 + ~#A~0.offset, 1); srcloc: L74 {20498#true} is VALID [2020-07-08 23:38:08,779 INFO L263 TraceCheckUtils]: 9: Hoare triple {20498#true} call #t~ret20 := parse_expression_list(~#A~0.base, ~#A~0.offset); {20498#true} is VALID [2020-07-08 23:38:08,779 INFO L280 TraceCheckUtils]: 10: Hoare triple {20498#true} ~str.base, ~str.offset := #in~str.base, #in~str.offset; {20498#true} is VALID [2020-07-08 23:38:08,779 INFO L280 TraceCheckUtils]: 11: Hoare triple {20498#true} ~start~0 := 0; {20498#true} is VALID [2020-07-08 23:38:08,779 INFO L280 TraceCheckUtils]: 12: Hoare triple {20498#true} ~i~0 := -1; {20498#true} is VALID [2020-07-08 23:38:08,779 INFO L280 TraceCheckUtils]: 13: Hoare triple {20498#true} ~j~0 := -1; {20498#true} is VALID [2020-07-08 23:38:08,779 INFO L280 TraceCheckUtils]: 14: Hoare triple {20498#true} SUMMARY for call ~#str2~0.base, ~#str2~0.offset := #Ultimate.allocOnStack(2); srcloc: L49 {20498#true} is VALID [2020-07-08 23:38:08,780 INFO L280 TraceCheckUtils]: 15: Hoare triple {20498#true} assume !(~str.base == 0 && ~str.offset == 0); {20498#true} is VALID [2020-07-08 23:38:08,780 INFO L280 TraceCheckUtils]: 16: Hoare triple {20498#true} #t~post2 := ~i~0; {20498#true} is VALID [2020-07-08 23:38:08,780 INFO L280 TraceCheckUtils]: 17: Hoare triple {20498#true} ~i~0 := 1 + #t~post2; {20498#true} is VALID [2020-07-08 23:38:08,780 INFO L280 TraceCheckUtils]: 18: Hoare triple {20498#true} havoc #t~post2; {20498#true} is VALID [2020-07-08 23:38:08,780 INFO L280 TraceCheckUtils]: 19: Hoare triple {20498#true} SUMMARY for call #t~mem3 := read~int(~str.base, ~str.offset + ~i~0, 1); srcloc: L53 {20498#true} is VALID [2020-07-08 23:38:08,780 INFO L280 TraceCheckUtils]: 20: Hoare triple {20498#true} #t~switch4 := 0 == #t~mem3; {20498#true} is VALID [2020-07-08 23:38:08,781 INFO L280 TraceCheckUtils]: 21: Hoare triple {20498#true} assume #t~switch4; {20498#true} is VALID [2020-07-08 23:38:08,781 INFO L280 TraceCheckUtils]: 22: Hoare triple {20498#true} SUMMARY for call #t~mem5 := read~int(~str.base, ~str.offset + ~start~0, 1); srcloc: L55-17 {20498#true} is VALID [2020-07-08 23:38:08,781 INFO L280 TraceCheckUtils]: 23: Hoare triple {20498#true} #t~short7 := 32 == #t~mem5; {20498#true} is VALID [2020-07-08 23:38:08,781 INFO L280 TraceCheckUtils]: 24: Hoare triple {20498#true} assume #t~short7; {20498#true} is VALID [2020-07-08 23:38:08,781 INFO L280 TraceCheckUtils]: 25: Hoare triple {20498#true} assume !!#t~short7; {20498#true} is VALID [2020-07-08 23:38:08,782 INFO L280 TraceCheckUtils]: 26: Hoare triple {20498#true} havoc #t~mem5; {20498#true} is VALID [2020-07-08 23:38:08,782 INFO L280 TraceCheckUtils]: 27: Hoare triple {20498#true} havoc #t~mem6; {20498#true} is VALID [2020-07-08 23:38:08,782 INFO L280 TraceCheckUtils]: 28: Hoare triple {20498#true} havoc #t~short7; {20498#true} is VALID [2020-07-08 23:38:08,782 INFO L280 TraceCheckUtils]: 29: Hoare triple {20498#true} #t~post8 := ~start~0; {20498#true} is VALID [2020-07-08 23:38:08,782 INFO L280 TraceCheckUtils]: 30: Hoare triple {20498#true} ~start~0 := 1 + #t~post8; {20498#true} is VALID [2020-07-08 23:38:08,782 INFO L280 TraceCheckUtils]: 31: Hoare triple {20498#true} havoc #t~post8; {20498#true} is VALID [2020-07-08 23:38:08,783 INFO L280 TraceCheckUtils]: 32: Hoare triple {20498#true} SUMMARY for call #t~mem5 := read~int(~str.base, ~str.offset + ~start~0, 1); srcloc: L55-17 {20498#true} is VALID [2020-07-08 23:38:08,783 INFO L280 TraceCheckUtils]: 33: Hoare triple {20498#true} #t~short7 := 32 == #t~mem5; {20498#true} is VALID [2020-07-08 23:38:08,783 INFO L280 TraceCheckUtils]: 34: Hoare triple {20498#true} assume !#t~short7; {20498#true} is VALID [2020-07-08 23:38:08,783 INFO L280 TraceCheckUtils]: 35: Hoare triple {20498#true} SUMMARY for call #t~mem6 := read~int(~str.base, ~str.offset + ~start~0, 1); srcloc: L55-4 {20498#true} is VALID [2020-07-08 23:38:08,783 INFO L280 TraceCheckUtils]: 36: Hoare triple {20498#true} #t~short7 := 9 == #t~mem6; {20498#true} is VALID [2020-07-08 23:38:08,783 INFO L280 TraceCheckUtils]: 37: Hoare triple {20498#true} assume !#t~short7; {20498#true} is VALID [2020-07-08 23:38:08,784 INFO L280 TraceCheckUtils]: 38: Hoare triple {20498#true} havoc #t~mem5; {20498#true} is VALID [2020-07-08 23:38:08,784 INFO L280 TraceCheckUtils]: 39: Hoare triple {20498#true} havoc #t~mem6; {20498#true} is VALID [2020-07-08 23:38:08,784 INFO L280 TraceCheckUtils]: 40: Hoare triple {20498#true} havoc #t~short7; {20498#true} is VALID [2020-07-08 23:38:08,784 INFO L280 TraceCheckUtils]: 41: Hoare triple {20498#true} SUMMARY for call #t~mem9 := read~int(~str.base, ~str.offset + ~start~0, 1); srcloc: L55-18 {20498#true} is VALID [2020-07-08 23:38:08,784 INFO L280 TraceCheckUtils]: 42: Hoare triple {20498#true} assume !(34 == #t~mem9); {20498#true} is VALID [2020-07-08 23:38:08,784 INFO L280 TraceCheckUtils]: 43: Hoare triple {20498#true} havoc #t~mem9; {20498#true} is VALID [2020-07-08 23:38:08,785 INFO L280 TraceCheckUtils]: 44: Hoare triple {20498#true} ~j~0 := ~i~0 - 1; {20498#true} is VALID [2020-07-08 23:38:08,785 INFO L280 TraceCheckUtils]: 45: Hoare triple {20498#true} #t~short14 := 0 < ~j~0; {20505#(or (<= parse_expression_list_~j~0 0) |parse_expression_list_#t~short14|)} is VALID [2020-07-08 23:38:08,786 INFO L280 TraceCheckUtils]: 46: Hoare triple {20505#(or (<= parse_expression_list_~j~0 0) |parse_expression_list_#t~short14|)} assume !#t~short14; {20506#(<= parse_expression_list_~j~0 0)} is VALID [2020-07-08 23:38:08,787 INFO L280 TraceCheckUtils]: 47: Hoare triple {20506#(<= parse_expression_list_~j~0 0)} assume !#t~short14; {20506#(<= parse_expression_list_~j~0 0)} is VALID [2020-07-08 23:38:08,787 INFO L280 TraceCheckUtils]: 48: Hoare triple {20506#(<= parse_expression_list_~j~0 0)} havoc #t~mem11; {20506#(<= parse_expression_list_~j~0 0)} is VALID [2020-07-08 23:38:08,788 INFO L280 TraceCheckUtils]: 49: Hoare triple {20506#(<= parse_expression_list_~j~0 0)} havoc #t~short13; {20506#(<= parse_expression_list_~j~0 0)} is VALID [2020-07-08 23:38:08,788 INFO L280 TraceCheckUtils]: 50: Hoare triple {20506#(<= parse_expression_list_~j~0 0)} havoc #t~short14; {20506#(<= parse_expression_list_~j~0 0)} is VALID [2020-07-08 23:38:08,789 INFO L280 TraceCheckUtils]: 51: Hoare triple {20506#(<= parse_expression_list_~j~0 0)} havoc #t~mem12; {20506#(<= parse_expression_list_~j~0 0)} is VALID [2020-07-08 23:38:08,789 INFO L280 TraceCheckUtils]: 52: Hoare triple {20506#(<= parse_expression_list_~j~0 0)} #t~short17 := 0 < ~j~0; {20507#(not |parse_expression_list_#t~short17|)} is VALID [2020-07-08 23:38:08,790 INFO L280 TraceCheckUtils]: 53: Hoare triple {20507#(not |parse_expression_list_#t~short17|)} assume #t~short17; {20499#false} is VALID [2020-07-08 23:38:08,790 INFO L280 TraceCheckUtils]: 54: Hoare triple {20499#false} SUMMARY for call #t~mem16 := read~int(~str.base, ~str.offset + ~j~0, 1); srcloc: L59-1 {20499#false} is VALID [2020-07-08 23:38:08,790 INFO L280 TraceCheckUtils]: 55: Hoare triple {20499#false} #t~short17 := 34 == #t~mem16; {20499#false} is VALID [2020-07-08 23:38:08,790 INFO L280 TraceCheckUtils]: 56: Hoare triple {20499#false} assume #t~short17; {20499#false} is VALID [2020-07-08 23:38:08,791 INFO L280 TraceCheckUtils]: 57: Hoare triple {20499#false} havoc #t~short17; {20499#false} is VALID [2020-07-08 23:38:08,791 INFO L280 TraceCheckUtils]: 58: Hoare triple {20499#false} havoc #t~mem16; {20499#false} is VALID [2020-07-08 23:38:08,791 INFO L280 TraceCheckUtils]: 59: Hoare triple {20499#false} #t~post18 := ~j~0; {20499#false} is VALID [2020-07-08 23:38:08,791 INFO L280 TraceCheckUtils]: 60: Hoare triple {20499#false} ~j~0 := #t~post18 - 1; {20499#false} is VALID [2020-07-08 23:38:08,791 INFO L280 TraceCheckUtils]: 61: Hoare triple {20499#false} havoc #t~post18; {20499#false} is VALID [2020-07-08 23:38:08,791 INFO L280 TraceCheckUtils]: 62: Hoare triple {20499#false} assume ~start~0 <= ~j~0; {20499#false} is VALID [2020-07-08 23:38:08,792 INFO L263 TraceCheckUtils]: 63: Hoare triple {20499#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)); {20498#true} is VALID [2020-07-08 23:38:08,792 INFO L280 TraceCheckUtils]: 64: Hoare triple {20498#true} ~dest.base, ~dest.offset := #in~dest.base, #in~dest.offset; {20498#true} is VALID [2020-07-08 23:38:08,792 INFO L280 TraceCheckUtils]: 65: Hoare triple {20498#true} ~src.base, ~src.offset := #in~src.base, #in~src.offset; {20498#true} is VALID [2020-07-08 23:38:08,792 INFO L280 TraceCheckUtils]: 66: Hoare triple {20498#true} ~n := #in~n; {20498#true} is VALID [2020-07-08 23:38:08,792 INFO L280 TraceCheckUtils]: 67: Hoare triple {20498#true} SUMMARY for call #t~ret0.base, #t~ret0.offset := strncpy(~dest.base, ~dest.offset, ~src.base, ~src.offset, ~n); srcloc: L30-2 {20498#true} is VALID [2020-07-08 23:38:08,793 INFO L280 TraceCheckUtils]: 68: Hoare triple {20498#true} #res.base, #res.offset := #t~ret0.base, #t~ret0.offset; {20498#true} is VALID [2020-07-08 23:38:08,793 INFO L280 TraceCheckUtils]: 69: Hoare triple {20498#true} havoc #t~ret0.base, #t~ret0.offset; {20498#true} is VALID [2020-07-08 23:38:08,793 INFO L280 TraceCheckUtils]: 70: Hoare triple {20498#true} assume true; {20498#true} is VALID [2020-07-08 23:38:08,793 INFO L275 TraceCheckUtils]: 71: Hoare quadruple {20498#true} {20499#false} #201#return; {20499#false} is VALID [2020-07-08 23:38:08,793 INFO L280 TraceCheckUtils]: 72: Hoare triple {20499#false} havoc #t~ret19.base, #t~ret19.offset; {20499#false} is VALID [2020-07-08 23:38:08,793 INFO L263 TraceCheckUtils]: 73: Hoare triple {20499#false} call __VERIFIER_assert((if 1 + (~j~0 - ~start~0) < 2 then 1 else 0)); {20499#false} is VALID [2020-07-08 23:38:08,794 INFO L280 TraceCheckUtils]: 74: Hoare triple {20499#false} ~cond := #in~cond; {20499#false} is VALID [2020-07-08 23:38:08,794 INFO L280 TraceCheckUtils]: 75: Hoare triple {20499#false} assume 0 == ~cond; {20499#false} is VALID [2020-07-08 23:38:08,794 INFO L280 TraceCheckUtils]: 76: Hoare triple {20499#false} assume !false; {20499#false} is VALID [2020-07-08 23:38:08,797 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-08 23:38:08,798 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1923609842] [2020-07-08 23:38:08,798 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 23:38:08,798 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-08 23:38:08,798 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879003573] [2020-07-08 23:38:08,799 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 77 [2020-07-08 23:38:08,799 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 23:38:08,799 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-08 23:38:08,870 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:38:08,871 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-08 23:38:08,871 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 23:38:08,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-08 23:38:08,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-07-08 23:38:08,871 INFO L87 Difference]: Start difference. First operand 260 states and 291 transitions. Second operand 6 states. [2020-07-08 23:38:09,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:38:09,946 INFO L93 Difference]: Finished difference Result 411 states and 459 transitions. [2020-07-08 23:38:09,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-08 23:38:09,947 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 77 [2020-07-08 23:38:09,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 23:38:09,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-08 23:38:09,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 264 transitions. [2020-07-08 23:38:09,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-08 23:38:09,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 264 transitions. [2020-07-08 23:38:09,950 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 264 transitions. [2020-07-08 23:38:10,223 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 264 edges. 264 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:38:10,229 INFO L225 Difference]: With dead ends: 411 [2020-07-08 23:38:10,229 INFO L226 Difference]: Without dead ends: 297 [2020-07-08 23:38:10,230 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-07-08 23:38:10,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2020-07-08 23:38:10,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 253. [2020-07-08 23:38:10,596 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 23:38:10,596 INFO L82 GeneralOperation]: Start isEquivalent. First operand 297 states. Second operand 253 states. [2020-07-08 23:38:10,596 INFO L74 IsIncluded]: Start isIncluded. First operand 297 states. Second operand 253 states. [2020-07-08 23:38:10,596 INFO L87 Difference]: Start difference. First operand 297 states. Second operand 253 states. [2020-07-08 23:38:10,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:38:10,604 INFO L93 Difference]: Finished difference Result 297 states and 331 transitions. [2020-07-08 23:38:10,604 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 331 transitions. [2020-07-08 23:38:10,605 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:38:10,605 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:38:10,605 INFO L74 IsIncluded]: Start isIncluded. First operand 253 states. Second operand 297 states. [2020-07-08 23:38:10,605 INFO L87 Difference]: Start difference. First operand 253 states. Second operand 297 states. [2020-07-08 23:38:10,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:38:10,612 INFO L93 Difference]: Finished difference Result 297 states and 331 transitions. [2020-07-08 23:38:10,613 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 331 transitions. [2020-07-08 23:38:10,613 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:38:10,613 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:38:10,614 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 23:38:10,614 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 23:38:10,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2020-07-08 23:38:10,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 281 transitions. [2020-07-08 23:38:10,619 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 281 transitions. Word has length 77 [2020-07-08 23:38:10,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 23:38:10,620 INFO L479 AbstractCegarLoop]: Abstraction has 253 states and 281 transitions. [2020-07-08 23:38:10,620 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-08 23:38:10,620 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 253 states and 281 transitions. [2020-07-08 23:38:10,979 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 281 edges. 281 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:38:10,979 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 281 transitions. [2020-07-08 23:38:10,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2020-07-08 23:38:10,981 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 23:38:10,981 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, 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-08 23:38:10,982 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-07-08 23:38:10,982 INFO L427 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 23:38:10,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 23:38:10,982 INFO L82 PathProgramCache]: Analyzing trace with hash 2031617893, now seen corresponding path program 1 times [2020-07-08 23:38:10,982 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 23:38:10,983 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [910342507] [2020-07-08 23:38:10,983 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 23:38:10,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:38:11,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:38:11,067 INFO L280 TraceCheckUtils]: 0: Hoare triple {22465#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {22445#true} is VALID [2020-07-08 23:38:11,067 INFO L280 TraceCheckUtils]: 1: Hoare triple {22445#true} #valid := #valid[0 := 0]; {22445#true} is VALID [2020-07-08 23:38:11,067 INFO L280 TraceCheckUtils]: 2: Hoare triple {22445#true} assume 0 < #StackHeapBarrier; {22445#true} is VALID [2020-07-08 23:38:11,068 INFO L280 TraceCheckUtils]: 3: Hoare triple {22445#true} assume true; {22445#true} is VALID [2020-07-08 23:38:11,068 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {22445#true} {22445#true} #205#return; {22445#true} is VALID [2020-07-08 23:38:11,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:38:11,071 INFO L280 TraceCheckUtils]: 0: Hoare triple {22445#true} ~dest.base, ~dest.offset := #in~dest.base, #in~dest.offset; {22445#true} is VALID [2020-07-08 23:38:11,072 INFO L280 TraceCheckUtils]: 1: Hoare triple {22445#true} ~src.base, ~src.offset := #in~src.base, #in~src.offset; {22445#true} is VALID [2020-07-08 23:38:11,072 INFO L280 TraceCheckUtils]: 2: Hoare triple {22445#true} ~n := #in~n; {22445#true} is VALID [2020-07-08 23:38:11,072 INFO L280 TraceCheckUtils]: 3: Hoare triple {22445#true} SUMMARY for call #t~ret0.base, #t~ret0.offset := strncpy(~dest.base, ~dest.offset, ~src.base, ~src.offset, ~n); srcloc: L30-2 {22445#true} is VALID [2020-07-08 23:38:11,072 INFO L280 TraceCheckUtils]: 4: Hoare triple {22445#true} #res.base, #res.offset := #t~ret0.base, #t~ret0.offset; {22445#true} is VALID [2020-07-08 23:38:11,073 INFO L280 TraceCheckUtils]: 5: Hoare triple {22445#true} havoc #t~ret0.base, #t~ret0.offset; {22445#true} is VALID [2020-07-08 23:38:11,073 INFO L280 TraceCheckUtils]: 6: Hoare triple {22445#true} assume true; {22445#true} is VALID [2020-07-08 23:38:11,073 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {22445#true} {22446#false} #201#return; {22446#false} is VALID [2020-07-08 23:38:11,074 INFO L263 TraceCheckUtils]: 0: Hoare triple {22445#true} call ULTIMATE.init(); {22465#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 23:38:11,074 INFO L280 TraceCheckUtils]: 1: Hoare triple {22465#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {22445#true} is VALID [2020-07-08 23:38:11,075 INFO L280 TraceCheckUtils]: 2: Hoare triple {22445#true} #valid := #valid[0 := 0]; {22445#true} is VALID [2020-07-08 23:38:11,075 INFO L280 TraceCheckUtils]: 3: Hoare triple {22445#true} assume 0 < #StackHeapBarrier; {22445#true} is VALID [2020-07-08 23:38:11,075 INFO L280 TraceCheckUtils]: 4: Hoare triple {22445#true} assume true; {22445#true} is VALID [2020-07-08 23:38:11,075 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {22445#true} {22445#true} #205#return; {22445#true} is VALID [2020-07-08 23:38:11,075 INFO L263 TraceCheckUtils]: 6: Hoare triple {22445#true} call #t~ret21 := main(); {22445#true} is VALID [2020-07-08 23:38:11,076 INFO L280 TraceCheckUtils]: 7: Hoare triple {22445#true} SUMMARY for call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(9); srcloc: mainENTRY {22445#true} is VALID [2020-07-08 23:38:11,076 INFO L280 TraceCheckUtils]: 8: Hoare triple {22445#true} SUMMARY for call write~int(0, ~#A~0.base, 8 + ~#A~0.offset, 1); srcloc: L74 {22445#true} is VALID [2020-07-08 23:38:11,076 INFO L263 TraceCheckUtils]: 9: Hoare triple {22445#true} call #t~ret20 := parse_expression_list(~#A~0.base, ~#A~0.offset); {22445#true} is VALID [2020-07-08 23:38:11,076 INFO L280 TraceCheckUtils]: 10: Hoare triple {22445#true} ~str.base, ~str.offset := #in~str.base, #in~str.offset; {22445#true} is VALID [2020-07-08 23:38:11,076 INFO L280 TraceCheckUtils]: 11: Hoare triple {22445#true} ~start~0 := 0; {22445#true} is VALID [2020-07-08 23:38:11,077 INFO L280 TraceCheckUtils]: 12: Hoare triple {22445#true} ~i~0 := -1; {22452#(<= (+ parse_expression_list_~i~0 1) 0)} is VALID [2020-07-08 23:38:11,077 INFO L280 TraceCheckUtils]: 13: Hoare triple {22452#(<= (+ parse_expression_list_~i~0 1) 0)} ~j~0 := -1; {22452#(<= (+ parse_expression_list_~i~0 1) 0)} is VALID [2020-07-08 23:38:11,078 INFO L280 TraceCheckUtils]: 14: Hoare triple {22452#(<= (+ parse_expression_list_~i~0 1) 0)} SUMMARY for call ~#str2~0.base, ~#str2~0.offset := #Ultimate.allocOnStack(2); srcloc: L49 {22452#(<= (+ parse_expression_list_~i~0 1) 0)} is VALID [2020-07-08 23:38:11,079 INFO L280 TraceCheckUtils]: 15: Hoare triple {22452#(<= (+ parse_expression_list_~i~0 1) 0)} assume !(~str.base == 0 && ~str.offset == 0); {22452#(<= (+ parse_expression_list_~i~0 1) 0)} is VALID [2020-07-08 23:38:11,079 INFO L280 TraceCheckUtils]: 16: Hoare triple {22452#(<= (+ parse_expression_list_~i~0 1) 0)} #t~post2 := ~i~0; {22453#(<= (+ |parse_expression_list_#t~post2| 1) 0)} is VALID [2020-07-08 23:38:11,080 INFO L280 TraceCheckUtils]: 17: Hoare triple {22453#(<= (+ |parse_expression_list_#t~post2| 1) 0)} ~i~0 := 1 + #t~post2; {22454#(<= parse_expression_list_~i~0 0)} is VALID [2020-07-08 23:38:11,080 INFO L280 TraceCheckUtils]: 18: Hoare triple {22454#(<= parse_expression_list_~i~0 0)} havoc #t~post2; {22454#(<= parse_expression_list_~i~0 0)} is VALID [2020-07-08 23:38:11,081 INFO L280 TraceCheckUtils]: 19: Hoare triple {22454#(<= parse_expression_list_~i~0 0)} SUMMARY for call #t~mem3 := read~int(~str.base, ~str.offset + ~i~0, 1); srcloc: L53 {22454#(<= parse_expression_list_~i~0 0)} is VALID [2020-07-08 23:38:11,082 INFO L280 TraceCheckUtils]: 20: Hoare triple {22454#(<= parse_expression_list_~i~0 0)} #t~switch4 := 0 == #t~mem3; {22454#(<= parse_expression_list_~i~0 0)} is VALID [2020-07-08 23:38:11,082 INFO L280 TraceCheckUtils]: 21: Hoare triple {22454#(<= parse_expression_list_~i~0 0)} assume #t~switch4; {22454#(<= parse_expression_list_~i~0 0)} is VALID [2020-07-08 23:38:11,083 INFO L280 TraceCheckUtils]: 22: Hoare triple {22454#(<= parse_expression_list_~i~0 0)} SUMMARY for call #t~mem5 := read~int(~str.base, ~str.offset + ~start~0, 1); srcloc: L55-17 {22454#(<= parse_expression_list_~i~0 0)} is VALID [2020-07-08 23:38:11,083 INFO L280 TraceCheckUtils]: 23: Hoare triple {22454#(<= parse_expression_list_~i~0 0)} #t~short7 := 32 == #t~mem5; {22454#(<= parse_expression_list_~i~0 0)} is VALID [2020-07-08 23:38:11,084 INFO L280 TraceCheckUtils]: 24: Hoare triple {22454#(<= parse_expression_list_~i~0 0)} assume #t~short7; {22454#(<= parse_expression_list_~i~0 0)} is VALID [2020-07-08 23:38:11,084 INFO L280 TraceCheckUtils]: 25: Hoare triple {22454#(<= parse_expression_list_~i~0 0)} assume !!#t~short7; {22454#(<= parse_expression_list_~i~0 0)} is VALID [2020-07-08 23:38:11,085 INFO L280 TraceCheckUtils]: 26: Hoare triple {22454#(<= parse_expression_list_~i~0 0)} havoc #t~mem5; {22454#(<= parse_expression_list_~i~0 0)} is VALID [2020-07-08 23:38:11,085 INFO L280 TraceCheckUtils]: 27: Hoare triple {22454#(<= parse_expression_list_~i~0 0)} havoc #t~mem6; {22454#(<= parse_expression_list_~i~0 0)} is VALID [2020-07-08 23:38:11,086 INFO L280 TraceCheckUtils]: 28: Hoare triple {22454#(<= parse_expression_list_~i~0 0)} havoc #t~short7; {22454#(<= parse_expression_list_~i~0 0)} is VALID [2020-07-08 23:38:11,086 INFO L280 TraceCheckUtils]: 29: Hoare triple {22454#(<= parse_expression_list_~i~0 0)} #t~post8 := ~start~0; {22454#(<= parse_expression_list_~i~0 0)} is VALID [2020-07-08 23:38:11,087 INFO L280 TraceCheckUtils]: 30: Hoare triple {22454#(<= parse_expression_list_~i~0 0)} ~start~0 := 1 + #t~post8; {22454#(<= parse_expression_list_~i~0 0)} is VALID [2020-07-08 23:38:11,087 INFO L280 TraceCheckUtils]: 31: Hoare triple {22454#(<= parse_expression_list_~i~0 0)} havoc #t~post8; {22454#(<= parse_expression_list_~i~0 0)} is VALID [2020-07-08 23:38:11,088 INFO L280 TraceCheckUtils]: 32: Hoare triple {22454#(<= parse_expression_list_~i~0 0)} SUMMARY for call #t~mem5 := read~int(~str.base, ~str.offset + ~start~0, 1); srcloc: L55-17 {22454#(<= parse_expression_list_~i~0 0)} is VALID [2020-07-08 23:38:11,088 INFO L280 TraceCheckUtils]: 33: Hoare triple {22454#(<= parse_expression_list_~i~0 0)} #t~short7 := 32 == #t~mem5; {22454#(<= parse_expression_list_~i~0 0)} is VALID [2020-07-08 23:38:11,089 INFO L280 TraceCheckUtils]: 34: Hoare triple {22454#(<= parse_expression_list_~i~0 0)} assume !#t~short7; {22454#(<= parse_expression_list_~i~0 0)} is VALID [2020-07-08 23:38:11,089 INFO L280 TraceCheckUtils]: 35: Hoare triple {22454#(<= parse_expression_list_~i~0 0)} SUMMARY for call #t~mem6 := read~int(~str.base, ~str.offset + ~start~0, 1); srcloc: L55-4 {22454#(<= parse_expression_list_~i~0 0)} is VALID [2020-07-08 23:38:11,090 INFO L280 TraceCheckUtils]: 36: Hoare triple {22454#(<= parse_expression_list_~i~0 0)} #t~short7 := 9 == #t~mem6; {22454#(<= parse_expression_list_~i~0 0)} is VALID [2020-07-08 23:38:11,090 INFO L280 TraceCheckUtils]: 37: Hoare triple {22454#(<= parse_expression_list_~i~0 0)} assume !#t~short7; {22454#(<= parse_expression_list_~i~0 0)} is VALID [2020-07-08 23:38:11,091 INFO L280 TraceCheckUtils]: 38: Hoare triple {22454#(<= parse_expression_list_~i~0 0)} havoc #t~mem5; {22454#(<= parse_expression_list_~i~0 0)} is VALID [2020-07-08 23:38:11,091 INFO L280 TraceCheckUtils]: 39: Hoare triple {22454#(<= parse_expression_list_~i~0 0)} havoc #t~mem6; {22454#(<= parse_expression_list_~i~0 0)} is VALID [2020-07-08 23:38:11,092 INFO L280 TraceCheckUtils]: 40: Hoare triple {22454#(<= parse_expression_list_~i~0 0)} havoc #t~short7; {22454#(<= parse_expression_list_~i~0 0)} is VALID [2020-07-08 23:38:11,092 INFO L280 TraceCheckUtils]: 41: Hoare triple {22454#(<= parse_expression_list_~i~0 0)} SUMMARY for call #t~mem9 := read~int(~str.base, ~str.offset + ~start~0, 1); srcloc: L55-18 {22454#(<= parse_expression_list_~i~0 0)} is VALID [2020-07-08 23:38:11,093 INFO L280 TraceCheckUtils]: 42: Hoare triple {22454#(<= parse_expression_list_~i~0 0)} assume !(34 == #t~mem9); {22454#(<= parse_expression_list_~i~0 0)} is VALID [2020-07-08 23:38:11,093 INFO L280 TraceCheckUtils]: 43: Hoare triple {22454#(<= parse_expression_list_~i~0 0)} havoc #t~mem9; {22454#(<= parse_expression_list_~i~0 0)} is VALID [2020-07-08 23:38:11,095 INFO L280 TraceCheckUtils]: 44: Hoare triple {22454#(<= parse_expression_list_~i~0 0)} ~j~0 := ~i~0 - 1; {22455#(<= (+ parse_expression_list_~j~0 1) 0)} is VALID [2020-07-08 23:38:11,095 INFO L280 TraceCheckUtils]: 45: Hoare triple {22455#(<= (+ parse_expression_list_~j~0 1) 0)} #t~short14 := 0 < ~j~0; {22456#(not |parse_expression_list_#t~short14|)} is VALID [2020-07-08 23:38:11,096 INFO L280 TraceCheckUtils]: 46: Hoare triple {22456#(not |parse_expression_list_#t~short14|)} assume #t~short14; {22446#false} is VALID [2020-07-08 23:38:11,096 INFO L280 TraceCheckUtils]: 47: Hoare triple {22446#false} SUMMARY for call #t~mem11 := read~int(~str.base, ~str.offset + ~j~0, 1); srcloc: L58-2 {22446#false} is VALID [2020-07-08 23:38:11,096 INFO L280 TraceCheckUtils]: 48: Hoare triple {22446#false} #t~short13 := 32 == #t~mem11; {22446#false} is VALID [2020-07-08 23:38:11,097 INFO L280 TraceCheckUtils]: 49: Hoare triple {22446#false} assume !#t~short13; {22446#false} is VALID [2020-07-08 23:38:11,097 INFO L280 TraceCheckUtils]: 50: Hoare triple {22446#false} SUMMARY for call #t~mem12 := read~int(~str.base, ~str.offset + ~j~0, 1); srcloc: L58-6 {22446#false} is VALID [2020-07-08 23:38:11,097 INFO L280 TraceCheckUtils]: 51: Hoare triple {22446#false} #t~short13 := 9 == #t~mem12; {22446#false} is VALID [2020-07-08 23:38:11,097 INFO L280 TraceCheckUtils]: 52: Hoare triple {22446#false} #t~short14 := #t~short13; {22446#false} is VALID [2020-07-08 23:38:11,097 INFO L280 TraceCheckUtils]: 53: Hoare triple {22446#false} assume !#t~short14; {22446#false} is VALID [2020-07-08 23:38:11,097 INFO L280 TraceCheckUtils]: 54: Hoare triple {22446#false} havoc #t~mem11; {22446#false} is VALID [2020-07-08 23:38:11,098 INFO L280 TraceCheckUtils]: 55: Hoare triple {22446#false} havoc #t~short13; {22446#false} is VALID [2020-07-08 23:38:11,098 INFO L280 TraceCheckUtils]: 56: Hoare triple {22446#false} havoc #t~short14; {22446#false} is VALID [2020-07-08 23:38:11,098 INFO L280 TraceCheckUtils]: 57: Hoare triple {22446#false} havoc #t~mem12; {22446#false} is VALID [2020-07-08 23:38:11,098 INFO L280 TraceCheckUtils]: 58: Hoare triple {22446#false} #t~short17 := 0 < ~j~0; {22446#false} is VALID [2020-07-08 23:38:11,098 INFO L280 TraceCheckUtils]: 59: Hoare triple {22446#false} assume !#t~short17; {22446#false} is VALID [2020-07-08 23:38:11,098 INFO L280 TraceCheckUtils]: 60: Hoare triple {22446#false} assume !#t~short17; {22446#false} is VALID [2020-07-08 23:38:11,099 INFO L280 TraceCheckUtils]: 61: Hoare triple {22446#false} havoc #t~short17; {22446#false} is VALID [2020-07-08 23:38:11,099 INFO L280 TraceCheckUtils]: 62: Hoare triple {22446#false} havoc #t~mem16; {22446#false} is VALID [2020-07-08 23:38:11,099 INFO L280 TraceCheckUtils]: 63: Hoare triple {22446#false} assume ~start~0 <= ~j~0; {22446#false} is VALID [2020-07-08 23:38:11,099 INFO L263 TraceCheckUtils]: 64: Hoare triple {22446#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)); {22445#true} is VALID [2020-07-08 23:38:11,100 INFO L280 TraceCheckUtils]: 65: Hoare triple {22445#true} ~dest.base, ~dest.offset := #in~dest.base, #in~dest.offset; {22445#true} is VALID [2020-07-08 23:38:11,100 INFO L280 TraceCheckUtils]: 66: Hoare triple {22445#true} ~src.base, ~src.offset := #in~src.base, #in~src.offset; {22445#true} is VALID [2020-07-08 23:38:11,100 INFO L280 TraceCheckUtils]: 67: Hoare triple {22445#true} ~n := #in~n; {22445#true} is VALID [2020-07-08 23:38:11,100 INFO L280 TraceCheckUtils]: 68: Hoare triple {22445#true} SUMMARY for call #t~ret0.base, #t~ret0.offset := strncpy(~dest.base, ~dest.offset, ~src.base, ~src.offset, ~n); srcloc: L30-2 {22445#true} is VALID [2020-07-08 23:38:11,100 INFO L280 TraceCheckUtils]: 69: Hoare triple {22445#true} #res.base, #res.offset := #t~ret0.base, #t~ret0.offset; {22445#true} is VALID [2020-07-08 23:38:11,100 INFO L280 TraceCheckUtils]: 70: Hoare triple {22445#true} havoc #t~ret0.base, #t~ret0.offset; {22445#true} is VALID [2020-07-08 23:38:11,101 INFO L280 TraceCheckUtils]: 71: Hoare triple {22445#true} assume true; {22445#true} is VALID [2020-07-08 23:38:11,101 INFO L275 TraceCheckUtils]: 72: Hoare quadruple {22445#true} {22446#false} #201#return; {22446#false} is VALID [2020-07-08 23:38:11,101 INFO L280 TraceCheckUtils]: 73: Hoare triple {22446#false} havoc #t~ret19.base, #t~ret19.offset; {22446#false} is VALID [2020-07-08 23:38:11,101 INFO L263 TraceCheckUtils]: 74: Hoare triple {22446#false} call __VERIFIER_assert((if 1 + (~j~0 - ~start~0) < 2 then 1 else 0)); {22446#false} is VALID [2020-07-08 23:38:11,101 INFO L280 TraceCheckUtils]: 75: Hoare triple {22446#false} ~cond := #in~cond; {22446#false} is VALID [2020-07-08 23:38:11,102 INFO L280 TraceCheckUtils]: 76: Hoare triple {22446#false} assume 0 == ~cond; {22446#false} is VALID [2020-07-08 23:38:11,102 INFO L280 TraceCheckUtils]: 77: Hoare triple {22446#false} assume !false; {22446#false} is VALID [2020-07-08 23:38:11,106 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-08 23:38:11,107 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [910342507] [2020-07-08 23:38:11,107 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 23:38:11,107 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-07-08 23:38:11,107 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367675383] [2020-07-08 23:38:11,108 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 78 [2020-07-08 23:38:11,108 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 23:38:11,108 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-08 23:38:11,179 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:38:11,179 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-08 23:38:11,179 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 23:38:11,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-08 23:38:11,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-07-08 23:38:11,180 INFO L87 Difference]: Start difference. First operand 253 states and 281 transitions. Second operand 8 states. [2020-07-08 23:38:12,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:38:12,915 INFO L93 Difference]: Finished difference Result 521 states and 577 transitions. [2020-07-08 23:38:12,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-08 23:38:12,916 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 78 [2020-07-08 23:38:12,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 23:38:12,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-08 23:38:12,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 306 transitions. [2020-07-08 23:38:12,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-08 23:38:12,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 306 transitions. [2020-07-08 23:38:12,919 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 306 transitions. [2020-07-08 23:38:13,236 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 306 edges. 306 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:38:13,244 INFO L225 Difference]: With dead ends: 521 [2020-07-08 23:38:13,244 INFO L226 Difference]: Without dead ends: 331 [2020-07-08 23:38:13,245 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2020-07-08 23:38:13,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2020-07-08 23:38:13,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 264. [2020-07-08 23:38:13,641 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 23:38:13,642 INFO L82 GeneralOperation]: Start isEquivalent. First operand 331 states. Second operand 264 states. [2020-07-08 23:38:13,642 INFO L74 IsIncluded]: Start isIncluded. First operand 331 states. Second operand 264 states. [2020-07-08 23:38:13,642 INFO L87 Difference]: Start difference. First operand 331 states. Second operand 264 states. [2020-07-08 23:38:13,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:38:13,651 INFO L93 Difference]: Finished difference Result 331 states and 365 transitions. [2020-07-08 23:38:13,651 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 365 transitions. [2020-07-08 23:38:13,652 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:38:13,652 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:38:13,652 INFO L74 IsIncluded]: Start isIncluded. First operand 264 states. Second operand 331 states. [2020-07-08 23:38:13,652 INFO L87 Difference]: Start difference. First operand 264 states. Second operand 331 states. [2020-07-08 23:38:13,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:38:13,660 INFO L93 Difference]: Finished difference Result 331 states and 365 transitions. [2020-07-08 23:38:13,660 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 365 transitions. [2020-07-08 23:38:13,661 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:38:13,661 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:38:13,661 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 23:38:13,661 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 23:38:13,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2020-07-08 23:38:13,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 292 transitions. [2020-07-08 23:38:13,667 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 292 transitions. Word has length 78 [2020-07-08 23:38:13,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 23:38:13,667 INFO L479 AbstractCegarLoop]: Abstraction has 264 states and 292 transitions. [2020-07-08 23:38:13,667 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-08 23:38:13,668 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 264 states and 292 transitions. [2020-07-08 23:38:14,039 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 292 edges. 292 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:38:14,039 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 292 transitions. [2020-07-08 23:38:14,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2020-07-08 23:38:14,044 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 23:38:14,044 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 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, 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-08 23:38:14,045 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-07-08 23:38:14,045 INFO L427 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 23:38:14,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 23:38:14,045 INFO L82 PathProgramCache]: Analyzing trace with hash -1446971750, now seen corresponding path program 1 times [2020-07-08 23:38:14,045 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 23:38:14,045 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [445054986] [2020-07-08 23:38:14,045 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 23:38:14,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:38:14,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:38:14,163 INFO L280 TraceCheckUtils]: 0: Hoare triple {24736#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {24714#true} is VALID [2020-07-08 23:38:14,164 INFO L280 TraceCheckUtils]: 1: Hoare triple {24714#true} #valid := #valid[0 := 0]; {24714#true} is VALID [2020-07-08 23:38:14,164 INFO L280 TraceCheckUtils]: 2: Hoare triple {24714#true} assume 0 < #StackHeapBarrier; {24714#true} is VALID [2020-07-08 23:38:14,164 INFO L280 TraceCheckUtils]: 3: Hoare triple {24714#true} assume true; {24714#true} is VALID [2020-07-08 23:38:14,164 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {24714#true} {24714#true} #205#return; {24714#true} is VALID [2020-07-08 23:38:14,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:38:14,168 INFO L280 TraceCheckUtils]: 0: Hoare triple {24714#true} ~dest.base, ~dest.offset := #in~dest.base, #in~dest.offset; {24714#true} is VALID [2020-07-08 23:38:14,169 INFO L280 TraceCheckUtils]: 1: Hoare triple {24714#true} ~src.base, ~src.offset := #in~src.base, #in~src.offset; {24714#true} is VALID [2020-07-08 23:38:14,169 INFO L280 TraceCheckUtils]: 2: Hoare triple {24714#true} ~n := #in~n; {24714#true} is VALID [2020-07-08 23:38:14,169 INFO L280 TraceCheckUtils]: 3: Hoare triple {24714#true} SUMMARY for call #t~ret0.base, #t~ret0.offset := strncpy(~dest.base, ~dest.offset, ~src.base, ~src.offset, ~n); srcloc: L30-2 {24714#true} is VALID [2020-07-08 23:38:14,169 INFO L280 TraceCheckUtils]: 4: Hoare triple {24714#true} #res.base, #res.offset := #t~ret0.base, #t~ret0.offset; {24714#true} is VALID [2020-07-08 23:38:14,170 INFO L280 TraceCheckUtils]: 5: Hoare triple {24714#true} havoc #t~ret0.base, #t~ret0.offset; {24714#true} is VALID [2020-07-08 23:38:14,170 INFO L280 TraceCheckUtils]: 6: Hoare triple {24714#true} assume true; {24714#true} is VALID [2020-07-08 23:38:14,170 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {24714#true} {24715#false} #201#return; {24715#false} is VALID [2020-07-08 23:38:14,171 INFO L263 TraceCheckUtils]: 0: Hoare triple {24714#true} call ULTIMATE.init(); {24736#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 23:38:14,171 INFO L280 TraceCheckUtils]: 1: Hoare triple {24736#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {24714#true} is VALID [2020-07-08 23:38:14,172 INFO L280 TraceCheckUtils]: 2: Hoare triple {24714#true} #valid := #valid[0 := 0]; {24714#true} is VALID [2020-07-08 23:38:14,172 INFO L280 TraceCheckUtils]: 3: Hoare triple {24714#true} assume 0 < #StackHeapBarrier; {24714#true} is VALID [2020-07-08 23:38:14,172 INFO L280 TraceCheckUtils]: 4: Hoare triple {24714#true} assume true; {24714#true} is VALID [2020-07-08 23:38:14,172 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {24714#true} {24714#true} #205#return; {24714#true} is VALID [2020-07-08 23:38:14,172 INFO L263 TraceCheckUtils]: 6: Hoare triple {24714#true} call #t~ret21 := main(); {24714#true} is VALID [2020-07-08 23:38:14,173 INFO L280 TraceCheckUtils]: 7: Hoare triple {24714#true} SUMMARY for call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(9); srcloc: mainENTRY {24714#true} is VALID [2020-07-08 23:38:14,173 INFO L280 TraceCheckUtils]: 8: Hoare triple {24714#true} SUMMARY for call write~int(0, ~#A~0.base, 8 + ~#A~0.offset, 1); srcloc: L74 {24714#true} is VALID [2020-07-08 23:38:14,173 INFO L263 TraceCheckUtils]: 9: Hoare triple {24714#true} call #t~ret20 := parse_expression_list(~#A~0.base, ~#A~0.offset); {24714#true} is VALID [2020-07-08 23:38:14,173 INFO L280 TraceCheckUtils]: 10: Hoare triple {24714#true} ~str.base, ~str.offset := #in~str.base, #in~str.offset; {24714#true} is VALID [2020-07-08 23:38:14,173 INFO L280 TraceCheckUtils]: 11: Hoare triple {24714#true} ~start~0 := 0; {24714#true} is VALID [2020-07-08 23:38:14,175 INFO L280 TraceCheckUtils]: 12: Hoare triple {24714#true} ~i~0 := -1; {24721#(<= (+ parse_expression_list_~i~0 1) 0)} is VALID [2020-07-08 23:38:14,175 INFO L280 TraceCheckUtils]: 13: Hoare triple {24721#(<= (+ parse_expression_list_~i~0 1) 0)} ~j~0 := -1; {24721#(<= (+ parse_expression_list_~i~0 1) 0)} is VALID [2020-07-08 23:38:14,176 INFO L280 TraceCheckUtils]: 14: Hoare triple {24721#(<= (+ parse_expression_list_~i~0 1) 0)} SUMMARY for call ~#str2~0.base, ~#str2~0.offset := #Ultimate.allocOnStack(2); srcloc: L49 {24721#(<= (+ parse_expression_list_~i~0 1) 0)} is VALID [2020-07-08 23:38:14,177 INFO L280 TraceCheckUtils]: 15: Hoare triple {24721#(<= (+ parse_expression_list_~i~0 1) 0)} assume !(~str.base == 0 && ~str.offset == 0); {24721#(<= (+ parse_expression_list_~i~0 1) 0)} is VALID [2020-07-08 23:38:14,178 INFO L280 TraceCheckUtils]: 16: Hoare triple {24721#(<= (+ parse_expression_list_~i~0 1) 0)} #t~post2 := ~i~0; {24722#(<= (+ |parse_expression_list_#t~post2| 1) 0)} is VALID [2020-07-08 23:38:14,179 INFO L280 TraceCheckUtils]: 17: Hoare triple {24722#(<= (+ |parse_expression_list_#t~post2| 1) 0)} ~i~0 := 1 + #t~post2; {24723#(<= parse_expression_list_~i~0 0)} is VALID [2020-07-08 23:38:14,180 INFO L280 TraceCheckUtils]: 18: Hoare triple {24723#(<= parse_expression_list_~i~0 0)} havoc #t~post2; {24723#(<= parse_expression_list_~i~0 0)} is VALID [2020-07-08 23:38:14,180 INFO L280 TraceCheckUtils]: 19: Hoare triple {24723#(<= parse_expression_list_~i~0 0)} SUMMARY for call #t~mem3 := read~int(~str.base, ~str.offset + ~i~0, 1); srcloc: L53 {24723#(<= parse_expression_list_~i~0 0)} is VALID [2020-07-08 23:38:14,181 INFO L280 TraceCheckUtils]: 20: Hoare triple {24723#(<= parse_expression_list_~i~0 0)} #t~switch4 := 0 == #t~mem3; {24723#(<= parse_expression_list_~i~0 0)} is VALID [2020-07-08 23:38:14,181 INFO L280 TraceCheckUtils]: 21: Hoare triple {24723#(<= parse_expression_list_~i~0 0)} assume !#t~switch4; {24723#(<= parse_expression_list_~i~0 0)} is VALID [2020-07-08 23:38:14,182 INFO L280 TraceCheckUtils]: 22: Hoare triple {24723#(<= parse_expression_list_~i~0 0)} havoc #t~mem3; {24723#(<= parse_expression_list_~i~0 0)} is VALID [2020-07-08 23:38:14,182 INFO L280 TraceCheckUtils]: 23: Hoare triple {24723#(<= parse_expression_list_~i~0 0)} havoc #t~switch4; {24723#(<= parse_expression_list_~i~0 0)} is VALID [2020-07-08 23:38:14,183 INFO L280 TraceCheckUtils]: 24: Hoare triple {24723#(<= parse_expression_list_~i~0 0)} SUMMARY for call #t~mem1 := read~int(~str.base, ~str.offset + ~i~0, 1); srcloc: L51-1 {24723#(<= parse_expression_list_~i~0 0)} is VALID [2020-07-08 23:38:14,183 INFO L280 TraceCheckUtils]: 25: Hoare triple {24723#(<= parse_expression_list_~i~0 0)} assume !!(0 != #t~mem1); {24723#(<= parse_expression_list_~i~0 0)} is VALID [2020-07-08 23:38:14,184 INFO L280 TraceCheckUtils]: 26: Hoare triple {24723#(<= parse_expression_list_~i~0 0)} havoc #t~mem1; {24723#(<= parse_expression_list_~i~0 0)} is VALID [2020-07-08 23:38:14,185 INFO L280 TraceCheckUtils]: 27: Hoare triple {24723#(<= parse_expression_list_~i~0 0)} #t~post2 := ~i~0; {24724#(<= |parse_expression_list_#t~post2| 0)} is VALID [2020-07-08 23:38:14,185 INFO L280 TraceCheckUtils]: 28: Hoare triple {24724#(<= |parse_expression_list_#t~post2| 0)} ~i~0 := 1 + #t~post2; {24725#(<= parse_expression_list_~i~0 1)} is VALID [2020-07-08 23:38:14,186 INFO L280 TraceCheckUtils]: 29: Hoare triple {24725#(<= parse_expression_list_~i~0 1)} havoc #t~post2; {24725#(<= parse_expression_list_~i~0 1)} is VALID [2020-07-08 23:38:14,187 INFO L280 TraceCheckUtils]: 30: Hoare triple {24725#(<= parse_expression_list_~i~0 1)} SUMMARY for call #t~mem3 := read~int(~str.base, ~str.offset + ~i~0, 1); srcloc: L53 {24725#(<= parse_expression_list_~i~0 1)} is VALID [2020-07-08 23:38:14,188 INFO L280 TraceCheckUtils]: 31: Hoare triple {24725#(<= parse_expression_list_~i~0 1)} #t~switch4 := 0 == #t~mem3; {24725#(<= parse_expression_list_~i~0 1)} is VALID [2020-07-08 23:38:14,189 INFO L280 TraceCheckUtils]: 32: Hoare triple {24725#(<= parse_expression_list_~i~0 1)} assume #t~switch4; {24725#(<= parse_expression_list_~i~0 1)} is VALID [2020-07-08 23:38:14,190 INFO L280 TraceCheckUtils]: 33: Hoare triple {24725#(<= parse_expression_list_~i~0 1)} SUMMARY for call #t~mem5 := read~int(~str.base, ~str.offset + ~start~0, 1); srcloc: L55-17 {24725#(<= parse_expression_list_~i~0 1)} is VALID [2020-07-08 23:38:14,191 INFO L280 TraceCheckUtils]: 34: Hoare triple {24725#(<= parse_expression_list_~i~0 1)} #t~short7 := 32 == #t~mem5; {24725#(<= parse_expression_list_~i~0 1)} is VALID [2020-07-08 23:38:14,191 INFO L280 TraceCheckUtils]: 35: Hoare triple {24725#(<= parse_expression_list_~i~0 1)} assume !#t~short7; {24725#(<= parse_expression_list_~i~0 1)} is VALID [2020-07-08 23:38:14,192 INFO L280 TraceCheckUtils]: 36: Hoare triple {24725#(<= parse_expression_list_~i~0 1)} SUMMARY for call #t~mem6 := read~int(~str.base, ~str.offset + ~start~0, 1); srcloc: L55-4 {24725#(<= parse_expression_list_~i~0 1)} is VALID [2020-07-08 23:38:14,194 INFO L280 TraceCheckUtils]: 37: Hoare triple {24725#(<= parse_expression_list_~i~0 1)} #t~short7 := 9 == #t~mem6; {24725#(<= parse_expression_list_~i~0 1)} is VALID [2020-07-08 23:38:14,194 INFO L280 TraceCheckUtils]: 38: Hoare triple {24725#(<= parse_expression_list_~i~0 1)} assume !#t~short7; {24725#(<= parse_expression_list_~i~0 1)} is VALID [2020-07-08 23:38:14,195 INFO L280 TraceCheckUtils]: 39: Hoare triple {24725#(<= parse_expression_list_~i~0 1)} havoc #t~mem5; {24725#(<= parse_expression_list_~i~0 1)} is VALID [2020-07-08 23:38:14,196 INFO L280 TraceCheckUtils]: 40: Hoare triple {24725#(<= parse_expression_list_~i~0 1)} havoc #t~mem6; {24725#(<= parse_expression_list_~i~0 1)} is VALID [2020-07-08 23:38:14,197 INFO L280 TraceCheckUtils]: 41: Hoare triple {24725#(<= parse_expression_list_~i~0 1)} havoc #t~short7; {24725#(<= parse_expression_list_~i~0 1)} is VALID [2020-07-08 23:38:14,198 INFO L280 TraceCheckUtils]: 42: Hoare triple {24725#(<= parse_expression_list_~i~0 1)} SUMMARY for call #t~mem9 := read~int(~str.base, ~str.offset + ~start~0, 1); srcloc: L55-18 {24725#(<= parse_expression_list_~i~0 1)} is VALID [2020-07-08 23:38:14,198 INFO L280 TraceCheckUtils]: 43: Hoare triple {24725#(<= parse_expression_list_~i~0 1)} assume !(34 == #t~mem9); {24725#(<= parse_expression_list_~i~0 1)} is VALID [2020-07-08 23:38:14,199 INFO L280 TraceCheckUtils]: 44: Hoare triple {24725#(<= parse_expression_list_~i~0 1)} havoc #t~mem9; {24725#(<= parse_expression_list_~i~0 1)} is VALID [2020-07-08 23:38:14,200 INFO L280 TraceCheckUtils]: 45: Hoare triple {24725#(<= parse_expression_list_~i~0 1)} ~j~0 := ~i~0 - 1; {24726#(<= parse_expression_list_~j~0 0)} is VALID [2020-07-08 23:38:14,201 INFO L280 TraceCheckUtils]: 46: Hoare triple {24726#(<= parse_expression_list_~j~0 0)} #t~short14 := 0 < ~j~0; {24727#(not |parse_expression_list_#t~short14|)} is VALID [2020-07-08 23:38:14,202 INFO L280 TraceCheckUtils]: 47: Hoare triple {24727#(not |parse_expression_list_#t~short14|)} assume #t~short14; {24715#false} is VALID [2020-07-08 23:38:14,203 INFO L280 TraceCheckUtils]: 48: Hoare triple {24715#false} SUMMARY for call #t~mem11 := read~int(~str.base, ~str.offset + ~j~0, 1); srcloc: L58-2 {24715#false} is VALID [2020-07-08 23:38:14,203 INFO L280 TraceCheckUtils]: 49: Hoare triple {24715#false} #t~short13 := 32 == #t~mem11; {24715#false} is VALID [2020-07-08 23:38:14,203 INFO L280 TraceCheckUtils]: 50: Hoare triple {24715#false} assume !#t~short13; {24715#false} is VALID [2020-07-08 23:38:14,204 INFO L280 TraceCheckUtils]: 51: Hoare triple {24715#false} SUMMARY for call #t~mem12 := read~int(~str.base, ~str.offset + ~j~0, 1); srcloc: L58-6 {24715#false} is VALID [2020-07-08 23:38:14,204 INFO L280 TraceCheckUtils]: 52: Hoare triple {24715#false} #t~short13 := 9 == #t~mem12; {24715#false} is VALID [2020-07-08 23:38:14,204 INFO L280 TraceCheckUtils]: 53: Hoare triple {24715#false} #t~short14 := #t~short13; {24715#false} is VALID [2020-07-08 23:38:14,205 INFO L280 TraceCheckUtils]: 54: Hoare triple {24715#false} assume !#t~short14; {24715#false} is VALID [2020-07-08 23:38:14,205 INFO L280 TraceCheckUtils]: 55: Hoare triple {24715#false} havoc #t~mem11; {24715#false} is VALID [2020-07-08 23:38:14,205 INFO L280 TraceCheckUtils]: 56: Hoare triple {24715#false} havoc #t~short13; {24715#false} is VALID [2020-07-08 23:38:14,206 INFO L280 TraceCheckUtils]: 57: Hoare triple {24715#false} havoc #t~short14; {24715#false} is VALID [2020-07-08 23:38:14,206 INFO L280 TraceCheckUtils]: 58: Hoare triple {24715#false} havoc #t~mem12; {24715#false} is VALID [2020-07-08 23:38:14,206 INFO L280 TraceCheckUtils]: 59: Hoare triple {24715#false} #t~short17 := 0 < ~j~0; {24715#false} is VALID [2020-07-08 23:38:14,207 INFO L280 TraceCheckUtils]: 60: Hoare triple {24715#false} assume !#t~short17; {24715#false} is VALID [2020-07-08 23:38:14,207 INFO L280 TraceCheckUtils]: 61: Hoare triple {24715#false} assume !#t~short17; {24715#false} is VALID [2020-07-08 23:38:14,208 INFO L280 TraceCheckUtils]: 62: Hoare triple {24715#false} havoc #t~short17; {24715#false} is VALID [2020-07-08 23:38:14,208 INFO L280 TraceCheckUtils]: 63: Hoare triple {24715#false} havoc #t~mem16; {24715#false} is VALID [2020-07-08 23:38:14,208 INFO L280 TraceCheckUtils]: 64: Hoare triple {24715#false} assume ~start~0 <= ~j~0; {24715#false} is VALID [2020-07-08 23:38:14,209 INFO L263 TraceCheckUtils]: 65: Hoare triple {24715#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)); {24714#true} is VALID [2020-07-08 23:38:14,209 INFO L280 TraceCheckUtils]: 66: Hoare triple {24714#true} ~dest.base, ~dest.offset := #in~dest.base, #in~dest.offset; {24714#true} is VALID [2020-07-08 23:38:14,209 INFO L280 TraceCheckUtils]: 67: Hoare triple {24714#true} ~src.base, ~src.offset := #in~src.base, #in~src.offset; {24714#true} is VALID [2020-07-08 23:38:14,210 INFO L280 TraceCheckUtils]: 68: Hoare triple {24714#true} ~n := #in~n; {24714#true} is VALID [2020-07-08 23:38:14,210 INFO L280 TraceCheckUtils]: 69: Hoare triple {24714#true} SUMMARY for call #t~ret0.base, #t~ret0.offset := strncpy(~dest.base, ~dest.offset, ~src.base, ~src.offset, ~n); srcloc: L30-2 {24714#true} is VALID [2020-07-08 23:38:14,210 INFO L280 TraceCheckUtils]: 70: Hoare triple {24714#true} #res.base, #res.offset := #t~ret0.base, #t~ret0.offset; {24714#true} is VALID [2020-07-08 23:38:14,211 INFO L280 TraceCheckUtils]: 71: Hoare triple {24714#true} havoc #t~ret0.base, #t~ret0.offset; {24714#true} is VALID [2020-07-08 23:38:14,211 INFO L280 TraceCheckUtils]: 72: Hoare triple {24714#true} assume true; {24714#true} is VALID [2020-07-08 23:38:14,211 INFO L275 TraceCheckUtils]: 73: Hoare quadruple {24714#true} {24715#false} #201#return; {24715#false} is VALID [2020-07-08 23:38:14,224 INFO L280 TraceCheckUtils]: 74: Hoare triple {24715#false} havoc #t~ret19.base, #t~ret19.offset; {24715#false} is VALID [2020-07-08 23:38:14,225 INFO L263 TraceCheckUtils]: 75: Hoare triple {24715#false} call __VERIFIER_assert((if 1 + (~j~0 - ~start~0) < 2 then 1 else 0)); {24715#false} is VALID [2020-07-08 23:38:14,225 INFO L280 TraceCheckUtils]: 76: Hoare triple {24715#false} ~cond := #in~cond; {24715#false} is VALID [2020-07-08 23:38:14,225 INFO L280 TraceCheckUtils]: 77: Hoare triple {24715#false} assume 0 == ~cond; {24715#false} is VALID [2020-07-08 23:38:14,226 INFO L280 TraceCheckUtils]: 78: Hoare triple {24715#false} assume !false; {24715#false} is VALID [2020-07-08 23:38:14,244 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 23:38:14,246 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [445054986] [2020-07-08 23:38:14,247 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-08 23:38:14,247 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-07-08 23:38:14,247 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405912541] [2020-07-08 23:38:14,248 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 79 [2020-07-08 23:38:14,251 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 23:38:14,252 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-08 23:38:14,366 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:38:14,366 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-08 23:38:14,366 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 23:38:14,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-08 23:38:14,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2020-07-08 23:38:14,367 INFO L87 Difference]: Start difference. First operand 264 states and 292 transitions. Second operand 10 states. [2020-07-08 23:38:17,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:38:17,075 INFO L93 Difference]: Finished difference Result 599 states and 665 transitions. [2020-07-08 23:38:17,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-07-08 23:38:17,075 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 79 [2020-07-08 23:38:17,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 23:38:17,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-08 23:38:17,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 364 transitions. [2020-07-08 23:38:17,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-08 23:38:17,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 364 transitions. [2020-07-08 23:38:17,080 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 364 transitions. [2020-07-08 23:38:17,480 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 364 edges. 364 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:38:17,491 INFO L225 Difference]: With dead ends: 599 [2020-07-08 23:38:17,491 INFO L226 Difference]: Without dead ends: 435 [2020-07-08 23:38:17,492 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2020-07-08 23:38:17,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2020-07-08 23:38:18,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 355. [2020-07-08 23:38:18,079 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 23:38:18,079 INFO L82 GeneralOperation]: Start isEquivalent. First operand 435 states. Second operand 355 states. [2020-07-08 23:38:18,079 INFO L74 IsIncluded]: Start isIncluded. First operand 435 states. Second operand 355 states. [2020-07-08 23:38:18,079 INFO L87 Difference]: Start difference. First operand 435 states. Second operand 355 states. [2020-07-08 23:38:18,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:38:18,090 INFO L93 Difference]: Finished difference Result 435 states and 481 transitions. [2020-07-08 23:38:18,090 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 481 transitions. [2020-07-08 23:38:18,091 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:38:18,091 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:38:18,091 INFO L74 IsIncluded]: Start isIncluded. First operand 355 states. Second operand 435 states. [2020-07-08 23:38:18,092 INFO L87 Difference]: Start difference. First operand 355 states. Second operand 435 states. [2020-07-08 23:38:18,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:38:18,104 INFO L93 Difference]: Finished difference Result 435 states and 481 transitions. [2020-07-08 23:38:18,104 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 481 transitions. [2020-07-08 23:38:18,105 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:38:18,105 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:38:18,105 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 23:38:18,105 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 23:38:18,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 355 states. [2020-07-08 23:38:18,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 393 transitions. [2020-07-08 23:38:18,111 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 393 transitions. Word has length 79 [2020-07-08 23:38:18,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 23:38:18,112 INFO L479 AbstractCegarLoop]: Abstraction has 355 states and 393 transitions. [2020-07-08 23:38:18,112 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-08 23:38:18,112 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 355 states and 393 transitions. [2020-07-08 23:38:18,665 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 393 edges. 393 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:38:18,666 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 393 transitions. [2020-07-08 23:38:18,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2020-07-08 23:38:18,667 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 23:38:18,668 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 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, 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-08 23:38:18,668 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-07-08 23:38:18,668 INFO L427 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 23:38:18,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 23:38:18,668 INFO L82 PathProgramCache]: Analyzing trace with hash 1140392269, now seen corresponding path program 2 times [2020-07-08 23:38:18,668 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 23:38:18,668 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [221671400] [2020-07-08 23:38:18,669 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 23:38:18,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:38:18,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:38:18,887 INFO L280 TraceCheckUtils]: 0: Hoare triple {27564#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {27539#true} is VALID [2020-07-08 23:38:18,887 INFO L280 TraceCheckUtils]: 1: Hoare triple {27539#true} #valid := #valid[0 := 0]; {27539#true} is VALID [2020-07-08 23:38:18,887 INFO L280 TraceCheckUtils]: 2: Hoare triple {27539#true} assume 0 < #StackHeapBarrier; {27539#true} is VALID [2020-07-08 23:38:18,887 INFO L280 TraceCheckUtils]: 3: Hoare triple {27539#true} assume true; {27539#true} is VALID [2020-07-08 23:38:18,888 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {27539#true} {27539#true} #205#return; {27539#true} is VALID [2020-07-08 23:38:18,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:38:18,898 INFO L280 TraceCheckUtils]: 0: Hoare triple {27539#true} ~dest.base, ~dest.offset := #in~dest.base, #in~dest.offset; {27539#true} is VALID [2020-07-08 23:38:18,898 INFO L280 TraceCheckUtils]: 1: Hoare triple {27539#true} ~src.base, ~src.offset := #in~src.base, #in~src.offset; {27539#true} is VALID [2020-07-08 23:38:18,899 INFO L280 TraceCheckUtils]: 2: Hoare triple {27539#true} ~n := #in~n; {27539#true} is VALID [2020-07-08 23:38:18,899 INFO L280 TraceCheckUtils]: 3: Hoare triple {27539#true} SUMMARY for call #t~ret0.base, #t~ret0.offset := strncpy(~dest.base, ~dest.offset, ~src.base, ~src.offset, ~n); srcloc: L30-2 {27539#true} is VALID [2020-07-08 23:38:18,899 INFO L280 TraceCheckUtils]: 4: Hoare triple {27539#true} #res.base, #res.offset := #t~ret0.base, #t~ret0.offset; {27539#true} is VALID [2020-07-08 23:38:18,900 INFO L280 TraceCheckUtils]: 5: Hoare triple {27539#true} havoc #t~ret0.base, #t~ret0.offset; {27539#true} is VALID [2020-07-08 23:38:18,900 INFO L280 TraceCheckUtils]: 6: Hoare triple {27539#true} assume true; {27539#true} is VALID [2020-07-08 23:38:18,902 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {27539#true} {27553#(<= (+ parse_expression_list_~j~0 2) parse_expression_list_~start~0)} #201#return; {27553#(<= (+ parse_expression_list_~j~0 2) parse_expression_list_~start~0)} is VALID [2020-07-08 23:38:18,903 INFO L263 TraceCheckUtils]: 0: Hoare triple {27539#true} call ULTIMATE.init(); {27564#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 23:38:18,904 INFO L280 TraceCheckUtils]: 1: Hoare triple {27564#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {27539#true} is VALID [2020-07-08 23:38:18,904 INFO L280 TraceCheckUtils]: 2: Hoare triple {27539#true} #valid := #valid[0 := 0]; {27539#true} is VALID [2020-07-08 23:38:18,904 INFO L280 TraceCheckUtils]: 3: Hoare triple {27539#true} assume 0 < #StackHeapBarrier; {27539#true} is VALID [2020-07-08 23:38:18,904 INFO L280 TraceCheckUtils]: 4: Hoare triple {27539#true} assume true; {27539#true} is VALID [2020-07-08 23:38:18,905 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {27539#true} {27539#true} #205#return; {27539#true} is VALID [2020-07-08 23:38:18,905 INFO L263 TraceCheckUtils]: 6: Hoare triple {27539#true} call #t~ret21 := main(); {27539#true} is VALID [2020-07-08 23:38:18,905 INFO L280 TraceCheckUtils]: 7: Hoare triple {27539#true} SUMMARY for call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(9); srcloc: mainENTRY {27539#true} is VALID [2020-07-08 23:38:18,905 INFO L280 TraceCheckUtils]: 8: Hoare triple {27539#true} SUMMARY for call write~int(0, ~#A~0.base, 8 + ~#A~0.offset, 1); srcloc: L74 {27539#true} is VALID [2020-07-08 23:38:18,906 INFO L263 TraceCheckUtils]: 9: Hoare triple {27539#true} call #t~ret20 := parse_expression_list(~#A~0.base, ~#A~0.offset); {27539#true} is VALID [2020-07-08 23:38:18,906 INFO L280 TraceCheckUtils]: 10: Hoare triple {27539#true} ~str.base, ~str.offset := #in~str.base, #in~str.offset; {27539#true} is VALID [2020-07-08 23:38:18,907 INFO L280 TraceCheckUtils]: 11: Hoare triple {27539#true} ~start~0 := 0; {27546#(= 0 parse_expression_list_~start~0)} is VALID [2020-07-08 23:38:18,908 INFO L280 TraceCheckUtils]: 12: Hoare triple {27546#(= 0 parse_expression_list_~start~0)} ~i~0 := -1; {27546#(= 0 parse_expression_list_~start~0)} is VALID [2020-07-08 23:38:18,908 INFO L280 TraceCheckUtils]: 13: Hoare triple {27546#(= 0 parse_expression_list_~start~0)} ~j~0 := -1; {27546#(= 0 parse_expression_list_~start~0)} is VALID [2020-07-08 23:38:18,909 INFO L280 TraceCheckUtils]: 14: Hoare triple {27546#(= 0 parse_expression_list_~start~0)} SUMMARY for call ~#str2~0.base, ~#str2~0.offset := #Ultimate.allocOnStack(2); srcloc: L49 {27546#(= 0 parse_expression_list_~start~0)} is VALID [2020-07-08 23:38:18,910 INFO L280 TraceCheckUtils]: 15: Hoare triple {27546#(= 0 parse_expression_list_~start~0)} assume !(~str.base == 0 && ~str.offset == 0); {27546#(= 0 parse_expression_list_~start~0)} is VALID [2020-07-08 23:38:18,911 INFO L280 TraceCheckUtils]: 16: Hoare triple {27546#(= 0 parse_expression_list_~start~0)} #t~post2 := ~i~0; {27546#(= 0 parse_expression_list_~start~0)} is VALID [2020-07-08 23:38:18,912 INFO L280 TraceCheckUtils]: 17: Hoare triple {27546#(= 0 parse_expression_list_~start~0)} ~i~0 := 1 + #t~post2; {27546#(= 0 parse_expression_list_~start~0)} is VALID [2020-07-08 23:38:18,912 INFO L280 TraceCheckUtils]: 18: Hoare triple {27546#(= 0 parse_expression_list_~start~0)} havoc #t~post2; {27546#(= 0 parse_expression_list_~start~0)} is VALID [2020-07-08 23:38:18,913 INFO L280 TraceCheckUtils]: 19: Hoare triple {27546#(= 0 parse_expression_list_~start~0)} SUMMARY for call #t~mem3 := read~int(~str.base, ~str.offset + ~i~0, 1); srcloc: L53 {27546#(= 0 parse_expression_list_~start~0)} is VALID [2020-07-08 23:38:18,913 INFO L280 TraceCheckUtils]: 20: Hoare triple {27546#(= 0 parse_expression_list_~start~0)} #t~switch4 := 0 == #t~mem3; {27546#(= 0 parse_expression_list_~start~0)} is VALID [2020-07-08 23:38:18,914 INFO L280 TraceCheckUtils]: 21: Hoare triple {27546#(= 0 parse_expression_list_~start~0)} assume #t~switch4; {27546#(= 0 parse_expression_list_~start~0)} is VALID [2020-07-08 23:38:18,914 INFO L280 TraceCheckUtils]: 22: Hoare triple {27546#(= 0 parse_expression_list_~start~0)} SUMMARY for call #t~mem5 := read~int(~str.base, ~str.offset + ~start~0, 1); srcloc: L55-17 {27546#(= 0 parse_expression_list_~start~0)} is VALID [2020-07-08 23:38:18,915 INFO L280 TraceCheckUtils]: 23: Hoare triple {27546#(= 0 parse_expression_list_~start~0)} #t~short7 := 32 == #t~mem5; {27546#(= 0 parse_expression_list_~start~0)} is VALID [2020-07-08 23:38:18,915 INFO L280 TraceCheckUtils]: 24: Hoare triple {27546#(= 0 parse_expression_list_~start~0)} assume #t~short7; {27546#(= 0 parse_expression_list_~start~0)} is VALID [2020-07-08 23:38:18,916 INFO L280 TraceCheckUtils]: 25: Hoare triple {27546#(= 0 parse_expression_list_~start~0)} assume !!#t~short7; {27546#(= 0 parse_expression_list_~start~0)} is VALID [2020-07-08 23:38:18,917 INFO L280 TraceCheckUtils]: 26: Hoare triple {27546#(= 0 parse_expression_list_~start~0)} havoc #t~mem5; {27546#(= 0 parse_expression_list_~start~0)} is VALID [2020-07-08 23:38:18,917 INFO L280 TraceCheckUtils]: 27: Hoare triple {27546#(= 0 parse_expression_list_~start~0)} havoc #t~mem6; {27546#(= 0 parse_expression_list_~start~0)} is VALID [2020-07-08 23:38:18,918 INFO L280 TraceCheckUtils]: 28: Hoare triple {27546#(= 0 parse_expression_list_~start~0)} havoc #t~short7; {27546#(= 0 parse_expression_list_~start~0)} is VALID [2020-07-08 23:38:18,919 INFO L280 TraceCheckUtils]: 29: Hoare triple {27546#(= 0 parse_expression_list_~start~0)} #t~post8 := ~start~0; {27547#(= 0 |parse_expression_list_#t~post8|)} is VALID [2020-07-08 23:38:18,920 INFO L280 TraceCheckUtils]: 30: Hoare triple {27547#(= 0 |parse_expression_list_#t~post8|)} ~start~0 := 1 + #t~post8; {27548#(<= 1 parse_expression_list_~start~0)} is VALID [2020-07-08 23:38:18,920 INFO L280 TraceCheckUtils]: 31: Hoare triple {27548#(<= 1 parse_expression_list_~start~0)} havoc #t~post8; {27548#(<= 1 parse_expression_list_~start~0)} is VALID [2020-07-08 23:38:18,921 INFO L280 TraceCheckUtils]: 32: Hoare triple {27548#(<= 1 parse_expression_list_~start~0)} SUMMARY for call #t~mem5 := read~int(~str.base, ~str.offset + ~start~0, 1); srcloc: L55-17 {27548#(<= 1 parse_expression_list_~start~0)} is VALID [2020-07-08 23:38:18,922 INFO L280 TraceCheckUtils]: 33: Hoare triple {27548#(<= 1 parse_expression_list_~start~0)} #t~short7 := 32 == #t~mem5; {27548#(<= 1 parse_expression_list_~start~0)} is VALID [2020-07-08 23:38:18,923 INFO L280 TraceCheckUtils]: 34: Hoare triple {27548#(<= 1 parse_expression_list_~start~0)} assume #t~short7; {27548#(<= 1 parse_expression_list_~start~0)} is VALID [2020-07-08 23:38:18,924 INFO L280 TraceCheckUtils]: 35: Hoare triple {27548#(<= 1 parse_expression_list_~start~0)} assume !!#t~short7; {27548#(<= 1 parse_expression_list_~start~0)} is VALID [2020-07-08 23:38:18,924 INFO L280 TraceCheckUtils]: 36: Hoare triple {27548#(<= 1 parse_expression_list_~start~0)} havoc #t~mem5; {27548#(<= 1 parse_expression_list_~start~0)} is VALID [2020-07-08 23:38:18,925 INFO L280 TraceCheckUtils]: 37: Hoare triple {27548#(<= 1 parse_expression_list_~start~0)} havoc #t~mem6; {27548#(<= 1 parse_expression_list_~start~0)} is VALID [2020-07-08 23:38:18,926 INFO L280 TraceCheckUtils]: 38: Hoare triple {27548#(<= 1 parse_expression_list_~start~0)} havoc #t~short7; {27548#(<= 1 parse_expression_list_~start~0)} is VALID [2020-07-08 23:38:18,927 INFO L280 TraceCheckUtils]: 39: Hoare triple {27548#(<= 1 parse_expression_list_~start~0)} #t~post8 := ~start~0; {27549#(<= 1 |parse_expression_list_#t~post8|)} is VALID [2020-07-08 23:38:18,928 INFO L280 TraceCheckUtils]: 40: Hoare triple {27549#(<= 1 |parse_expression_list_#t~post8|)} ~start~0 := 1 + #t~post8; {27550#(<= 2 parse_expression_list_~start~0)} is VALID [2020-07-08 23:38:18,929 INFO L280 TraceCheckUtils]: 41: Hoare triple {27550#(<= 2 parse_expression_list_~start~0)} havoc #t~post8; {27550#(<= 2 parse_expression_list_~start~0)} is VALID [2020-07-08 23:38:18,930 INFO L280 TraceCheckUtils]: 42: Hoare triple {27550#(<= 2 parse_expression_list_~start~0)} SUMMARY for call #t~mem5 := read~int(~str.base, ~str.offset + ~start~0, 1); srcloc: L55-17 {27550#(<= 2 parse_expression_list_~start~0)} is VALID [2020-07-08 23:38:18,931 INFO L280 TraceCheckUtils]: 43: Hoare triple {27550#(<= 2 parse_expression_list_~start~0)} #t~short7 := 32 == #t~mem5; {27550#(<= 2 parse_expression_list_~start~0)} is VALID [2020-07-08 23:38:18,931 INFO L280 TraceCheckUtils]: 44: Hoare triple {27550#(<= 2 parse_expression_list_~start~0)} assume !#t~short7; {27550#(<= 2 parse_expression_list_~start~0)} is VALID [2020-07-08 23:38:18,932 INFO L280 TraceCheckUtils]: 45: Hoare triple {27550#(<= 2 parse_expression_list_~start~0)} SUMMARY for call #t~mem6 := read~int(~str.base, ~str.offset + ~start~0, 1); srcloc: L55-4 {27550#(<= 2 parse_expression_list_~start~0)} is VALID [2020-07-08 23:38:18,933 INFO L280 TraceCheckUtils]: 46: Hoare triple {27550#(<= 2 parse_expression_list_~start~0)} #t~short7 := 9 == #t~mem6; {27550#(<= 2 parse_expression_list_~start~0)} is VALID [2020-07-08 23:38:18,934 INFO L280 TraceCheckUtils]: 47: Hoare triple {27550#(<= 2 parse_expression_list_~start~0)} assume !#t~short7; {27550#(<= 2 parse_expression_list_~start~0)} is VALID [2020-07-08 23:38:18,934 INFO L280 TraceCheckUtils]: 48: Hoare triple {27550#(<= 2 parse_expression_list_~start~0)} havoc #t~mem5; {27550#(<= 2 parse_expression_list_~start~0)} is VALID [2020-07-08 23:38:18,935 INFO L280 TraceCheckUtils]: 49: Hoare triple {27550#(<= 2 parse_expression_list_~start~0)} havoc #t~mem6; {27550#(<= 2 parse_expression_list_~start~0)} is VALID [2020-07-08 23:38:18,936 INFO L280 TraceCheckUtils]: 50: Hoare triple {27550#(<= 2 parse_expression_list_~start~0)} havoc #t~short7; {27550#(<= 2 parse_expression_list_~start~0)} is VALID [2020-07-08 23:38:18,936 INFO L280 TraceCheckUtils]: 51: Hoare triple {27550#(<= 2 parse_expression_list_~start~0)} SUMMARY for call #t~mem9 := read~int(~str.base, ~str.offset + ~start~0, 1); srcloc: L55-18 {27550#(<= 2 parse_expression_list_~start~0)} is VALID [2020-07-08 23:38:18,937 INFO L280 TraceCheckUtils]: 52: Hoare triple {27550#(<= 2 parse_expression_list_~start~0)} assume !(34 == #t~mem9); {27550#(<= 2 parse_expression_list_~start~0)} is VALID [2020-07-08 23:38:18,937 INFO L280 TraceCheckUtils]: 53: Hoare triple {27550#(<= 2 parse_expression_list_~start~0)} havoc #t~mem9; {27550#(<= 2 parse_expression_list_~start~0)} is VALID [2020-07-08 23:38:18,938 INFO L280 TraceCheckUtils]: 54: Hoare triple {27550#(<= 2 parse_expression_list_~start~0)} ~j~0 := ~i~0 - 1; {27550#(<= 2 parse_expression_list_~start~0)} is VALID [2020-07-08 23:38:18,939 INFO L280 TraceCheckUtils]: 55: Hoare triple {27550#(<= 2 parse_expression_list_~start~0)} #t~short14 := 0 < ~j~0; {27551#(and (or (< 0 parse_expression_list_~j~0) (<= 2 parse_expression_list_~start~0)) (or (<= parse_expression_list_~j~0 0) |parse_expression_list_#t~short14|))} is VALID [2020-07-08 23:38:18,940 INFO L280 TraceCheckUtils]: 56: Hoare triple {27551#(and (or (< 0 parse_expression_list_~j~0) (<= 2 parse_expression_list_~start~0)) (or (<= parse_expression_list_~j~0 0) |parse_expression_list_#t~short14|))} assume !#t~short14; {27552#(and (<= parse_expression_list_~j~0 0) (<= 2 parse_expression_list_~start~0))} is VALID [2020-07-08 23:38:18,940 INFO L280 TraceCheckUtils]: 57: Hoare triple {27552#(and (<= parse_expression_list_~j~0 0) (<= 2 parse_expression_list_~start~0))} assume !#t~short14; {27552#(and (<= parse_expression_list_~j~0 0) (<= 2 parse_expression_list_~start~0))} is VALID [2020-07-08 23:38:18,941 INFO L280 TraceCheckUtils]: 58: Hoare triple {27552#(and (<= parse_expression_list_~j~0 0) (<= 2 parse_expression_list_~start~0))} havoc #t~mem11; {27552#(and (<= parse_expression_list_~j~0 0) (<= 2 parse_expression_list_~start~0))} is VALID [2020-07-08 23:38:18,942 INFO L280 TraceCheckUtils]: 59: Hoare triple {27552#(and (<= parse_expression_list_~j~0 0) (<= 2 parse_expression_list_~start~0))} havoc #t~short13; {27552#(and (<= parse_expression_list_~j~0 0) (<= 2 parse_expression_list_~start~0))} is VALID [2020-07-08 23:38:18,942 INFO L280 TraceCheckUtils]: 60: Hoare triple {27552#(and (<= parse_expression_list_~j~0 0) (<= 2 parse_expression_list_~start~0))} havoc #t~short14; {27552#(and (<= parse_expression_list_~j~0 0) (<= 2 parse_expression_list_~start~0))} is VALID [2020-07-08 23:38:18,943 INFO L280 TraceCheckUtils]: 61: Hoare triple {27552#(and (<= parse_expression_list_~j~0 0) (<= 2 parse_expression_list_~start~0))} havoc #t~mem12; {27552#(and (<= parse_expression_list_~j~0 0) (<= 2 parse_expression_list_~start~0))} is VALID [2020-07-08 23:38:18,944 INFO L280 TraceCheckUtils]: 62: Hoare triple {27552#(and (<= parse_expression_list_~j~0 0) (<= 2 parse_expression_list_~start~0))} #t~short17 := 0 < ~j~0; {27553#(<= (+ parse_expression_list_~j~0 2) parse_expression_list_~start~0)} is VALID [2020-07-08 23:38:18,944 INFO L280 TraceCheckUtils]: 63: Hoare triple {27553#(<= (+ parse_expression_list_~j~0 2) parse_expression_list_~start~0)} assume !#t~short17; {27553#(<= (+ parse_expression_list_~j~0 2) parse_expression_list_~start~0)} is VALID [2020-07-08 23:38:18,945 INFO L280 TraceCheckUtils]: 64: Hoare triple {27553#(<= (+ parse_expression_list_~j~0 2) parse_expression_list_~start~0)} assume !#t~short17; {27553#(<= (+ parse_expression_list_~j~0 2) parse_expression_list_~start~0)} is VALID [2020-07-08 23:38:18,945 INFO L280 TraceCheckUtils]: 65: Hoare triple {27553#(<= (+ parse_expression_list_~j~0 2) parse_expression_list_~start~0)} havoc #t~short17; {27553#(<= (+ parse_expression_list_~j~0 2) parse_expression_list_~start~0)} is VALID [2020-07-08 23:38:18,946 INFO L280 TraceCheckUtils]: 66: Hoare triple {27553#(<= (+ parse_expression_list_~j~0 2) parse_expression_list_~start~0)} havoc #t~mem16; {27553#(<= (+ parse_expression_list_~j~0 2) parse_expression_list_~start~0)} is VALID [2020-07-08 23:38:18,946 INFO L280 TraceCheckUtils]: 67: Hoare triple {27553#(<= (+ parse_expression_list_~j~0 2) parse_expression_list_~start~0)} assume ~start~0 <= ~j~0; {27553#(<= (+ parse_expression_list_~j~0 2) parse_expression_list_~start~0)} is VALID [2020-07-08 23:38:18,947 INFO L263 TraceCheckUtils]: 68: Hoare triple {27553#(<= (+ parse_expression_list_~j~0 2) parse_expression_list_~start~0)} 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)); {27539#true} is VALID [2020-07-08 23:38:18,947 INFO L280 TraceCheckUtils]: 69: Hoare triple {27539#true} ~dest.base, ~dest.offset := #in~dest.base, #in~dest.offset; {27539#true} is VALID [2020-07-08 23:38:18,947 INFO L280 TraceCheckUtils]: 70: Hoare triple {27539#true} ~src.base, ~src.offset := #in~src.base, #in~src.offset; {27539#true} is VALID [2020-07-08 23:38:18,947 INFO L280 TraceCheckUtils]: 71: Hoare triple {27539#true} ~n := #in~n; {27539#true} is VALID [2020-07-08 23:38:18,947 INFO L280 TraceCheckUtils]: 72: Hoare triple {27539#true} SUMMARY for call #t~ret0.base, #t~ret0.offset := strncpy(~dest.base, ~dest.offset, ~src.base, ~src.offset, ~n); srcloc: L30-2 {27539#true} is VALID [2020-07-08 23:38:18,948 INFO L280 TraceCheckUtils]: 73: Hoare triple {27539#true} #res.base, #res.offset := #t~ret0.base, #t~ret0.offset; {27539#true} is VALID [2020-07-08 23:38:18,948 INFO L280 TraceCheckUtils]: 74: Hoare triple {27539#true} havoc #t~ret0.base, #t~ret0.offset; {27539#true} is VALID [2020-07-08 23:38:18,948 INFO L280 TraceCheckUtils]: 75: Hoare triple {27539#true} assume true; {27539#true} is VALID [2020-07-08 23:38:18,949 INFO L275 TraceCheckUtils]: 76: Hoare quadruple {27539#true} {27553#(<= (+ parse_expression_list_~j~0 2) parse_expression_list_~start~0)} #201#return; {27553#(<= (+ parse_expression_list_~j~0 2) parse_expression_list_~start~0)} is VALID [2020-07-08 23:38:18,950 INFO L280 TraceCheckUtils]: 77: Hoare triple {27553#(<= (+ parse_expression_list_~j~0 2) parse_expression_list_~start~0)} havoc #t~ret19.base, #t~ret19.offset; {27553#(<= (+ parse_expression_list_~j~0 2) parse_expression_list_~start~0)} is VALID [2020-07-08 23:38:18,951 INFO L263 TraceCheckUtils]: 78: Hoare triple {27553#(<= (+ parse_expression_list_~j~0 2) parse_expression_list_~start~0)} call __VERIFIER_assert((if 1 + (~j~0 - ~start~0) < 2 then 1 else 0)); {27562#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-08 23:38:18,952 INFO L280 TraceCheckUtils]: 79: Hoare triple {27562#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {27563#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-08 23:38:18,953 INFO L280 TraceCheckUtils]: 80: Hoare triple {27563#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {27540#false} is VALID [2020-07-08 23:38:18,953 INFO L280 TraceCheckUtils]: 81: Hoare triple {27540#false} assume !false; {27540#false} is VALID [2020-07-08 23:38:18,963 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 23:38:18,963 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [221671400] [2020-07-08 23:38:18,963 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-08 23:38:18,963 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2020-07-08 23:38:18,964 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281504746] [2020-07-08 23:38:18,965 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 82 [2020-07-08 23:38:18,965 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 23:38:18,965 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2020-07-08 23:38:19,053 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:38:19,053 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-07-08 23:38:19,053 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 23:38:19,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-08 23:38:19,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2020-07-08 23:38:19,054 INFO L87 Difference]: Start difference. First operand 355 states and 393 transitions. Second operand 13 states. [2020-07-08 23:38:22,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:38:22,858 INFO L93 Difference]: Finished difference Result 694 states and 770 transitions. [2020-07-08 23:38:22,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-07-08 23:38:22,859 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 82 [2020-07-08 23:38:22,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 23:38:22,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-08 23:38:22,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 437 transitions. [2020-07-08 23:38:22,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-08 23:38:22,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 437 transitions. [2020-07-08 23:38:22,865 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 437 transitions. [2020-07-08 23:38:23,309 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 437 edges. 437 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:38:23,322 INFO L225 Difference]: With dead ends: 694 [2020-07-08 23:38:23,323 INFO L226 Difference]: Without dead ends: 525 [2020-07-08 23:38:23,323 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=320, Unknown=0, NotChecked=0, Total=380 [2020-07-08 23:38:23,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2020-07-08 23:38:23,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 390. [2020-07-08 23:38:23,978 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 23:38:23,979 INFO L82 GeneralOperation]: Start isEquivalent. First operand 525 states. Second operand 390 states. [2020-07-08 23:38:23,979 INFO L74 IsIncluded]: Start isIncluded. First operand 525 states. Second operand 390 states. [2020-07-08 23:38:23,979 INFO L87 Difference]: Start difference. First operand 525 states. Second operand 390 states. [2020-07-08 23:38:23,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:38:23,993 INFO L93 Difference]: Finished difference Result 525 states and 583 transitions. [2020-07-08 23:38:23,993 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 583 transitions. [2020-07-08 23:38:23,994 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:38:23,994 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:38:23,994 INFO L74 IsIncluded]: Start isIncluded. First operand 390 states. Second operand 525 states. [2020-07-08 23:38:23,994 INFO L87 Difference]: Start difference. First operand 390 states. Second operand 525 states. [2020-07-08 23:38:24,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:38:24,011 INFO L93 Difference]: Finished difference Result 525 states and 583 transitions. [2020-07-08 23:38:24,011 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 583 transitions. [2020-07-08 23:38:24,012 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:38:24,012 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:38:24,012 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 23:38:24,012 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 23:38:24,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-07-08 23:38:24,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 432 transitions. [2020-07-08 23:38:24,020 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 432 transitions. Word has length 82 [2020-07-08 23:38:24,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 23:38:24,020 INFO L479 AbstractCegarLoop]: Abstraction has 390 states and 432 transitions. [2020-07-08 23:38:24,020 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-07-08 23:38:24,020 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 390 states and 432 transitions. [2020-07-08 23:38:24,631 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 432 edges. 432 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:38:24,631 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 432 transitions. [2020-07-08 23:38:24,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2020-07-08 23:38:24,632 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 23:38:24,633 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 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, 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-08 23:38:24,633 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-07-08 23:38:24,633 INFO L427 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 23:38:24,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 23:38:24,634 INFO L82 PathProgramCache]: Analyzing trace with hash -1836590973, now seen corresponding path program 2 times [2020-07-08 23:38:24,634 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 23:38:24,634 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [551237855] [2020-07-08 23:38:24,634 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 23:38:24,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:38:24,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:38:24,898 INFO L280 TraceCheckUtils]: 0: Hoare triple {30826#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {30799#true} is VALID [2020-07-08 23:38:24,899 INFO L280 TraceCheckUtils]: 1: Hoare triple {30799#true} #valid := #valid[0 := 0]; {30799#true} is VALID [2020-07-08 23:38:24,899 INFO L280 TraceCheckUtils]: 2: Hoare triple {30799#true} assume 0 < #StackHeapBarrier; {30799#true} is VALID [2020-07-08 23:38:24,899 INFO L280 TraceCheckUtils]: 3: Hoare triple {30799#true} assume true; {30799#true} is VALID [2020-07-08 23:38:24,899 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {30799#true} {30799#true} #205#return; {30799#true} is VALID [2020-07-08 23:38:24,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:38:24,904 INFO L280 TraceCheckUtils]: 0: Hoare triple {30799#true} ~dest.base, ~dest.offset := #in~dest.base, #in~dest.offset; {30799#true} is VALID [2020-07-08 23:38:24,905 INFO L280 TraceCheckUtils]: 1: Hoare triple {30799#true} ~src.base, ~src.offset := #in~src.base, #in~src.offset; {30799#true} is VALID [2020-07-08 23:38:24,905 INFO L280 TraceCheckUtils]: 2: Hoare triple {30799#true} ~n := #in~n; {30799#true} is VALID [2020-07-08 23:38:24,905 INFO L280 TraceCheckUtils]: 3: Hoare triple {30799#true} SUMMARY for call #t~ret0.base, #t~ret0.offset := strncpy(~dest.base, ~dest.offset, ~src.base, ~src.offset, ~n); srcloc: L30-2 {30799#true} is VALID [2020-07-08 23:38:24,906 INFO L280 TraceCheckUtils]: 4: Hoare triple {30799#true} #res.base, #res.offset := #t~ret0.base, #t~ret0.offset; {30799#true} is VALID [2020-07-08 23:38:24,906 INFO L280 TraceCheckUtils]: 5: Hoare triple {30799#true} havoc #t~ret0.base, #t~ret0.offset; {30799#true} is VALID [2020-07-08 23:38:24,906 INFO L280 TraceCheckUtils]: 6: Hoare triple {30799#true} assume true; {30799#true} is VALID [2020-07-08 23:38:24,908 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {30799#true} {30815#(<= (+ parse_expression_list_~j~0 3) parse_expression_list_~start~0)} #201#return; {30815#(<= (+ parse_expression_list_~j~0 3) parse_expression_list_~start~0)} is VALID [2020-07-08 23:38:24,909 INFO L263 TraceCheckUtils]: 0: Hoare triple {30799#true} call ULTIMATE.init(); {30826#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 23:38:24,909 INFO L280 TraceCheckUtils]: 1: Hoare triple {30826#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {30799#true} is VALID [2020-07-08 23:38:24,910 INFO L280 TraceCheckUtils]: 2: Hoare triple {30799#true} #valid := #valid[0 := 0]; {30799#true} is VALID [2020-07-08 23:38:24,910 INFO L280 TraceCheckUtils]: 3: Hoare triple {30799#true} assume 0 < #StackHeapBarrier; {30799#true} is VALID [2020-07-08 23:38:24,910 INFO L280 TraceCheckUtils]: 4: Hoare triple {30799#true} assume true; {30799#true} is VALID [2020-07-08 23:38:24,911 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {30799#true} {30799#true} #205#return; {30799#true} is VALID [2020-07-08 23:38:24,911 INFO L263 TraceCheckUtils]: 6: Hoare triple {30799#true} call #t~ret21 := main(); {30799#true} is VALID [2020-07-08 23:38:24,911 INFO L280 TraceCheckUtils]: 7: Hoare triple {30799#true} SUMMARY for call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(9); srcloc: mainENTRY {30799#true} is VALID [2020-07-08 23:38:24,911 INFO L280 TraceCheckUtils]: 8: Hoare triple {30799#true} SUMMARY for call write~int(0, ~#A~0.base, 8 + ~#A~0.offset, 1); srcloc: L74 {30799#true} is VALID [2020-07-08 23:38:24,912 INFO L263 TraceCheckUtils]: 9: Hoare triple {30799#true} call #t~ret20 := parse_expression_list(~#A~0.base, ~#A~0.offset); {30799#true} is VALID [2020-07-08 23:38:24,912 INFO L280 TraceCheckUtils]: 10: Hoare triple {30799#true} ~str.base, ~str.offset := #in~str.base, #in~str.offset; {30799#true} is VALID [2020-07-08 23:38:24,913 INFO L280 TraceCheckUtils]: 11: Hoare triple {30799#true} ~start~0 := 0; {30806#(= 0 parse_expression_list_~start~0)} is VALID [2020-07-08 23:38:24,914 INFO L280 TraceCheckUtils]: 12: Hoare triple {30806#(= 0 parse_expression_list_~start~0)} ~i~0 := -1; {30806#(= 0 parse_expression_list_~start~0)} is VALID [2020-07-08 23:38:24,915 INFO L280 TraceCheckUtils]: 13: Hoare triple {30806#(= 0 parse_expression_list_~start~0)} ~j~0 := -1; {30806#(= 0 parse_expression_list_~start~0)} is VALID [2020-07-08 23:38:24,916 INFO L280 TraceCheckUtils]: 14: Hoare triple {30806#(= 0 parse_expression_list_~start~0)} SUMMARY for call ~#str2~0.base, ~#str2~0.offset := #Ultimate.allocOnStack(2); srcloc: L49 {30806#(= 0 parse_expression_list_~start~0)} is VALID [2020-07-08 23:38:24,917 INFO L280 TraceCheckUtils]: 15: Hoare triple {30806#(= 0 parse_expression_list_~start~0)} assume !(~str.base == 0 && ~str.offset == 0); {30806#(= 0 parse_expression_list_~start~0)} is VALID [2020-07-08 23:38:24,917 INFO L280 TraceCheckUtils]: 16: Hoare triple {30806#(= 0 parse_expression_list_~start~0)} #t~post2 := ~i~0; {30806#(= 0 parse_expression_list_~start~0)} is VALID [2020-07-08 23:38:24,918 INFO L280 TraceCheckUtils]: 17: Hoare triple {30806#(= 0 parse_expression_list_~start~0)} ~i~0 := 1 + #t~post2; {30806#(= 0 parse_expression_list_~start~0)} is VALID [2020-07-08 23:38:24,919 INFO L280 TraceCheckUtils]: 18: Hoare triple {30806#(= 0 parse_expression_list_~start~0)} havoc #t~post2; {30806#(= 0 parse_expression_list_~start~0)} is VALID [2020-07-08 23:38:24,919 INFO L280 TraceCheckUtils]: 19: Hoare triple {30806#(= 0 parse_expression_list_~start~0)} SUMMARY for call #t~mem3 := read~int(~str.base, ~str.offset + ~i~0, 1); srcloc: L53 {30806#(= 0 parse_expression_list_~start~0)} is VALID [2020-07-08 23:38:24,920 INFO L280 TraceCheckUtils]: 20: Hoare triple {30806#(= 0 parse_expression_list_~start~0)} #t~switch4 := 0 == #t~mem3; {30806#(= 0 parse_expression_list_~start~0)} is VALID [2020-07-08 23:38:24,920 INFO L280 TraceCheckUtils]: 21: Hoare triple {30806#(= 0 parse_expression_list_~start~0)} assume #t~switch4; {30806#(= 0 parse_expression_list_~start~0)} is VALID [2020-07-08 23:38:24,921 INFO L280 TraceCheckUtils]: 22: Hoare triple {30806#(= 0 parse_expression_list_~start~0)} SUMMARY for call #t~mem5 := read~int(~str.base, ~str.offset + ~start~0, 1); srcloc: L55-17 {30806#(= 0 parse_expression_list_~start~0)} is VALID [2020-07-08 23:38:24,922 INFO L280 TraceCheckUtils]: 23: Hoare triple {30806#(= 0 parse_expression_list_~start~0)} #t~short7 := 32 == #t~mem5; {30806#(= 0 parse_expression_list_~start~0)} is VALID [2020-07-08 23:38:24,922 INFO L280 TraceCheckUtils]: 24: Hoare triple {30806#(= 0 parse_expression_list_~start~0)} assume #t~short7; {30806#(= 0 parse_expression_list_~start~0)} is VALID [2020-07-08 23:38:24,923 INFO L280 TraceCheckUtils]: 25: Hoare triple {30806#(= 0 parse_expression_list_~start~0)} assume !!#t~short7; {30806#(= 0 parse_expression_list_~start~0)} is VALID [2020-07-08 23:38:24,924 INFO L280 TraceCheckUtils]: 26: Hoare triple {30806#(= 0 parse_expression_list_~start~0)} havoc #t~mem5; {30806#(= 0 parse_expression_list_~start~0)} is VALID [2020-07-08 23:38:24,924 INFO L280 TraceCheckUtils]: 27: Hoare triple {30806#(= 0 parse_expression_list_~start~0)} havoc #t~mem6; {30806#(= 0 parse_expression_list_~start~0)} is VALID [2020-07-08 23:38:24,925 INFO L280 TraceCheckUtils]: 28: Hoare triple {30806#(= 0 parse_expression_list_~start~0)} havoc #t~short7; {30806#(= 0 parse_expression_list_~start~0)} is VALID [2020-07-08 23:38:24,925 INFO L280 TraceCheckUtils]: 29: Hoare triple {30806#(= 0 parse_expression_list_~start~0)} #t~post8 := ~start~0; {30807#(= 0 |parse_expression_list_#t~post8|)} is VALID [2020-07-08 23:38:24,926 INFO L280 TraceCheckUtils]: 30: Hoare triple {30807#(= 0 |parse_expression_list_#t~post8|)} ~start~0 := 1 + #t~post8; {30808#(<= 1 parse_expression_list_~start~0)} is VALID [2020-07-08 23:38:24,927 INFO L280 TraceCheckUtils]: 31: Hoare triple {30808#(<= 1 parse_expression_list_~start~0)} havoc #t~post8; {30808#(<= 1 parse_expression_list_~start~0)} is VALID [2020-07-08 23:38:24,927 INFO L280 TraceCheckUtils]: 32: Hoare triple {30808#(<= 1 parse_expression_list_~start~0)} SUMMARY for call #t~mem5 := read~int(~str.base, ~str.offset + ~start~0, 1); srcloc: L55-17 {30808#(<= 1 parse_expression_list_~start~0)} is VALID [2020-07-08 23:38:24,928 INFO L280 TraceCheckUtils]: 33: Hoare triple {30808#(<= 1 parse_expression_list_~start~0)} #t~short7 := 32 == #t~mem5; {30808#(<= 1 parse_expression_list_~start~0)} is VALID [2020-07-08 23:38:24,929 INFO L280 TraceCheckUtils]: 34: Hoare triple {30808#(<= 1 parse_expression_list_~start~0)} assume #t~short7; {30808#(<= 1 parse_expression_list_~start~0)} is VALID [2020-07-08 23:38:24,929 INFO L280 TraceCheckUtils]: 35: Hoare triple {30808#(<= 1 parse_expression_list_~start~0)} assume !!#t~short7; {30808#(<= 1 parse_expression_list_~start~0)} is VALID [2020-07-08 23:38:24,930 INFO L280 TraceCheckUtils]: 36: Hoare triple {30808#(<= 1 parse_expression_list_~start~0)} havoc #t~mem5; {30808#(<= 1 parse_expression_list_~start~0)} is VALID [2020-07-08 23:38:24,931 INFO L280 TraceCheckUtils]: 37: Hoare triple {30808#(<= 1 parse_expression_list_~start~0)} havoc #t~mem6; {30808#(<= 1 parse_expression_list_~start~0)} is VALID [2020-07-08 23:38:24,931 INFO L280 TraceCheckUtils]: 38: Hoare triple {30808#(<= 1 parse_expression_list_~start~0)} havoc #t~short7; {30808#(<= 1 parse_expression_list_~start~0)} is VALID [2020-07-08 23:38:24,932 INFO L280 TraceCheckUtils]: 39: Hoare triple {30808#(<= 1 parse_expression_list_~start~0)} #t~post8 := ~start~0; {30809#(<= 1 |parse_expression_list_#t~post8|)} is VALID [2020-07-08 23:38:24,933 INFO L280 TraceCheckUtils]: 40: Hoare triple {30809#(<= 1 |parse_expression_list_#t~post8|)} ~start~0 := 1 + #t~post8; {30810#(<= 2 parse_expression_list_~start~0)} is VALID [2020-07-08 23:38:24,933 INFO L280 TraceCheckUtils]: 41: Hoare triple {30810#(<= 2 parse_expression_list_~start~0)} havoc #t~post8; {30810#(<= 2 parse_expression_list_~start~0)} is VALID [2020-07-08 23:38:24,934 INFO L280 TraceCheckUtils]: 42: Hoare triple {30810#(<= 2 parse_expression_list_~start~0)} SUMMARY for call #t~mem5 := read~int(~str.base, ~str.offset + ~start~0, 1); srcloc: L55-17 {30810#(<= 2 parse_expression_list_~start~0)} is VALID [2020-07-08 23:38:24,935 INFO L280 TraceCheckUtils]: 43: Hoare triple {30810#(<= 2 parse_expression_list_~start~0)} #t~short7 := 32 == #t~mem5; {30810#(<= 2 parse_expression_list_~start~0)} is VALID [2020-07-08 23:38:24,935 INFO L280 TraceCheckUtils]: 44: Hoare triple {30810#(<= 2 parse_expression_list_~start~0)} assume !#t~short7; {30810#(<= 2 parse_expression_list_~start~0)} is VALID [2020-07-08 23:38:24,936 INFO L280 TraceCheckUtils]: 45: Hoare triple {30810#(<= 2 parse_expression_list_~start~0)} SUMMARY for call #t~mem6 := read~int(~str.base, ~str.offset + ~start~0, 1); srcloc: L55-4 {30810#(<= 2 parse_expression_list_~start~0)} is VALID [2020-07-08 23:38:24,936 INFO L280 TraceCheckUtils]: 46: Hoare triple {30810#(<= 2 parse_expression_list_~start~0)} #t~short7 := 9 == #t~mem6; {30810#(<= 2 parse_expression_list_~start~0)} is VALID [2020-07-08 23:38:24,937 INFO L280 TraceCheckUtils]: 47: Hoare triple {30810#(<= 2 parse_expression_list_~start~0)} assume !#t~short7; {30810#(<= 2 parse_expression_list_~start~0)} is VALID [2020-07-08 23:38:24,938 INFO L280 TraceCheckUtils]: 48: Hoare triple {30810#(<= 2 parse_expression_list_~start~0)} havoc #t~mem5; {30810#(<= 2 parse_expression_list_~start~0)} is VALID [2020-07-08 23:38:24,939 INFO L280 TraceCheckUtils]: 49: Hoare triple {30810#(<= 2 parse_expression_list_~start~0)} havoc #t~mem6; {30810#(<= 2 parse_expression_list_~start~0)} is VALID [2020-07-08 23:38:24,940 INFO L280 TraceCheckUtils]: 50: Hoare triple {30810#(<= 2 parse_expression_list_~start~0)} havoc #t~short7; {30810#(<= 2 parse_expression_list_~start~0)} is VALID [2020-07-08 23:38:24,940 INFO L280 TraceCheckUtils]: 51: Hoare triple {30810#(<= 2 parse_expression_list_~start~0)} SUMMARY for call #t~mem9 := read~int(~str.base, ~str.offset + ~start~0, 1); srcloc: L55-18 {30810#(<= 2 parse_expression_list_~start~0)} is VALID [2020-07-08 23:38:24,941 INFO L280 TraceCheckUtils]: 52: Hoare triple {30810#(<= 2 parse_expression_list_~start~0)} assume 34 == #t~mem9; {30810#(<= 2 parse_expression_list_~start~0)} is VALID [2020-07-08 23:38:24,942 INFO L280 TraceCheckUtils]: 53: Hoare triple {30810#(<= 2 parse_expression_list_~start~0)} havoc #t~mem9; {30810#(<= 2 parse_expression_list_~start~0)} is VALID [2020-07-08 23:38:24,943 INFO L280 TraceCheckUtils]: 54: Hoare triple {30810#(<= 2 parse_expression_list_~start~0)} #t~post10 := ~start~0; {30811#(<= 2 |parse_expression_list_#t~post10|)} is VALID [2020-07-08 23:38:24,944 INFO L280 TraceCheckUtils]: 55: Hoare triple {30811#(<= 2 |parse_expression_list_#t~post10|)} ~start~0 := 1 + #t~post10; {30812#(<= 3 parse_expression_list_~start~0)} is VALID [2020-07-08 23:38:24,945 INFO L280 TraceCheckUtils]: 56: Hoare triple {30812#(<= 3 parse_expression_list_~start~0)} havoc #t~post10; {30812#(<= 3 parse_expression_list_~start~0)} is VALID [2020-07-08 23:38:24,946 INFO L280 TraceCheckUtils]: 57: Hoare triple {30812#(<= 3 parse_expression_list_~start~0)} ~j~0 := ~i~0 - 1; {30812#(<= 3 parse_expression_list_~start~0)} is VALID [2020-07-08 23:38:24,947 INFO L280 TraceCheckUtils]: 58: Hoare triple {30812#(<= 3 parse_expression_list_~start~0)} #t~short14 := 0 < ~j~0; {30813#(and (or (<= parse_expression_list_~j~0 0) |parse_expression_list_#t~short14|) (or (<= 3 parse_expression_list_~start~0) (< 0 parse_expression_list_~j~0)))} is VALID [2020-07-08 23:38:24,948 INFO L280 TraceCheckUtils]: 59: Hoare triple {30813#(and (or (<= parse_expression_list_~j~0 0) |parse_expression_list_#t~short14|) (or (<= 3 parse_expression_list_~start~0) (< 0 parse_expression_list_~j~0)))} assume !#t~short14; {30814#(and (<= 3 parse_expression_list_~start~0) (<= parse_expression_list_~j~0 0))} is VALID [2020-07-08 23:38:24,949 INFO L280 TraceCheckUtils]: 60: Hoare triple {30814#(and (<= 3 parse_expression_list_~start~0) (<= parse_expression_list_~j~0 0))} assume !#t~short14; {30814#(and (<= 3 parse_expression_list_~start~0) (<= parse_expression_list_~j~0 0))} is VALID [2020-07-08 23:38:24,950 INFO L280 TraceCheckUtils]: 61: Hoare triple {30814#(and (<= 3 parse_expression_list_~start~0) (<= parse_expression_list_~j~0 0))} havoc #t~mem11; {30814#(and (<= 3 parse_expression_list_~start~0) (<= parse_expression_list_~j~0 0))} is VALID [2020-07-08 23:38:24,951 INFO L280 TraceCheckUtils]: 62: Hoare triple {30814#(and (<= 3 parse_expression_list_~start~0) (<= parse_expression_list_~j~0 0))} havoc #t~short13; {30814#(and (<= 3 parse_expression_list_~start~0) (<= parse_expression_list_~j~0 0))} is VALID [2020-07-08 23:38:24,952 INFO L280 TraceCheckUtils]: 63: Hoare triple {30814#(and (<= 3 parse_expression_list_~start~0) (<= parse_expression_list_~j~0 0))} havoc #t~short14; {30814#(and (<= 3 parse_expression_list_~start~0) (<= parse_expression_list_~j~0 0))} is VALID [2020-07-08 23:38:24,953 INFO L280 TraceCheckUtils]: 64: Hoare triple {30814#(and (<= 3 parse_expression_list_~start~0) (<= parse_expression_list_~j~0 0))} havoc #t~mem12; {30814#(and (<= 3 parse_expression_list_~start~0) (<= parse_expression_list_~j~0 0))} is VALID [2020-07-08 23:38:24,954 INFO L280 TraceCheckUtils]: 65: Hoare triple {30814#(and (<= 3 parse_expression_list_~start~0) (<= parse_expression_list_~j~0 0))} #t~short17 := 0 < ~j~0; {30815#(<= (+ parse_expression_list_~j~0 3) parse_expression_list_~start~0)} is VALID [2020-07-08 23:38:24,954 INFO L280 TraceCheckUtils]: 66: Hoare triple {30815#(<= (+ parse_expression_list_~j~0 3) parse_expression_list_~start~0)} assume !#t~short17; {30815#(<= (+ parse_expression_list_~j~0 3) parse_expression_list_~start~0)} is VALID [2020-07-08 23:38:24,955 INFO L280 TraceCheckUtils]: 67: Hoare triple {30815#(<= (+ parse_expression_list_~j~0 3) parse_expression_list_~start~0)} assume !#t~short17; {30815#(<= (+ parse_expression_list_~j~0 3) parse_expression_list_~start~0)} is VALID [2020-07-08 23:38:24,956 INFO L280 TraceCheckUtils]: 68: Hoare triple {30815#(<= (+ parse_expression_list_~j~0 3) parse_expression_list_~start~0)} havoc #t~short17; {30815#(<= (+ parse_expression_list_~j~0 3) parse_expression_list_~start~0)} is VALID [2020-07-08 23:38:24,956 INFO L280 TraceCheckUtils]: 69: Hoare triple {30815#(<= (+ parse_expression_list_~j~0 3) parse_expression_list_~start~0)} havoc #t~mem16; {30815#(<= (+ parse_expression_list_~j~0 3) parse_expression_list_~start~0)} is VALID [2020-07-08 23:38:24,957 INFO L280 TraceCheckUtils]: 70: Hoare triple {30815#(<= (+ parse_expression_list_~j~0 3) parse_expression_list_~start~0)} assume ~start~0 <= ~j~0; {30815#(<= (+ parse_expression_list_~j~0 3) parse_expression_list_~start~0)} is VALID [2020-07-08 23:38:24,957 INFO L263 TraceCheckUtils]: 71: Hoare triple {30815#(<= (+ parse_expression_list_~j~0 3) parse_expression_list_~start~0)} 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)); {30799#true} is VALID [2020-07-08 23:38:24,957 INFO L280 TraceCheckUtils]: 72: Hoare triple {30799#true} ~dest.base, ~dest.offset := #in~dest.base, #in~dest.offset; {30799#true} is VALID [2020-07-08 23:38:24,957 INFO L280 TraceCheckUtils]: 73: Hoare triple {30799#true} ~src.base, ~src.offset := #in~src.base, #in~src.offset; {30799#true} is VALID [2020-07-08 23:38:24,958 INFO L280 TraceCheckUtils]: 74: Hoare triple {30799#true} ~n := #in~n; {30799#true} is VALID [2020-07-08 23:38:24,958 INFO L280 TraceCheckUtils]: 75: Hoare triple {30799#true} SUMMARY for call #t~ret0.base, #t~ret0.offset := strncpy(~dest.base, ~dest.offset, ~src.base, ~src.offset, ~n); srcloc: L30-2 {30799#true} is VALID [2020-07-08 23:38:24,958 INFO L280 TraceCheckUtils]: 76: Hoare triple {30799#true} #res.base, #res.offset := #t~ret0.base, #t~ret0.offset; {30799#true} is VALID [2020-07-08 23:38:24,958 INFO L280 TraceCheckUtils]: 77: Hoare triple {30799#true} havoc #t~ret0.base, #t~ret0.offset; {30799#true} is VALID [2020-07-08 23:38:24,958 INFO L280 TraceCheckUtils]: 78: Hoare triple {30799#true} assume true; {30799#true} is VALID [2020-07-08 23:38:24,960 INFO L275 TraceCheckUtils]: 79: Hoare quadruple {30799#true} {30815#(<= (+ parse_expression_list_~j~0 3) parse_expression_list_~start~0)} #201#return; {30815#(<= (+ parse_expression_list_~j~0 3) parse_expression_list_~start~0)} is VALID [2020-07-08 23:38:24,960 INFO L280 TraceCheckUtils]: 80: Hoare triple {30815#(<= (+ parse_expression_list_~j~0 3) parse_expression_list_~start~0)} havoc #t~ret19.base, #t~ret19.offset; {30815#(<= (+ parse_expression_list_~j~0 3) parse_expression_list_~start~0)} is VALID [2020-07-08 23:38:24,962 INFO L263 TraceCheckUtils]: 81: Hoare triple {30815#(<= (+ parse_expression_list_~j~0 3) parse_expression_list_~start~0)} call __VERIFIER_assert((if 1 + (~j~0 - ~start~0) < 2 then 1 else 0)); {30824#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-08 23:38:24,963 INFO L280 TraceCheckUtils]: 82: Hoare triple {30824#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {30825#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-08 23:38:24,964 INFO L280 TraceCheckUtils]: 83: Hoare triple {30825#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {30800#false} is VALID [2020-07-08 23:38:24,964 INFO L280 TraceCheckUtils]: 84: Hoare triple {30800#false} assume !false; {30800#false} is VALID [2020-07-08 23:38:24,977 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 23:38:24,977 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [551237855] [2020-07-08 23:38:24,977 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-08 23:38:24,977 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2020-07-08 23:38:24,978 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632962712] [2020-07-08 23:38:24,978 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 85 [2020-07-08 23:38:24,978 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 23:38:24,979 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2020-07-08 23:38:25,089 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:38:25,089 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-07-08 23:38:25,089 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 23:38:25,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-07-08 23:38:25,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2020-07-08 23:38:25,090 INFO L87 Difference]: Start difference. First operand 390 states and 432 transitions. Second operand 15 states. [2020-07-08 23:38:29,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:38:29,294 INFO L93 Difference]: Finished difference Result 680 states and 754 transitions. [2020-07-08 23:38:29,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-07-08 23:38:29,294 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 85 [2020-07-08 23:38:29,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 23:38:29,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-08 23:38:29,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 483 transitions. [2020-07-08 23:38:29,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-08 23:38:29,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 483 transitions. [2020-07-08 23:38:29,300 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 483 transitions. [2020-07-08 23:38:29,837 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 483 edges. 483 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:38:29,850 INFO L225 Difference]: With dead ends: 680 [2020-07-08 23:38:29,850 INFO L226 Difference]: Without dead ends: 428 [2020-07-08 23:38:29,851 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=80, Invalid=472, Unknown=0, NotChecked=0, Total=552 [2020-07-08 23:38:29,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2020-07-08 23:38:30,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 247. [2020-07-08 23:38:30,256 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 23:38:30,256 INFO L82 GeneralOperation]: Start isEquivalent. First operand 428 states. Second operand 247 states. [2020-07-08 23:38:30,256 INFO L74 IsIncluded]: Start isIncluded. First operand 428 states. Second operand 247 states. [2020-07-08 23:38:30,256 INFO L87 Difference]: Start difference. First operand 428 states. Second operand 247 states. [2020-07-08 23:38:30,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:38:30,268 INFO L93 Difference]: Finished difference Result 428 states and 476 transitions. [2020-07-08 23:38:30,268 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 476 transitions. [2020-07-08 23:38:30,269 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:38:30,269 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:38:30,269 INFO L74 IsIncluded]: Start isIncluded. First operand 247 states. Second operand 428 states. [2020-07-08 23:38:30,270 INFO L87 Difference]: Start difference. First operand 247 states. Second operand 428 states. [2020-07-08 23:38:30,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:38:30,281 INFO L93 Difference]: Finished difference Result 428 states and 476 transitions. [2020-07-08 23:38:30,282 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 476 transitions. [2020-07-08 23:38:30,282 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:38:30,282 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:38:30,283 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 23:38:30,283 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 23:38:30,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2020-07-08 23:38:30,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 270 transitions. [2020-07-08 23:38:30,287 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 270 transitions. Word has length 85 [2020-07-08 23:38:30,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 23:38:30,288 INFO L479 AbstractCegarLoop]: Abstraction has 247 states and 270 transitions. [2020-07-08 23:38:30,288 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-07-08 23:38:30,288 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 247 states and 270 transitions. [2020-07-08 23:38:30,694 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 270 edges. 270 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:38:30,695 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 270 transitions. [2020-07-08 23:38:30,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2020-07-08 23:38:30,696 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 23:38:30,696 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 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, 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-08 23:38:30,696 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-07-08 23:38:30,696 INFO L427 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 23:38:30,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 23:38:30,697 INFO L82 PathProgramCache]: Analyzing trace with hash 1723821108, now seen corresponding path program 2 times [2020-07-08 23:38:30,697 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 23:38:30,697 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1480213137] [2020-07-08 23:38:30,697 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 23:38:30,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:38:30,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:38:30,767 INFO L280 TraceCheckUtils]: 0: Hoare triple {33575#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {33557#true} is VALID [2020-07-08 23:38:30,767 INFO L280 TraceCheckUtils]: 1: Hoare triple {33557#true} #valid := #valid[0 := 0]; {33557#true} is VALID [2020-07-08 23:38:30,767 INFO L280 TraceCheckUtils]: 2: Hoare triple {33557#true} assume 0 < #StackHeapBarrier; {33557#true} is VALID [2020-07-08 23:38:30,767 INFO L280 TraceCheckUtils]: 3: Hoare triple {33557#true} assume true; {33557#true} is VALID [2020-07-08 23:38:30,768 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {33557#true} {33557#true} #205#return; {33557#true} is VALID [2020-07-08 23:38:30,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:38:30,771 INFO L280 TraceCheckUtils]: 0: Hoare triple {33557#true} ~dest.base, ~dest.offset := #in~dest.base, #in~dest.offset; {33557#true} is VALID [2020-07-08 23:38:30,771 INFO L280 TraceCheckUtils]: 1: Hoare triple {33557#true} ~src.base, ~src.offset := #in~src.base, #in~src.offset; {33557#true} is VALID [2020-07-08 23:38:30,772 INFO L280 TraceCheckUtils]: 2: Hoare triple {33557#true} ~n := #in~n; {33557#true} is VALID [2020-07-08 23:38:30,772 INFO L280 TraceCheckUtils]: 3: Hoare triple {33557#true} SUMMARY for call #t~ret0.base, #t~ret0.offset := strncpy(~dest.base, ~dest.offset, ~src.base, ~src.offset, ~n); srcloc: L30-2 {33557#true} is VALID [2020-07-08 23:38:30,772 INFO L280 TraceCheckUtils]: 4: Hoare triple {33557#true} #res.base, #res.offset := #t~ret0.base, #t~ret0.offset; {33557#true} is VALID [2020-07-08 23:38:30,772 INFO L280 TraceCheckUtils]: 5: Hoare triple {33557#true} havoc #t~ret0.base, #t~ret0.offset; {33557#true} is VALID [2020-07-08 23:38:30,773 INFO L280 TraceCheckUtils]: 6: Hoare triple {33557#true} assume true; {33557#true} is VALID [2020-07-08 23:38:30,773 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {33557#true} {33558#false} #201#return; {33558#false} is VALID [2020-07-08 23:38:30,777 INFO L263 TraceCheckUtils]: 0: Hoare triple {33557#true} call ULTIMATE.init(); {33575#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 23:38:30,777 INFO L280 TraceCheckUtils]: 1: Hoare triple {33575#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {33557#true} is VALID [2020-07-08 23:38:30,777 INFO L280 TraceCheckUtils]: 2: Hoare triple {33557#true} #valid := #valid[0 := 0]; {33557#true} is VALID [2020-07-08 23:38:30,777 INFO L280 TraceCheckUtils]: 3: Hoare triple {33557#true} assume 0 < #StackHeapBarrier; {33557#true} is VALID [2020-07-08 23:38:30,778 INFO L280 TraceCheckUtils]: 4: Hoare triple {33557#true} assume true; {33557#true} is VALID [2020-07-08 23:38:30,778 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {33557#true} {33557#true} #205#return; {33557#true} is VALID [2020-07-08 23:38:30,778 INFO L263 TraceCheckUtils]: 6: Hoare triple {33557#true} call #t~ret21 := main(); {33557#true} is VALID [2020-07-08 23:38:30,778 INFO L280 TraceCheckUtils]: 7: Hoare triple {33557#true} SUMMARY for call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(9); srcloc: mainENTRY {33557#true} is VALID [2020-07-08 23:38:30,778 INFO L280 TraceCheckUtils]: 8: Hoare triple {33557#true} SUMMARY for call write~int(0, ~#A~0.base, 8 + ~#A~0.offset, 1); srcloc: L74 {33557#true} is VALID [2020-07-08 23:38:30,778 INFO L263 TraceCheckUtils]: 9: Hoare triple {33557#true} call #t~ret20 := parse_expression_list(~#A~0.base, ~#A~0.offset); {33557#true} is VALID [2020-07-08 23:38:30,779 INFO L280 TraceCheckUtils]: 10: Hoare triple {33557#true} ~str.base, ~str.offset := #in~str.base, #in~str.offset; {33557#true} is VALID [2020-07-08 23:38:30,779 INFO L280 TraceCheckUtils]: 11: Hoare triple {33557#true} ~start~0 := 0; {33557#true} is VALID [2020-07-08 23:38:30,779 INFO L280 TraceCheckUtils]: 12: Hoare triple {33557#true} ~i~0 := -1; {33557#true} is VALID [2020-07-08 23:38:30,779 INFO L280 TraceCheckUtils]: 13: Hoare triple {33557#true} ~j~0 := -1; {33557#true} is VALID [2020-07-08 23:38:30,779 INFO L280 TraceCheckUtils]: 14: Hoare triple {33557#true} SUMMARY for call ~#str2~0.base, ~#str2~0.offset := #Ultimate.allocOnStack(2); srcloc: L49 {33557#true} is VALID [2020-07-08 23:38:30,779 INFO L280 TraceCheckUtils]: 15: Hoare triple {33557#true} assume !(~str.base == 0 && ~str.offset == 0); {33557#true} is VALID [2020-07-08 23:38:30,780 INFO L280 TraceCheckUtils]: 16: Hoare triple {33557#true} #t~post2 := ~i~0; {33557#true} is VALID [2020-07-08 23:38:30,780 INFO L280 TraceCheckUtils]: 17: Hoare triple {33557#true} ~i~0 := 1 + #t~post2; {33557#true} is VALID [2020-07-08 23:38:30,780 INFO L280 TraceCheckUtils]: 18: Hoare triple {33557#true} havoc #t~post2; {33557#true} is VALID [2020-07-08 23:38:30,780 INFO L280 TraceCheckUtils]: 19: Hoare triple {33557#true} SUMMARY for call #t~mem3 := read~int(~str.base, ~str.offset + ~i~0, 1); srcloc: L53 {33557#true} is VALID [2020-07-08 23:38:30,780 INFO L280 TraceCheckUtils]: 20: Hoare triple {33557#true} #t~switch4 := 0 == #t~mem3; {33557#true} is VALID [2020-07-08 23:38:30,780 INFO L280 TraceCheckUtils]: 21: Hoare triple {33557#true} assume !#t~switch4; {33557#true} is VALID [2020-07-08 23:38:30,781 INFO L280 TraceCheckUtils]: 22: Hoare triple {33557#true} havoc #t~mem3; {33557#true} is VALID [2020-07-08 23:38:30,781 INFO L280 TraceCheckUtils]: 23: Hoare triple {33557#true} havoc #t~switch4; {33557#true} is VALID [2020-07-08 23:38:30,781 INFO L280 TraceCheckUtils]: 24: Hoare triple {33557#true} SUMMARY for call #t~mem1 := read~int(~str.base, ~str.offset + ~i~0, 1); srcloc: L51-1 {33557#true} is VALID [2020-07-08 23:38:30,781 INFO L280 TraceCheckUtils]: 25: Hoare triple {33557#true} assume !!(0 != #t~mem1); {33557#true} is VALID [2020-07-08 23:38:30,781 INFO L280 TraceCheckUtils]: 26: Hoare triple {33557#true} havoc #t~mem1; {33557#true} is VALID [2020-07-08 23:38:30,782 INFO L280 TraceCheckUtils]: 27: Hoare triple {33557#true} #t~post2 := ~i~0; {33557#true} is VALID [2020-07-08 23:38:30,782 INFO L280 TraceCheckUtils]: 28: Hoare triple {33557#true} ~i~0 := 1 + #t~post2; {33557#true} is VALID [2020-07-08 23:38:30,782 INFO L280 TraceCheckUtils]: 29: Hoare triple {33557#true} havoc #t~post2; {33557#true} is VALID [2020-07-08 23:38:30,782 INFO L280 TraceCheckUtils]: 30: Hoare triple {33557#true} SUMMARY for call #t~mem3 := read~int(~str.base, ~str.offset + ~i~0, 1); srcloc: L53 {33557#true} is VALID [2020-07-08 23:38:30,782 INFO L280 TraceCheckUtils]: 31: Hoare triple {33557#true} #t~switch4 := 0 == #t~mem3; {33557#true} is VALID [2020-07-08 23:38:30,782 INFO L280 TraceCheckUtils]: 32: Hoare triple {33557#true} assume !#t~switch4; {33557#true} is VALID [2020-07-08 23:38:30,783 INFO L280 TraceCheckUtils]: 33: Hoare triple {33557#true} havoc #t~mem3; {33557#true} is VALID [2020-07-08 23:38:30,783 INFO L280 TraceCheckUtils]: 34: Hoare triple {33557#true} havoc #t~switch4; {33557#true} is VALID [2020-07-08 23:38:30,783 INFO L280 TraceCheckUtils]: 35: Hoare triple {33557#true} SUMMARY for call #t~mem1 := read~int(~str.base, ~str.offset + ~i~0, 1); srcloc: L51-1 {33557#true} is VALID [2020-07-08 23:38:30,783 INFO L280 TraceCheckUtils]: 36: Hoare triple {33557#true} assume !!(0 != #t~mem1); {33557#true} is VALID [2020-07-08 23:38:30,783 INFO L280 TraceCheckUtils]: 37: Hoare triple {33557#true} havoc #t~mem1; {33557#true} is VALID [2020-07-08 23:38:30,783 INFO L280 TraceCheckUtils]: 38: Hoare triple {33557#true} #t~post2 := ~i~0; {33557#true} is VALID [2020-07-08 23:38:30,784 INFO L280 TraceCheckUtils]: 39: Hoare triple {33557#true} ~i~0 := 1 + #t~post2; {33557#true} is VALID [2020-07-08 23:38:30,784 INFO L280 TraceCheckUtils]: 40: Hoare triple {33557#true} havoc #t~post2; {33557#true} is VALID [2020-07-08 23:38:30,784 INFO L280 TraceCheckUtils]: 41: Hoare triple {33557#true} SUMMARY for call #t~mem3 := read~int(~str.base, ~str.offset + ~i~0, 1); srcloc: L53 {33557#true} is VALID [2020-07-08 23:38:30,784 INFO L280 TraceCheckUtils]: 42: Hoare triple {33557#true} #t~switch4 := 0 == #t~mem3; {33557#true} is VALID [2020-07-08 23:38:30,784 INFO L280 TraceCheckUtils]: 43: Hoare triple {33557#true} assume #t~switch4; {33557#true} is VALID [2020-07-08 23:38:30,784 INFO L280 TraceCheckUtils]: 44: Hoare triple {33557#true} SUMMARY for call #t~mem5 := read~int(~str.base, ~str.offset + ~start~0, 1); srcloc: L55-17 {33557#true} is VALID [2020-07-08 23:38:30,785 INFO L280 TraceCheckUtils]: 45: Hoare triple {33557#true} #t~short7 := 32 == #t~mem5; {33557#true} is VALID [2020-07-08 23:38:30,785 INFO L280 TraceCheckUtils]: 46: Hoare triple {33557#true} assume !#t~short7; {33557#true} is VALID [2020-07-08 23:38:30,785 INFO L280 TraceCheckUtils]: 47: Hoare triple {33557#true} SUMMARY for call #t~mem6 := read~int(~str.base, ~str.offset + ~start~0, 1); srcloc: L55-4 {33557#true} is VALID [2020-07-08 23:38:30,785 INFO L280 TraceCheckUtils]: 48: Hoare triple {33557#true} #t~short7 := 9 == #t~mem6; {33557#true} is VALID [2020-07-08 23:38:30,785 INFO L280 TraceCheckUtils]: 49: Hoare triple {33557#true} assume !#t~short7; {33557#true} is VALID [2020-07-08 23:38:30,786 INFO L280 TraceCheckUtils]: 50: Hoare triple {33557#true} havoc #t~mem5; {33557#true} is VALID [2020-07-08 23:38:30,786 INFO L280 TraceCheckUtils]: 51: Hoare triple {33557#true} havoc #t~mem6; {33557#true} is VALID [2020-07-08 23:38:30,786 INFO L280 TraceCheckUtils]: 52: Hoare triple {33557#true} havoc #t~short7; {33557#true} is VALID [2020-07-08 23:38:30,786 INFO L280 TraceCheckUtils]: 53: Hoare triple {33557#true} SUMMARY for call #t~mem9 := read~int(~str.base, ~str.offset + ~start~0, 1); srcloc: L55-18 {33557#true} is VALID [2020-07-08 23:38:30,786 INFO L280 TraceCheckUtils]: 54: Hoare triple {33557#true} assume !(34 == #t~mem9); {33557#true} is VALID [2020-07-08 23:38:30,787 INFO L280 TraceCheckUtils]: 55: Hoare triple {33557#true} havoc #t~mem9; {33557#true} is VALID [2020-07-08 23:38:30,787 INFO L280 TraceCheckUtils]: 56: Hoare triple {33557#true} ~j~0 := ~i~0 - 1; {33557#true} is VALID [2020-07-08 23:38:30,787 INFO L280 TraceCheckUtils]: 57: Hoare triple {33557#true} #t~short14 := 0 < ~j~0; {33564#(or (< 0 parse_expression_list_~j~0) (not |parse_expression_list_#t~short14|))} is VALID [2020-07-08 23:38:30,788 INFO L280 TraceCheckUtils]: 58: Hoare triple {33564#(or (< 0 parse_expression_list_~j~0) (not |parse_expression_list_#t~short14|))} assume #t~short14; {33565#(< 0 parse_expression_list_~j~0)} is VALID [2020-07-08 23:38:30,789 INFO L280 TraceCheckUtils]: 59: Hoare triple {33565#(< 0 parse_expression_list_~j~0)} SUMMARY for call #t~mem11 := read~int(~str.base, ~str.offset + ~j~0, 1); srcloc: L58-2 {33565#(< 0 parse_expression_list_~j~0)} is VALID [2020-07-08 23:38:30,789 INFO L280 TraceCheckUtils]: 60: Hoare triple {33565#(< 0 parse_expression_list_~j~0)} #t~short13 := 32 == #t~mem11; {33565#(< 0 parse_expression_list_~j~0)} is VALID [2020-07-08 23:38:30,790 INFO L280 TraceCheckUtils]: 61: Hoare triple {33565#(< 0 parse_expression_list_~j~0)} assume !#t~short13; {33565#(< 0 parse_expression_list_~j~0)} is VALID [2020-07-08 23:38:30,790 INFO L280 TraceCheckUtils]: 62: Hoare triple {33565#(< 0 parse_expression_list_~j~0)} SUMMARY for call #t~mem12 := read~int(~str.base, ~str.offset + ~j~0, 1); srcloc: L58-6 {33565#(< 0 parse_expression_list_~j~0)} is VALID [2020-07-08 23:38:30,791 INFO L280 TraceCheckUtils]: 63: Hoare triple {33565#(< 0 parse_expression_list_~j~0)} #t~short13 := 9 == #t~mem12; {33565#(< 0 parse_expression_list_~j~0)} is VALID [2020-07-08 23:38:30,791 INFO L280 TraceCheckUtils]: 64: Hoare triple {33565#(< 0 parse_expression_list_~j~0)} #t~short14 := #t~short13; {33565#(< 0 parse_expression_list_~j~0)} is VALID [2020-07-08 23:38:30,792 INFO L280 TraceCheckUtils]: 65: Hoare triple {33565#(< 0 parse_expression_list_~j~0)} assume !#t~short14; {33565#(< 0 parse_expression_list_~j~0)} is VALID [2020-07-08 23:38:30,792 INFO L280 TraceCheckUtils]: 66: Hoare triple {33565#(< 0 parse_expression_list_~j~0)} havoc #t~mem11; {33565#(< 0 parse_expression_list_~j~0)} is VALID [2020-07-08 23:38:30,793 INFO L280 TraceCheckUtils]: 67: Hoare triple {33565#(< 0 parse_expression_list_~j~0)} havoc #t~short13; {33565#(< 0 parse_expression_list_~j~0)} is VALID [2020-07-08 23:38:30,793 INFO L280 TraceCheckUtils]: 68: Hoare triple {33565#(< 0 parse_expression_list_~j~0)} havoc #t~short14; {33565#(< 0 parse_expression_list_~j~0)} is VALID [2020-07-08 23:38:30,794 INFO L280 TraceCheckUtils]: 69: Hoare triple {33565#(< 0 parse_expression_list_~j~0)} havoc #t~mem12; {33565#(< 0 parse_expression_list_~j~0)} is VALID [2020-07-08 23:38:30,795 INFO L280 TraceCheckUtils]: 70: Hoare triple {33565#(< 0 parse_expression_list_~j~0)} #t~short17 := 0 < ~j~0; {33566#|parse_expression_list_#t~short17|} is VALID [2020-07-08 23:38:30,795 INFO L280 TraceCheckUtils]: 71: Hoare triple {33566#|parse_expression_list_#t~short17|} assume !#t~short17; {33558#false} is VALID [2020-07-08 23:38:30,796 INFO L280 TraceCheckUtils]: 72: Hoare triple {33558#false} assume !#t~short17; {33558#false} is VALID [2020-07-08 23:38:30,796 INFO L280 TraceCheckUtils]: 73: Hoare triple {33558#false} havoc #t~short17; {33558#false} is VALID [2020-07-08 23:38:30,796 INFO L280 TraceCheckUtils]: 74: Hoare triple {33558#false} havoc #t~mem16; {33558#false} is VALID [2020-07-08 23:38:30,797 INFO L280 TraceCheckUtils]: 75: Hoare triple {33558#false} assume ~start~0 <= ~j~0; {33558#false} is VALID [2020-07-08 23:38:30,797 INFO L263 TraceCheckUtils]: 76: Hoare triple {33558#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)); {33557#true} is VALID [2020-07-08 23:38:30,797 INFO L280 TraceCheckUtils]: 77: Hoare triple {33557#true} ~dest.base, ~dest.offset := #in~dest.base, #in~dest.offset; {33557#true} is VALID [2020-07-08 23:38:30,798 INFO L280 TraceCheckUtils]: 78: Hoare triple {33557#true} ~src.base, ~src.offset := #in~src.base, #in~src.offset; {33557#true} is VALID [2020-07-08 23:38:30,798 INFO L280 TraceCheckUtils]: 79: Hoare triple {33557#true} ~n := #in~n; {33557#true} is VALID [2020-07-08 23:38:30,798 INFO L280 TraceCheckUtils]: 80: Hoare triple {33557#true} SUMMARY for call #t~ret0.base, #t~ret0.offset := strncpy(~dest.base, ~dest.offset, ~src.base, ~src.offset, ~n); srcloc: L30-2 {33557#true} is VALID [2020-07-08 23:38:30,798 INFO L280 TraceCheckUtils]: 81: Hoare triple {33557#true} #res.base, #res.offset := #t~ret0.base, #t~ret0.offset; {33557#true} is VALID [2020-07-08 23:38:30,799 INFO L280 TraceCheckUtils]: 82: Hoare triple {33557#true} havoc #t~ret0.base, #t~ret0.offset; {33557#true} is VALID [2020-07-08 23:38:30,799 INFO L280 TraceCheckUtils]: 83: Hoare triple {33557#true} assume true; {33557#true} is VALID [2020-07-08 23:38:30,799 INFO L275 TraceCheckUtils]: 84: Hoare quadruple {33557#true} {33558#false} #201#return; {33558#false} is VALID [2020-07-08 23:38:30,799 INFO L280 TraceCheckUtils]: 85: Hoare triple {33558#false} havoc #t~ret19.base, #t~ret19.offset; {33558#false} is VALID [2020-07-08 23:38:30,800 INFO L263 TraceCheckUtils]: 86: Hoare triple {33558#false} call __VERIFIER_assert((if 1 + (~j~0 - ~start~0) < 2 then 1 else 0)); {33558#false} is VALID [2020-07-08 23:38:30,800 INFO L280 TraceCheckUtils]: 87: Hoare triple {33558#false} ~cond := #in~cond; {33558#false} is VALID [2020-07-08 23:38:30,800 INFO L280 TraceCheckUtils]: 88: Hoare triple {33558#false} assume 0 == ~cond; {33558#false} is VALID [2020-07-08 23:38:30,801 INFO L280 TraceCheckUtils]: 89: Hoare triple {33558#false} assume !false; {33558#false} is VALID [2020-07-08 23:38:30,809 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2020-07-08 23:38:30,809 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1480213137] [2020-07-08 23:38:30,810 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 23:38:30,810 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-08 23:38:30,810 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562389069] [2020-07-08 23:38:30,811 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 90 [2020-07-08 23:38:30,811 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 23:38:30,811 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-08 23:38:30,900 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:38:30,900 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-08 23:38:30,901 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 23:38:30,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-08 23:38:30,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-07-08 23:38:30,902 INFO L87 Difference]: Start difference. First operand 247 states and 270 transitions. Second operand 6 states. [2020-07-08 23:38:32,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:38:32,131 INFO L93 Difference]: Finished difference Result 387 states and 425 transitions. [2020-07-08 23:38:32,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-08 23:38:32,131 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 90 [2020-07-08 23:38:32,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 23:38:32,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-08 23:38:32,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 262 transitions. [2020-07-08 23:38:32,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-08 23:38:32,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 262 transitions. [2020-07-08 23:38:32,135 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 262 transitions. [2020-07-08 23:38:32,418 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 262 edges. 262 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:38:32,423 INFO L225 Difference]: With dead ends: 387 [2020-07-08 23:38:32,424 INFO L226 Difference]: Without dead ends: 290 [2020-07-08 23:38:32,424 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-07-08 23:38:32,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2020-07-08 23:38:32,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 247. [2020-07-08 23:38:32,861 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 23:38:32,861 INFO L82 GeneralOperation]: Start isEquivalent. First operand 290 states. Second operand 247 states. [2020-07-08 23:38:32,861 INFO L74 IsIncluded]: Start isIncluded. First operand 290 states. Second operand 247 states. [2020-07-08 23:38:32,861 INFO L87 Difference]: Start difference. First operand 290 states. Second operand 247 states. [2020-07-08 23:38:32,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:38:32,868 INFO L93 Difference]: Finished difference Result 290 states and 318 transitions. [2020-07-08 23:38:32,868 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 318 transitions. [2020-07-08 23:38:32,868 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:38:32,868 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:38:32,869 INFO L74 IsIncluded]: Start isIncluded. First operand 247 states. Second operand 290 states. [2020-07-08 23:38:32,869 INFO L87 Difference]: Start difference. First operand 247 states. Second operand 290 states. [2020-07-08 23:38:32,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:38:32,874 INFO L93 Difference]: Finished difference Result 290 states and 318 transitions. [2020-07-08 23:38:32,874 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 318 transitions. [2020-07-08 23:38:32,875 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:38:32,875 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:38:32,875 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 23:38:32,875 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 23:38:32,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2020-07-08 23:38:32,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 269 transitions. [2020-07-08 23:38:32,879 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 269 transitions. Word has length 90 [2020-07-08 23:38:32,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 23:38:32,879 INFO L479 AbstractCegarLoop]: Abstraction has 247 states and 269 transitions. [2020-07-08 23:38:32,879 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-08 23:38:32,879 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 247 states and 269 transitions. [2020-07-08 23:38:33,284 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 269 edges. 269 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:38:33,285 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 269 transitions. [2020-07-08 23:38:33,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2020-07-08 23:38:33,286 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 23:38:33,286 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 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, 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-08 23:38:33,286 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-07-08 23:38:33,286 INFO L427 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 23:38:33,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 23:38:33,287 INFO L82 PathProgramCache]: Analyzing trace with hash 888855281, now seen corresponding path program 1 times [2020-07-08 23:38:33,287 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 23:38:33,287 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1352245831] [2020-07-08 23:38:33,288 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 23:38:33,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-08 23:38:33,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-08 23:38:33,367 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-07-08 23:38:33,367 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-08 23:38:33,367 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-07-08 23:38:33,415 WARN L1295 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2020-07-08 23:38:33,418 WARN L1295 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2020-07-08 23:38:33,420 WARN L1295 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2020-07-08 23:38:33,420 WARN L1295 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2020-07-08 23:38:33,421 WARN L1295 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2020-07-08 23:38:33,421 WARN L1295 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2020-07-08 23:38:33,422 WARN L1295 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2020-07-08 23:38:33,423 WARN L1295 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2020-07-08 23:38:33,424 WARN L1295 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2020-07-08 23:38:33,425 WARN L1295 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2020-07-08 23:38:33,425 WARN L1295 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2020-07-08 23:38:33,426 WARN L1295 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2020-07-08 23:38:33,426 WARN L1295 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2020-07-08 23:38:33,427 WARN L1295 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2020-07-08 23:38:33,427 WARN L1295 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2020-07-08 23:38:33,428 WARN L1295 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2020-07-08 23:38:33,428 WARN L1295 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2020-07-08 23:38:33,429 WARN L1295 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2020-07-08 23:38:33,430 WARN L1295 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2020-07-08 23:38:33,430 WARN L1295 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2020-07-08 23:38:33,431 WARN L1295 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2020-07-08 23:38:33,431 WARN L1295 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2020-07-08 23:38:33,432 WARN L1295 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2020-07-08 23:38:33,438 WARN L1295 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2020-07-08 23:38:33,452 WARN L170 areAnnotationChecker]: parse_expression_listENTRY has no Hoare annotation [2020-07-08 23:38:33,453 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2020-07-08 23:38:33,453 WARN L170 areAnnotationChecker]: r_strncpyENTRY has no Hoare annotation [2020-07-08 23:38:33,453 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-08 23:38:33,453 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-08 23:38:33,453 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-08 23:38:33,453 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2020-07-08 23:38:33,453 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2020-07-08 23:38:33,453 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-08 23:38:33,453 WARN L170 areAnnotationChecker]: L30 has no Hoare annotation [2020-07-08 23:38:33,454 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-08 23:38:33,454 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-08 23:38:33,454 WARN L170 areAnnotationChecker]: L74 has no Hoare annotation [2020-07-08 23:38:33,454 WARN L170 areAnnotationChecker]: L3 has no Hoare annotation [2020-07-08 23:38:33,454 WARN L170 areAnnotationChecker]: L3 has no Hoare annotation [2020-07-08 23:38:33,454 WARN L170 areAnnotationChecker]: L48-1 has no Hoare annotation [2020-07-08 23:38:33,454 WARN L170 areAnnotationChecker]: L-1-1 has no Hoare annotation [2020-07-08 23:38:33,454 WARN L170 areAnnotationChecker]: L30-1 has no Hoare annotation [2020-07-08 23:38:33,455 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-08 23:38:33,455 WARN L170 areAnnotationChecker]: L75 has no Hoare annotation [2020-07-08 23:38:33,455 WARN L170 areAnnotationChecker]: L75 has no Hoare annotation [2020-07-08 23:38:33,455 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-08 23:38:33,455 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-08 23:38:33,455 WARN L170 areAnnotationChecker]: L3-2 has no Hoare annotation [2020-07-08 23:38:33,455 WARN L170 areAnnotationChecker]: L48-2 has no Hoare annotation [2020-07-08 23:38:33,455 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-08 23:38:33,456 WARN L170 areAnnotationChecker]: L30-2 has no Hoare annotation [2020-07-08 23:38:33,456 WARN L170 areAnnotationChecker]: L76 has no Hoare annotation [2020-07-08 23:38:33,456 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-08 23:38:33,456 WARN L170 areAnnotationChecker]: L49 has no Hoare annotation [2020-07-08 23:38:33,456 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-08 23:38:33,456 WARN L170 areAnnotationChecker]: L30-3 has no Hoare annotation [2020-07-08 23:38:33,456 WARN L170 areAnnotationChecker]: L76-1 has no Hoare annotation [2020-07-08 23:38:33,456 WARN L170 areAnnotationChecker]: L62-1 has no Hoare annotation [2020-07-08 23:38:33,456 WARN L170 areAnnotationChecker]: L49-1 has no Hoare annotation [2020-07-08 23:38:33,457 WARN L170 areAnnotationChecker]: L49-1 has no Hoare annotation [2020-07-08 23:38:33,457 WARN L170 areAnnotationChecker]: L30-4 has no Hoare annotation [2020-07-08 23:38:33,457 WARN L170 areAnnotationChecker]: L77 has no Hoare annotation [2020-07-08 23:38:33,457 WARN L170 areAnnotationChecker]: L63 has no Hoare annotation [2020-07-08 23:38:33,457 WARN L170 areAnnotationChecker]: L50 has no Hoare annotation [2020-07-08 23:38:33,457 WARN L170 areAnnotationChecker]: L51-3 has no Hoare annotation [2020-07-08 23:38:33,457 WARN L170 areAnnotationChecker]: L51-3 has no Hoare annotation [2020-07-08 23:38:33,457 WARN L170 areAnnotationChecker]: r_strncpyFINAL has no Hoare annotation [2020-07-08 23:38:33,457 WARN L170 areAnnotationChecker]: L74-1 has no Hoare annotation [2020-07-08 23:38:33,458 WARN L170 areAnnotationChecker]: L53-2 has no Hoare annotation [2020-07-08 23:38:33,458 WARN L170 areAnnotationChecker]: L49-2 has no Hoare annotation [2020-07-08 23:38:33,458 WARN L170 areAnnotationChecker]: L52 has no Hoare annotation [2020-07-08 23:38:33,458 WARN L170 areAnnotationChecker]: L51-4 has no Hoare annotation [2020-07-08 23:38:33,458 WARN L170 areAnnotationChecker]: r_strncpyEXIT has no Hoare annotation [2020-07-08 23:38:33,458 WARN L170 areAnnotationChecker]: L74-2 has no Hoare annotation [2020-07-08 23:38:33,458 WARN L170 areAnnotationChecker]: L53-3 has no Hoare annotation [2020-07-08 23:38:33,458 WARN L170 areAnnotationChecker]: L49-3 has no Hoare annotation [2020-07-08 23:38:33,458 WARN L170 areAnnotationChecker]: L52-1 has no Hoare annotation [2020-07-08 23:38:33,459 WARN L170 areAnnotationChecker]: L49-6 has no Hoare annotation [2020-07-08 23:38:33,459 WARN L170 areAnnotationChecker]: L61-1 has no Hoare annotation [2020-07-08 23:38:33,459 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-08 23:38:33,459 WARN L170 areAnnotationChecker]: L51-1 has no Hoare annotation [2020-07-08 23:38:33,459 WARN L170 areAnnotationChecker]: parse_expression_listFINAL has no Hoare annotation [2020-07-08 23:38:33,459 WARN L170 areAnnotationChecker]: L53 has no Hoare annotation [2020-07-08 23:38:33,459 WARN L170 areAnnotationChecker]: L49-7 has no Hoare annotation [2020-07-08 23:38:33,459 WARN L170 areAnnotationChecker]: L62 has no Hoare annotation [2020-07-08 23:38:33,460 WARN L170 areAnnotationChecker]: L62 has no Hoare annotation [2020-07-08 23:38:33,460 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-08 23:38:33,460 WARN L170 areAnnotationChecker]: L69 has no Hoare annotation [2020-07-08 23:38:33,460 WARN L170 areAnnotationChecker]: L69 has no Hoare annotation [2020-07-08 23:38:33,460 WARN L170 areAnnotationChecker]: parse_expression_listEXIT has no Hoare annotation [2020-07-08 23:38:33,460 WARN L170 areAnnotationChecker]: L53-1 has no Hoare annotation [2020-07-08 23:38:33,460 WARN L170 areAnnotationChecker]: L69-1 has no Hoare annotation [2020-07-08 23:38:33,460 WARN L170 areAnnotationChecker]: L69-2 has no Hoare annotation [2020-07-08 23:38:33,460 WARN L170 areAnnotationChecker]: L54 has no Hoare annotation [2020-07-08 23:38:33,461 WARN L170 areAnnotationChecker]: L54 has no Hoare annotation [2020-07-08 23:38:33,461 WARN L170 areAnnotationChecker]: L55-17 has no Hoare annotation [2020-07-08 23:38:33,461 WARN L170 areAnnotationChecker]: L55-17 has no Hoare annotation [2020-07-08 23:38:33,461 WARN L170 areAnnotationChecker]: L55-18 has no Hoare annotation [2020-07-08 23:38:33,461 WARN L170 areAnnotationChecker]: L55-1 has no Hoare annotation [2020-07-08 23:38:33,461 WARN L170 areAnnotationChecker]: L56 has no Hoare annotation [2020-07-08 23:38:33,461 WARN L170 areAnnotationChecker]: L56 has no Hoare annotation [2020-07-08 23:38:33,461 WARN L170 areAnnotationChecker]: L55-2 has no Hoare annotation [2020-07-08 23:38:33,461 WARN L170 areAnnotationChecker]: L55-2 has no Hoare annotation [2020-07-08 23:38:33,461 WARN L170 areAnnotationChecker]: L56-1 has no Hoare annotation [2020-07-08 23:38:33,462 WARN L170 areAnnotationChecker]: L56-6 has no Hoare annotation [2020-07-08 23:38:33,462 WARN L170 areAnnotationChecker]: L55-6 has no Hoare annotation [2020-07-08 23:38:33,462 WARN L170 areAnnotationChecker]: L55-6 has no Hoare annotation [2020-07-08 23:38:33,462 WARN L170 areAnnotationChecker]: L55-4 has no Hoare annotation [2020-07-08 23:38:33,462 WARN L170 areAnnotationChecker]: L56-2 has no Hoare annotation [2020-07-08 23:38:33,462 WARN L170 areAnnotationChecker]: L56-7 has no Hoare annotation [2020-07-08 23:38:33,462 WARN L170 areAnnotationChecker]: L55-7 has no Hoare annotation [2020-07-08 23:38:33,462 WARN L170 areAnnotationChecker]: L55-11 has no Hoare annotation [2020-07-08 23:38:33,462 WARN L170 areAnnotationChecker]: L55-5 has no Hoare annotation [2020-07-08 23:38:33,462 WARN L170 areAnnotationChecker]: L56-3 has no Hoare annotation [2020-07-08 23:38:33,463 WARN L170 areAnnotationChecker]: L58-23 has no Hoare annotation [2020-07-08 23:38:33,463 WARN L170 areAnnotationChecker]: L58-23 has no Hoare annotation [2020-07-08 23:38:33,463 WARN L170 areAnnotationChecker]: L55-8 has no Hoare annotation [2020-07-08 23:38:33,463 WARN L170 areAnnotationChecker]: L55-12 has no Hoare annotation [2020-07-08 23:38:33,463 WARN L170 areAnnotationChecker]: L56-4 has no Hoare annotation [2020-07-08 23:38:33,463 WARN L170 areAnnotationChecker]: L58-24 has no Hoare annotation [2020-07-08 23:38:33,463 WARN L170 areAnnotationChecker]: L58-1 has no Hoare annotation [2020-07-08 23:38:33,463 WARN L170 areAnnotationChecker]: L58-1 has no Hoare annotation [2020-07-08 23:38:33,463 WARN L170 areAnnotationChecker]: L55-9 has no Hoare annotation [2020-07-08 23:38:33,463 WARN L170 areAnnotationChecker]: L55-13 has no Hoare annotation [2020-07-08 23:38:33,464 WARN L170 areAnnotationChecker]: L59 has no Hoare annotation [2020-07-08 23:38:33,464 WARN L170 areAnnotationChecker]: L59 has no Hoare annotation [2020-07-08 23:38:33,464 WARN L170 areAnnotationChecker]: L58-2 has no Hoare annotation [2020-07-08 23:38:33,464 WARN L170 areAnnotationChecker]: L58-10 has no Hoare annotation [2020-07-08 23:38:33,464 WARN L170 areAnnotationChecker]: L58-10 has no Hoare annotation [2020-07-08 23:38:33,464 WARN L170 areAnnotationChecker]: L55-14 has no Hoare annotation [2020-07-08 23:38:33,464 WARN L170 areAnnotationChecker]: L59-1 has no Hoare annotation [2020-07-08 23:38:33,464 WARN L170 areAnnotationChecker]: L59-4 has no Hoare annotation [2020-07-08 23:38:33,464 WARN L170 areAnnotationChecker]: L59-4 has no Hoare annotation [2020-07-08 23:38:33,464 WARN L170 areAnnotationChecker]: L58-3 has no Hoare annotation [2020-07-08 23:38:33,465 WARN L170 areAnnotationChecker]: L58-11 has no Hoare annotation [2020-07-08 23:38:33,465 WARN L170 areAnnotationChecker]: L58-16 has no Hoare annotation [2020-07-08 23:38:33,465 WARN L170 areAnnotationChecker]: L55-15 has no Hoare annotation [2020-07-08 23:38:33,465 WARN L170 areAnnotationChecker]: L59-2 has no Hoare annotation [2020-07-08 23:38:33,465 WARN L170 areAnnotationChecker]: L59-5 has no Hoare annotation [2020-07-08 23:38:33,465 WARN L170 areAnnotationChecker]: L59-11 has no Hoare annotation [2020-07-08 23:38:33,465 WARN L170 areAnnotationChecker]: L58-4 has no Hoare annotation [2020-07-08 23:38:33,465 WARN L170 areAnnotationChecker]: L58-4 has no Hoare annotation [2020-07-08 23:38:33,465 WARN L170 areAnnotationChecker]: L58-12 has no Hoare annotation [2020-07-08 23:38:33,465 WARN L170 areAnnotationChecker]: L58-17 has no Hoare annotation [2020-07-08 23:38:33,466 WARN L170 areAnnotationChecker]: L55-16 has no Hoare annotation [2020-07-08 23:38:33,466 WARN L170 areAnnotationChecker]: L59-6 has no Hoare annotation [2020-07-08 23:38:33,466 WARN L170 areAnnotationChecker]: L59-12 has no Hoare annotation [2020-07-08 23:38:33,466 WARN L170 areAnnotationChecker]: L58-8 has no Hoare annotation [2020-07-08 23:38:33,466 WARN L170 areAnnotationChecker]: L58-6 has no Hoare annotation [2020-07-08 23:38:33,466 WARN L170 areAnnotationChecker]: L58-13 has no Hoare annotation [2020-07-08 23:38:33,466 WARN L170 areAnnotationChecker]: L58-18 has no Hoare annotation [2020-07-08 23:38:33,466 WARN L170 areAnnotationChecker]: L59-7 has no Hoare annotation [2020-07-08 23:38:33,466 WARN L170 areAnnotationChecker]: L59-13 has no Hoare annotation [2020-07-08 23:38:33,466 WARN L170 areAnnotationChecker]: L59-13 has no Hoare annotation [2020-07-08 23:38:33,467 WARN L170 areAnnotationChecker]: L58-7 has no Hoare annotation [2020-07-08 23:38:33,467 WARN L170 areAnnotationChecker]: L58-14 has no Hoare annotation [2020-07-08 23:38:33,467 WARN L170 areAnnotationChecker]: L58-19 has no Hoare annotation [2020-07-08 23:38:33,467 WARN L170 areAnnotationChecker]: L59-8 has no Hoare annotation [2020-07-08 23:38:33,467 WARN L170 areAnnotationChecker]: L61 has no Hoare annotation [2020-07-08 23:38:33,467 WARN L170 areAnnotationChecker]: L61 has no Hoare annotation [2020-07-08 23:38:33,467 WARN L170 areAnnotationChecker]: L65 has no Hoare annotation [2020-07-08 23:38:33,467 WARN L170 areAnnotationChecker]: L58-20 has no Hoare annotation [2020-07-08 23:38:33,467 WARN L170 areAnnotationChecker]: L59-9 has no Hoare annotation [2020-07-08 23:38:33,467 WARN L170 areAnnotationChecker]: L49-4 has no Hoare annotation [2020-07-08 23:38:33,468 WARN L170 areAnnotationChecker]: L58-21 has no Hoare annotation [2020-07-08 23:38:33,468 WARN L170 areAnnotationChecker]: L49-5 has no Hoare annotation [2020-07-08 23:38:33,468 WARN L170 areAnnotationChecker]: L58-22 has no Hoare annotation [2020-07-08 23:38:33,468 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-08 23:38:33,472 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.07 11:38:33 BoogieIcfgContainer [2020-07-08 23:38:33,472 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-08 23:38:33,475 INFO L168 Benchmark]: Toolchain (without parser) took 61839.40 ms. Allocated memory was 146.8 MB in the beginning and 555.7 MB in the end (delta: 408.9 MB). Free memory was 104.7 MB in the beginning and 219.6 MB in the end (delta: -114.9 MB). Peak memory consumption was 294.1 MB. Max. memory is 7.1 GB. [2020-07-08 23:38:33,475 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 146.8 MB. Free memory was 123.4 MB in the beginning and 123.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-08 23:38:33,476 INFO L168 Benchmark]: CACSL2BoogieTranslator took 409.67 ms. Allocated memory was 146.8 MB in the beginning and 204.5 MB in the end (delta: 57.7 MB). Free memory was 104.5 MB in the beginning and 180.8 MB in the end (delta: -76.2 MB). Peak memory consumption was 19.8 MB. Max. memory is 7.1 GB. [2020-07-08 23:38:33,476 INFO L168 Benchmark]: Boogie Preprocessor took 54.82 ms. Allocated memory is still 204.5 MB. Free memory was 180.8 MB in the beginning and 178.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2020-07-08 23:38:33,477 INFO L168 Benchmark]: RCFGBuilder took 710.61 ms. Allocated memory is still 204.5 MB. Free memory was 178.2 MB in the beginning and 128.6 MB in the end (delta: 49.6 MB). Peak memory consumption was 49.6 MB. Max. memory is 7.1 GB. [2020-07-08 23:38:33,477 INFO L168 Benchmark]: TraceAbstraction took 60658.89 ms. Allocated memory was 204.5 MB in the beginning and 555.7 MB in the end (delta: 351.3 MB). Free memory was 128.6 MB in the beginning and 219.6 MB in the end (delta: -91.0 MB). Peak memory consumption was 260.3 MB. Max. memory is 7.1 GB. [2020-07-08 23:38:33,479 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.18 ms. Allocated memory is still 146.8 MB. Free memory was 123.4 MB in the beginning and 123.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 409.67 ms. Allocated memory was 146.8 MB in the beginning and 204.5 MB in the end (delta: 57.7 MB). Free memory was 104.5 MB in the beginning and 180.8 MB in the end (delta: -76.2 MB). Peak memory consumption was 19.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 54.82 ms. Allocated memory is still 204.5 MB. Free memory was 180.8 MB in the beginning and 178.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 710.61 ms. Allocated memory is still 204.5 MB. Free memory was 178.2 MB in the beginning and 128.6 MB in the end (delta: 49.6 MB). Peak memory consumption was 49.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 60658.89 ms. Allocated memory was 204.5 MB in the beginning and 555.7 MB in the end (delta: 351.3 MB). Free memory was 128.6 MB in the beginning and 219.6 MB in the end (delta: -91.0 MB). Peak memory consumption was 260.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L74] char A [2 + 2 + 4 +1]; VAL [A={4:0}] [L75] A[2 + 2 + 4] = 0 VAL [A={4:0}] [L76] CALL parse_expression_list (A) VAL [str={4:0}] [L48] int start=0, i=-1, j=-1; VAL [i=-1, j=-1, start=0, str={4:0}, str={4:0}] [L49] char str2[2]; VAL [i=-1, j=-1, start=0, str={4:0}, str={4:0}, str2={3:0}] [L50] COND FALSE !(!str) VAL [i=-1, j=-1, start=0, str={4:0}, str={4:0}, str2={3:0}] [L52] i++ VAL [i=0, j=-1, start=0, str={4:0}, str={4:0}, str2={3:0}] [L53] str[i] VAL [i=0, j=-1, start=0, str={4:0}, str={4:0}, str2={3:0}, str[i]=40] [L54] case 0: VAL [i=0, j=-1, start=0, str={4:0}, str={4:0}, str2={3:0}, str[i]=40] [L69] EXPR str[i] VAL [i=0, j=-1, start=0, str={4:0}, str={4:0}, str2={3:0}, str[i]=40] [L69] COND TRUE str[i] != 0 VAL [i=0, j=-1, start=0, str={4:0}, str={4:0}, str2={3:0}, str[i]=40] [L52] i++ VAL [i=1, j=-1, start=0, str={4:0}, str={4:0}, str2={3:0}] [L53] str[i] VAL [i=1, j=-1, start=0, str={4:0}, str={4:0}, str2={3:0}, str[i]=36] [L54] case 0: VAL [i=1, j=-1, start=0, str={4:0}, str={4:0}, str2={3:0}, str[i]=36] [L69] EXPR str[i] VAL [i=1, j=-1, start=0, str={4:0}, str={4:0}, str2={3:0}, str[i]=36] [L69] COND TRUE str[i] != 0 VAL [i=1, j=-1, start=0, str={4:0}, str={4:0}, str2={3:0}, str[i]=36] [L52] i++ VAL [i=2, j=-1, start=0, str={4:0}, str={4:0}, str2={3:0}] [L53] str[i] VAL [i=2, j=-1, start=0, str={4:0}, str={4:0}, str2={3:0}, str[i]=0] [L54] case 0: VAL [i=2, j=-1, start=0, str={4:0}, str={4:0}, str2={3:0}, str[i]=0] [L55] EXPR str[start] VAL [i=2, j=-1, start=0, str={4:0}, str={4:0}, str2={3:0}, str[i]=0, str[start]=40] [L55] (str[start] == ' ') || (str[start] == '\t') VAL [(str[start] == ' ') || (str[start] == '\t')=0, i=2, j=-1, start=0, str={4:0}, str={4:0}, str2={3:0}, str[i]=0, str[start]=40] [L55] EXPR str[start] VAL [(str[start] == ' ') || (str[start] == '\t')=0, i=2, j=-1, start=0, str={4:0}, str={4:0}, str2={3:0}, str[i]=0, str[start]=40, str[start]=40] [L55] (str[start] == ' ') || (str[start] == '\t') VAL [(str[start] == ' ') || (str[start] == '\t')=0, i=2, j=-1, start=0, str={4:0}, str={4:0}, str2={3:0}, str[i]=0, str[start]=40, str[start]=40] [L55] COND FALSE !((str[start] == ' ') || (str[start] == '\t')) VAL [(str[start] == ' ') || (str[start] == '\t')=0, i=2, j=-1, start=0, str={4:0}, str={4:0}, str2={3:0}, str[i]=0, str[start]=40, str[start]=40] [L56] EXPR str[start] VAL [i=2, j=-1, start=0, str={4:0}, str={4:0}, str2={3:0}, str[i]=0, str[start]=40] [L56] COND FALSE !(str[start] == '"') VAL [i=2, j=-1, start=0, str={4:0}, str={4:0}, str2={3:0}, str[i]=0, str[start]=40] [L57] j = i-1 VAL [i=2, j=1, start=0, str={4:0}, str={4:0}, str2={3:0}, str[i]=0] [L58] (0 < j) && ((str[j] == ' ') || (str[j] == '\t')) VAL [(0 < j) && ((str[j] == ' ') || (str[j] == '\t'))=1, i=2, j=1, start=0, str={4:0}, str={4:0}, str2={3:0}, str[i]=0] [L58] EXPR str[j] VAL [(0 < j) && ((str[j] == ' ') || (str[j] == '\t'))=1, i=2, j=1, start=0, str={4:0}, str={4:0}, str2={3:0}, str[i]=0, str[j]=36] [L58] EXPR (str[j] == ' ') || (str[j] == '\t') VAL [(0 < j) && ((str[j] == ' ') || (str[j] == '\t'))=1, (str[j] == ' ') || (str[j] == '\t')=0, i=2, j=1, start=0, str={4:0}, str={4:0}, str2={3:0}, str[i]=0, str[j]=36] [L58] EXPR str[j] VAL [(0 < j) && ((str[j] == ' ') || (str[j] == '\t'))=1, (str[j] == ' ') || (str[j] == '\t')=0, i=2, j=1, start=0, str={4:0}, str={4:0}, str2={3:0}, str[i]=0, str[j]=36, str[j]=36] [L58] EXPR (str[j] == ' ') || (str[j] == '\t') VAL [(0 < j) && ((str[j] == ' ') || (str[j] == '\t'))=1, (str[j] == ' ') || (str[j] == '\t')=0, i=2, j=1, start=0, str={4:0}, str={4:0}, str2={3:0}, str[i]=0, str[j]=36, str[j]=36] [L58] (0 < j) && ((str[j] == ' ') || (str[j] == '\t')) VAL [(0 < j) && ((str[j] == ' ') || (str[j] == '\t'))=0, (str[j] == ' ') || (str[j] == '\t')=0, i=2, j=1, start=0, str={4:0}, str={4:0}, str2={3:0}, str[i]=0, str[j]=36, str[j]=36] [L58] COND FALSE !((0 < j) && ((str[j] == ' ') || (str[j] == '\t'))) VAL [(0 < j) && ((str[j] == ' ') || (str[j] == '\t'))=0, (str[j] == ' ') || (str[j] == '\t')=0, i=2, j=1, start=0, str={4:0}, str={4:0}, str2={3:0}, str[i]=0, str[j]=36, str[j]=36] [L59] (0 < j) && (str[j] == '"') VAL [(0 < j) && (str[j] == '"')=1, i=2, j=1, start=0, str={4:0}, str={4:0}, str2={3:0}, str[i]=0] [L59] EXPR str[j] VAL [(0 < j) && (str[j] == '"')=1, i=2, j=1, start=0, str={4:0}, str={4:0}, str2={3:0}, str[i]=0, str[j]=36] [L59] (0 < j) && (str[j] == '"') VAL [(0 < j) && (str[j] == '"')=0, i=2, j=1, start=0, str={4:0}, str={4:0}, str2={3:0}, str[i]=0, str[j]=36] [L59] COND FALSE !((0 < j) && (str[j] == '"')) VAL [(0 < j) && (str[j] == '"')=0, i=2, j=1, start=0, str={4:0}, str={4:0}, str2={3:0}, str[i]=0, str[j]=36] [L60] COND TRUE start<=j VAL [i=2, j=1, start=0, str={4:0}, str={4:0}, str2={3:0}, str[i]=0] [L61] CALL r_strncpy(str2, str+start, j-start+1) VAL [\old(n)=2, dest={3:0}, src={4:0}] [L30] return strncpy(dest,src,n); VAL [\old(n)=2, \result={37:38}, dest={3:0}, dest={3:0}, n=2, src={4:0}, src={4:0}, strncpy(dest,src,n)={37:38}] [L61] RET r_strncpy(str2, str+start, j-start+1) VAL [i=2, j=1, r_strncpy(str2, str+start, j-start+1)={37:38}, start=0, str={4:0}, str={4:0}, str2={3:0}, str[i]=0] [L62] CALL __VERIFIER_assert(j - start + 1 < 2) VAL [\old(cond)=0] [L3] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L4] __VERIFIER_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 123 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 60.4s, OverallIterations: 20, TraceHistogramMax: 3, AutomataDifference: 42.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2579 SDtfs, 3313 SDslu, 10287 SDs, 0 SdLazy, 6521 SolverSat, 256 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 315 GetRequests, 95 SyntacticMatches, 2 SemanticMatches, 218 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 520 ImplicationChecksByTransitivity, 2.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=390occurred in iteration=17, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 6.5s AutomataMinimizationTime, 19 MinimizatonAttempts, 1529 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 1464 NumberOfCodeBlocks, 1464 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 1353 ConstructedInterpolants, 0 QuantifiedInterpolants, 264799 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 14 PerfectInterpolantSequences, 60/100 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...