java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.trace.refinement.strategy SIFA_TAIPAN --sifa.abstract.domain CompoundDomain --rcfgbuilder.size.of.a.code.block LoopFreeBlock --sifa.call.summarizer TopInputCallSummarizer --sifa.fluid SizeLimitFluid --sifa.simplification.technique SIMPLIFY_QUICK -i ../../../trunk/examples/svcomp/forester-heap/sll-01-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 01:58:57,012 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 01:58:57,015 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 01:58:57,035 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 01:58:57,035 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 01:58:57,037 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 01:58:57,039 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 01:58:57,052 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 01:58:57,054 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 01:58:57,056 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 01:58:57,058 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 01:58:57,059 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 01:58:57,059 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 01:58:57,062 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 01:58:57,065 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 01:58:57,066 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 01:58:57,068 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 01:58:57,069 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 01:58:57,071 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 01:58:57,076 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 01:58:57,081 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 01:58:57,084 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 01:58:57,088 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 01:58:57,089 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 01:58:57,090 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 01:58:57,091 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 01:58:57,091 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 01:58:57,092 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 01:58:57,092 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 01:58:57,093 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 01:58:57,093 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 01:58:57,094 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 01:58:57,095 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 01:58:57,095 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 01:58:57,097 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 01:58:57,097 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 01:58:57,098 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 01:58:57,098 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 01:58:57,098 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 01:58:57,099 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 01:58:57,101 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 01:58:57,102 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-15 01:58:57,121 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 01:58:57,121 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 01:58:57,123 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 01:58:57,124 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 01:58:57,124 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 01:58:57,124 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 01:58:57,124 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 01:58:57,125 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 01:58:57,125 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 01:58:57,125 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 01:58:57,126 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 01:58:57,126 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 01:58:57,127 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 01:58:57,127 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 01:58:57,127 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 01:58:57,127 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 01:58:57,128 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 01:58:57,128 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 01:58:57,128 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 01:58:57,128 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 01:58:57,129 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 01:58:57,129 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 01:58:57,129 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 01:58:57,129 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 01:58:57,129 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 01:58:57,130 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 01:58:57,130 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 01:58:57,130 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 01:58:57,130 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> SIFA_TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> CompoundDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Call Summarizer -> TopInputCallSummarizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Fluid -> SizeLimitFluid Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Simplification Technique -> SIMPLIFY_QUICK [2019-10-15 01:58:57,436 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 01:58:57,457 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 01:58:57,461 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 01:58:57,463 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 01:58:57,463 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 01:58:57,464 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/sll-01-1.i [2019-10-15 01:58:57,540 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6652f7c05/f1eb277198de4d91972deb2dfd5f493b/FLAGf522829a4 [2019-10-15 01:58:58,168 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 01:58:58,170 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-01-1.i [2019-10-15 01:58:58,192 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6652f7c05/f1eb277198de4d91972deb2dfd5f493b/FLAGf522829a4 [2019-10-15 01:58:58,437 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6652f7c05/f1eb277198de4d91972deb2dfd5f493b [2019-10-15 01:58:58,446 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 01:58:58,448 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 01:58:58,449 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 01:58:58,449 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 01:58:58,453 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 01:58:58,454 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:58:58" (1/1) ... [2019-10-15 01:58:58,457 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b043f65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:58:58, skipping insertion in model container [2019-10-15 01:58:58,457 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:58:58" (1/1) ... [2019-10-15 01:58:58,464 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 01:58:58,504 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 01:58:59,000 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:58:59,018 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 01:58:59,104 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:58:59,167 INFO L192 MainTranslator]: Completed translation [2019-10-15 01:58:59,168 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:58:59 WrapperNode [2019-10-15 01:58:59,168 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 01:58:59,169 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 01:58:59,169 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 01:58:59,170 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 01:58:59,184 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:58:59" (1/1) ... [2019-10-15 01:58:59,184 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:58:59" (1/1) ... [2019-10-15 01:58:59,202 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:58:59" (1/1) ... [2019-10-15 01:58:59,203 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:58:59" (1/1) ... [2019-10-15 01:58:59,224 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:58:59" (1/1) ... [2019-10-15 01:58:59,234 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:58:59" (1/1) ... [2019-10-15 01:58:59,238 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:58:59" (1/1) ... [2019-10-15 01:58:59,245 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 01:58:59,246 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 01:58:59,246 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 01:58:59,246 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 01:58:59,247 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:58:59" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 01:58:59,304 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 01:58:59,305 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 01:58:59,305 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 01:58:59,305 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-10-15 01:58:59,305 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-10-15 01:58:59,306 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-10-15 01:58:59,306 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-10-15 01:58:59,306 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-10-15 01:58:59,306 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-10-15 01:58:59,306 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-10-15 01:58:59,306 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-10-15 01:58:59,307 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-10-15 01:58:59,307 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-10-15 01:58:59,307 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-10-15 01:58:59,307 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-10-15 01:58:59,307 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-10-15 01:58:59,308 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-10-15 01:58:59,308 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-10-15 01:58:59,308 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-10-15 01:58:59,308 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-10-15 01:58:59,308 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-10-15 01:58:59,308 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-10-15 01:58:59,308 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-10-15 01:58:59,309 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-10-15 01:58:59,309 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-10-15 01:58:59,311 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-10-15 01:58:59,312 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-10-15 01:58:59,312 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-10-15 01:58:59,312 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-10-15 01:58:59,312 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-10-15 01:58:59,312 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-10-15 01:58:59,312 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-10-15 01:58:59,312 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-10-15 01:58:59,313 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-10-15 01:58:59,313 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-10-15 01:58:59,313 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-10-15 01:58:59,313 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-10-15 01:58:59,313 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-10-15 01:58:59,314 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-10-15 01:58:59,314 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-10-15 01:58:59,314 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-10-15 01:58:59,314 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-10-15 01:58:59,314 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-10-15 01:58:59,314 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-10-15 01:58:59,314 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-10-15 01:58:59,315 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-10-15 01:58:59,315 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-10-15 01:58:59,315 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-10-15 01:58:59,315 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-10-15 01:58:59,315 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-10-15 01:58:59,315 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-10-15 01:58:59,315 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-10-15 01:58:59,316 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-10-15 01:58:59,316 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-15 01:58:59,316 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-10-15 01:58:59,316 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-10-15 01:58:59,316 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-15 01:58:59,316 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-10-15 01:58:59,317 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-10-15 01:58:59,317 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-10-15 01:58:59,317 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-10-15 01:58:59,317 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-10-15 01:58:59,317 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-10-15 01:58:59,317 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-10-15 01:58:59,318 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-10-15 01:58:59,318 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-10-15 01:58:59,318 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-15 01:58:59,318 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-10-15 01:58:59,318 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-10-15 01:58:59,318 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-10-15 01:58:59,318 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-10-15 01:58:59,319 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-10-15 01:58:59,319 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-10-15 01:58:59,319 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-10-15 01:58:59,319 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-10-15 01:58:59,319 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-10-15 01:58:59,319 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-10-15 01:58:59,320 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-10-15 01:58:59,320 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-10-15 01:58:59,320 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-10-15 01:58:59,322 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-10-15 01:58:59,322 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-10-15 01:58:59,323 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-10-15 01:58:59,323 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-10-15 01:58:59,323 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-10-15 01:58:59,323 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-10-15 01:58:59,323 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-10-15 01:58:59,324 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-10-15 01:58:59,324 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-10-15 01:58:59,324 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-10-15 01:58:59,325 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-10-15 01:58:59,325 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-10-15 01:58:59,325 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-10-15 01:58:59,325 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-10-15 01:58:59,325 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-10-15 01:58:59,325 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-10-15 01:58:59,325 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-10-15 01:58:59,326 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-10-15 01:58:59,326 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-10-15 01:58:59,326 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-10-15 01:58:59,326 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-10-15 01:58:59,326 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-10-15 01:58:59,326 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-10-15 01:58:59,326 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-10-15 01:58:59,327 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-10-15 01:58:59,327 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-10-15 01:58:59,327 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-15 01:58:59,327 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 01:58:59,327 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 01:58:59,327 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-15 01:58:59,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-15 01:58:59,328 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-15 01:58:59,328 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-15 01:58:59,328 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 01:58:59,328 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 01:59:00,259 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 01:59:00,259 INFO L284 CfgBuilder]: Removed 30 assume(true) statements. [2019-10-15 01:59:00,260 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:59:00 BoogieIcfgContainer [2019-10-15 01:59:00,261 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 01:59:00,263 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 01:59:00,263 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 01:59:00,267 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 01:59:00,268 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 01:58:58" (1/3) ... [2019-10-15 01:59:00,269 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a00fdc9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:59:00, skipping insertion in model container [2019-10-15 01:59:00,269 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:58:59" (2/3) ... [2019-10-15 01:59:00,270 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a00fdc9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:59:00, skipping insertion in model container [2019-10-15 01:59:00,270 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:59:00" (3/3) ... [2019-10-15 01:59:00,272 INFO L109 eAbstractionObserver]: Analyzing ICFG sll-01-1.i [2019-10-15 01:59:00,284 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 01:59:00,293 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 13 error locations. [2019-10-15 01:59:00,305 INFO L249 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2019-10-15 01:59:00,341 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 01:59:00,341 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 01:59:00,342 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 01:59:00,346 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 01:59:00,346 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 01:59:00,347 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 01:59:00,347 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 01:59:00,347 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 01:59:00,377 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states. [2019-10-15 01:59:00,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-10-15 01:59:00,383 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:59:00,384 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:59:00,386 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:59:00,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:59:00,392 INFO L82 PathProgramCache]: Analyzing trace with hash -445938275, now seen corresponding path program 1 times [2019-10-15 01:59:00,401 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 01:59:00,402 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763619696] [2019-10-15 01:59:00,402 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:59:00,403 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:59:00,403 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:59:00,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:59:00,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:59:00,614 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763619696] [2019-10-15 01:59:00,616 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:59:00,616 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:59:00,617 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53769021] [2019-10-15 01:59:00,625 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:59:00,626 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 01:59:00,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:59:00,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:59:00,644 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 3 states. [2019-10-15 01:59:00,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:59:00,736 INFO L93 Difference]: Finished difference Result 171 states and 270 transitions. [2019-10-15 01:59:00,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:59:00,737 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-10-15 01:59:00,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:59:00,752 INFO L225 Difference]: With dead ends: 171 [2019-10-15 01:59:00,752 INFO L226 Difference]: Without dead ends: 93 [2019-10-15 01:59:00,759 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:59:00,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-10-15 01:59:00,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 75. [2019-10-15 01:59:00,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-10-15 01:59:00,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 79 transitions. [2019-10-15 01:59:00,838 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 79 transitions. Word has length 7 [2019-10-15 01:59:00,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:59:00,839 INFO L462 AbstractCegarLoop]: Abstraction has 75 states and 79 transitions. [2019-10-15 01:59:00,839 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:59:00,839 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 79 transitions. [2019-10-15 01:59:00,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-10-15 01:59:00,840 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:59:00,840 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:59:00,841 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:59:00,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:59:00,842 INFO L82 PathProgramCache]: Analyzing trace with hash -1700846502, now seen corresponding path program 1 times [2019-10-15 01:59:00,843 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 01:59:00,843 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930825361] [2019-10-15 01:59:00,844 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:59:00,844 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:59:00,844 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:59:00,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:59:00,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:59:00,993 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930825361] [2019-10-15 01:59:00,993 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:59:00,993 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:59:00,993 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851368134] [2019-10-15 01:59:00,996 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:59:00,997 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 01:59:00,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:59:00,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:59:00,998 INFO L87 Difference]: Start difference. First operand 75 states and 79 transitions. Second operand 3 states. [2019-10-15 01:59:01,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:59:01,012 INFO L93 Difference]: Finished difference Result 75 states and 79 transitions. [2019-10-15 01:59:01,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:59:01,013 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-10-15 01:59:01,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:59:01,014 INFO L225 Difference]: With dead ends: 75 [2019-10-15 01:59:01,014 INFO L226 Difference]: Without dead ends: 73 [2019-10-15 01:59:01,015 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:59:01,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-10-15 01:59:01,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2019-10-15 01:59:01,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-10-15 01:59:01,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 77 transitions. [2019-10-15 01:59:01,024 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 77 transitions. Word has length 11 [2019-10-15 01:59:01,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:59:01,024 INFO L462 AbstractCegarLoop]: Abstraction has 73 states and 77 transitions. [2019-10-15 01:59:01,025 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:59:01,025 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 77 transitions. [2019-10-15 01:59:01,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-15 01:59:01,025 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:59:01,026 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:59:01,026 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:59:01,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:59:01,026 INFO L82 PathProgramCache]: Analyzing trace with hash 458096093, now seen corresponding path program 1 times [2019-10-15 01:59:01,027 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 01:59:01,027 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571909975] [2019-10-15 01:59:01,027 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:59:01,027 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:59:01,027 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:59:01,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:59:01,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:59:01,087 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571909975] [2019-10-15 01:59:01,087 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:59:01,087 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:59:01,088 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083240279] [2019-10-15 01:59:01,088 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:59:01,089 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 01:59:01,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:59:01,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:59:01,090 INFO L87 Difference]: Start difference. First operand 73 states and 77 transitions. Second operand 3 states. [2019-10-15 01:59:01,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:59:01,167 INFO L93 Difference]: Finished difference Result 76 states and 81 transitions. [2019-10-15 01:59:01,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:59:01,168 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-10-15 01:59:01,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:59:01,169 INFO L225 Difference]: With dead ends: 76 [2019-10-15 01:59:01,169 INFO L226 Difference]: Without dead ends: 72 [2019-10-15 01:59:01,170 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:59:01,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-10-15 01:59:01,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 69. [2019-10-15 01:59:01,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-10-15 01:59:01,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2019-10-15 01:59:01,179 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 16 [2019-10-15 01:59:01,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:59:01,179 INFO L462 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2019-10-15 01:59:01,179 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:59:01,179 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2019-10-15 01:59:01,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-15 01:59:01,180 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:59:01,180 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:59:01,181 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:59:01,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:59:01,181 INFO L82 PathProgramCache]: Analyzing trace with hash 1316081195, now seen corresponding path program 1 times [2019-10-15 01:59:01,181 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 01:59:01,182 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899277343] [2019-10-15 01:59:01,182 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:59:01,182 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:59:01,182 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:59:01,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:59:01,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:59:01,264 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899277343] [2019-10-15 01:59:01,264 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:59:01,264 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:59:01,265 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370406577] [2019-10-15 01:59:01,265 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:59:01,265 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 01:59:01,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:59:01,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:59:01,266 INFO L87 Difference]: Start difference. First operand 69 states and 73 transitions. Second operand 5 states. [2019-10-15 01:59:01,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:59:01,353 INFO L93 Difference]: Finished difference Result 127 states and 135 transitions. [2019-10-15 01:59:01,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:59:01,354 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-10-15 01:59:01,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:59:01,355 INFO L225 Difference]: With dead ends: 127 [2019-10-15 01:59:01,355 INFO L226 Difference]: Without dead ends: 107 [2019-10-15 01:59:01,356 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:59:01,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-10-15 01:59:01,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 68. [2019-10-15 01:59:01,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-10-15 01:59:01,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2019-10-15 01:59:01,366 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 17 [2019-10-15 01:59:01,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:59:01,366 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2019-10-15 01:59:01,366 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:59:01,366 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2019-10-15 01:59:01,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-15 01:59:01,367 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:59:01,367 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:59:01,368 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:59:01,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:59:01,368 INFO L82 PathProgramCache]: Analyzing trace with hash 247185224, now seen corresponding path program 1 times [2019-10-15 01:59:01,369 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 01:59:01,369 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957846212] [2019-10-15 01:59:01,369 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:59:01,369 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:59:01,369 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:59:01,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:59:01,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:59:01,428 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957846212] [2019-10-15 01:59:01,428 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:59:01,428 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:59:01,429 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593751560] [2019-10-15 01:59:01,429 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:59:01,430 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 01:59:01,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:59:01,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:59:01,430 INFO L87 Difference]: Start difference. First operand 68 states and 72 transitions. Second operand 3 states. [2019-10-15 01:59:01,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:59:01,455 INFO L93 Difference]: Finished difference Result 93 states and 100 transitions. [2019-10-15 01:59:01,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:59:01,458 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-10-15 01:59:01,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:59:01,459 INFO L225 Difference]: With dead ends: 93 [2019-10-15 01:59:01,460 INFO L226 Difference]: Without dead ends: 91 [2019-10-15 01:59:01,462 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:59:01,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-10-15 01:59:01,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 70. [2019-10-15 01:59:01,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-10-15 01:59:01,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 75 transitions. [2019-10-15 01:59:01,475 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 75 transitions. Word has length 21 [2019-10-15 01:59:01,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:59:01,476 INFO L462 AbstractCegarLoop]: Abstraction has 70 states and 75 transitions. [2019-10-15 01:59:01,476 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:59:01,479 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 75 transitions. [2019-10-15 01:59:01,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-15 01:59:01,480 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:59:01,480 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:59:01,481 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:59:01,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:59:01,484 INFO L82 PathProgramCache]: Analyzing trace with hash 247187244, now seen corresponding path program 1 times [2019-10-15 01:59:01,484 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 01:59:01,484 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020267357] [2019-10-15 01:59:01,484 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:59:01,485 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:59:01,485 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:59:01,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:59:01,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:59:01,562 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020267357] [2019-10-15 01:59:01,562 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:59:01,562 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:59:01,563 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062674757] [2019-10-15 01:59:01,563 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:59:01,564 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 01:59:01,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:59:01,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:59:01,565 INFO L87 Difference]: Start difference. First operand 70 states and 75 transitions. Second operand 3 states. [2019-10-15 01:59:01,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:59:01,591 INFO L93 Difference]: Finished difference Result 70 states and 75 transitions. [2019-10-15 01:59:01,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:59:01,592 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-10-15 01:59:01,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:59:01,594 INFO L225 Difference]: With dead ends: 70 [2019-10-15 01:59:01,594 INFO L226 Difference]: Without dead ends: 68 [2019-10-15 01:59:01,594 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:59:01,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-10-15 01:59:01,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-10-15 01:59:01,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-10-15 01:59:01,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 73 transitions. [2019-10-15 01:59:01,609 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 73 transitions. Word has length 21 [2019-10-15 01:59:01,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:59:01,610 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 73 transitions. [2019-10-15 01:59:01,613 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:59:01,613 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 73 transitions. [2019-10-15 01:59:01,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-15 01:59:01,614 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:59:01,614 INFO L380 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] [2019-10-15 01:59:01,615 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:59:01,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:59:01,616 INFO L82 PathProgramCache]: Analyzing trace with hash -1873975586, now seen corresponding path program 1 times [2019-10-15 01:59:01,616 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 01:59:01,616 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225536252] [2019-10-15 01:59:01,617 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:59:01,617 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:59:01,617 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:59:01,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:59:01,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:59:01,738 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225536252] [2019-10-15 01:59:01,738 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:59:01,738 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:59:01,738 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978797950] [2019-10-15 01:59:01,739 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:59:01,739 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 01:59:01,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:59:01,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:59:01,740 INFO L87 Difference]: Start difference. First operand 68 states and 73 transitions. Second operand 3 states. [2019-10-15 01:59:01,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:59:01,750 INFO L93 Difference]: Finished difference Result 68 states and 73 transitions. [2019-10-15 01:59:01,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:59:01,751 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-10-15 01:59:01,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:59:01,752 INFO L225 Difference]: With dead ends: 68 [2019-10-15 01:59:01,753 INFO L226 Difference]: Without dead ends: 66 [2019-10-15 01:59:01,757 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:59:01,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-10-15 01:59:01,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-10-15 01:59:01,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-10-15 01:59:01,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 71 transitions. [2019-10-15 01:59:01,771 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 71 transitions. Word has length 22 [2019-10-15 01:59:01,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:59:01,771 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 71 transitions. [2019-10-15 01:59:01,771 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:59:01,771 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 71 transitions. [2019-10-15 01:59:01,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-15 01:59:01,772 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:59:01,773 INFO L380 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] [2019-10-15 01:59:01,773 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:59:01,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:59:01,778 INFO L82 PathProgramCache]: Analyzing trace with hash -1909632269, now seen corresponding path program 1 times [2019-10-15 01:59:01,778 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 01:59:01,778 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570727188] [2019-10-15 01:59:01,778 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:59:01,778 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:59:01,779 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:59:01,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:59:02,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:59:02,338 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570727188] [2019-10-15 01:59:02,338 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:59:02,338 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-15 01:59:02,338 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858871175] [2019-10-15 01:59:02,339 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-15 01:59:02,339 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 01:59:02,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-15 01:59:02,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-10-15 01:59:02,340 INFO L87 Difference]: Start difference. First operand 66 states and 71 transitions. Second operand 10 states. [2019-10-15 01:59:02,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:59:02,925 INFO L93 Difference]: Finished difference Result 151 states and 164 transitions. [2019-10-15 01:59:02,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-15 01:59:02,925 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2019-10-15 01:59:02,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:59:02,928 INFO L225 Difference]: With dead ends: 151 [2019-10-15 01:59:02,928 INFO L226 Difference]: Without dead ends: 149 [2019-10-15 01:59:02,930 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2019-10-15 01:59:02,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-10-15 01:59:02,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 83. [2019-10-15 01:59:02,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-10-15 01:59:02,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 92 transitions. [2019-10-15 01:59:02,939 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 92 transitions. Word has length 24 [2019-10-15 01:59:02,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:59:02,939 INFO L462 AbstractCegarLoop]: Abstraction has 83 states and 92 transitions. [2019-10-15 01:59:02,939 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-15 01:59:02,940 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 92 transitions. [2019-10-15 01:59:02,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-15 01:59:02,941 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:59:02,941 INFO L380 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] [2019-10-15 01:59:02,941 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:59:02,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:59:02,942 INFO L82 PathProgramCache]: Analyzing trace with hash 1231807495, now seen corresponding path program 1 times [2019-10-15 01:59:02,942 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 01:59:02,942 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674060407] [2019-10-15 01:59:02,942 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:59:02,942 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:59:02,943 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:59:02,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:59:02,970 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-15 01:59:02,971 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674060407] [2019-10-15 01:59:02,971 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:59:02,971 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:59:02,972 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24912086] [2019-10-15 01:59:02,972 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:59:02,972 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 01:59:02,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:59:02,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:59:02,973 INFO L87 Difference]: Start difference. First operand 83 states and 92 transitions. Second operand 3 states. [2019-10-15 01:59:03,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:59:03,009 INFO L93 Difference]: Finished difference Result 83 states and 92 transitions. [2019-10-15 01:59:03,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:59:03,010 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-10-15 01:59:03,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:59:03,011 INFO L225 Difference]: With dead ends: 83 [2019-10-15 01:59:03,011 INFO L226 Difference]: Without dead ends: 81 [2019-10-15 01:59:03,011 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:59:03,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-10-15 01:59:03,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2019-10-15 01:59:03,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-10-15 01:59:03,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 90 transitions. [2019-10-15 01:59:03,018 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 90 transitions. Word has length 27 [2019-10-15 01:59:03,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:59:03,019 INFO L462 AbstractCegarLoop]: Abstraction has 81 states and 90 transitions. [2019-10-15 01:59:03,019 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:59:03,019 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 90 transitions. [2019-10-15 01:59:03,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-15 01:59:03,020 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:59:03,020 INFO L380 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] [2019-10-15 01:59:03,021 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:59:03,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:59:03,021 INFO L82 PathProgramCache]: Analyzing trace with hash 1285989278, now seen corresponding path program 1 times [2019-10-15 01:59:03,021 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 01:59:03,021 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188835989] [2019-10-15 01:59:03,022 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:59:03,022 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:59:03,022 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:59:03,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:59:03,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:59:03,436 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188835989] [2019-10-15 01:59:03,437 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:59:03,437 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-15 01:59:03,437 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238402422] [2019-10-15 01:59:03,437 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-15 01:59:03,438 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 01:59:03,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-15 01:59:03,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-10-15 01:59:03,438 INFO L87 Difference]: Start difference. First operand 81 states and 90 transitions. Second operand 10 states. [2019-10-15 01:59:04,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:59:04,125 INFO L93 Difference]: Finished difference Result 154 states and 167 transitions. [2019-10-15 01:59:04,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-15 01:59:04,125 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 27 [2019-10-15 01:59:04,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:59:04,127 INFO L225 Difference]: With dead ends: 154 [2019-10-15 01:59:04,127 INFO L226 Difference]: Without dead ends: 152 [2019-10-15 01:59:04,128 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=93, Invalid=213, Unknown=0, NotChecked=0, Total=306 [2019-10-15 01:59:04,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-10-15 01:59:04,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 88. [2019-10-15 01:59:04,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-10-15 01:59:04,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 97 transitions. [2019-10-15 01:59:04,136 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 97 transitions. Word has length 27 [2019-10-15 01:59:04,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:59:04,136 INFO L462 AbstractCegarLoop]: Abstraction has 88 states and 97 transitions. [2019-10-15 01:59:04,136 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-15 01:59:04,136 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 97 transitions. [2019-10-15 01:59:04,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-15 01:59:04,138 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:59:04,138 INFO L380 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, 1] [2019-10-15 01:59:04,138 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:59:04,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:59:04,139 INFO L82 PathProgramCache]: Analyzing trace with hash 1737137716, now seen corresponding path program 1 times [2019-10-15 01:59:04,139 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 01:59:04,139 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689572707] [2019-10-15 01:59:04,139 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:59:04,139 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:59:04,140 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:59:04,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:59:04,340 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:59:04,341 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689572707] [2019-10-15 01:59:04,341 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1526892499] [2019-10-15 01:59:04,342 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:59:04,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:59:04,450 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 23 conjunts are in the unsatisfiable core [2019-10-15 01:59:04,457 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:59:04,522 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-15 01:59:04,523 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-15 01:59:04,536 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 01:59:04,542 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-10-15 01:59:04,543 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-15 01:59:04,553 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 01:59:04,558 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-10-15 01:59:04,558 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-15 01:59:04,567 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 01:59:04,567 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-15 01:59:04,568 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:32, output treesize:23 [2019-10-15 01:59:04,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:59:04,612 INFO L392 ElimStorePlain]: Different costs {0=[|v_#valid_32|], 1=[v_prenex_2]} [2019-10-15 01:59:04,628 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 47 [2019-10-15 01:59:04,629 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-15 01:59:04,784 WARN L191 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2019-10-15 01:59:04,785 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 01:59:04,810 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 01:59:04,811 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 374 treesize of output 378 [2019-10-15 01:59:04,813 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-15 01:59:04,945 WARN L191 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2019-10-15 01:59:04,946 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 01:59:04,950 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_46|, |v_#memory_$Pointer$.offset_46|], 16=[v_prenex_1, v_prenex_3]} [2019-10-15 01:59:04,973 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 01:59:04,984 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 43 [2019-10-15 01:59:04,985 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-15 01:59:05,091 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2019-10-15 01:59:05,092 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 01:59:05,101 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 01:59:05,112 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 39 [2019-10-15 01:59:05,113 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-15 01:59:05,262 WARN L191 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2019-10-15 01:59:05,262 INFO L567 ElimStorePlain]: treesize reduction 8, result has 98.0 percent of original size [2019-10-15 01:59:05,267 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 01:59:05,272 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 01:59:05,429 WARN L191 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 38 [2019-10-15 01:59:05,430 INFO L341 Elim1Store]: treesize reduction 226, result has 38.6 percent of original size [2019-10-15 01:59:05,430 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 158 treesize of output 268 [2019-10-15 01:59:05,431 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-10-15 01:59:05,610 WARN L191 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 43 [2019-10-15 01:59:05,611 INFO L567 ElimStorePlain]: treesize reduction 118, result has 60.9 percent of original size [2019-10-15 01:59:05,615 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 01:59:05,619 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 01:59:05,624 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 01:59:05,658 INFO L341 Elim1Store]: treesize reduction 18, result has 64.7 percent of original size [2019-10-15 01:59:05,659 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 75 treesize of output 83 [2019-10-15 01:59:05,660 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-10-15 01:59:05,734 INFO L567 ElimStorePlain]: treesize reduction 16, result has 86.3 percent of original size [2019-10-15 01:59:05,735 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, 4 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-10-15 01:59:05,735 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 7 variables, input treesize:424, output treesize:116 [2019-10-15 01:59:06,024 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2019-10-15 01:59:06,024 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-15 01:59:06,032 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 01:59:06,035 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 01:59:06,035 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2019-10-15 01:59:06,036 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-15 01:59:06,042 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 01:59:06,042 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-15 01:59:06,042 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:43, output treesize:7 [2019-10-15 01:59:06,051 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:59:06,051 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:59:06,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:59:06,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:59:06,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:59:08,151 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse7 (+ c_main_~list~0.offset 4))) (and (forall ((|v_main_#t~malloc2.base_7| Int)) (let ((.cse4 (+ c_main_~list~0.offset 4))) (let ((.cse0 (let ((.cse6 (store |c_#memory_$Pointer$.offset| c_main_~list~0.base (store (select |c_#memory_$Pointer$.offset| c_main_~list~0.base) .cse4 0)))) (store .cse6 |v_main_#t~malloc2.base_7| (store (select .cse6 |v_main_#t~malloc2.base_7|) 0 0)))) (.cse3 (let ((.cse5 (store |c_#memory_$Pointer$.base| c_main_~list~0.base (store (select |c_#memory_$Pointer$.base| c_main_~list~0.base) .cse4 |v_main_#t~malloc2.base_7|)))) (store .cse5 |v_main_#t~malloc2.base_7| (store (select .cse5 |v_main_#t~malloc2.base_7|) 0 0))))) (let ((.cse1 (select (select .cse3 c_main_~list~0.base) .cse4)) (.cse2 (+ (select (select .cse0 c_main_~list~0.base) .cse4) 4))) (or (not (= (select |c_#valid| |v_main_#t~malloc2.base_7|) 0)) (= |v_main_#t~malloc2.base_7| 0) (= (select (select (store .cse0 .cse1 (store (select .cse0 .cse1) .cse2 0)) c_main_~list~0.base) c_main_~list~0.offset) 0) (not (= 0 (select (select (store .cse3 .cse1 (store (select .cse3 .cse1) .cse2 0)) c_main_~list~0.base) .cse4)))))))) (= 0 (select (store (select |c_#memory_$Pointer$.base| c_main_~list~0.base) .cse7 0) c_main_~list~0.offset)) (= 0 (select (store (select |c_#memory_$Pointer$.offset| c_main_~list~0.base) .cse7 0) c_main_~list~0.offset)) (forall ((|v_main_#t~malloc2.base_7| Int)) (let ((.cse9 (+ c_main_~list~0.offset 4))) (let ((.cse8 (select (let ((.cse10 (let ((.cse13 (store |c_#memory_$Pointer$.base| c_main_~list~0.base (store (select |c_#memory_$Pointer$.base| c_main_~list~0.base) .cse9 |v_main_#t~malloc2.base_7|)))) (store .cse13 |v_main_#t~malloc2.base_7| (store (select .cse13 |v_main_#t~malloc2.base_7|) 0 0))))) (let ((.cse11 (select (select .cse10 c_main_~list~0.base) .cse9))) (store .cse10 .cse11 (store (select .cse10 .cse11) (+ (select (select (let ((.cse12 (store |c_#memory_$Pointer$.offset| c_main_~list~0.base (store (select |c_#memory_$Pointer$.offset| c_main_~list~0.base) .cse9 0)))) (store .cse12 |v_main_#t~malloc2.base_7| (store (select .cse12 |v_main_#t~malloc2.base_7|) 0 0))) c_main_~list~0.base) .cse9) 4) 0)))) c_main_~list~0.base))) (or (not (= (select |c_#valid| |v_main_#t~malloc2.base_7|) 0)) (= |v_main_#t~malloc2.base_7| 0) (not (= 0 (select .cse8 .cse9))) (= 0 (select .cse8 c_main_~list~0.offset)))))))) is different from false [2019-10-15 01:59:10,176 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse7 (+ c_main_~list~0.offset 4))) (and (forall ((|v_main_#t~malloc2.base_7| Int)) (let ((.cse4 (+ c_main_~list~0.offset 4))) (let ((.cse0 (let ((.cse6 (store |c_#memory_$Pointer$.offset| c_main_~list~0.base (store (select |c_#memory_$Pointer$.offset| c_main_~list~0.base) .cse4 0)))) (store .cse6 |v_main_#t~malloc2.base_7| (store (select .cse6 |v_main_#t~malloc2.base_7|) 0 0)))) (.cse3 (let ((.cse5 (store |c_#memory_$Pointer$.base| c_main_~list~0.base (store (select |c_#memory_$Pointer$.base| c_main_~list~0.base) .cse4 |v_main_#t~malloc2.base_7|)))) (store .cse5 |v_main_#t~malloc2.base_7| (store (select .cse5 |v_main_#t~malloc2.base_7|) 0 0))))) (let ((.cse1 (select (select .cse3 c_main_~list~0.base) .cse4)) (.cse2 (+ (select (select .cse0 c_main_~list~0.base) .cse4) 4))) (or (not (= (select |c_#valid| |v_main_#t~malloc2.base_7|) 0)) (= |v_main_#t~malloc2.base_7| 0) (= (select (select (store .cse0 .cse1 (store (select .cse0 .cse1) .cse2 0)) c_main_~list~0.base) c_main_~list~0.offset) 0) (not (= 0 (select (select (store .cse3 .cse1 (store (select .cse3 .cse1) .cse2 0)) c_main_~list~0.base) .cse4)))))))) (= 0 (select (store (select |c_#memory_$Pointer$.base| c_main_~list~0.base) .cse7 0) c_main_~list~0.offset)) (= 0 (select (store (select |c_#memory_$Pointer$.offset| c_main_~list~0.base) .cse7 0) c_main_~list~0.offset)) (forall ((v_prenex_4 Int)) (let ((.cse9 (+ c_main_~list~0.offset 4))) (let ((.cse8 (select (let ((.cse10 (let ((.cse13 (store |c_#memory_$Pointer$.base| c_main_~list~0.base (store (select |c_#memory_$Pointer$.base| c_main_~list~0.base) .cse9 v_prenex_4)))) (store .cse13 v_prenex_4 (store (select .cse13 v_prenex_4) 0 0))))) (let ((.cse11 (select (select .cse10 c_main_~list~0.base) .cse9))) (store .cse10 .cse11 (store (select .cse10 .cse11) (+ (select (select (let ((.cse12 (store |c_#memory_$Pointer$.offset| c_main_~list~0.base (store (select |c_#memory_$Pointer$.offset| c_main_~list~0.base) .cse9 0)))) (store .cse12 v_prenex_4 (store (select .cse12 v_prenex_4) 0 0))) c_main_~list~0.base) .cse9) 4) 0)))) c_main_~list~0.base))) (or (= v_prenex_4 0) (not (= (select |c_#valid| v_prenex_4) 0)) (not (= 0 (select .cse8 .cse9))) (= 0 (select .cse8 c_main_~list~0.offset)))))))) is different from false [2019-10-15 01:59:10,210 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:59:10,210 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1119370278] [2019-10-15 01:59:10,258 INFO L162 IcfgInterpreter]: Started Sifa with 28 locations of interest [2019-10-15 01:59:10,258 INFO L169 IcfgInterpreter]: Building call graph [2019-10-15 01:59:10,264 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-15 01:59:10,270 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-15 01:59:10,270 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-15 01:59:10,354 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 24 for LOIs [2019-10-15 01:59:10,997 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-15 01:59:11,003 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-15 01:59:11,368 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2019-10-15 01:59:11,858 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-15 01:59:11,859 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 9, 12] total 28 [2019-10-15 01:59:11,859 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282258305] [2019-10-15 01:59:11,860 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-10-15 01:59:11,860 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 01:59:11,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-10-15 01:59:11,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=562, Unknown=2, NotChecked=98, Total=756 [2019-10-15 01:59:11,861 INFO L87 Difference]: Start difference. First operand 88 states and 97 transitions. Second operand 28 states. [2019-10-15 01:59:18,733 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse13 (+ c_main_~list~0.offset 4))) (and (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| c_main_~list~0.base (store (select |c_old(#memory_$Pointer$.offset)| c_main_~list~0.base) c_main_~list~0.offset 0))) (<= |c_#NULL.base| 0) (forall ((|v_main_#t~malloc2.base_7| Int)) (let ((.cse4 (+ c_main_~list~0.offset 4))) (let ((.cse0 (let ((.cse6 (store |c_#memory_$Pointer$.offset| c_main_~list~0.base (store (select |c_#memory_$Pointer$.offset| c_main_~list~0.base) .cse4 0)))) (store .cse6 |v_main_#t~malloc2.base_7| (store (select .cse6 |v_main_#t~malloc2.base_7|) 0 0)))) (.cse3 (let ((.cse5 (store |c_#memory_$Pointer$.base| c_main_~list~0.base (store (select |c_#memory_$Pointer$.base| c_main_~list~0.base) .cse4 |v_main_#t~malloc2.base_7|)))) (store .cse5 |v_main_#t~malloc2.base_7| (store (select .cse5 |v_main_#t~malloc2.base_7|) 0 0))))) (let ((.cse1 (select (select .cse3 c_main_~list~0.base) .cse4)) (.cse2 (+ (select (select .cse0 c_main_~list~0.base) .cse4) 4))) (or (not (= (select |c_#valid| |v_main_#t~malloc2.base_7|) 0)) (= |v_main_#t~malloc2.base_7| 0) (= (select (select (store .cse0 .cse1 (store (select .cse0 .cse1) .cse2 0)) c_main_~list~0.base) c_main_~list~0.offset) 0) (not (= 0 (select (select (store .cse3 .cse1 (store (select .cse3 .cse1) .cse2 0)) c_main_~list~0.base) .cse4)))))))) (<= 0 |c_#NULL.base|) (= 0 (select |c_old(#valid)| 0)) (forall ((|v_main_#t~malloc2.base_7| Int)) (let ((.cse8 (+ c_main_~list~0.offset 4))) (let ((.cse7 (select (let ((.cse9 (let ((.cse12 (store |c_#memory_$Pointer$.base| c_main_~list~0.base (store (select |c_#memory_$Pointer$.base| c_main_~list~0.base) .cse8 |v_main_#t~malloc2.base_7|)))) (store .cse12 |v_main_#t~malloc2.base_7| (store (select .cse12 |v_main_#t~malloc2.base_7|) 0 0))))) (let ((.cse10 (select (select .cse9 c_main_~list~0.base) .cse8))) (store .cse9 .cse10 (store (select .cse9 .cse10) (+ (select (select (let ((.cse11 (store |c_#memory_$Pointer$.offset| c_main_~list~0.base (store (select |c_#memory_$Pointer$.offset| c_main_~list~0.base) .cse8 0)))) (store .cse11 |v_main_#t~malloc2.base_7| (store (select .cse11 |v_main_#t~malloc2.base_7|) 0 0))) c_main_~list~0.base) .cse8) 4) 0)))) c_main_~list~0.base))) (or (not (= (select |c_#valid| |v_main_#t~malloc2.base_7|) 0)) (= |v_main_#t~malloc2.base_7| 0) (not (= 0 (select .cse7 .cse8))) (= 0 (select .cse7 c_main_~list~0.offset)))))) (= c_main_~list~0.offset |c_main_#t~malloc0.offset|) (= |c_#length| (store |c_old(#length)| |c_main_#t~malloc0.base| 8)) (= |c_main_#t~malloc0.base| c_main_~list~0.base) (= 0 (select (store (select |c_#memory_$Pointer$.base| c_main_~list~0.base) .cse13 0) c_main_~list~0.offset)) (<= 0 c_main_~list~0.offset) (= 0 (select (store (select |c_#memory_$Pointer$.offset| c_main_~list~0.base) .cse13 0) c_main_~list~0.offset)) (= (select |c_old(#valid)| |c_main_#t~malloc0.base|) 0) (< |c_#StackHeapBarrier| |c_main_#t~malloc0.base|) (= |c_#NULL.offset| 0) (not (= |c_main_#t~malloc0.base| 0)) (<= c_main_~list~0.offset 0) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| c_main_~list~0.base (store (select |c_old(#memory_$Pointer$.base)| c_main_~list~0.base) c_main_~list~0.offset 0))) (= (store |c_old(#valid)| |c_main_#t~malloc0.base| 1) |c_#valid|))) is different from false [2019-10-15 01:59:18,874 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 41 [2019-10-15 01:59:19,157 WARN L191 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 67 [2019-10-15 01:59:19,436 WARN L191 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 73 [2019-10-15 01:59:19,859 WARN L191 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 69 [2019-10-15 01:59:20,087 WARN L191 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 59 [2019-10-15 01:59:20,290 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2019-10-15 01:59:20,509 WARN L191 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 63 [2019-10-15 01:59:20,744 WARN L191 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2019-10-15 01:59:20,916 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 48 [2019-10-15 01:59:21,130 WARN L191 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 62 [2019-10-15 01:59:21,322 WARN L191 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 59 [2019-10-15 01:59:21,671 WARN L191 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 49 [2019-10-15 01:59:22,110 WARN L191 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 71 [2019-10-15 01:59:22,421 WARN L191 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 76 [2019-10-15 01:59:22,651 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2019-10-15 01:59:23,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:59:23,217 INFO L93 Difference]: Finished difference Result 209 states and 227 transitions. [2019-10-15 01:59:23,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-10-15 01:59:23,219 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 29 [2019-10-15 01:59:23,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:59:23,223 INFO L225 Difference]: With dead ends: 209 [2019-10-15 01:59:23,224 INFO L226 Difference]: Without dead ends: 171 [2019-10-15 01:59:23,227 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 69 SyntacticMatches, 3 SemanticMatches, 54 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 766 ImplicationChecksByTransitivity, 15.7s TimeCoverageRelationStatistics Valid=511, Invalid=2254, Unknown=3, NotChecked=312, Total=3080 [2019-10-15 01:59:23,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-10-15 01:59:23,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 93. [2019-10-15 01:59:23,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-10-15 01:59:23,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 103 transitions. [2019-10-15 01:59:23,247 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 103 transitions. Word has length 29 [2019-10-15 01:59:23,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:59:23,248 INFO L462 AbstractCegarLoop]: Abstraction has 93 states and 103 transitions. [2019-10-15 01:59:23,248 INFO L463 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-10-15 01:59:23,248 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 103 transitions. [2019-10-15 01:59:23,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-15 01:59:23,252 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:59:23,253 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:59:23,453 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:59:23,455 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:59:23,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:59:23,456 INFO L82 PathProgramCache]: Analyzing trace with hash 580690258, now seen corresponding path program 1 times [2019-10-15 01:59:23,456 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 01:59:23,456 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649004245] [2019-10-15 01:59:23,457 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:59:23,457 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:59:23,457 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:59:23,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:59:23,650 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:59:23,650 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649004245] [2019-10-15 01:59:23,650 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1208039328] [2019-10-15 01:59:23,650 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:59:23,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:59:23,759 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 25 conjunts are in the unsatisfiable core [2019-10-15 01:59:23,762 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:59:23,849 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:59:23,850 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:59:23,901 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:59:23,901 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-15 01:59:23,902 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 7] total 13 [2019-10-15 01:59:23,902 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66815732] [2019-10-15 01:59:23,902 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:59:23,903 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 01:59:23,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:59:23,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2019-10-15 01:59:23,903 INFO L87 Difference]: Start difference. First operand 93 states and 103 transitions. Second operand 6 states. [2019-10-15 01:59:24,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:59:24,135 INFO L93 Difference]: Finished difference Result 158 states and 175 transitions. [2019-10-15 01:59:24,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-15 01:59:24,135 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2019-10-15 01:59:24,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:59:24,137 INFO L225 Difference]: With dead ends: 158 [2019-10-15 01:59:24,137 INFO L226 Difference]: Without dead ends: 142 [2019-10-15 01:59:24,139 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2019-10-15 01:59:24,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2019-10-15 01:59:24,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 115. [2019-10-15 01:59:24,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-10-15 01:59:24,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 132 transitions. [2019-10-15 01:59:24,148 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 132 transitions. Word has length 30 [2019-10-15 01:59:24,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:59:24,148 INFO L462 AbstractCegarLoop]: Abstraction has 115 states and 132 transitions. [2019-10-15 01:59:24,148 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:59:24,148 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 132 transitions. [2019-10-15 01:59:24,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-15 01:59:24,150 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:59:24,150 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:59:24,354 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:59:24,355 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:59:24,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:59:24,355 INFO L82 PathProgramCache]: Analyzing trace with hash -1829633834, now seen corresponding path program 1 times [2019-10-15 01:59:24,356 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 01:59:24,356 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026300022] [2019-10-15 01:59:24,356 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:59:24,356 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:59:24,357 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:59:24,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:59:24,384 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:59:24,384 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026300022] [2019-10-15 01:59:24,385 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1210541303] [2019-10-15 01:59:24,385 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:59:24,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:59:24,539 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-15 01:59:24,551 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:59:24,565 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:59:24,566 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:59:24,575 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:59:24,575 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1920069469] [2019-10-15 01:59:24,577 INFO L162 IcfgInterpreter]: Started Sifa with 31 locations of interest [2019-10-15 01:59:24,577 INFO L169 IcfgInterpreter]: Building call graph [2019-10-15 01:59:24,578 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-15 01:59:24,581 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-15 01:59:24,582 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-15 01:59:24,617 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 24 for LOIs [2019-10-15 01:59:25,049 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-15 01:59:25,053 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-15 01:59:25,707 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-15 01:59:25,708 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 15] total 19 [2019-10-15 01:59:25,708 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553726922] [2019-10-15 01:59:25,710 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-15 01:59:25,710 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 01:59:25,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-15 01:59:25,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2019-10-15 01:59:25,711 INFO L87 Difference]: Start difference. First operand 115 states and 132 transitions. Second operand 19 states. [2019-10-15 01:59:27,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:59:27,401 INFO L93 Difference]: Finished difference Result 209 states and 238 transitions. [2019-10-15 01:59:27,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-10-15 01:59:27,401 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 31 [2019-10-15 01:59:27,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:59:27,404 INFO L225 Difference]: With dead ends: 209 [2019-10-15 01:59:27,404 INFO L226 Difference]: Without dead ends: 207 [2019-10-15 01:59:27,406 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 80 SyntacticMatches, 3 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=271, Invalid=1289, Unknown=0, NotChecked=0, Total=1560 [2019-10-15 01:59:27,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2019-10-15 01:59:27,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 139. [2019-10-15 01:59:27,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2019-10-15 01:59:27,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 163 transitions. [2019-10-15 01:59:27,416 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 163 transitions. Word has length 31 [2019-10-15 01:59:27,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:59:27,417 INFO L462 AbstractCegarLoop]: Abstraction has 139 states and 163 transitions. [2019-10-15 01:59:27,417 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-15 01:59:27,417 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 163 transitions. [2019-10-15 01:59:27,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-10-15 01:59:27,418 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:59:27,418 INFO L380 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, 1, 1, 1, 1, 1] [2019-10-15 01:59:27,622 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:59:27,623 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:59:27,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:59:27,623 INFO L82 PathProgramCache]: Analyzing trace with hash 245997555, now seen corresponding path program 1 times [2019-10-15 01:59:27,624 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 01:59:27,624 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90723762] [2019-10-15 01:59:27,624 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:59:27,625 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:59:27,625 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:59:27,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:59:27,762 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:59:27,763 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90723762] [2019-10-15 01:59:27,763 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [344505105] [2019-10-15 01:59:27,763 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:59:27,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:59:27,903 INFO L256 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 21 conjunts are in the unsatisfiable core [2019-10-15 01:59:27,905 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:59:27,956 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:59:27,957 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:59:28,058 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:59:28,059 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1080041174] [2019-10-15 01:59:28,061 INFO L162 IcfgInterpreter]: Started Sifa with 31 locations of interest [2019-10-15 01:59:28,061 INFO L169 IcfgInterpreter]: Building call graph [2019-10-15 01:59:28,062 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-15 01:59:28,063 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-15 01:59:28,063 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-15 01:59:28,098 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 24 for LOIs [2019-10-15 01:59:28,384 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-15 01:59:28,473 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-15 01:59:29,101 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-15 01:59:29,105 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-15 01:59:29,486 WARN L191 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2019-10-15 01:59:29,983 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-15 01:59:29,984 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6, 15] total 22 [2019-10-15 01:59:29,984 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512888427] [2019-10-15 01:59:29,985 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-10-15 01:59:29,985 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 01:59:29,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-10-15 01:59:29,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=405, Unknown=0, NotChecked=0, Total=462 [2019-10-15 01:59:29,986 INFO L87 Difference]: Start difference. First operand 139 states and 163 transitions. Second operand 22 states. [2019-10-15 01:59:31,271 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2019-10-15 01:59:31,443 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 48 [2019-10-15 01:59:32,583 WARN L191 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 62 [2019-10-15 01:59:32,919 WARN L191 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 63 [2019-10-15 01:59:33,113 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 44 [2019-10-15 01:59:33,646 WARN L191 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 59 [2019-10-15 01:59:33,812 WARN L191 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 45 [2019-10-15 01:59:34,024 WARN L191 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 69 [2019-10-15 01:59:34,211 WARN L191 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 70 [2019-10-15 01:59:34,380 WARN L191 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 58 [2019-10-15 01:59:34,643 WARN L191 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 68 [2019-10-15 01:59:34,829 WARN L191 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 69 [2019-10-15 01:59:34,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:59:34,844 INFO L93 Difference]: Finished difference Result 288 states and 332 transitions. [2019-10-15 01:59:34,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-10-15 01:59:34,845 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 33 [2019-10-15 01:59:34,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:59:34,848 INFO L225 Difference]: With dead ends: 288 [2019-10-15 01:59:34,849 INFO L226 Difference]: Without dead ends: 261 [2019-10-15 01:59:34,850 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 94 SyntacticMatches, 3 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 883 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=574, Invalid=2848, Unknown=0, NotChecked=0, Total=3422 [2019-10-15 01:59:34,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2019-10-15 01:59:34,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 173. [2019-10-15 01:59:34,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2019-10-15 01:59:34,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 205 transitions. [2019-10-15 01:59:34,863 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 205 transitions. Word has length 33 [2019-10-15 01:59:34,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:59:34,864 INFO L462 AbstractCegarLoop]: Abstraction has 173 states and 205 transitions. [2019-10-15 01:59:34,864 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-10-15 01:59:34,864 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 205 transitions. [2019-10-15 01:59:34,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-10-15 01:59:34,865 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:59:34,865 INFO L380 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, 1, 1, 1, 1, 1, 1] [2019-10-15 01:59:35,069 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:59:35,070 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:59:35,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:59:35,071 INFO L82 PathProgramCache]: Analyzing trace with hash -1425148835, now seen corresponding path program 1 times [2019-10-15 01:59:35,071 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 01:59:35,071 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960836836] [2019-10-15 01:59:35,071 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:59:35,072 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:59:35,072 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:59:35,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:59:35,675 WARN L191 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 35 [2019-10-15 01:59:36,018 WARN L191 SmtUtils]: Spent 320.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 48 [2019-10-15 01:59:36,268 WARN L191 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 27 [2019-10-15 01:59:36,562 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:59:36,562 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960836836] [2019-10-15 01:59:36,562 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2140891900] [2019-10-15 01:59:36,562 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:59:36,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:59:36,720 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 40 conjunts are in the unsatisfiable core [2019-10-15 01:59:36,724 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:59:37,104 WARN L191 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 61 [2019-10-15 01:59:37,286 WARN L191 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2019-10-15 01:59:37,509 WARN L191 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2019-10-15 01:59:38,323 WARN L191 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2019-10-15 01:59:38,671 WARN L191 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 56