java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default-Const.epf -i ../../../trunk/examples/svcomp/array-examples/relax_true-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 18:41:19,323 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 18:41:19,326 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 18:41:19,346 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 18:41:19,346 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 18:41:19,348 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 18:41:19,349 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 18:41:19,351 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 18:41:19,352 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 18:41:19,353 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 18:41:19,354 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 18:41:19,354 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 18:41:19,355 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 18:41:19,356 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 18:41:19,358 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 18:41:19,358 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 18:41:19,359 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 18:41:19,361 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 18:41:19,363 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 18:41:19,365 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 18:41:19,366 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 18:41:19,367 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 18:41:19,370 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 18:41:19,370 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 18:41:19,370 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 18:41:19,371 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 18:41:19,372 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 18:41:19,373 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 18:41:19,374 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 18:41:19,375 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 18:41:19,375 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 18:41:19,376 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 18:41:19,376 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 18:41:19,376 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 18:41:19,377 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 18:41:19,378 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 18:41:19,378 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default-Const.epf [2018-11-14 18:41:19,393 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 18:41:19,393 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 18:41:19,394 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 18:41:19,394 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 18:41:19,395 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 18:41:19,395 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 18:41:19,395 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 18:41:19,395 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 18:41:19,396 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 18:41:19,396 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-14 18:41:19,396 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 18:41:19,396 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 18:41:19,396 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 18:41:19,397 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 18:41:19,397 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 18:41:19,397 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 18:41:19,397 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 18:41:19,397 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-14 18:41:19,397 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 18:41:19,398 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 18:41:19,398 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 18:41:19,398 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 18:41:19,398 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 18:41:19,398 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 18:41:19,399 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 18:41:19,399 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 18:41:19,399 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 18:41:19,399 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-14 18:41:19,399 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 18:41:19,400 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-14 18:41:19,400 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 18:41:19,444 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 18:41:19,457 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 18:41:19,461 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 18:41:19,462 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 18:41:19,463 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 18:41:19,464 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/relax_true-unreach-call.i [2018-11-14 18:41:19,525 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a48ea2af/ea51a1d1eda04825871396a4a19a7f92/FLAGb6f42f4fb [2018-11-14 18:41:20,113 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 18:41:20,113 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/relax_true-unreach-call.i [2018-11-14 18:41:20,128 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a48ea2af/ea51a1d1eda04825871396a4a19a7f92/FLAGb6f42f4fb [2018-11-14 18:41:20,141 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a48ea2af/ea51a1d1eda04825871396a4a19a7f92 [2018-11-14 18:41:20,151 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 18:41:20,153 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 18:41:20,154 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 18:41:20,154 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 18:41:20,158 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 18:41:20,159 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 06:41:20" (1/1) ... [2018-11-14 18:41:20,163 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@379fc3aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:41:20, skipping insertion in model container [2018-11-14 18:41:20,163 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 06:41:20" (1/1) ... [2018-11-14 18:41:20,173 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 18:41:20,225 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 18:41:20,713 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 18:41:20,731 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 18:41:20,823 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 18:41:20,967 INFO L195 MainTranslator]: Completed translation [2018-11-14 18:41:20,968 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:41:20 WrapperNode [2018-11-14 18:41:20,968 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 18:41:20,970 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 18:41:20,970 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 18:41:20,970 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 18:41:20,985 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:41:20" (1/1) ... [2018-11-14 18:41:20,986 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:41:20" (1/1) ... [2018-11-14 18:41:21,011 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:41:20" (1/1) ... [2018-11-14 18:41:21,013 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:41:20" (1/1) ... [2018-11-14 18:41:21,050 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:41:20" (1/1) ... [2018-11-14 18:41:21,066 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:41:20" (1/1) ... [2018-11-14 18:41:21,073 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:41:20" (1/1) ... [2018-11-14 18:41:21,080 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 18:41:21,080 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 18:41:21,081 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 18:41:21,081 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 18:41:21,082 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:41:20" (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 [2018-11-14 18:41:21,148 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 18:41:21,148 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 18:41:21,149 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-14 18:41:21,149 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2018-11-14 18:41:21,149 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2018-11-14 18:41:21,149 INFO L138 BoogieDeclarations]: Found implementation of procedure is_relaxed_prefix [2018-11-14 18:41:21,149 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 18:41:21,150 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2018-11-14 18:41:21,150 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-14 18:41:21,150 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2018-11-14 18:41:21,150 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 18:41:21,150 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-14 18:41:21,150 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2018-11-14 18:41:21,151 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2018-11-14 18:41:21,151 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-11-14 18:41:21,151 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-11-14 18:41:21,151 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-11-14 18:41:21,151 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-11-14 18:41:21,152 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-11-14 18:41:21,152 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-11-14 18:41:21,152 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-11-14 18:41:21,152 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-11-14 18:41:21,152 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-11-14 18:41:21,152 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-11-14 18:41:21,153 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-11-14 18:41:21,153 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-11-14 18:41:21,153 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-11-14 18:41:21,153 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-11-14 18:41:21,153 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-11-14 18:41:21,153 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-11-14 18:41:21,154 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-11-14 18:41:21,154 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-11-14 18:41:21,154 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-11-14 18:41:21,154 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-11-14 18:41:21,154 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-11-14 18:41:21,154 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-11-14 18:41:21,154 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-11-14 18:41:21,155 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-11-14 18:41:21,155 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-11-14 18:41:21,155 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-11-14 18:41:21,155 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-11-14 18:41:21,155 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-11-14 18:41:21,155 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-11-14 18:41:21,155 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-11-14 18:41:21,156 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-11-14 18:41:21,156 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-11-14 18:41:21,156 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-11-14 18:41:21,156 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-11-14 18:41:21,156 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-11-14 18:41:21,156 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-11-14 18:41:21,156 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-11-14 18:41:21,157 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-11-14 18:41:21,157 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-11-14 18:41:21,157 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-11-14 18:41:21,157 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-11-14 18:41:21,157 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-11-14 18:41:21,157 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-11-14 18:41:21,157 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-11-14 18:41:21,158 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-11-14 18:41:21,158 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-11-14 18:41:21,158 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-11-14 18:41:21,158 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-11-14 18:41:21,158 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-11-14 18:41:21,158 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-11-14 18:41:21,159 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-11-14 18:41:21,159 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-11-14 18:41:21,159 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-11-14 18:41:21,159 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-11-14 18:41:21,159 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-11-14 18:41:21,159 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-11-14 18:41:21,159 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-11-14 18:41:21,160 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-11-14 18:41:21,160 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-11-14 18:41:21,160 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-11-14 18:41:21,160 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-11-14 18:41:21,160 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-14 18:41:21,160 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-11-14 18:41:21,161 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-11-14 18:41:21,161 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-11-14 18:41:21,161 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-11-14 18:41:21,161 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-11-14 18:41:21,161 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-11-14 18:41:21,161 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-11-14 18:41:21,161 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-11-14 18:41:21,162 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-11-14 18:41:21,162 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-11-14 18:41:21,162 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-11-14 18:41:21,162 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-11-14 18:41:21,162 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-11-14 18:41:21,163 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-11-14 18:41:21,163 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-11-14 18:41:21,163 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-11-14 18:41:21,163 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-11-14 18:41:21,163 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-11-14 18:41:21,163 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-11-14 18:41:21,164 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-11-14 18:41:21,164 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-11-14 18:41:21,164 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-11-14 18:41:21,164 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-11-14 18:41:21,164 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-11-14 18:41:21,164 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-11-14 18:41:21,166 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-11-14 18:41:21,166 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-11-14 18:41:21,166 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-11-14 18:41:21,166 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-11-14 18:41:21,166 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-11-14 18:41:21,167 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-11-14 18:41:21,167 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-11-14 18:41:21,167 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-11-14 18:41:21,167 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-11-14 18:41:21,167 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-11-14 18:41:21,168 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-11-14 18:41:21,168 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-11-14 18:41:21,168 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-11-14 18:41:21,168 INFO L130 BoogieDeclarations]: Found specification of procedure is_relaxed_prefix [2018-11-14 18:41:21,168 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-14 18:41:21,168 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 18:41:21,169 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-14 18:41:21,169 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-14 18:41:21,169 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 18:41:21,169 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 18:41:21,169 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-11-14 18:41:21,169 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-14 18:41:22,420 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 18:41:22,421 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 06:41:22 BoogieIcfgContainer [2018-11-14 18:41:22,421 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 18:41:22,422 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 18:41:22,422 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 18:41:22,426 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 18:41:22,426 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 06:41:20" (1/3) ... [2018-11-14 18:41:22,427 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2190f397 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 06:41:22, skipping insertion in model container [2018-11-14 18:41:22,427 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:41:20" (2/3) ... [2018-11-14 18:41:22,428 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2190f397 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 06:41:22, skipping insertion in model container [2018-11-14 18:41:22,428 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 06:41:22" (3/3) ... [2018-11-14 18:41:22,430 INFO L112 eAbstractionObserver]: Analyzing ICFG relax_true-unreach-call.i [2018-11-14 18:41:22,439 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 18:41:22,446 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 18:41:22,462 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 18:41:22,495 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 18:41:22,496 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 18:41:22,497 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 18:41:22,497 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 18:41:22,497 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 18:41:22,497 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 18:41:22,497 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 18:41:22,498 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 18:41:22,498 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 18:41:22,516 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states. [2018-11-14 18:41:22,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-14 18:41:22,523 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:41:22,524 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:41:22,527 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:41:22,533 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:41:22,534 INFO L82 PathProgramCache]: Analyzing trace with hash -1473558439, now seen corresponding path program 1 times [2018-11-14 18:41:22,536 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:41:22,538 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:41:22,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:41:22,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:41:22,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:41:22,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:41:22,732 INFO L256 TraceCheckUtils]: 0: Hoare triple {58#true} call ULTIMATE.init(); {58#true} is VALID [2018-11-14 18:41:22,736 INFO L273 TraceCheckUtils]: 1: Hoare triple {58#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {58#true} is VALID [2018-11-14 18:41:22,737 INFO L273 TraceCheckUtils]: 2: Hoare triple {58#true} assume true; {58#true} is VALID [2018-11-14 18:41:22,737 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {58#true} {58#true} #173#return; {58#true} is VALID [2018-11-14 18:41:22,738 INFO L256 TraceCheckUtils]: 4: Hoare triple {58#true} call #t~ret28 := main(); {58#true} is VALID [2018-11-14 18:41:22,738 INFO L273 TraceCheckUtils]: 5: Hoare triple {58#true} ~pat_len~0 := #t~nondet6;havoc #t~nondet6;~a_len~0 := #t~nondet7;havoc #t~nondet7;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.alloc(4 * ~pat_len~0);~pat~0.base, ~pat~0.offset := #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.alloc(4 * ~a_len~0);~a~0.base, ~a~0.offset := #t~malloc9.base, #t~malloc9.offset;~j~0 := 0; {58#true} is VALID [2018-11-14 18:41:22,739 INFO L273 TraceCheckUtils]: 6: Hoare triple {58#true} assume !true; {59#false} is VALID [2018-11-14 18:41:22,739 INFO L273 TraceCheckUtils]: 7: Hoare triple {59#false} ~j~1 := 0; {59#false} is VALID [2018-11-14 18:41:22,740 INFO L273 TraceCheckUtils]: 8: Hoare triple {59#false} assume !true; {59#false} is VALID [2018-11-14 18:41:22,740 INFO L256 TraceCheckUtils]: 9: Hoare triple {59#false} call #t~ret14 := is_relaxed_prefix(~pat~0.base, ~pat~0.offset, ~pat_len~0, ~a~0.base, ~a~0.offset, ~a_len~0); {58#true} is VALID [2018-11-14 18:41:22,740 INFO L273 TraceCheckUtils]: 10: Hoare triple {58#true} ~pat.base, ~pat.offset := #in~pat.base, #in~pat.offset;~pat_length := #in~pat_length;~a.base, ~a.offset := #in~a.base, #in~a.offset;~a_length := #in~a_length; {58#true} is VALID [2018-11-14 18:41:22,740 INFO L273 TraceCheckUtils]: 11: Hoare triple {58#true} assume ~pat_length % 4294967296 > (~a_length + 1) % 4294967296;#res := 0; {58#true} is VALID [2018-11-14 18:41:22,741 INFO L273 TraceCheckUtils]: 12: Hoare triple {58#true} assume true; {58#true} is VALID [2018-11-14 18:41:22,741 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {58#true} {59#false} #165#return; {59#false} is VALID [2018-11-14 18:41:22,741 INFO L273 TraceCheckUtils]: 14: Hoare triple {59#false} assume #t~ret14 % 256 != 0;havoc #t~ret14; {59#false} is VALID [2018-11-14 18:41:22,742 INFO L256 TraceCheckUtils]: 15: Hoare triple {59#false} call __VERIFIER_assert((if ~pat_len~0 % 4294967296 <= (~a_len~0 + 1) % 4294967296 then 1 else 0)); {59#false} is VALID [2018-11-14 18:41:22,742 INFO L273 TraceCheckUtils]: 16: Hoare triple {59#false} ~cond := #in~cond; {59#false} is VALID [2018-11-14 18:41:22,743 INFO L273 TraceCheckUtils]: 17: Hoare triple {59#false} assume ~cond == 0; {59#false} is VALID [2018-11-14 18:41:22,743 INFO L273 TraceCheckUtils]: 18: Hoare triple {59#false} assume !false; {59#false} is VALID [2018-11-14 18:41:22,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:41:22,749 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:41:22,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-14 18:41:22,755 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 19 [2018-11-14 18:41:22,758 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:41:22,761 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-14 18:41:22,920 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:41:22,920 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-14 18:41:22,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-14 18:41:22,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 18:41:22,934 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 2 states. [2018-11-14 18:41:23,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:41:23,521 INFO L93 Difference]: Finished difference Result 101 states and 151 transitions. [2018-11-14 18:41:23,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-14 18:41:23,522 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 19 [2018-11-14 18:41:23,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:41:23,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 18:41:23,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 151 transitions. [2018-11-14 18:41:23,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 18:41:23,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 151 transitions. [2018-11-14 18:41:23,546 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 151 transitions. [2018-11-14 18:41:23,920 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 151 edges. 151 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:41:23,936 INFO L225 Difference]: With dead ends: 101 [2018-11-14 18:41:23,936 INFO L226 Difference]: Without dead ends: 50 [2018-11-14 18:41:23,940 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 18:41:23,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-11-14 18:41:24,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-11-14 18:41:24,022 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:41:24,022 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand 50 states. [2018-11-14 18:41:24,023 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 50 states. [2018-11-14 18:41:24,023 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 50 states. [2018-11-14 18:41:24,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:41:24,030 INFO L93 Difference]: Finished difference Result 50 states and 66 transitions. [2018-11-14 18:41:24,031 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 66 transitions. [2018-11-14 18:41:24,032 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:41:24,032 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:41:24,032 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 50 states. [2018-11-14 18:41:24,032 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 50 states. [2018-11-14 18:41:24,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:41:24,038 INFO L93 Difference]: Finished difference Result 50 states and 66 transitions. [2018-11-14 18:41:24,039 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 66 transitions. [2018-11-14 18:41:24,040 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:41:24,040 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:41:24,040 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:41:24,040 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:41:24,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-14 18:41:24,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 66 transitions. [2018-11-14 18:41:24,047 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 66 transitions. Word has length 19 [2018-11-14 18:41:24,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:41:24,049 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 66 transitions. [2018-11-14 18:41:24,049 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-14 18:41:24,049 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 66 transitions. [2018-11-14 18:41:24,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-14 18:41:24,050 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:41:24,050 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:41:24,051 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:41:24,051 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:41:24,051 INFO L82 PathProgramCache]: Analyzing trace with hash 160429454, now seen corresponding path program 1 times [2018-11-14 18:41:24,051 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:41:24,052 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:41:24,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:41:24,054 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:41:24,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:41:24,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:41:24,274 INFO L256 TraceCheckUtils]: 0: Hoare triple {353#true} call ULTIMATE.init(); {353#true} is VALID [2018-11-14 18:41:24,274 INFO L273 TraceCheckUtils]: 1: Hoare triple {353#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {353#true} is VALID [2018-11-14 18:41:24,275 INFO L273 TraceCheckUtils]: 2: Hoare triple {353#true} assume true; {353#true} is VALID [2018-11-14 18:41:24,275 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {353#true} {353#true} #173#return; {353#true} is VALID [2018-11-14 18:41:24,275 INFO L256 TraceCheckUtils]: 4: Hoare triple {353#true} call #t~ret28 := main(); {353#true} is VALID [2018-11-14 18:41:24,275 INFO L273 TraceCheckUtils]: 5: Hoare triple {353#true} ~pat_len~0 := #t~nondet6;havoc #t~nondet6;~a_len~0 := #t~nondet7;havoc #t~nondet7;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.alloc(4 * ~pat_len~0);~pat~0.base, ~pat~0.offset := #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.alloc(4 * ~a_len~0);~a~0.base, ~a~0.offset := #t~malloc9.base, #t~malloc9.offset;~j~0 := 0; {353#true} is VALID [2018-11-14 18:41:24,276 INFO L273 TraceCheckUtils]: 6: Hoare triple {353#true} assume true; {353#true} is VALID [2018-11-14 18:41:24,276 INFO L273 TraceCheckUtils]: 7: Hoare triple {353#true} assume !(~j~0 % 4294967296 < ~pat_len~0 % 4294967296); {353#true} is VALID [2018-11-14 18:41:24,276 INFO L273 TraceCheckUtils]: 8: Hoare triple {353#true} ~j~1 := 0; {353#true} is VALID [2018-11-14 18:41:24,277 INFO L273 TraceCheckUtils]: 9: Hoare triple {353#true} assume true; {353#true} is VALID [2018-11-14 18:41:24,277 INFO L273 TraceCheckUtils]: 10: Hoare triple {353#true} assume !(~j~1 % 4294967296 < ~a_len~0 % 4294967296); {353#true} is VALID [2018-11-14 18:41:24,278 INFO L256 TraceCheckUtils]: 11: Hoare triple {353#true} call #t~ret14 := is_relaxed_prefix(~pat~0.base, ~pat~0.offset, ~pat_len~0, ~a~0.base, ~a~0.offset, ~a_len~0); {353#true} is VALID [2018-11-14 18:41:24,278 INFO L273 TraceCheckUtils]: 12: Hoare triple {353#true} ~pat.base, ~pat.offset := #in~pat.base, #in~pat.offset;~pat_length := #in~pat_length;~a.base, ~a.offset := #in~a.base, #in~a.offset;~a_length := #in~a_length; {353#true} is VALID [2018-11-14 18:41:24,280 INFO L273 TraceCheckUtils]: 13: Hoare triple {353#true} assume ~pat_length % 4294967296 > (~a_length + 1) % 4294967296;#res := 0; {355#(= 0 |is_relaxed_prefix_#res|)} is VALID [2018-11-14 18:41:24,281 INFO L273 TraceCheckUtils]: 14: Hoare triple {355#(= 0 |is_relaxed_prefix_#res|)} assume true; {355#(= 0 |is_relaxed_prefix_#res|)} is VALID [2018-11-14 18:41:24,293 INFO L268 TraceCheckUtils]: 15: Hoare quadruple {355#(= 0 |is_relaxed_prefix_#res|)} {353#true} #165#return; {356#(= |main_#t~ret14| 0)} is VALID [2018-11-14 18:41:24,294 INFO L273 TraceCheckUtils]: 16: Hoare triple {356#(= |main_#t~ret14| 0)} assume #t~ret14 % 256 != 0;havoc #t~ret14; {354#false} is VALID [2018-11-14 18:41:24,294 INFO L256 TraceCheckUtils]: 17: Hoare triple {354#false} call __VERIFIER_assert((if ~pat_len~0 % 4294967296 <= (~a_len~0 + 1) % 4294967296 then 1 else 0)); {354#false} is VALID [2018-11-14 18:41:24,294 INFO L273 TraceCheckUtils]: 18: Hoare triple {354#false} ~cond := #in~cond; {354#false} is VALID [2018-11-14 18:41:24,294 INFO L273 TraceCheckUtils]: 19: Hoare triple {354#false} assume ~cond == 0; {354#false} is VALID [2018-11-14 18:41:24,295 INFO L273 TraceCheckUtils]: 20: Hoare triple {354#false} assume !false; {354#false} is VALID [2018-11-14 18:41:24,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:41:24,297 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:41:24,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-14 18:41:24,299 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2018-11-14 18:41:24,300 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:41:24,300 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-14 18:41:24,388 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:41:24,388 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-14 18:41:24,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-14 18:41:24,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-14 18:41:24,389 INFO L87 Difference]: Start difference. First operand 50 states and 66 transitions. Second operand 4 states. [2018-11-14 18:41:24,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:41:24,719 INFO L93 Difference]: Finished difference Result 71 states and 93 transitions. [2018-11-14 18:41:24,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-14 18:41:24,720 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2018-11-14 18:41:24,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:41:24,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 18:41:24,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 93 transitions. [2018-11-14 18:41:24,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 18:41:24,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 93 transitions. [2018-11-14 18:41:24,729 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 93 transitions. [2018-11-14 18:41:24,994 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:41:24,999 INFO L225 Difference]: With dead ends: 71 [2018-11-14 18:41:24,999 INFO L226 Difference]: Without dead ends: 53 [2018-11-14 18:41:25,000 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-14 18:41:25,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-11-14 18:41:25,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-11-14 18:41:25,039 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:41:25,039 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand 53 states. [2018-11-14 18:41:25,040 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand 53 states. [2018-11-14 18:41:25,040 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 53 states. [2018-11-14 18:41:25,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:41:25,044 INFO L93 Difference]: Finished difference Result 53 states and 69 transitions. [2018-11-14 18:41:25,045 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 69 transitions. [2018-11-14 18:41:25,045 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:41:25,046 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:41:25,046 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand 53 states. [2018-11-14 18:41:25,046 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 53 states. [2018-11-14 18:41:25,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:41:25,050 INFO L93 Difference]: Finished difference Result 53 states and 69 transitions. [2018-11-14 18:41:25,050 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 69 transitions. [2018-11-14 18:41:25,051 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:41:25,052 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:41:25,052 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:41:25,052 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:41:25,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-11-14 18:41:25,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 69 transitions. [2018-11-14 18:41:25,056 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 69 transitions. Word has length 21 [2018-11-14 18:41:25,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:41:25,056 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 69 transitions. [2018-11-14 18:41:25,057 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-14 18:41:25,057 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 69 transitions. [2018-11-14 18:41:25,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-14 18:41:25,058 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:41:25,058 INFO L375 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] [2018-11-14 18:41:25,058 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:41:25,059 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:41:25,059 INFO L82 PathProgramCache]: Analyzing trace with hash 585893467, now seen corresponding path program 1 times [2018-11-14 18:41:25,059 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:41:25,059 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:41:25,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:41:25,061 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:41:25,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:41:25,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:41:25,288 INFO L256 TraceCheckUtils]: 0: Hoare triple {623#true} call ULTIMATE.init(); {623#true} is VALID [2018-11-14 18:41:25,289 INFO L273 TraceCheckUtils]: 1: Hoare triple {623#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {623#true} is VALID [2018-11-14 18:41:25,289 INFO L273 TraceCheckUtils]: 2: Hoare triple {623#true} assume true; {623#true} is VALID [2018-11-14 18:41:25,290 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {623#true} {623#true} #173#return; {623#true} is VALID [2018-11-14 18:41:25,290 INFO L256 TraceCheckUtils]: 4: Hoare triple {623#true} call #t~ret28 := main(); {623#true} is VALID [2018-11-14 18:41:25,291 INFO L273 TraceCheckUtils]: 5: Hoare triple {623#true} ~pat_len~0 := #t~nondet6;havoc #t~nondet6;~a_len~0 := #t~nondet7;havoc #t~nondet7;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.alloc(4 * ~pat_len~0);~pat~0.base, ~pat~0.offset := #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.alloc(4 * ~a_len~0);~a~0.base, ~a~0.offset := #t~malloc9.base, #t~malloc9.offset;~j~0 := 0; {625#(= main_~j~0 0)} is VALID [2018-11-14 18:41:25,291 INFO L273 TraceCheckUtils]: 6: Hoare triple {625#(= main_~j~0 0)} assume true; {625#(= main_~j~0 0)} is VALID [2018-11-14 18:41:25,292 INFO L273 TraceCheckUtils]: 7: Hoare triple {625#(= main_~j~0 0)} assume !(~j~0 % 4294967296 < ~pat_len~0 % 4294967296); {626#(<= main_~pat_len~0 (* 4294967296 (div main_~pat_len~0 4294967296)))} is VALID [2018-11-14 18:41:25,293 INFO L273 TraceCheckUtils]: 8: Hoare triple {626#(<= main_~pat_len~0 (* 4294967296 (div main_~pat_len~0 4294967296)))} ~j~1 := 0; {626#(<= main_~pat_len~0 (* 4294967296 (div main_~pat_len~0 4294967296)))} is VALID [2018-11-14 18:41:25,295 INFO L273 TraceCheckUtils]: 9: Hoare triple {626#(<= main_~pat_len~0 (* 4294967296 (div main_~pat_len~0 4294967296)))} assume true; {626#(<= main_~pat_len~0 (* 4294967296 (div main_~pat_len~0 4294967296)))} is VALID [2018-11-14 18:41:25,296 INFO L273 TraceCheckUtils]: 10: Hoare triple {626#(<= main_~pat_len~0 (* 4294967296 (div main_~pat_len~0 4294967296)))} assume !(~j~1 % 4294967296 < ~a_len~0 % 4294967296); {626#(<= main_~pat_len~0 (* 4294967296 (div main_~pat_len~0 4294967296)))} is VALID [2018-11-14 18:41:25,296 INFO L256 TraceCheckUtils]: 11: Hoare triple {626#(<= main_~pat_len~0 (* 4294967296 (div main_~pat_len~0 4294967296)))} call #t~ret14 := is_relaxed_prefix(~pat~0.base, ~pat~0.offset, ~pat_len~0, ~a~0.base, ~a~0.offset, ~a_len~0); {623#true} is VALID [2018-11-14 18:41:25,296 INFO L273 TraceCheckUtils]: 12: Hoare triple {623#true} ~pat.base, ~pat.offset := #in~pat.base, #in~pat.offset;~pat_length := #in~pat_length;~a.base, ~a.offset := #in~a.base, #in~a.offset;~a_length := #in~a_length; {623#true} is VALID [2018-11-14 18:41:25,297 INFO L273 TraceCheckUtils]: 13: Hoare triple {623#true} assume !(~pat_length % 4294967296 > (~a_length + 1) % 4294967296);~shift~0 := 0;~i~0 := 0; {623#true} is VALID [2018-11-14 18:41:25,297 INFO L273 TraceCheckUtils]: 14: Hoare triple {623#true} assume true; {623#true} is VALID [2018-11-14 18:41:25,297 INFO L273 TraceCheckUtils]: 15: Hoare triple {623#true} assume !(~i~0 % 4294967296 < ~pat_length % 4294967296 && ~i~0 % 4294967296 < ~a_length % 4294967296); {623#true} is VALID [2018-11-14 18:41:25,298 INFO L273 TraceCheckUtils]: 16: Hoare triple {623#true} assume !(~pat_length % 4294967296 > ~a_length % 4294967296 && ~shift~0 == 1);#res := 1; {623#true} is VALID [2018-11-14 18:41:25,298 INFO L273 TraceCheckUtils]: 17: Hoare triple {623#true} assume true; {623#true} is VALID [2018-11-14 18:41:25,300 INFO L268 TraceCheckUtils]: 18: Hoare quadruple {623#true} {626#(<= main_~pat_len~0 (* 4294967296 (div main_~pat_len~0 4294967296)))} #165#return; {626#(<= main_~pat_len~0 (* 4294967296 (div main_~pat_len~0 4294967296)))} is VALID [2018-11-14 18:41:25,301 INFO L273 TraceCheckUtils]: 19: Hoare triple {626#(<= main_~pat_len~0 (* 4294967296 (div main_~pat_len~0 4294967296)))} assume #t~ret14 % 256 != 0;havoc #t~ret14; {626#(<= main_~pat_len~0 (* 4294967296 (div main_~pat_len~0 4294967296)))} is VALID [2018-11-14 18:41:25,302 INFO L256 TraceCheckUtils]: 20: Hoare triple {626#(<= main_~pat_len~0 (* 4294967296 (div main_~pat_len~0 4294967296)))} call __VERIFIER_assert((if ~pat_len~0 % 4294967296 <= (~a_len~0 + 1) % 4294967296 then 1 else 0)); {627#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-14 18:41:25,303 INFO L273 TraceCheckUtils]: 21: Hoare triple {627#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {628#(= __VERIFIER_assert_~cond 1)} is VALID [2018-11-14 18:41:25,305 INFO L273 TraceCheckUtils]: 22: Hoare triple {628#(= __VERIFIER_assert_~cond 1)} assume ~cond == 0; {624#false} is VALID [2018-11-14 18:41:25,306 INFO L273 TraceCheckUtils]: 23: Hoare triple {624#false} assume !false; {624#false} is VALID [2018-11-14 18:41:25,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:41:25,308 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:41:25,308 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-14 18:41:25,308 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-11-14 18:41:25,309 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:41:25,309 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-14 18:41:25,372 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:41:25,372 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-14 18:41:25,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-14 18:41:25,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-14 18:41:25,374 INFO L87 Difference]: Start difference. First operand 53 states and 69 transitions. Second operand 6 states. [2018-11-14 18:41:25,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:41:25,986 INFO L93 Difference]: Finished difference Result 99 states and 130 transitions. [2018-11-14 18:41:25,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-14 18:41:25,986 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-11-14 18:41:25,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:41:25,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 18:41:25,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 125 transitions. [2018-11-14 18:41:25,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 18:41:25,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 125 transitions. [2018-11-14 18:41:25,995 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 125 transitions. [2018-11-14 18:41:26,287 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 125 edges. 125 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:41:26,291 INFO L225 Difference]: With dead ends: 99 [2018-11-14 18:41:26,292 INFO L226 Difference]: Without dead ends: 68 [2018-11-14 18:41:26,293 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-14 18:41:26,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-11-14 18:41:26,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 65. [2018-11-14 18:41:26,326 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:41:26,326 INFO L82 GeneralOperation]: Start isEquivalent. First operand 68 states. Second operand 65 states. [2018-11-14 18:41:26,326 INFO L74 IsIncluded]: Start isIncluded. First operand 68 states. Second operand 65 states. [2018-11-14 18:41:26,327 INFO L87 Difference]: Start difference. First operand 68 states. Second operand 65 states. [2018-11-14 18:41:26,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:41:26,332 INFO L93 Difference]: Finished difference Result 68 states and 88 transitions. [2018-11-14 18:41:26,332 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 88 transitions. [2018-11-14 18:41:26,333 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:41:26,334 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:41:26,334 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand 68 states. [2018-11-14 18:41:26,334 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 68 states. [2018-11-14 18:41:26,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:41:26,339 INFO L93 Difference]: Finished difference Result 68 states and 88 transitions. [2018-11-14 18:41:26,339 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 88 transitions. [2018-11-14 18:41:26,342 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:41:26,342 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:41:26,343 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:41:26,343 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:41:26,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-11-14 18:41:26,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 85 transitions. [2018-11-14 18:41:26,347 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 85 transitions. Word has length 24 [2018-11-14 18:41:26,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:41:26,348 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 85 transitions. [2018-11-14 18:41:26,348 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-14 18:41:26,348 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 85 transitions. [2018-11-14 18:41:26,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-14 18:41:26,349 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:41:26,350 INFO L375 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] [2018-11-14 18:41:26,350 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:41:26,350 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:41:26,350 INFO L82 PathProgramCache]: Analyzing trace with hash 984246889, now seen corresponding path program 1 times [2018-11-14 18:41:26,350 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:41:26,351 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:41:26,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:41:26,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:41:26,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:41:26,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:41:26,863 WARN L179 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 3 [2018-11-14 18:41:27,103 INFO L256 TraceCheckUtils]: 0: Hoare triple {982#true} call ULTIMATE.init(); {982#true} is VALID [2018-11-14 18:41:27,104 INFO L273 TraceCheckUtils]: 1: Hoare triple {982#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {982#true} is VALID [2018-11-14 18:41:27,105 INFO L273 TraceCheckUtils]: 2: Hoare triple {982#true} assume true; {982#true} is VALID [2018-11-14 18:41:27,105 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {982#true} {982#true} #173#return; {982#true} is VALID [2018-11-14 18:41:27,105 INFO L256 TraceCheckUtils]: 4: Hoare triple {982#true} call #t~ret28 := main(); {982#true} is VALID [2018-11-14 18:41:27,106 INFO L273 TraceCheckUtils]: 5: Hoare triple {982#true} ~pat_len~0 := #t~nondet6;havoc #t~nondet6;~a_len~0 := #t~nondet7;havoc #t~nondet7;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.alloc(4 * ~pat_len~0);~pat~0.base, ~pat~0.offset := #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.alloc(4 * ~a_len~0);~a~0.base, ~a~0.offset := #t~malloc9.base, #t~malloc9.offset;~j~0 := 0; {982#true} is VALID [2018-11-14 18:41:27,106 INFO L273 TraceCheckUtils]: 6: Hoare triple {982#true} assume true; {982#true} is VALID [2018-11-14 18:41:27,106 INFO L273 TraceCheckUtils]: 7: Hoare triple {982#true} assume !(~j~0 % 4294967296 < ~pat_len~0 % 4294967296); {982#true} is VALID [2018-11-14 18:41:27,107 INFO L273 TraceCheckUtils]: 8: Hoare triple {982#true} ~j~1 := 0; {984#(= main_~j~1 0)} is VALID [2018-11-14 18:41:27,108 INFO L273 TraceCheckUtils]: 9: Hoare triple {984#(= main_~j~1 0)} assume true; {984#(= main_~j~1 0)} is VALID [2018-11-14 18:41:27,109 INFO L273 TraceCheckUtils]: 10: Hoare triple {984#(= main_~j~1 0)} assume !(~j~1 % 4294967296 < ~a_len~0 % 4294967296); {985#(<= main_~a_len~0 (* 4294967296 (div main_~a_len~0 4294967296)))} is VALID [2018-11-14 18:41:27,109 INFO L256 TraceCheckUtils]: 11: Hoare triple {985#(<= main_~a_len~0 (* 4294967296 (div main_~a_len~0 4294967296)))} call #t~ret14 := is_relaxed_prefix(~pat~0.base, ~pat~0.offset, ~pat_len~0, ~a~0.base, ~a~0.offset, ~a_len~0); {982#true} is VALID [2018-11-14 18:41:27,109 INFO L273 TraceCheckUtils]: 12: Hoare triple {982#true} ~pat.base, ~pat.offset := #in~pat.base, #in~pat.offset;~pat_length := #in~pat_length;~a.base, ~a.offset := #in~a.base, #in~a.offset;~a_length := #in~a_length; {986#(= is_relaxed_prefix_~pat_length |is_relaxed_prefix_#in~pat_length|)} is VALID [2018-11-14 18:41:27,111 INFO L273 TraceCheckUtils]: 13: Hoare triple {986#(= is_relaxed_prefix_~pat_length |is_relaxed_prefix_#in~pat_length|)} assume ~pat_length % 4294967296 > (~a_length + 1) % 4294967296;#res := 0; {987#(<= (+ (* 4294967296 (div (+ (- |is_relaxed_prefix_#in~pat_length|) 4294967296) 4294967296)) |is_relaxed_prefix_#in~pat_length|) 4294967295)} is VALID [2018-11-14 18:41:27,111 INFO L273 TraceCheckUtils]: 14: Hoare triple {987#(<= (+ (* 4294967296 (div (+ (- |is_relaxed_prefix_#in~pat_length|) 4294967296) 4294967296)) |is_relaxed_prefix_#in~pat_length|) 4294967295)} assume true; {987#(<= (+ (* 4294967296 (div (+ (- |is_relaxed_prefix_#in~pat_length|) 4294967296) 4294967296)) |is_relaxed_prefix_#in~pat_length|) 4294967295)} is VALID [2018-11-14 18:41:27,115 INFO L268 TraceCheckUtils]: 15: Hoare quadruple {987#(<= (+ (* 4294967296 (div (+ (- |is_relaxed_prefix_#in~pat_length|) 4294967296) 4294967296)) |is_relaxed_prefix_#in~pat_length|) 4294967295)} {985#(<= main_~a_len~0 (* 4294967296 (div main_~a_len~0 4294967296)))} #165#return; {988#(<= (+ main_~a_len~0 (* 4294967296 (div main_~pat_len~0 4294967296)) 1) (+ main_~pat_len~0 (* 4294967296 (div main_~a_len~0 4294967296))))} is VALID [2018-11-14 18:41:27,118 INFO L273 TraceCheckUtils]: 16: Hoare triple {988#(<= (+ main_~a_len~0 (* 4294967296 (div main_~pat_len~0 4294967296)) 1) (+ main_~pat_len~0 (* 4294967296 (div main_~a_len~0 4294967296))))} assume !(#t~ret14 % 256 != 0);havoc #t~ret14; {988#(<= (+ main_~a_len~0 (* 4294967296 (div main_~pat_len~0 4294967296)) 1) (+ main_~pat_len~0 (* 4294967296 (div main_~a_len~0 4294967296))))} is VALID [2018-11-14 18:41:27,118 INFO L273 TraceCheckUtils]: 17: Hoare triple {988#(<= (+ main_~a_len~0 (* 4294967296 (div main_~pat_len~0 4294967296)) 1) (+ main_~pat_len~0 (* 4294967296 (div main_~a_len~0 4294967296))))} assume ~pat_len~0 % 4294967296 <= (~a_len~0 + 1) % 4294967296;~differences~0 := 0;~i~2 := 0; {988#(<= (+ main_~a_len~0 (* 4294967296 (div main_~pat_len~0 4294967296)) 1) (+ main_~pat_len~0 (* 4294967296 (div main_~a_len~0 4294967296))))} is VALID [2018-11-14 18:41:27,119 INFO L273 TraceCheckUtils]: 18: Hoare triple {988#(<= (+ main_~a_len~0 (* 4294967296 (div main_~pat_len~0 4294967296)) 1) (+ main_~pat_len~0 (* 4294967296 (div main_~a_len~0 4294967296))))} assume true; {988#(<= (+ main_~a_len~0 (* 4294967296 (div main_~pat_len~0 4294967296)) 1) (+ main_~pat_len~0 (* 4294967296 (div main_~a_len~0 4294967296))))} is VALID [2018-11-14 18:41:27,120 INFO L273 TraceCheckUtils]: 19: Hoare triple {988#(<= (+ main_~a_len~0 (* 4294967296 (div main_~pat_len~0 4294967296)) 1) (+ main_~pat_len~0 (* 4294967296 (div main_~a_len~0 4294967296))))} assume !(~i~2 % 4294967296 < ~pat_len~0 % 4294967296 && ~i~2 % 4294967296 < ~a_len~0 % 4294967296); {988#(<= (+ main_~a_len~0 (* 4294967296 (div main_~pat_len~0 4294967296)) 1) (+ main_~pat_len~0 (* 4294967296 (div main_~a_len~0 4294967296))))} is VALID [2018-11-14 18:41:27,122 INFO L273 TraceCheckUtils]: 20: Hoare triple {988#(<= (+ main_~a_len~0 (* 4294967296 (div main_~pat_len~0 4294967296)) 1) (+ main_~pat_len~0 (* 4294967296 (div main_~a_len~0 4294967296))))} assume !(~pat_len~0 % 4294967296 > ~a_len~0 % 4294967296); {983#false} is VALID [2018-11-14 18:41:27,122 INFO L256 TraceCheckUtils]: 21: Hoare triple {983#false} call __VERIFIER_assert((if ~differences~0 % 4294967296 > 1 then 1 else 0)); {983#false} is VALID [2018-11-14 18:41:27,122 INFO L273 TraceCheckUtils]: 22: Hoare triple {983#false} ~cond := #in~cond; {983#false} is VALID [2018-11-14 18:41:27,123 INFO L273 TraceCheckUtils]: 23: Hoare triple {983#false} assume ~cond == 0; {983#false} is VALID [2018-11-14 18:41:27,123 INFO L273 TraceCheckUtils]: 24: Hoare triple {983#false} assume !false; {983#false} is VALID [2018-11-14 18:41:27,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:41:27,126 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:41:27,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-14 18:41:27,127 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2018-11-14 18:41:27,128 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:41:27,128 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-14 18:41:27,162 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:41:27,162 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-14 18:41:27,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-14 18:41:27,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-14 18:41:27,164 INFO L87 Difference]: Start difference. First operand 65 states and 85 transitions. Second operand 7 states. [2018-11-14 18:41:28,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:41:28,487 INFO L93 Difference]: Finished difference Result 144 states and 195 transitions. [2018-11-14 18:41:28,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-14 18:41:28,487 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2018-11-14 18:41:28,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:41:28,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 18:41:28,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 155 transitions. [2018-11-14 18:41:28,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 18:41:28,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 155 transitions. [2018-11-14 18:41:28,497 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 155 transitions. [2018-11-14 18:41:28,733 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 155 edges. 155 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:41:28,737 INFO L225 Difference]: With dead ends: 144 [2018-11-14 18:41:28,738 INFO L226 Difference]: Without dead ends: 108 [2018-11-14 18:41:28,739 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-11-14 18:41:28,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-11-14 18:41:28,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 87. [2018-11-14 18:41:28,854 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:41:28,854 INFO L82 GeneralOperation]: Start isEquivalent. First operand 108 states. Second operand 87 states. [2018-11-14 18:41:28,854 INFO L74 IsIncluded]: Start isIncluded. First operand 108 states. Second operand 87 states. [2018-11-14 18:41:28,854 INFO L87 Difference]: Start difference. First operand 108 states. Second operand 87 states. [2018-11-14 18:41:28,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:41:28,860 INFO L93 Difference]: Finished difference Result 108 states and 144 transitions. [2018-11-14 18:41:28,860 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 144 transitions. [2018-11-14 18:41:28,861 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:41:28,861 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:41:28,861 INFO L74 IsIncluded]: Start isIncluded. First operand 87 states. Second operand 108 states. [2018-11-14 18:41:28,862 INFO L87 Difference]: Start difference. First operand 87 states. Second operand 108 states. [2018-11-14 18:41:28,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:41:28,868 INFO L93 Difference]: Finished difference Result 108 states and 144 transitions. [2018-11-14 18:41:28,869 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 144 transitions. [2018-11-14 18:41:28,870 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:41:28,870 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:41:28,870 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:41:28,870 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:41:28,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-11-14 18:41:28,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 118 transitions. [2018-11-14 18:41:28,874 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 118 transitions. Word has length 25 [2018-11-14 18:41:28,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:41:28,875 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 118 transitions. [2018-11-14 18:41:28,875 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-14 18:41:28,875 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 118 transitions. [2018-11-14 18:41:28,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-14 18:41:28,876 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:41:28,876 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:41:28,877 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:41:28,877 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:41:28,877 INFO L82 PathProgramCache]: Analyzing trace with hash 2086994378, now seen corresponding path program 1 times [2018-11-14 18:41:28,877 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:41:28,877 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:41:28,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:41:28,879 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:41:28,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:41:28,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:41:29,438 INFO L256 TraceCheckUtils]: 0: Hoare triple {1513#true} call ULTIMATE.init(); {1513#true} is VALID [2018-11-14 18:41:29,438 INFO L273 TraceCheckUtils]: 1: Hoare triple {1513#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1513#true} is VALID [2018-11-14 18:41:29,439 INFO L273 TraceCheckUtils]: 2: Hoare triple {1513#true} assume true; {1513#true} is VALID [2018-11-14 18:41:29,439 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1513#true} {1513#true} #173#return; {1513#true} is VALID [2018-11-14 18:41:29,440 INFO L256 TraceCheckUtils]: 4: Hoare triple {1513#true} call #t~ret28 := main(); {1513#true} is VALID [2018-11-14 18:41:29,441 INFO L273 TraceCheckUtils]: 5: Hoare triple {1513#true} ~pat_len~0 := #t~nondet6;havoc #t~nondet6;~a_len~0 := #t~nondet7;havoc #t~nondet7;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.alloc(4 * ~pat_len~0);~pat~0.base, ~pat~0.offset := #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.alloc(4 * ~a_len~0);~a~0.base, ~a~0.offset := #t~malloc9.base, #t~malloc9.offset;~j~0 := 0; {1515#(or (<= (+ (div main_~a_len~0 4294967296) 1) (div (+ main_~a_len~0 1) 4294967296)) (= main_~j~0 0))} is VALID [2018-11-14 18:41:29,442 INFO L273 TraceCheckUtils]: 6: Hoare triple {1515#(or (<= (+ (div main_~a_len~0 4294967296) 1) (div (+ main_~a_len~0 1) 4294967296)) (= main_~j~0 0))} assume true; {1515#(or (<= (+ (div main_~a_len~0 4294967296) 1) (div (+ main_~a_len~0 1) 4294967296)) (= main_~j~0 0))} is VALID [2018-11-14 18:41:29,442 INFO L273 TraceCheckUtils]: 7: Hoare triple {1515#(or (<= (+ (div main_~a_len~0 4294967296) 1) (div (+ main_~a_len~0 1) 4294967296)) (= main_~j~0 0))} assume !!(~j~0 % 4294967296 < ~pat_len~0 % 4294967296);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~pat~0.base, ~pat~0.offset + ~j~0 * 4, 4);havoc #t~nondet11; {1515#(or (<= (+ (div main_~a_len~0 4294967296) 1) (div (+ main_~a_len~0 1) 4294967296)) (= main_~j~0 0))} is VALID [2018-11-14 18:41:29,443 INFO L273 TraceCheckUtils]: 8: Hoare triple {1515#(or (<= (+ (div main_~a_len~0 4294967296) 1) (div (+ main_~a_len~0 1) 4294967296)) (= main_~j~0 0))} #t~post10 := ~j~0;~j~0 := #t~post10 + 1;havoc #t~post10; {1516#(or (<= (+ (div main_~a_len~0 4294967296) 1) (div (+ main_~a_len~0 1) 4294967296)) (and (< (div (+ main_~a_len~0 1) 4294967296) (+ (div main_~j~0 4294967296) (div main_~a_len~0 4294967296) 1)) (<= main_~j~0 1)))} is VALID [2018-11-14 18:41:29,444 INFO L273 TraceCheckUtils]: 9: Hoare triple {1516#(or (<= (+ (div main_~a_len~0 4294967296) 1) (div (+ main_~a_len~0 1) 4294967296)) (and (< (div (+ main_~a_len~0 1) 4294967296) (+ (div main_~j~0 4294967296) (div main_~a_len~0 4294967296) 1)) (<= main_~j~0 1)))} assume true; {1516#(or (<= (+ (div main_~a_len~0 4294967296) 1) (div (+ main_~a_len~0 1) 4294967296)) (and (< (div (+ main_~a_len~0 1) 4294967296) (+ (div main_~j~0 4294967296) (div main_~a_len~0 4294967296) 1)) (<= main_~j~0 1)))} is VALID [2018-11-14 18:41:29,446 INFO L273 TraceCheckUtils]: 10: Hoare triple {1516#(or (<= (+ (div main_~a_len~0 4294967296) 1) (div (+ main_~a_len~0 1) 4294967296)) (and (< (div (+ main_~a_len~0 1) 4294967296) (+ (div main_~j~0 4294967296) (div main_~a_len~0 4294967296) 1)) (<= main_~j~0 1)))} assume !(~j~0 % 4294967296 < ~pat_len~0 % 4294967296); {1517#(or (<= (+ main_~pat_len~0 (* 4294967296 (div (+ main_~a_len~0 1) 4294967296))) (+ (* 4294967296 (div main_~a_len~0 4294967296)) (* 4294967296 (div main_~pat_len~0 4294967296)) 1)) (<= (+ (div main_~a_len~0 4294967296) 1) (div (+ main_~a_len~0 1) 4294967296)))} is VALID [2018-11-14 18:41:29,447 INFO L273 TraceCheckUtils]: 11: Hoare triple {1517#(or (<= (+ main_~pat_len~0 (* 4294967296 (div (+ main_~a_len~0 1) 4294967296))) (+ (* 4294967296 (div main_~a_len~0 4294967296)) (* 4294967296 (div main_~pat_len~0 4294967296)) 1)) (<= (+ (div main_~a_len~0 4294967296) 1) (div (+ main_~a_len~0 1) 4294967296)))} ~j~1 := 0; {1518#(and (or (< (div (+ main_~a_len~0 1) 4294967296) (+ (div main_~a_len~0 4294967296) 1)) (= main_~j~1 0)) (or (<= (+ main_~pat_len~0 (* 4294967296 (div (+ main_~a_len~0 1) 4294967296))) (+ (* 4294967296 (div main_~a_len~0 4294967296)) (* 4294967296 (div main_~pat_len~0 4294967296)) 1)) (<= (+ (div main_~a_len~0 4294967296) 1) (div (+ main_~a_len~0 1) 4294967296))))} is VALID [2018-11-14 18:41:29,448 INFO L273 TraceCheckUtils]: 12: Hoare triple {1518#(and (or (< (div (+ main_~a_len~0 1) 4294967296) (+ (div main_~a_len~0 4294967296) 1)) (= main_~j~1 0)) (or (<= (+ main_~pat_len~0 (* 4294967296 (div (+ main_~a_len~0 1) 4294967296))) (+ (* 4294967296 (div main_~a_len~0 4294967296)) (* 4294967296 (div main_~pat_len~0 4294967296)) 1)) (<= (+ (div main_~a_len~0 4294967296) 1) (div (+ main_~a_len~0 1) 4294967296))))} assume true; {1518#(and (or (< (div (+ main_~a_len~0 1) 4294967296) (+ (div main_~a_len~0 4294967296) 1)) (= main_~j~1 0)) (or (<= (+ main_~pat_len~0 (* 4294967296 (div (+ main_~a_len~0 1) 4294967296))) (+ (* 4294967296 (div main_~a_len~0 4294967296)) (* 4294967296 (div main_~pat_len~0 4294967296)) 1)) (<= (+ (div main_~a_len~0 4294967296) 1) (div (+ main_~a_len~0 1) 4294967296))))} is VALID [2018-11-14 18:41:29,450 INFO L273 TraceCheckUtils]: 13: Hoare triple {1518#(and (or (< (div (+ main_~a_len~0 1) 4294967296) (+ (div main_~a_len~0 4294967296) 1)) (= main_~j~1 0)) (or (<= (+ main_~pat_len~0 (* 4294967296 (div (+ main_~a_len~0 1) 4294967296))) (+ (* 4294967296 (div main_~a_len~0 4294967296)) (* 4294967296 (div main_~pat_len~0 4294967296)) 1)) (<= (+ (div main_~a_len~0 4294967296) 1) (div (+ main_~a_len~0 1) 4294967296))))} assume !(~j~1 % 4294967296 < ~a_len~0 % 4294967296); {1519#(and (<= (+ main_~pat_len~0 (* 4294967296 (div (+ main_~a_len~0 1) 4294967296))) (+ main_~a_len~0 (* 4294967296 (div main_~pat_len~0 4294967296)) 1)) (<= (div (+ main_~a_len~0 1) 4294967296) (div main_~a_len~0 4294967296)))} is VALID [2018-11-14 18:41:29,451 INFO L256 TraceCheckUtils]: 14: Hoare triple {1519#(and (<= (+ main_~pat_len~0 (* 4294967296 (div (+ main_~a_len~0 1) 4294967296))) (+ main_~a_len~0 (* 4294967296 (div main_~pat_len~0 4294967296)) 1)) (<= (div (+ main_~a_len~0 1) 4294967296) (div main_~a_len~0 4294967296)))} call #t~ret14 := is_relaxed_prefix(~pat~0.base, ~pat~0.offset, ~pat_len~0, ~a~0.base, ~a~0.offset, ~a_len~0); {1513#true} is VALID [2018-11-14 18:41:29,451 INFO L273 TraceCheckUtils]: 15: Hoare triple {1513#true} ~pat.base, ~pat.offset := #in~pat.base, #in~pat.offset;~pat_length := #in~pat_length;~a.base, ~a.offset := #in~a.base, #in~a.offset;~a_length := #in~a_length; {1513#true} is VALID [2018-11-14 18:41:29,452 INFO L273 TraceCheckUtils]: 16: Hoare triple {1513#true} assume !(~pat_length % 4294967296 > (~a_length + 1) % 4294967296);~shift~0 := 0;~i~0 := 0; {1513#true} is VALID [2018-11-14 18:41:29,452 INFO L273 TraceCheckUtils]: 17: Hoare triple {1513#true} assume true; {1513#true} is VALID [2018-11-14 18:41:29,453 INFO L273 TraceCheckUtils]: 18: Hoare triple {1513#true} assume !(~i~0 % 4294967296 < ~pat_length % 4294967296 && ~i~0 % 4294967296 < ~a_length % 4294967296); {1513#true} is VALID [2018-11-14 18:41:29,453 INFO L273 TraceCheckUtils]: 19: Hoare triple {1513#true} assume !(~pat_length % 4294967296 > ~a_length % 4294967296 && ~shift~0 == 1);#res := 1; {1513#true} is VALID [2018-11-14 18:41:29,453 INFO L273 TraceCheckUtils]: 20: Hoare triple {1513#true} assume true; {1513#true} is VALID [2018-11-14 18:41:29,458 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {1513#true} {1519#(and (<= (+ main_~pat_len~0 (* 4294967296 (div (+ main_~a_len~0 1) 4294967296))) (+ main_~a_len~0 (* 4294967296 (div main_~pat_len~0 4294967296)) 1)) (<= (div (+ main_~a_len~0 1) 4294967296) (div main_~a_len~0 4294967296)))} #165#return; {1519#(and (<= (+ main_~pat_len~0 (* 4294967296 (div (+ main_~a_len~0 1) 4294967296))) (+ main_~a_len~0 (* 4294967296 (div main_~pat_len~0 4294967296)) 1)) (<= (div (+ main_~a_len~0 1) 4294967296) (div main_~a_len~0 4294967296)))} is VALID [2018-11-14 18:41:29,459 INFO L273 TraceCheckUtils]: 22: Hoare triple {1519#(and (<= (+ main_~pat_len~0 (* 4294967296 (div (+ main_~a_len~0 1) 4294967296))) (+ main_~a_len~0 (* 4294967296 (div main_~pat_len~0 4294967296)) 1)) (<= (div (+ main_~a_len~0 1) 4294967296) (div main_~a_len~0 4294967296)))} assume #t~ret14 % 256 != 0;havoc #t~ret14; {1519#(and (<= (+ main_~pat_len~0 (* 4294967296 (div (+ main_~a_len~0 1) 4294967296))) (+ main_~a_len~0 (* 4294967296 (div main_~pat_len~0 4294967296)) 1)) (<= (div (+ main_~a_len~0 1) 4294967296) (div main_~a_len~0 4294967296)))} is VALID [2018-11-14 18:41:29,460 INFO L256 TraceCheckUtils]: 23: Hoare triple {1519#(and (<= (+ main_~pat_len~0 (* 4294967296 (div (+ main_~a_len~0 1) 4294967296))) (+ main_~a_len~0 (* 4294967296 (div main_~pat_len~0 4294967296)) 1)) (<= (div (+ main_~a_len~0 1) 4294967296) (div main_~a_len~0 4294967296)))} call __VERIFIER_assert((if ~pat_len~0 % 4294967296 <= (~a_len~0 + 1) % 4294967296 then 1 else 0)); {1520#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-14 18:41:29,461 INFO L273 TraceCheckUtils]: 24: Hoare triple {1520#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {1521#(= __VERIFIER_assert_~cond 1)} is VALID [2018-11-14 18:41:29,465 INFO L273 TraceCheckUtils]: 25: Hoare triple {1521#(= __VERIFIER_assert_~cond 1)} assume ~cond == 0; {1514#false} is VALID [2018-11-14 18:41:29,466 INFO L273 TraceCheckUtils]: 26: Hoare triple {1514#false} assume !false; {1514#false} is VALID [2018-11-14 18:41:29,470 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:41:29,470 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:41:29,470 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 18:41:29,493 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:41:29,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:41:29,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:41:29,581 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:41:30,026 INFO L256 TraceCheckUtils]: 0: Hoare triple {1513#true} call ULTIMATE.init(); {1513#true} is VALID [2018-11-14 18:41:30,026 INFO L273 TraceCheckUtils]: 1: Hoare triple {1513#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1513#true} is VALID [2018-11-14 18:41:30,027 INFO L273 TraceCheckUtils]: 2: Hoare triple {1513#true} assume true; {1513#true} is VALID [2018-11-14 18:41:30,027 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1513#true} {1513#true} #173#return; {1513#true} is VALID [2018-11-14 18:41:30,027 INFO L256 TraceCheckUtils]: 4: Hoare triple {1513#true} call #t~ret28 := main(); {1513#true} is VALID [2018-11-14 18:41:30,027 INFO L273 TraceCheckUtils]: 5: Hoare triple {1513#true} ~pat_len~0 := #t~nondet6;havoc #t~nondet6;~a_len~0 := #t~nondet7;havoc #t~nondet7;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.alloc(4 * ~pat_len~0);~pat~0.base, ~pat~0.offset := #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.alloc(4 * ~a_len~0);~a~0.base, ~a~0.offset := #t~malloc9.base, #t~malloc9.offset;~j~0 := 0; {1513#true} is VALID [2018-11-14 18:41:30,028 INFO L273 TraceCheckUtils]: 6: Hoare triple {1513#true} assume true; {1513#true} is VALID [2018-11-14 18:41:30,028 INFO L273 TraceCheckUtils]: 7: Hoare triple {1513#true} assume !!(~j~0 % 4294967296 < ~pat_len~0 % 4294967296);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~pat~0.base, ~pat~0.offset + ~j~0 * 4, 4);havoc #t~nondet11; {1513#true} is VALID [2018-11-14 18:41:30,028 INFO L273 TraceCheckUtils]: 8: Hoare triple {1513#true} #t~post10 := ~j~0;~j~0 := #t~post10 + 1;havoc #t~post10; {1513#true} is VALID [2018-11-14 18:41:30,029 INFO L273 TraceCheckUtils]: 9: Hoare triple {1513#true} assume true; {1513#true} is VALID [2018-11-14 18:41:30,029 INFO L273 TraceCheckUtils]: 10: Hoare triple {1513#true} assume !(~j~0 % 4294967296 < ~pat_len~0 % 4294967296); {1513#true} is VALID [2018-11-14 18:41:30,029 INFO L273 TraceCheckUtils]: 11: Hoare triple {1513#true} ~j~1 := 0; {1513#true} is VALID [2018-11-14 18:41:30,030 INFO L273 TraceCheckUtils]: 12: Hoare triple {1513#true} assume true; {1513#true} is VALID [2018-11-14 18:41:30,030 INFO L273 TraceCheckUtils]: 13: Hoare triple {1513#true} assume !(~j~1 % 4294967296 < ~a_len~0 % 4294967296); {1513#true} is VALID [2018-11-14 18:41:30,031 INFO L256 TraceCheckUtils]: 14: Hoare triple {1513#true} call #t~ret14 := is_relaxed_prefix(~pat~0.base, ~pat~0.offset, ~pat_len~0, ~a~0.base, ~a~0.offset, ~a_len~0); {1513#true} is VALID [2018-11-14 18:41:30,041 INFO L273 TraceCheckUtils]: 15: Hoare triple {1513#true} ~pat.base, ~pat.offset := #in~pat.base, #in~pat.offset;~pat_length := #in~pat_length;~a.base, ~a.offset := #in~a.base, #in~a.offset;~a_length := #in~a_length; {1570#(and (= |is_relaxed_prefix_#in~a_length| is_relaxed_prefix_~a_length) (= |is_relaxed_prefix_#in~pat_length| is_relaxed_prefix_~pat_length))} is VALID [2018-11-14 18:41:30,046 INFO L273 TraceCheckUtils]: 16: Hoare triple {1570#(and (= |is_relaxed_prefix_#in~a_length| is_relaxed_prefix_~a_length) (= |is_relaxed_prefix_#in~pat_length| is_relaxed_prefix_~pat_length))} assume !(~pat_length % 4294967296 > (~a_length + 1) % 4294967296);~shift~0 := 0;~i~0 := 0; {1574#(<= (mod |is_relaxed_prefix_#in~pat_length| 4294967296) (mod (+ |is_relaxed_prefix_#in~a_length| 1) 4294967296))} is VALID [2018-11-14 18:41:30,047 INFO L273 TraceCheckUtils]: 17: Hoare triple {1574#(<= (mod |is_relaxed_prefix_#in~pat_length| 4294967296) (mod (+ |is_relaxed_prefix_#in~a_length| 1) 4294967296))} assume true; {1574#(<= (mod |is_relaxed_prefix_#in~pat_length| 4294967296) (mod (+ |is_relaxed_prefix_#in~a_length| 1) 4294967296))} is VALID [2018-11-14 18:41:30,052 INFO L273 TraceCheckUtils]: 18: Hoare triple {1574#(<= (mod |is_relaxed_prefix_#in~pat_length| 4294967296) (mod (+ |is_relaxed_prefix_#in~a_length| 1) 4294967296))} assume !(~i~0 % 4294967296 < ~pat_length % 4294967296 && ~i~0 % 4294967296 < ~a_length % 4294967296); {1574#(<= (mod |is_relaxed_prefix_#in~pat_length| 4294967296) (mod (+ |is_relaxed_prefix_#in~a_length| 1) 4294967296))} is VALID [2018-11-14 18:41:30,061 INFO L273 TraceCheckUtils]: 19: Hoare triple {1574#(<= (mod |is_relaxed_prefix_#in~pat_length| 4294967296) (mod (+ |is_relaxed_prefix_#in~a_length| 1) 4294967296))} assume !(~pat_length % 4294967296 > ~a_length % 4294967296 && ~shift~0 == 1);#res := 1; {1574#(<= (mod |is_relaxed_prefix_#in~pat_length| 4294967296) (mod (+ |is_relaxed_prefix_#in~a_length| 1) 4294967296))} is VALID [2018-11-14 18:41:30,075 INFO L273 TraceCheckUtils]: 20: Hoare triple {1574#(<= (mod |is_relaxed_prefix_#in~pat_length| 4294967296) (mod (+ |is_relaxed_prefix_#in~a_length| 1) 4294967296))} assume true; {1574#(<= (mod |is_relaxed_prefix_#in~pat_length| 4294967296) (mod (+ |is_relaxed_prefix_#in~a_length| 1) 4294967296))} is VALID [2018-11-14 18:41:30,091 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {1574#(<= (mod |is_relaxed_prefix_#in~pat_length| 4294967296) (mod (+ |is_relaxed_prefix_#in~a_length| 1) 4294967296))} {1513#true} #165#return; {1590#(<= (mod main_~pat_len~0 4294967296) (mod (+ main_~a_len~0 1) 4294967296))} is VALID [2018-11-14 18:41:30,107 INFO L273 TraceCheckUtils]: 22: Hoare triple {1590#(<= (mod main_~pat_len~0 4294967296) (mod (+ main_~a_len~0 1) 4294967296))} assume #t~ret14 % 256 != 0;havoc #t~ret14; {1590#(<= (mod main_~pat_len~0 4294967296) (mod (+ main_~a_len~0 1) 4294967296))} is VALID [2018-11-14 18:41:30,117 INFO L256 TraceCheckUtils]: 23: Hoare triple {1590#(<= (mod main_~pat_len~0 4294967296) (mod (+ main_~a_len~0 1) 4294967296))} call __VERIFIER_assert((if ~pat_len~0 % 4294967296 <= (~a_len~0 + 1) % 4294967296 then 1 else 0)); {1520#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-14 18:41:30,134 INFO L273 TraceCheckUtils]: 24: Hoare triple {1520#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {1521#(= __VERIFIER_assert_~cond 1)} is VALID [2018-11-14 18:41:30,143 INFO L273 TraceCheckUtils]: 25: Hoare triple {1521#(= __VERIFIER_assert_~cond 1)} assume ~cond == 0; {1514#false} is VALID [2018-11-14 18:41:30,144 INFO L273 TraceCheckUtils]: 26: Hoare triple {1514#false} assume !false; {1514#false} is VALID [2018-11-14 18:41:30,146 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-14 18:41:30,175 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-14 18:41:30,175 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 12 [2018-11-14 18:41:30,176 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 27 [2018-11-14 18:41:30,176 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:41:30,176 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-14 18:41:30,269 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:41:30,269 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-14 18:41:30,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-14 18:41:30,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-11-14 18:41:30,271 INFO L87 Difference]: Start difference. First operand 87 states and 118 transitions. Second operand 12 states. [2018-11-14 18:41:30,917 WARN L179 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 22 [2018-11-14 18:41:34,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:41:34,455 INFO L93 Difference]: Finished difference Result 184 states and 243 transitions. [2018-11-14 18:41:34,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-14 18:41:34,455 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 27 [2018-11-14 18:41:34,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:41:34,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-14 18:41:34,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 194 transitions. [2018-11-14 18:41:34,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-14 18:41:34,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 194 transitions. [2018-11-14 18:41:34,466 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 194 transitions. [2018-11-14 18:41:34,774 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 194 edges. 194 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:41:34,780 INFO L225 Difference]: With dead ends: 184 [2018-11-14 18:41:34,780 INFO L226 Difference]: Without dead ends: 168 [2018-11-14 18:41:34,781 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=104, Invalid=402, Unknown=0, NotChecked=0, Total=506 [2018-11-14 18:41:34,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2018-11-14 18:41:34,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 100. [2018-11-14 18:41:34,980 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:41:34,981 INFO L82 GeneralOperation]: Start isEquivalent. First operand 168 states. Second operand 100 states. [2018-11-14 18:41:34,981 INFO L74 IsIncluded]: Start isIncluded. First operand 168 states. Second operand 100 states. [2018-11-14 18:41:34,981 INFO L87 Difference]: Start difference. First operand 168 states. Second operand 100 states. [2018-11-14 18:41:34,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:41:34,990 INFO L93 Difference]: Finished difference Result 168 states and 222 transitions. [2018-11-14 18:41:34,990 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 222 transitions. [2018-11-14 18:41:34,991 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:41:34,992 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:41:34,992 INFO L74 IsIncluded]: Start isIncluded. First operand 100 states. Second operand 168 states. [2018-11-14 18:41:34,992 INFO L87 Difference]: Start difference. First operand 100 states. Second operand 168 states. [2018-11-14 18:41:35,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:41:35,000 INFO L93 Difference]: Finished difference Result 168 states and 222 transitions. [2018-11-14 18:41:35,000 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 222 transitions. [2018-11-14 18:41:35,001 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:41:35,001 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:41:35,002 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:41:35,002 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:41:35,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-11-14 18:41:35,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 135 transitions. [2018-11-14 18:41:35,007 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 135 transitions. Word has length 27 [2018-11-14 18:41:35,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:41:35,007 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 135 transitions. [2018-11-14 18:41:35,007 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-14 18:41:35,007 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 135 transitions. [2018-11-14 18:41:35,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-14 18:41:35,008 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:41:35,009 INFO L375 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] [2018-11-14 18:41:35,009 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:41:35,009 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:41:35,009 INFO L82 PathProgramCache]: Analyzing trace with hash 851922102, now seen corresponding path program 1 times [2018-11-14 18:41:35,009 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:41:35,009 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:41:35,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:41:35,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:41:35,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:41:35,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:41:35,419 INFO L256 TraceCheckUtils]: 0: Hoare triple {2339#true} call ULTIMATE.init(); {2339#true} is VALID [2018-11-14 18:41:35,420 INFO L273 TraceCheckUtils]: 1: Hoare triple {2339#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2339#true} is VALID [2018-11-14 18:41:35,420 INFO L273 TraceCheckUtils]: 2: Hoare triple {2339#true} assume true; {2339#true} is VALID [2018-11-14 18:41:35,421 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2339#true} {2339#true} #173#return; {2339#true} is VALID [2018-11-14 18:41:35,421 INFO L256 TraceCheckUtils]: 4: Hoare triple {2339#true} call #t~ret28 := main(); {2339#true} is VALID [2018-11-14 18:41:35,421 INFO L273 TraceCheckUtils]: 5: Hoare triple {2339#true} ~pat_len~0 := #t~nondet6;havoc #t~nondet6;~a_len~0 := #t~nondet7;havoc #t~nondet7;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.alloc(4 * ~pat_len~0);~pat~0.base, ~pat~0.offset := #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.alloc(4 * ~a_len~0);~a~0.base, ~a~0.offset := #t~malloc9.base, #t~malloc9.offset;~j~0 := 0; {2339#true} is VALID [2018-11-14 18:41:35,422 INFO L273 TraceCheckUtils]: 6: Hoare triple {2339#true} assume true; {2339#true} is VALID [2018-11-14 18:41:35,422 INFO L273 TraceCheckUtils]: 7: Hoare triple {2339#true} assume !(~j~0 % 4294967296 < ~pat_len~0 % 4294967296); {2339#true} is VALID [2018-11-14 18:41:35,422 INFO L273 TraceCheckUtils]: 8: Hoare triple {2339#true} ~j~1 := 0; {2339#true} is VALID [2018-11-14 18:41:35,422 INFO L273 TraceCheckUtils]: 9: Hoare triple {2339#true} assume true; {2339#true} is VALID [2018-11-14 18:41:35,423 INFO L273 TraceCheckUtils]: 10: Hoare triple {2339#true} assume !(~j~1 % 4294967296 < ~a_len~0 % 4294967296); {2339#true} is VALID [2018-11-14 18:41:35,423 INFO L256 TraceCheckUtils]: 11: Hoare triple {2339#true} call #t~ret14 := is_relaxed_prefix(~pat~0.base, ~pat~0.offset, ~pat_len~0, ~a~0.base, ~a~0.offset, ~a_len~0); {2339#true} is VALID [2018-11-14 18:41:35,423 INFO L273 TraceCheckUtils]: 12: Hoare triple {2339#true} ~pat.base, ~pat.offset := #in~pat.base, #in~pat.offset;~pat_length := #in~pat_length;~a.base, ~a.offset := #in~a.base, #in~a.offset;~a_length := #in~a_length; {2339#true} is VALID [2018-11-14 18:41:35,424 INFO L273 TraceCheckUtils]: 13: Hoare triple {2339#true} assume !(~pat_length % 4294967296 > (~a_length + 1) % 4294967296);~shift~0 := 0;~i~0 := 0; {2339#true} is VALID [2018-11-14 18:41:35,424 INFO L273 TraceCheckUtils]: 14: Hoare triple {2339#true} assume true; {2339#true} is VALID [2018-11-14 18:41:35,424 INFO L273 TraceCheckUtils]: 15: Hoare triple {2339#true} assume !(~i~0 % 4294967296 < ~pat_length % 4294967296 && ~i~0 % 4294967296 < ~a_length % 4294967296); {2339#true} is VALID [2018-11-14 18:41:35,440 INFO L273 TraceCheckUtils]: 16: Hoare triple {2339#true} assume !(~pat_length % 4294967296 > ~a_length % 4294967296 && ~shift~0 == 1);#res := 1; {2341#(= 1 |is_relaxed_prefix_#res|)} is VALID [2018-11-14 18:41:35,450 INFO L273 TraceCheckUtils]: 17: Hoare triple {2341#(= 1 |is_relaxed_prefix_#res|)} assume true; {2341#(= 1 |is_relaxed_prefix_#res|)} is VALID [2018-11-14 18:41:35,464 INFO L268 TraceCheckUtils]: 18: Hoare quadruple {2341#(= 1 |is_relaxed_prefix_#res|)} {2339#true} #165#return; {2342#(= |main_#t~ret14| 1)} is VALID [2018-11-14 18:41:35,476 INFO L273 TraceCheckUtils]: 19: Hoare triple {2342#(= |main_#t~ret14| 1)} assume !(#t~ret14 % 256 != 0);havoc #t~ret14; {2340#false} is VALID [2018-11-14 18:41:35,477 INFO L273 TraceCheckUtils]: 20: Hoare triple {2340#false} assume ~pat_len~0 % 4294967296 <= (~a_len~0 + 1) % 4294967296;~differences~0 := 0;~i~2 := 0; {2340#false} is VALID [2018-11-14 18:41:35,477 INFO L273 TraceCheckUtils]: 21: Hoare triple {2340#false} assume true; {2340#false} is VALID [2018-11-14 18:41:35,477 INFO L273 TraceCheckUtils]: 22: Hoare triple {2340#false} assume !(~i~2 % 4294967296 < ~pat_len~0 % 4294967296 && ~i~2 % 4294967296 < ~a_len~0 % 4294967296); {2340#false} is VALID [2018-11-14 18:41:35,478 INFO L273 TraceCheckUtils]: 23: Hoare triple {2340#false} assume !(~pat_len~0 % 4294967296 > ~a_len~0 % 4294967296); {2340#false} is VALID [2018-11-14 18:41:35,478 INFO L256 TraceCheckUtils]: 24: Hoare triple {2340#false} call __VERIFIER_assert((if ~differences~0 % 4294967296 > 1 then 1 else 0)); {2340#false} is VALID [2018-11-14 18:41:35,478 INFO L273 TraceCheckUtils]: 25: Hoare triple {2340#false} ~cond := #in~cond; {2340#false} is VALID [2018-11-14 18:41:35,479 INFO L273 TraceCheckUtils]: 26: Hoare triple {2340#false} assume ~cond == 0; {2340#false} is VALID [2018-11-14 18:41:35,479 INFO L273 TraceCheckUtils]: 27: Hoare triple {2340#false} assume !false; {2340#false} is VALID [2018-11-14 18:41:35,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:41:35,480 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:41:35,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-14 18:41:35,481 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2018-11-14 18:41:35,481 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:41:35,481 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-14 18:41:35,828 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:41:35,829 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-14 18:41:35,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-14 18:41:35,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-14 18:41:35,830 INFO L87 Difference]: Start difference. First operand 100 states and 135 transitions. Second operand 4 states. [2018-11-14 18:41:36,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:41:36,406 INFO L93 Difference]: Finished difference Result 123 states and 160 transitions. [2018-11-14 18:41:36,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-14 18:41:36,406 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2018-11-14 18:41:36,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:41:36,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 18:41:36,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 84 transitions. [2018-11-14 18:41:36,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 18:41:36,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 84 transitions. [2018-11-14 18:41:36,410 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 84 transitions. [2018-11-14 18:41:36,631 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:41:36,634 INFO L225 Difference]: With dead ends: 123 [2018-11-14 18:41:36,634 INFO L226 Difference]: Without dead ends: 95 [2018-11-14 18:41:36,635 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-14 18:41:36,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-11-14 18:41:36,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 90. [2018-11-14 18:41:36,724 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:41:36,724 INFO L82 GeneralOperation]: Start isEquivalent. First operand 95 states. Second operand 90 states. [2018-11-14 18:41:36,724 INFO L74 IsIncluded]: Start isIncluded. First operand 95 states. Second operand 90 states. [2018-11-14 18:41:36,725 INFO L87 Difference]: Start difference. First operand 95 states. Second operand 90 states. [2018-11-14 18:41:36,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:41:36,729 INFO L93 Difference]: Finished difference Result 95 states and 121 transitions. [2018-11-14 18:41:36,729 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 121 transitions. [2018-11-14 18:41:36,730 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:41:36,730 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:41:36,730 INFO L74 IsIncluded]: Start isIncluded. First operand 90 states. Second operand 95 states. [2018-11-14 18:41:36,730 INFO L87 Difference]: Start difference. First operand 90 states. Second operand 95 states. [2018-11-14 18:41:36,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:41:36,735 INFO L93 Difference]: Finished difference Result 95 states and 121 transitions. [2018-11-14 18:41:36,735 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 121 transitions. [2018-11-14 18:41:36,735 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:41:36,736 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:41:36,736 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:41:36,736 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:41:36,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-11-14 18:41:36,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 114 transitions. [2018-11-14 18:41:36,740 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 114 transitions. Word has length 28 [2018-11-14 18:41:36,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:41:36,740 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 114 transitions. [2018-11-14 18:41:36,740 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-14 18:41:36,740 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 114 transitions. [2018-11-14 18:41:36,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-14 18:41:36,741 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:41:36,741 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:41:36,741 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:41:36,742 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:41:36,742 INFO L82 PathProgramCache]: Analyzing trace with hash 664703933, now seen corresponding path program 1 times [2018-11-14 18:41:36,742 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:41:36,742 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:41:36,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:41:36,743 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:41:36,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:41:36,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:41:37,129 INFO L256 TraceCheckUtils]: 0: Hoare triple {2812#true} call ULTIMATE.init(); {2812#true} is VALID [2018-11-14 18:41:37,130 INFO L273 TraceCheckUtils]: 1: Hoare triple {2812#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2812#true} is VALID [2018-11-14 18:41:37,130 INFO L273 TraceCheckUtils]: 2: Hoare triple {2812#true} assume true; {2812#true} is VALID [2018-11-14 18:41:37,130 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2812#true} {2812#true} #173#return; {2812#true} is VALID [2018-11-14 18:41:37,130 INFO L256 TraceCheckUtils]: 4: Hoare triple {2812#true} call #t~ret28 := main(); {2812#true} is VALID [2018-11-14 18:41:37,131 INFO L273 TraceCheckUtils]: 5: Hoare triple {2812#true} ~pat_len~0 := #t~nondet6;havoc #t~nondet6;~a_len~0 := #t~nondet7;havoc #t~nondet7;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.alloc(4 * ~pat_len~0);~pat~0.base, ~pat~0.offset := #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.alloc(4 * ~a_len~0);~a~0.base, ~a~0.offset := #t~malloc9.base, #t~malloc9.offset;~j~0 := 0; {2812#true} is VALID [2018-11-14 18:41:37,131 INFO L273 TraceCheckUtils]: 6: Hoare triple {2812#true} assume true; {2812#true} is VALID [2018-11-14 18:41:37,131 INFO L273 TraceCheckUtils]: 7: Hoare triple {2812#true} assume !(~j~0 % 4294967296 < ~pat_len~0 % 4294967296); {2812#true} is VALID [2018-11-14 18:41:37,131 INFO L273 TraceCheckUtils]: 8: Hoare triple {2812#true} ~j~1 := 0; {2812#true} is VALID [2018-11-14 18:41:37,131 INFO L273 TraceCheckUtils]: 9: Hoare triple {2812#true} assume true; {2812#true} is VALID [2018-11-14 18:41:37,137 INFO L273 TraceCheckUtils]: 10: Hoare triple {2812#true} assume !!(~j~1 % 4294967296 < ~a_len~0 % 4294967296);assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~a~0.base, ~a~0.offset + ~j~1 * 4, 4);havoc #t~nondet13; {2814#(<= (+ (* 4294967296 (div main_~a_len~0 4294967296)) 1) main_~a_len~0)} is VALID [2018-11-14 18:41:37,137 INFO L273 TraceCheckUtils]: 11: Hoare triple {2814#(<= (+ (* 4294967296 (div main_~a_len~0 4294967296)) 1) main_~a_len~0)} #t~post12 := ~j~1;~j~1 := #t~post12 + 1;havoc #t~post12; {2814#(<= (+ (* 4294967296 (div main_~a_len~0 4294967296)) 1) main_~a_len~0)} is VALID [2018-11-14 18:41:37,138 INFO L273 TraceCheckUtils]: 12: Hoare triple {2814#(<= (+ (* 4294967296 (div main_~a_len~0 4294967296)) 1) main_~a_len~0)} assume true; {2814#(<= (+ (* 4294967296 (div main_~a_len~0 4294967296)) 1) main_~a_len~0)} is VALID [2018-11-14 18:41:37,138 INFO L273 TraceCheckUtils]: 13: Hoare triple {2814#(<= (+ (* 4294967296 (div main_~a_len~0 4294967296)) 1) main_~a_len~0)} assume !(~j~1 % 4294967296 < ~a_len~0 % 4294967296); {2814#(<= (+ (* 4294967296 (div main_~a_len~0 4294967296)) 1) main_~a_len~0)} is VALID [2018-11-14 18:41:37,138 INFO L256 TraceCheckUtils]: 14: Hoare triple {2814#(<= (+ (* 4294967296 (div main_~a_len~0 4294967296)) 1) main_~a_len~0)} call #t~ret14 := is_relaxed_prefix(~pat~0.base, ~pat~0.offset, ~pat_len~0, ~a~0.base, ~a~0.offset, ~a_len~0); {2812#true} is VALID [2018-11-14 18:41:37,138 INFO L273 TraceCheckUtils]: 15: Hoare triple {2812#true} ~pat.base, ~pat.offset := #in~pat.base, #in~pat.offset;~pat_length := #in~pat_length;~a.base, ~a.offset := #in~a.base, #in~a.offset;~a_length := #in~a_length; {2815#(= is_relaxed_prefix_~pat_length |is_relaxed_prefix_#in~pat_length|)} is VALID [2018-11-14 18:41:37,140 INFO L273 TraceCheckUtils]: 16: Hoare triple {2815#(= is_relaxed_prefix_~pat_length |is_relaxed_prefix_#in~pat_length|)} assume ~pat_length % 4294967296 > (~a_length + 1) % 4294967296;#res := 0; {2816#(<= (+ (* 4294967296 (div (+ (- |is_relaxed_prefix_#in~pat_length|) 4294967296) 4294967296)) |is_relaxed_prefix_#in~pat_length|) 4294967295)} is VALID [2018-11-14 18:41:37,141 INFO L273 TraceCheckUtils]: 17: Hoare triple {2816#(<= (+ (* 4294967296 (div (+ (- |is_relaxed_prefix_#in~pat_length|) 4294967296) 4294967296)) |is_relaxed_prefix_#in~pat_length|) 4294967295)} assume true; {2816#(<= (+ (* 4294967296 (div (+ (- |is_relaxed_prefix_#in~pat_length|) 4294967296) 4294967296)) |is_relaxed_prefix_#in~pat_length|) 4294967295)} is VALID [2018-11-14 18:41:37,148 INFO L268 TraceCheckUtils]: 18: Hoare quadruple {2816#(<= (+ (* 4294967296 (div (+ (- |is_relaxed_prefix_#in~pat_length|) 4294967296) 4294967296)) |is_relaxed_prefix_#in~pat_length|) 4294967295)} {2814#(<= (+ (* 4294967296 (div main_~a_len~0 4294967296)) 1) main_~a_len~0)} #165#return; {2817#(and (<= (+ (* 4294967296 (div main_~pat_len~0 4294967296)) 1) main_~pat_len~0) (<= (+ (* 4294967296 (div main_~a_len~0 4294967296)) 1) main_~a_len~0))} is VALID [2018-11-14 18:41:37,149 INFO L273 TraceCheckUtils]: 19: Hoare triple {2817#(and (<= (+ (* 4294967296 (div main_~pat_len~0 4294967296)) 1) main_~pat_len~0) (<= (+ (* 4294967296 (div main_~a_len~0 4294967296)) 1) main_~a_len~0))} assume !(#t~ret14 % 256 != 0);havoc #t~ret14; {2817#(and (<= (+ (* 4294967296 (div main_~pat_len~0 4294967296)) 1) main_~pat_len~0) (<= (+ (* 4294967296 (div main_~a_len~0 4294967296)) 1) main_~a_len~0))} is VALID [2018-11-14 18:41:37,149 INFO L273 TraceCheckUtils]: 20: Hoare triple {2817#(and (<= (+ (* 4294967296 (div main_~pat_len~0 4294967296)) 1) main_~pat_len~0) (<= (+ (* 4294967296 (div main_~a_len~0 4294967296)) 1) main_~a_len~0))} assume ~pat_len~0 % 4294967296 <= (~a_len~0 + 1) % 4294967296;~differences~0 := 0;~i~2 := 0; {2818#(and (<= (+ (* 4294967296 (div main_~pat_len~0 4294967296)) 1) main_~pat_len~0) (<= (+ (* 4294967296 (div main_~a_len~0 4294967296)) 1) main_~a_len~0) (= main_~i~2 0))} is VALID [2018-11-14 18:41:37,153 INFO L273 TraceCheckUtils]: 21: Hoare triple {2818#(and (<= (+ (* 4294967296 (div main_~pat_len~0 4294967296)) 1) main_~pat_len~0) (<= (+ (* 4294967296 (div main_~a_len~0 4294967296)) 1) main_~a_len~0) (= main_~i~2 0))} assume true; {2818#(and (<= (+ (* 4294967296 (div main_~pat_len~0 4294967296)) 1) main_~pat_len~0) (<= (+ (* 4294967296 (div main_~a_len~0 4294967296)) 1) main_~a_len~0) (= main_~i~2 0))} is VALID [2018-11-14 18:41:37,154 INFO L273 TraceCheckUtils]: 22: Hoare triple {2818#(and (<= (+ (* 4294967296 (div main_~pat_len~0 4294967296)) 1) main_~pat_len~0) (<= (+ (* 4294967296 (div main_~a_len~0 4294967296)) 1) main_~a_len~0) (= main_~i~2 0))} assume !(~i~2 % 4294967296 < ~pat_len~0 % 4294967296 && ~i~2 % 4294967296 < ~a_len~0 % 4294967296); {2813#false} is VALID [2018-11-14 18:41:37,154 INFO L273 TraceCheckUtils]: 23: Hoare triple {2813#false} assume !(~pat_len~0 % 4294967296 > ~a_len~0 % 4294967296); {2813#false} is VALID [2018-11-14 18:41:37,154 INFO L256 TraceCheckUtils]: 24: Hoare triple {2813#false} call __VERIFIER_assert((if ~differences~0 % 4294967296 > 1 then 1 else 0)); {2813#false} is VALID [2018-11-14 18:41:37,154 INFO L273 TraceCheckUtils]: 25: Hoare triple {2813#false} ~cond := #in~cond; {2813#false} is VALID [2018-11-14 18:41:37,155 INFO L273 TraceCheckUtils]: 26: Hoare triple {2813#false} assume ~cond == 0; {2813#false} is VALID [2018-11-14 18:41:37,155 INFO L273 TraceCheckUtils]: 27: Hoare triple {2813#false} assume !false; {2813#false} is VALID [2018-11-14 18:41:37,156 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:41:37,156 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:41:37,156 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-14 18:41:37,157 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 28 [2018-11-14 18:41:37,157 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:41:37,157 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-14 18:41:37,166 WARN L140 InductivityCheck]: Transition 2818#(and (<= (+ (* 4294967296 (div main_~pat_len~0 4294967296)) 1) main_~pat_len~0) (<= (+ (* 4294967296 (div main_~a_len~0 4294967296)) 1) main_~a_len~0) (= main_~i~2 0)) ( _ , assume !(~i~2 % 4294967296 < ~pat_len~0 % 4294967296 && ~i~2 % 4294967296 < ~a_len~0 % 4294967296); , 2813#false ) not inductive [2018-11-14 18:41:37,167 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: inductivity failed at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.evaluateResult(InductivityCheck.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.checkInductivity(InductivityCheck.java:103) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.(InductivityCheck.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.constructInterpolantAutomaton(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:455) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-11-14 18:41:37,173 INFO L168 Benchmark]: Toolchain (without parser) took 17021.25 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 867.2 MB). Free memory was 1.4 GB in the beginning and 1.8 GB in the end (delta: -408.0 MB). Peak memory consumption was 459.2 MB. Max. memory is 7.1 GB. [2018-11-14 18:41:37,174 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-14 18:41:37,175 INFO L168 Benchmark]: CACSL2BoogieTranslator took 814.76 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 729.3 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -790.6 MB). Peak memory consumption was 60.2 MB. Max. memory is 7.1 GB. [2018-11-14 18:41:37,175 INFO L168 Benchmark]: Boogie Preprocessor took 110.04 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 13.5 MB). Peak memory consumption was 13.5 MB. Max. memory is 7.1 GB. [2018-11-14 18:41:37,176 INFO L168 Benchmark]: RCFGBuilder took 1341.06 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 66.3 MB). Peak memory consumption was 66.3 MB. Max. memory is 7.1 GB. [2018-11-14 18:41:37,177 INFO L168 Benchmark]: TraceAbstraction took 14749.11 ms. Allocated memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: 137.9 MB). Free memory was 2.1 GB in the beginning and 1.8 GB in the end (delta: 302.9 MB). Peak memory consumption was 440.8 MB. Max. memory is 7.1 GB. [2018-11-14 18:41:37,181 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - GenericResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.26 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 814.76 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 729.3 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -790.6 MB). Peak memory consumption was 60.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 110.04 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 13.5 MB). Peak memory consumption was 13.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1341.06 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 66.3 MB). Peak memory consumption was 66.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 14749.11 ms. Allocated memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: 137.9 MB). Free memory was 2.1 GB in the beginning and 1.8 GB in the end (delta: 302.9 MB). Peak memory consumption was 440.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: inductivity failed de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: inductivity failed: de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.evaluateResult(InductivityCheck.java:142) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...