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 -i ../../../trunk/examples/svcomp/forester-heap/sll-01-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 01:41:35,206 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 01:41:35,208 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 01:41:35,220 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 01:41:35,220 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 01:41:35,221 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 01:41:35,222 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 01:41:35,224 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 01:41:35,226 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 01:41:35,227 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 01:41:35,228 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 01:41:35,229 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 01:41:35,229 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 01:41:35,230 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 01:41:35,231 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 01:41:35,232 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 01:41:35,233 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 01:41:35,234 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 01:41:35,235 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 01:41:35,237 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 01:41:35,239 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 01:41:35,240 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 01:41:35,241 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 01:41:35,241 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 01:41:35,243 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 01:41:35,244 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 01:41:35,244 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 01:41:35,245 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 01:41:35,245 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 01:41:35,246 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 01:41:35,246 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 01:41:35,247 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 01:41:35,248 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 01:41:35,248 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 01:41:35,249 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 01:41:35,250 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 01:41:35,250 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 01:41:35,251 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 01:41:35,251 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 01:41:35,252 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 01:41:35,253 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 01:41:35,254 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-09-08 01:41:35,279 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 01:41:35,280 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 01:41:35,281 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 01:41:35,282 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 01:41:35,282 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 01:41:35,283 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 01:41:35,283 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 01:41:35,283 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 01:41:35,283 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 01:41:35,283 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 01:41:35,284 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 01:41:35,285 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 01:41:35,285 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 01:41:35,285 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 01:41:35,285 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 01:41:35,286 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 01:41:35,286 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 01:41:35,286 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 01:41:35,286 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 01:41:35,286 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 01:41:35,287 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 01:41:35,287 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 01:41:35,287 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 01:41:35,287 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 01:41:35,288 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 01:41:35,288 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 01:41:35,288 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 01:41:35,288 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 01:41:35,289 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 01:41:35,338 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 01:41:35,351 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 01:41:35,355 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 01:41:35,356 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 01:41:35,357 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 01:41:35,357 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/sll-01-2.i [2019-09-08 01:41:35,416 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4bf1f5b1f/dd9d86e7837748b4ba9b4694ebb1d286/FLAG995125cb3 [2019-09-08 01:41:35,959 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 01:41:35,960 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-01-2.i [2019-09-08 01:41:35,978 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4bf1f5b1f/dd9d86e7837748b4ba9b4694ebb1d286/FLAG995125cb3 [2019-09-08 01:41:36,259 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4bf1f5b1f/dd9d86e7837748b4ba9b4694ebb1d286 [2019-09-08 01:41:36,269 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 01:41:36,271 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 01:41:36,272 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 01:41:36,272 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 01:41:36,276 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 01:41:36,278 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 01:41:36" (1/1) ... [2019-09-08 01:41:36,280 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6fa32137 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:41:36, skipping insertion in model container [2019-09-08 01:41:36,280 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 01:41:36" (1/1) ... [2019-09-08 01:41:36,291 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 01:41:36,346 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 01:41:36,768 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 01:41:36,776 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 01:41:36,827 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 01:41:36,880 INFO L192 MainTranslator]: Completed translation [2019-09-08 01:41:36,881 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:41:36 WrapperNode [2019-09-08 01:41:36,881 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 01:41:36,882 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 01:41:36,882 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 01:41:36,882 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 01:41:36,896 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:41:36" (1/1) ... [2019-09-08 01:41:36,896 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:41:36" (1/1) ... [2019-09-08 01:41:36,913 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:41:36" (1/1) ... [2019-09-08 01:41:36,914 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:41:36" (1/1) ... [2019-09-08 01:41:36,947 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:41:36" (1/1) ... [2019-09-08 01:41:36,963 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:41:36" (1/1) ... [2019-09-08 01:41:36,967 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:41:36" (1/1) ... [2019-09-08 01:41:36,974 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 01:41:36,974 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 01:41:36,974 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 01:41:36,975 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 01:41:36,976 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:41:36" (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-09-08 01:41:37,037 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 01:41:37,037 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 01:41:37,037 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 01:41:37,037 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-09-08 01:41:37,037 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-09-08 01:41:37,038 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-09-08 01:41:37,038 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-09-08 01:41:37,038 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-09-08 01:41:37,038 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-09-08 01:41:37,038 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-09-08 01:41:37,038 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-09-08 01:41:37,039 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-09-08 01:41:37,039 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-09-08 01:41:37,039 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-09-08 01:41:37,039 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-09-08 01:41:37,039 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-09-08 01:41:37,040 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-09-08 01:41:37,040 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-09-08 01:41:37,040 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-09-08 01:41:37,040 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-09-08 01:41:37,040 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-09-08 01:41:37,040 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-09-08 01:41:37,041 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-09-08 01:41:37,041 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-09-08 01:41:37,041 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-09-08 01:41:37,041 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-09-08 01:41:37,041 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-09-08 01:41:37,041 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-09-08 01:41:37,042 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-09-08 01:41:37,042 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-09-08 01:41:37,042 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-09-08 01:41:37,042 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-09-08 01:41:37,042 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-09-08 01:41:37,042 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-09-08 01:41:37,043 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-09-08 01:41:37,043 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-09-08 01:41:37,043 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-09-08 01:41:37,043 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-09-08 01:41:37,043 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-09-08 01:41:37,043 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-09-08 01:41:37,044 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-09-08 01:41:37,044 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-09-08 01:41:37,044 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-09-08 01:41:37,044 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-09-08 01:41:37,044 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-09-08 01:41:37,044 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-09-08 01:41:37,045 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-09-08 01:41:37,045 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-09-08 01:41:37,045 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-09-08 01:41:37,045 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-09-08 01:41:37,045 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-09-08 01:41:37,045 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-09-08 01:41:37,045 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-09-08 01:41:37,046 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-08 01:41:37,046 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-09-08 01:41:37,046 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-09-08 01:41:37,046 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-09-08 01:41:37,046 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-09-08 01:41:37,046 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-09-08 01:41:37,046 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-09-08 01:41:37,047 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-09-08 01:41:37,047 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-09-08 01:41:37,047 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-09-08 01:41:37,047 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-09-08 01:41:37,047 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-09-08 01:41:37,047 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-09-08 01:41:37,048 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-09-08 01:41:37,048 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-09-08 01:41:37,048 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-09-08 01:41:37,048 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-09-08 01:41:37,048 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-09-08 01:41:37,048 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-09-08 01:41:37,049 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-09-08 01:41:37,049 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-09-08 01:41:37,049 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-09-08 01:41:37,049 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-09-08 01:41:37,049 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-09-08 01:41:37,049 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-09-08 01:41:37,050 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-09-08 01:41:37,050 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-09-08 01:41:37,050 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-09-08 01:41:37,050 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-09-08 01:41:37,050 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-09-08 01:41:37,050 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-09-08 01:41:37,050 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-09-08 01:41:37,051 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-09-08 01:41:37,051 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-09-08 01:41:37,051 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-09-08 01:41:37,051 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-09-08 01:41:37,051 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-09-08 01:41:37,051 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-09-08 01:41:37,052 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-09-08 01:41:37,052 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-09-08 01:41:37,052 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-09-08 01:41:37,052 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-09-08 01:41:37,052 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-09-08 01:41:37,052 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-09-08 01:41:37,052 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-09-08 01:41:37,053 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-09-08 01:41:37,053 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-09-08 01:41:37,053 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-09-08 01:41:37,053 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-09-08 01:41:37,053 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-09-08 01:41:37,053 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-09-08 01:41:37,053 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-09-08 01:41:37,054 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-09-08 01:41:37,054 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-08 01:41:37,054 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 01:41:37,054 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 01:41:37,054 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-08 01:41:37,054 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-08 01:41:37,054 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-08 01:41:37,055 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-08 01:41:37,055 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 01:41:37,055 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 01:41:37,727 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 01:41:37,727 INFO L283 CfgBuilder]: Removed 30 assume(true) statements. [2019-09-08 01:41:37,728 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 01:41:37 BoogieIcfgContainer [2019-09-08 01:41:37,728 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 01:41:37,729 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 01:41:37,729 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 01:41:37,733 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 01:41:37,733 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 01:41:36" (1/3) ... [2019-09-08 01:41:37,734 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3eb1b65c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 01:41:37, skipping insertion in model container [2019-09-08 01:41:37,734 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:41:36" (2/3) ... [2019-09-08 01:41:37,735 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3eb1b65c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 01:41:37, skipping insertion in model container [2019-09-08 01:41:37,735 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 01:41:37" (3/3) ... [2019-09-08 01:41:37,737 INFO L109 eAbstractionObserver]: Analyzing ICFG sll-01-2.i [2019-09-08 01:41:37,748 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 01:41:37,757 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 13 error locations. [2019-09-08 01:41:37,775 INFO L252 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2019-09-08 01:41:37,821 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 01:41:37,822 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 01:41:37,822 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 01:41:37,823 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 01:41:37,824 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 01:41:37,824 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 01:41:37,824 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 01:41:37,825 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 01:41:37,825 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 01:41:37,847 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states. [2019-09-08 01:41:37,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-09-08 01:41:37,853 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:41:37,854 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:41:37,857 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:41:37,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:41:37,863 INFO L82 PathProgramCache]: Analyzing trace with hash 11193106, now seen corresponding path program 1 times [2019-09-08 01:41:37,865 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:41:37,866 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:41:37,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:41:37,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:41:37,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:41:37,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:41:38,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:41:38,038 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 01:41:38,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 01:41:38,043 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 01:41:38,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 01:41:38,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 01:41:38,062 INFO L87 Difference]: Start difference. First operand 89 states. Second operand 3 states. [2019-09-08 01:41:38,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:41:38,139 INFO L93 Difference]: Finished difference Result 188 states and 306 transitions. [2019-09-08 01:41:38,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 01:41:38,141 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2019-09-08 01:41:38,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:41:38,153 INFO L225 Difference]: With dead ends: 188 [2019-09-08 01:41:38,153 INFO L226 Difference]: Without dead ends: 100 [2019-09-08 01:41:38,157 INFO L628 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-09-08 01:41:38,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-09-08 01:41:38,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 82. [2019-09-08 01:41:38,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-09-08 01:41:38,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 92 transitions. [2019-09-08 01:41:38,205 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 92 transitions. Word has length 8 [2019-09-08 01:41:38,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:41:38,205 INFO L475 AbstractCegarLoop]: Abstraction has 82 states and 92 transitions. [2019-09-08 01:41:38,205 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 01:41:38,206 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 92 transitions. [2019-09-08 01:41:38,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-09-08 01:41:38,206 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:41:38,206 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:41:38,207 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:41:38,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:41:38,208 INFO L82 PathProgramCache]: Analyzing trace with hash -648207140, now seen corresponding path program 1 times [2019-09-08 01:41:38,208 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:41:38,208 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:41:38,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:41:38,210 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:41:38,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:41:38,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:41:38,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:41:38,257 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 01:41:38,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 01:41:38,259 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 01:41:38,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 01:41:38,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 01:41:38,260 INFO L87 Difference]: Start difference. First operand 82 states and 92 transitions. Second operand 3 states. [2019-09-08 01:41:38,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:41:38,302 INFO L93 Difference]: Finished difference Result 85 states and 95 transitions. [2019-09-08 01:41:38,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 01:41:38,304 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-09-08 01:41:38,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:41:38,306 INFO L225 Difference]: With dead ends: 85 [2019-09-08 01:41:38,306 INFO L226 Difference]: Without dead ends: 83 [2019-09-08 01:41:38,307 INFO L628 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-09-08 01:41:38,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-09-08 01:41:38,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2019-09-08 01:41:38,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-09-08 01:41:38,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 93 transitions. [2019-09-08 01:41:38,318 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 93 transitions. Word has length 14 [2019-09-08 01:41:38,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:41:38,318 INFO L475 AbstractCegarLoop]: Abstraction has 83 states and 93 transitions. [2019-09-08 01:41:38,318 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 01:41:38,318 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 93 transitions. [2019-09-08 01:41:38,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-09-08 01:41:38,319 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:41:38,319 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:41:38,320 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:41:38,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:41:38,320 INFO L82 PathProgramCache]: Analyzing trace with hash -648205218, now seen corresponding path program 1 times [2019-09-08 01:41:38,320 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:41:38,321 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:41:38,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:41:38,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:41:38,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:41:38,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:41:38,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:41:38,397 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 01:41:38,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 01:41:38,398 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 01:41:38,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 01:41:38,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 01:41:38,401 INFO L87 Difference]: Start difference. First operand 83 states and 93 transitions. Second operand 4 states. [2019-09-08 01:41:38,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:41:38,488 INFO L93 Difference]: Finished difference Result 84 states and 94 transitions. [2019-09-08 01:41:38,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 01:41:38,488 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-09-08 01:41:38,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:41:38,489 INFO L225 Difference]: With dead ends: 84 [2019-09-08 01:41:38,489 INFO L226 Difference]: Without dead ends: 82 [2019-09-08 01:41:38,490 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 01:41:38,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-09-08 01:41:38,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 80. [2019-09-08 01:41:38,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-09-08 01:41:38,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 90 transitions. [2019-09-08 01:41:38,498 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 90 transitions. Word has length 14 [2019-09-08 01:41:38,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:41:38,498 INFO L475 AbstractCegarLoop]: Abstraction has 80 states and 90 transitions. [2019-09-08 01:41:38,498 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 01:41:38,499 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 90 transitions. [2019-09-08 01:41:38,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-08 01:41:38,499 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:41:38,500 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:41:38,500 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:41:38,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:41:38,501 INFO L82 PathProgramCache]: Analyzing trace with hash 1093009051, now seen corresponding path program 1 times [2019-09-08 01:41:38,501 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:41:38,501 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:41:38,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:41:38,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:41:38,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:41:38,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:41:38,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:41:38,563 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 01:41:38,563 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 01:41:38,564 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 01:41:38,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 01:41:38,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 01:41:38,564 INFO L87 Difference]: Start difference. First operand 80 states and 90 transitions. Second operand 3 states. [2019-09-08 01:41:38,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:41:38,632 INFO L93 Difference]: Finished difference Result 83 states and 94 transitions. [2019-09-08 01:41:38,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 01:41:38,632 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-09-08 01:41:38,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:41:38,634 INFO L225 Difference]: With dead ends: 83 [2019-09-08 01:41:38,634 INFO L226 Difference]: Without dead ends: 79 [2019-09-08 01:41:38,634 INFO L628 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-09-08 01:41:38,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-09-08 01:41:38,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 76. [2019-09-08 01:41:38,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-09-08 01:41:38,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 86 transitions. [2019-09-08 01:41:38,642 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 86 transitions. Word has length 19 [2019-09-08 01:41:38,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:41:38,643 INFO L475 AbstractCegarLoop]: Abstraction has 76 states and 86 transitions. [2019-09-08 01:41:38,643 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 01:41:38,643 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 86 transitions. [2019-09-08 01:41:38,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-08 01:41:38,644 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:41:38,646 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:41:38,647 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:41:38,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:41:38,647 INFO L82 PathProgramCache]: Analyzing trace with hash -476453587, now seen corresponding path program 1 times [2019-09-08 01:41:38,647 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:41:38,648 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:41:38,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:41:38,650 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:41:38,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:41:38,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:41:38,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-09-08 01:41:38,738 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 01:41:38,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 01:41:38,738 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 01:41:38,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 01:41:38,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 01:41:38,739 INFO L87 Difference]: Start difference. First operand 76 states and 86 transitions. Second operand 5 states. [2019-09-08 01:41:38,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:41:38,862 INFO L93 Difference]: Finished difference Result 136 states and 152 transitions. [2019-09-08 01:41:38,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 01:41:38,863 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2019-09-08 01:41:38,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:41:38,864 INFO L225 Difference]: With dead ends: 136 [2019-09-08 01:41:38,864 INFO L226 Difference]: Without dead ends: 116 [2019-09-08 01:41:38,865 INFO L628 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-09-08 01:41:38,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-09-08 01:41:38,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 75. [2019-09-08 01:41:38,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-09-08 01:41:38,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 85 transitions. [2019-09-08 01:41:38,873 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 85 transitions. Word has length 20 [2019-09-08 01:41:38,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:41:38,873 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 85 transitions. [2019-09-08 01:41:38,873 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 01:41:38,873 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 85 transitions. [2019-09-08 01:41:38,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-08 01:41:38,874 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:41:38,874 INFO L399 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-09-08 01:41:38,875 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:41:38,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:41:38,875 INFO L82 PathProgramCache]: Analyzing trace with hash 337242584, now seen corresponding path program 1 times [2019-09-08 01:41:38,876 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:41:38,876 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:41:38,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:41:38,877 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:41:38,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:41:38,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:41:38,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:41:38,930 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 01:41:38,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 01:41:38,930 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 01:41:38,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 01:41:38,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 01:41:38,931 INFO L87 Difference]: Start difference. First operand 75 states and 85 transitions. Second operand 3 states. [2019-09-08 01:41:38,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:41:38,947 INFO L93 Difference]: Finished difference Result 141 states and 161 transitions. [2019-09-08 01:41:38,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 01:41:38,949 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-09-08 01:41:38,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:41:38,950 INFO L225 Difference]: With dead ends: 141 [2019-09-08 01:41:38,950 INFO L226 Difference]: Without dead ends: 99 [2019-09-08 01:41:38,951 INFO L628 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-09-08 01:41:38,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-09-08 01:41:38,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 78. [2019-09-08 01:41:38,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-09-08 01:41:38,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 89 transitions. [2019-09-08 01:41:38,966 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 89 transitions. Word has length 24 [2019-09-08 01:41:38,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:41:38,967 INFO L475 AbstractCegarLoop]: Abstraction has 78 states and 89 transitions. [2019-09-08 01:41:38,967 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 01:41:38,967 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 89 transitions. [2019-09-08 01:41:38,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-09-08 01:41:38,968 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:41:38,968 INFO L399 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] [2019-09-08 01:41:38,968 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:41:38,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:41:38,969 INFO L82 PathProgramCache]: Analyzing trace with hash 1864575058, now seen corresponding path program 1 times [2019-09-08 01:41:38,969 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:41:38,973 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:41:38,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:41:38,975 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:41:38,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:41:38,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:41:39,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:41:39,037 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 01:41:39,037 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 01:41:39,038 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 01:41:39,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 01:41:39,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 01:41:39,038 INFO L87 Difference]: Start difference. First operand 78 states and 89 transitions. Second operand 3 states. [2019-09-08 01:41:39,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:41:39,070 INFO L93 Difference]: Finished difference Result 78 states and 89 transitions. [2019-09-08 01:41:39,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 01:41:39,071 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-09-08 01:41:39,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:41:39,072 INFO L225 Difference]: With dead ends: 78 [2019-09-08 01:41:39,072 INFO L226 Difference]: Without dead ends: 76 [2019-09-08 01:41:39,073 INFO L628 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-09-08 01:41:39,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-09-08 01:41:39,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2019-09-08 01:41:39,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-09-08 01:41:39,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 87 transitions. [2019-09-08 01:41:39,094 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 87 transitions. Word has length 25 [2019-09-08 01:41:39,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:41:39,095 INFO L475 AbstractCegarLoop]: Abstraction has 76 states and 87 transitions. [2019-09-08 01:41:39,095 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 01:41:39,095 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 87 transitions. [2019-09-08 01:41:39,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-08 01:41:39,096 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:41:39,097 INFO L399 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-09-08 01:41:39,098 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:41:39,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:41:39,103 INFO L82 PathProgramCache]: Analyzing trace with hash -660297045, now seen corresponding path program 1 times [2019-09-08 01:41:39,103 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:41:39,103 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:41:39,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:41:39,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:41:39,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:41:39,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:41:39,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:41:39,147 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 01:41:39,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 01:41:39,148 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 01:41:39,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 01:41:39,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 01:41:39,148 INFO L87 Difference]: Start difference. First operand 76 states and 87 transitions. Second operand 4 states. [2019-09-08 01:41:39,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:41:39,233 INFO L93 Difference]: Finished difference Result 77 states and 88 transitions. [2019-09-08 01:41:39,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 01:41:39,234 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2019-09-08 01:41:39,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:41:39,235 INFO L225 Difference]: With dead ends: 77 [2019-09-08 01:41:39,235 INFO L226 Difference]: Without dead ends: 75 [2019-09-08 01:41:39,236 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 01:41:39,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-09-08 01:41:39,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 74. [2019-09-08 01:41:39,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-09-08 01:41:39,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 85 transitions. [2019-09-08 01:41:39,247 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 85 transitions. Word has length 27 [2019-09-08 01:41:39,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:41:39,247 INFO L475 AbstractCegarLoop]: Abstraction has 74 states and 85 transitions. [2019-09-08 01:41:39,247 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 01:41:39,247 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 85 transitions. [2019-09-08 01:41:39,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-08 01:41:39,248 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:41:39,248 INFO L399 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] [2019-09-08 01:41:39,249 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:41:39,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:41:39,249 INFO L82 PathProgramCache]: Analyzing trace with hash 747608077, now seen corresponding path program 1 times [2019-09-08 01:41:39,250 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:41:39,250 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:41:39,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:41:39,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:41:39,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:41:39,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:41:39,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:41:39,323 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 01:41:39,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 01:41:39,324 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 01:41:39,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 01:41:39,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 01:41:39,326 INFO L87 Difference]: Start difference. First operand 74 states and 85 transitions. Second operand 4 states. [2019-09-08 01:41:39,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:41:39,444 INFO L93 Difference]: Finished difference Result 190 states and 218 transitions. [2019-09-08 01:41:39,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 01:41:39,444 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2019-09-08 01:41:39,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:41:39,445 INFO L225 Difference]: With dead ends: 190 [2019-09-08 01:41:39,446 INFO L226 Difference]: Without dead ends: 128 [2019-09-08 01:41:39,446 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 01:41:39,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-09-08 01:41:39,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 76. [2019-09-08 01:41:39,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-09-08 01:41:39,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 87 transitions. [2019-09-08 01:41:39,452 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 87 transitions. Word has length 28 [2019-09-08 01:41:39,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:41:39,452 INFO L475 AbstractCegarLoop]: Abstraction has 76 states and 87 transitions. [2019-09-08 01:41:39,452 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 01:41:39,453 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 87 transitions. [2019-09-08 01:41:39,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-08 01:41:39,454 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:41:39,454 INFO L399 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] [2019-09-08 01:41:39,454 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:41:39,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:41:39,455 INFO L82 PathProgramCache]: Analyzing trace with hash -840739825, now seen corresponding path program 1 times [2019-09-08 01:41:39,455 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:41:39,455 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:41:39,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:41:39,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:41:39,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:41:39,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:41:39,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:41:39,545 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 01:41:39,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 01:41:39,545 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 01:41:39,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 01:41:39,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-08 01:41:39,547 INFO L87 Difference]: Start difference. First operand 76 states and 87 transitions. Second operand 6 states. [2019-09-08 01:41:39,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:41:39,816 INFO L93 Difference]: Finished difference Result 182 states and 209 transitions. [2019-09-08 01:41:39,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 01:41:39,816 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-09-08 01:41:39,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:41:39,817 INFO L225 Difference]: With dead ends: 182 [2019-09-08 01:41:39,818 INFO L226 Difference]: Without dead ends: 139 [2019-09-08 01:41:39,818 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-09-08 01:41:39,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-09-08 01:41:39,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 86. [2019-09-08 01:41:39,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-09-08 01:41:39,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 98 transitions. [2019-09-08 01:41:39,835 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 98 transitions. Word has length 28 [2019-09-08 01:41:39,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:41:39,835 INFO L475 AbstractCegarLoop]: Abstraction has 86 states and 98 transitions. [2019-09-08 01:41:39,835 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 01:41:39,835 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 98 transitions. [2019-09-08 01:41:39,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-08 01:41:39,837 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:41:39,837 INFO L399 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] [2019-09-08 01:41:39,837 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:41:39,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:41:39,838 INFO L82 PathProgramCache]: Analyzing trace with hash -941335665, now seen corresponding path program 1 times [2019-09-08 01:41:39,838 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:41:39,838 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:41:39,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:41:39,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:41:39,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:41:39,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:41:40,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:41:40,036 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 01:41:40,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 01:41:40,036 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 01:41:40,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 01:41:40,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 01:41:40,037 INFO L87 Difference]: Start difference. First operand 86 states and 98 transitions. Second operand 7 states. [2019-09-08 01:41:40,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:41:40,550 INFO L93 Difference]: Finished difference Result 241 states and 269 transitions. [2019-09-08 01:41:40,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 01:41:40,552 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 28 [2019-09-08 01:41:40,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:41:40,557 INFO L225 Difference]: With dead ends: 241 [2019-09-08 01:41:40,557 INFO L226 Difference]: Without dead ends: 239 [2019-09-08 01:41:40,558 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-09-08 01:41:40,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2019-09-08 01:41:40,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 98. [2019-09-08 01:41:40,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-09-08 01:41:40,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 112 transitions. [2019-09-08 01:41:40,571 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 112 transitions. Word has length 28 [2019-09-08 01:41:40,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:41:40,572 INFO L475 AbstractCegarLoop]: Abstraction has 98 states and 112 transitions. [2019-09-08 01:41:40,572 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 01:41:40,573 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 112 transitions. [2019-09-08 01:41:40,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-08 01:41:40,580 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:41:40,580 INFO L399 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-09-08 01:41:40,580 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:41:40,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:41:40,581 INFO L82 PathProgramCache]: Analyzing trace with hash 1932526751, now seen corresponding path program 1 times [2019-09-08 01:41:40,581 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:41:40,581 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:41:40,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:41:40,583 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:41:40,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:41:40,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:41:40,663 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-08 01:41:40,663 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 01:41:40,663 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 01:41:40,664 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 01:41:40,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 01:41:40,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-08 01:41:40,666 INFO L87 Difference]: Start difference. First operand 98 states and 112 transitions. Second operand 5 states. [2019-09-08 01:41:40,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:41:40,775 INFO L93 Difference]: Finished difference Result 145 states and 166 transitions. [2019-09-08 01:41:40,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 01:41:40,776 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-09-08 01:41:40,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:41:40,777 INFO L225 Difference]: With dead ends: 145 [2019-09-08 01:41:40,777 INFO L226 Difference]: Without dead ends: 127 [2019-09-08 01:41:40,778 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-08 01:41:40,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-09-08 01:41:40,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 119. [2019-09-08 01:41:40,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-09-08 01:41:40,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 141 transitions. [2019-09-08 01:41:40,792 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 141 transitions. Word has length 30 [2019-09-08 01:41:40,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:41:40,793 INFO L475 AbstractCegarLoop]: Abstraction has 119 states and 141 transitions. [2019-09-08 01:41:40,793 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 01:41:40,793 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 141 transitions. [2019-09-08 01:41:40,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-08 01:41:40,798 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:41:40,798 INFO L399 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-09-08 01:41:40,799 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:41:40,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:41:40,800 INFO L82 PathProgramCache]: Analyzing trace with hash -250794977, now seen corresponding path program 1 times [2019-09-08 01:41:40,800 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:41:40,800 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:41:40,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:41:40,803 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:41:40,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:41:40,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:41:40,864 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-08 01:41:40,864 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 01:41:40,864 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 01:41:40,865 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 01:41:40,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 01:41:40,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 01:41:40,867 INFO L87 Difference]: Start difference. First operand 119 states and 141 transitions. Second operand 3 states. [2019-09-08 01:41:40,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:41:40,915 INFO L93 Difference]: Finished difference Result 119 states and 141 transitions. [2019-09-08 01:41:40,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 01:41:40,917 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-09-08 01:41:40,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:41:40,918 INFO L225 Difference]: With dead ends: 119 [2019-09-08 01:41:40,919 INFO L226 Difference]: Without dead ends: 117 [2019-09-08 01:41:40,919 INFO L628 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-09-08 01:41:40,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-09-08 01:41:40,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2019-09-08 01:41:40,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-09-08 01:41:40,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 139 transitions. [2019-09-08 01:41:40,930 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 139 transitions. Word has length 30 [2019-09-08 01:41:40,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:41:40,931 INFO L475 AbstractCegarLoop]: Abstraction has 117 states and 139 transitions. [2019-09-08 01:41:40,931 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 01:41:40,931 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 139 transitions. [2019-09-08 01:41:40,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-09-08 01:41:40,933 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:41:40,933 INFO L399 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-09-08 01:41:40,934 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:41:40,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:41:40,934 INFO L82 PathProgramCache]: Analyzing trace with hash -1485208190, now seen corresponding path program 1 times [2019-09-08 01:41:40,935 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:41:40,935 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:41:40,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:41:40,936 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:41:40,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:41:40,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:41:41,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:41:41,204 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 01:41:41,204 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 01:41:41,205 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 01:41:41,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 01:41:41,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-09-08 01:41:41,205 INFO L87 Difference]: Start difference. First operand 117 states and 139 transitions. Second operand 8 states. [2019-09-08 01:41:41,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:41:41,796 INFO L93 Difference]: Finished difference Result 277 states and 322 transitions. [2019-09-08 01:41:41,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 01:41:41,797 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 31 [2019-09-08 01:41:41,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:41:41,799 INFO L225 Difference]: With dead ends: 277 [2019-09-08 01:41:41,799 INFO L226 Difference]: Without dead ends: 275 [2019-09-08 01:41:41,799 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2019-09-08 01:41:41,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2019-09-08 01:41:41,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 120. [2019-09-08 01:41:41,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-09-08 01:41:41,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 142 transitions. [2019-09-08 01:41:41,809 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 142 transitions. Word has length 31 [2019-09-08 01:41:41,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:41:41,809 INFO L475 AbstractCegarLoop]: Abstraction has 120 states and 142 transitions. [2019-09-08 01:41:41,809 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 01:41:41,809 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 142 transitions. [2019-09-08 01:41:41,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-09-08 01:41:41,810 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:41:41,810 INFO L399 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-09-08 01:41:41,811 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:41:41,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:41:41,811 INFO L82 PathProgramCache]: Analyzing trace with hash 1679328926, now seen corresponding path program 1 times [2019-09-08 01:41:41,811 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:41:41,811 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:41:41,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:41:41,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:41:41,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:41:41,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:41:41,861 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:41:41,861 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:41:41,861 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 01:41:41,889 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:41:41,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:41:41,927 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-08 01:41:41,934 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:41:42,011 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-09-08 01:41:42,011 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 01:41:42,024 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:41:42,029 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-09-08 01:41:42,029 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-08 01:41:42,038 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:41:42,038 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 01:41:42,039 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:18 [2019-09-08 01:41:42,063 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 01:41:42,066 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 21 treesize of output 20 [2019-09-08 01:41:42,067 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 01:41:42,078 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:41:42,082 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 01:41:42,084 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 21 treesize of output 20 [2019-09-08 01:41:42,085 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-08 01:41:42,101 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:41:42,102 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 01:41:42,102 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:36 [2019-09-08 01:41:42,155 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-09-08 01:41:42,155 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 01:41:42,162 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:41:42,166 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:41:42,167 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-09-08 01:41:42,168 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-08 01:41:42,171 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:41:42,171 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 01:41:42,171 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:43, output treesize:7 [2019-09-08 01:41:42,177 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 01:41:42,182 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:41:42,182 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 8 [2019-09-08 01:41:42,183 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 01:41:42,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 01:41:42,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-08 01:41:42,184 INFO L87 Difference]: Start difference. First operand 120 states and 142 transitions. Second operand 8 states. [2019-09-08 01:41:42,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:41:42,510 INFO L93 Difference]: Finished difference Result 224 states and 260 transitions. [2019-09-08 01:41:42,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 01:41:42,510 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2019-09-08 01:41:42,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:41:42,512 INFO L225 Difference]: With dead ends: 224 [2019-09-08 01:41:42,512 INFO L226 Difference]: Without dead ends: 162 [2019-09-08 01:41:42,513 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2019-09-08 01:41:42,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-09-08 01:41:42,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 122. [2019-09-08 01:41:42,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-09-08 01:41:42,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 142 transitions. [2019-09-08 01:41:42,522 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 142 transitions. Word has length 33 [2019-09-08 01:41:42,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:41:42,522 INFO L475 AbstractCegarLoop]: Abstraction has 122 states and 142 transitions. [2019-09-08 01:41:42,522 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 01:41:42,522 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 142 transitions. [2019-09-08 01:41:42,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-09-08 01:41:42,523 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:41:42,523 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:41:42,524 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:41:42,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:41:42,524 INFO L82 PathProgramCache]: Analyzing trace with hash 1814124928, now seen corresponding path program 1 times [2019-09-08 01:41:42,524 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:41:42,524 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:41:42,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:41:42,526 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:41:42,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:41:42,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:41:42,695 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:41:42,695 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 01:41:42,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 01:41:42,696 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 01:41:42,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 01:41:42,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-08 01:41:42,700 INFO L87 Difference]: Start difference. First operand 122 states and 142 transitions. Second operand 6 states. [2019-09-08 01:41:42,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:41:42,876 INFO L93 Difference]: Finished difference Result 165 states and 184 transitions. [2019-09-08 01:41:42,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 01:41:42,876 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2019-09-08 01:41:42,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:41:42,878 INFO L225 Difference]: With dead ends: 165 [2019-09-08 01:41:42,878 INFO L226 Difference]: Without dead ends: 145 [2019-09-08 01:41:42,878 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-08 01:41:42,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-09-08 01:41:42,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 121. [2019-09-08 01:41:42,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-09-08 01:41:42,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 140 transitions. [2019-09-08 01:41:42,887 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 140 transitions. Word has length 33 [2019-09-08 01:41:42,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:41:42,887 INFO L475 AbstractCegarLoop]: Abstraction has 121 states and 140 transitions. [2019-09-08 01:41:42,887 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 01:41:42,888 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 140 transitions. [2019-09-08 01:41:42,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-09-08 01:41:42,888 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:41:42,888 INFO L399 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, 1, 1] [2019-09-08 01:41:42,889 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:41:42,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:41:42,889 INFO L82 PathProgramCache]: Analyzing trace with hash 270360779, now seen corresponding path program 1 times [2019-09-08 01:41:42,889 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:41:42,889 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:41:42,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:41:42,891 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:41:42,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:41:42,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:41:42,980 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:41:42,980 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:41:42,981 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 01:41:42,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:41:43,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:41:43,033 INFO L256 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-08 01:41:43,035 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:41:43,046 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 13 treesize of output 9 [2019-09-08 01:41:43,046 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 01:41:43,054 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:41:43,054 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 01:41:43,054 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-09-08 01:41:43,134 INFO L392 ElimStorePlain]: Different costs {0=[|#memory_$Pointer$.base|], 2=[|#memory_$Pointer$.offset|]} [2019-09-08 01:41:43,137 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-09-08 01:41:43,137 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 01:41:43,147 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:41:43,152 INFO L341 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2019-09-08 01:41:43,153 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 10 [2019-09-08 01:41:43,154 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-08 01:41:43,158 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:41:43,158 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 01:41:43,159 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:7 [2019-09-08 01:41:43,163 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:41:43,168 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:41:43,169 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 10 [2019-09-08 01:41:43,169 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 01:41:43,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 01:41:43,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-09-08 01:41:43,170 INFO L87 Difference]: Start difference. First operand 121 states and 140 transitions. Second operand 10 states. [2019-09-08 01:41:43,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:41:43,480 INFO L93 Difference]: Finished difference Result 225 states and 253 transitions. [2019-09-08 01:41:43,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 01:41:43,481 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 36 [2019-09-08 01:41:43,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:41:43,482 INFO L225 Difference]: With dead ends: 225 [2019-09-08 01:41:43,483 INFO L226 Difference]: Without dead ends: 194 [2019-09-08 01:41:43,483 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-09-08 01:41:43,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2019-09-08 01:41:43,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 138. [2019-09-08 01:41:43,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2019-09-08 01:41:43,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 165 transitions. [2019-09-08 01:41:43,494 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 165 transitions. Word has length 36 [2019-09-08 01:41:43,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:41:43,494 INFO L475 AbstractCegarLoop]: Abstraction has 138 states and 165 transitions. [2019-09-08 01:41:43,495 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 01:41:43,495 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 165 transitions. [2019-09-08 01:41:43,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-09-08 01:41:43,495 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:41:43,496 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:41:43,496 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:41:43,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:41:43,497 INFO L82 PathProgramCache]: Analyzing trace with hash -620993698, now seen corresponding path program 1 times [2019-09-08 01:41:43,497 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:41:43,497 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:41:43,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:41:43,498 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:41:43,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:41:43,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:41:43,524 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:41:43,525 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 01:41:43,525 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 01:41:43,525 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 01:41:43,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 01:41:43,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 01:41:43,526 INFO L87 Difference]: Start difference. First operand 138 states and 165 transitions. Second operand 3 states. [2019-09-08 01:41:43,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:41:43,549 INFO L93 Difference]: Finished difference Result 297 states and 364 transitions. [2019-09-08 01:41:43,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 01:41:43,550 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-09-08 01:41:43,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:41:43,552 INFO L225 Difference]: With dead ends: 297 [2019-09-08 01:41:43,552 INFO L226 Difference]: Without dead ends: 215 [2019-09-08 01:41:43,553 INFO L628 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-09-08 01:41:43,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2019-09-08 01:41:43,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 175. [2019-09-08 01:41:43,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2019-09-08 01:41:43,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 211 transitions. [2019-09-08 01:41:43,565 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 211 transitions. Word has length 36 [2019-09-08 01:41:43,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:41:43,565 INFO L475 AbstractCegarLoop]: Abstraction has 175 states and 211 transitions. [2019-09-08 01:41:43,565 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 01:41:43,566 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 211 transitions. [2019-09-08 01:41:43,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-09-08 01:41:43,566 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:41:43,566 INFO L399 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, 1, 1, 1, 1, 1, 1] [2019-09-08 01:41:43,568 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:41:43,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:41:43,569 INFO L82 PathProgramCache]: Analyzing trace with hash -366933706, now seen corresponding path program 1 times [2019-09-08 01:41:43,569 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:41:43,569 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:41:43,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:41:43,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:41:43,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:41:43,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:41:44,028 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:41:44,029 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:41:44,029 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 01:41:44,049 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:41:44,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:41:44,077 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-08 01:41:44,080 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:41:44,090 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-09-08 01:41:44,090 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 01:41:44,094 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:41:44,095 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-08 01:41:44,095 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-09-08 01:41:44,130 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 13 treesize of output 9 [2019-09-08 01:41:44,130 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 01:41:44,139 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:41:44,145 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 13 treesize of output 9 [2019-09-08 01:41:44,145 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-08 01:41:44,153 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:41:44,154 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 01:41:44,154 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:27 [2019-09-08 01:41:44,228 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:41:44,229 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-09-08 01:41:44,229 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 01:41:44,255 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:41:44,265 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 01:41:44,269 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2019-09-08 01:41:44,270 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-08 01:41:44,291 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:41:44,297 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 01:41:44,299 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2019-09-08 01:41:44,299 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-08 01:41:44,316 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:41:44,316 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 01:41:44,317 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:86, output treesize:47 [2019-09-08 01:41:44,360 INFO L392 ElimStorePlain]: Different costs {6=[|v_#memory_$Pointer$.offset_39|], 12=[|v_#memory_$Pointer$.base_38|]} [2019-09-08 01:41:44,365 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 01:41:44,366 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 40 [2019-09-08 01:41:44,367 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 01:41:44,387 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:41:44,391 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 01:41:44,469 INFO L341 Elim1Store]: treesize reduction 46, result has 65.2 percent of original size [2019-09-08 01:41:44,470 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 74 treesize of output 124 [2019-09-08 01:41:44,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:41:44,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:44,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:44,476 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2019-09-08 01:41:44,529 INFO L567 ElimStorePlain]: treesize reduction 224, result has 26.1 percent of original size [2019-09-08 01:41:44,531 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-08 01:41:44,531 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:94, output treesize:78 [2019-09-08 01:41:44,663 INFO L392 ElimStorePlain]: Different costs {6=[|#memory_$Pointer$.offset|], 10=[|#memory_$Pointer$.base|]} [2019-09-08 01:41:44,669 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 01:41:44,671 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 13 [2019-09-08 01:41:44,671 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 01:41:44,684 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:41:44,740 INFO L341 Elim1Store]: treesize reduction 10, result has 84.1 percent of original size [2019-09-08 01:41:44,741 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 47 treesize of output 72 [2019-09-08 01:41:44,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:44,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:44,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:44,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:44,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:44,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:44,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:44,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:44,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:44,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:44,758 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-08 01:41:44,781 INFO L567 ElimStorePlain]: treesize reduction 52, result has 17.5 percent of original size [2019-09-08 01:41:44,782 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 01:41:44,782 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:85, output treesize:7 [2019-09-08 01:41:44,810 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:41:44,823 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:41:44,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 18 [2019-09-08 01:41:44,825 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-08 01:41:44,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-08 01:41:44,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=248, Unknown=1, NotChecked=0, Total=306 [2019-09-08 01:41:44,827 INFO L87 Difference]: Start difference. First operand 175 states and 211 transitions. Second operand 18 states. [2019-09-08 01:41:46,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:41:46,803 INFO L93 Difference]: Finished difference Result 556 states and 660 transitions. [2019-09-08 01:41:46,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-08 01:41:46,803 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 40 [2019-09-08 01:41:46,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:41:46,806 INFO L225 Difference]: With dead ends: 556 [2019-09-08 01:41:46,806 INFO L226 Difference]: Without dead ends: 464 [2019-09-08 01:41:46,808 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 320 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=359, Invalid=1119, Unknown=4, NotChecked=0, Total=1482 [2019-09-08 01:41:46,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2019-09-08 01:41:46,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 203. [2019-09-08 01:41:46,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2019-09-08 01:41:46,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 243 transitions. [2019-09-08 01:41:46,824 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 243 transitions. Word has length 40 [2019-09-08 01:41:46,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:41:46,825 INFO L475 AbstractCegarLoop]: Abstraction has 203 states and 243 transitions. [2019-09-08 01:41:46,825 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-08 01:41:46,825 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 243 transitions. [2019-09-08 01:41:46,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-09-08 01:41:46,825 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:41:46,826 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:41:46,830 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:41:46,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:41:46,830 INFO L82 PathProgramCache]: Analyzing trace with hash 1717014481, now seen corresponding path program 1 times [2019-09-08 01:41:46,830 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:41:46,831 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:41:46,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:41:46,832 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:41:46,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:41:46,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-09-08 01:41:46,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-09-08 01:41:46,907 INFO L466 BasicCegarLoop]: Counterexample might be feasible [2019-09-08 01:41:46,951 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.09 01:41:46 BoogieIcfgContainer [2019-09-08 01:41:46,951 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-08 01:41:46,953 INFO L168 Benchmark]: Toolchain (without parser) took 10682.11 ms. Allocated memory was 133.2 MB in the beginning and 351.3 MB in the end (delta: 218.1 MB). Free memory was 87.8 MB in the beginning and 154.3 MB in the end (delta: -66.5 MB). Peak memory consumption was 151.7 MB. Max. memory is 7.1 GB. [2019-09-08 01:41:46,953 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 133.2 MB. Free memory was 107.6 MB in the beginning and 107.4 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-08 01:41:46,954 INFO L168 Benchmark]: CACSL2BoogieTranslator took 609.29 ms. Allocated memory was 133.2 MB in the beginning and 200.3 MB in the end (delta: 67.1 MB). Free memory was 87.6 MB in the beginning and 164.5 MB in the end (delta: -76.9 MB). Peak memory consumption was 27.1 MB. Max. memory is 7.1 GB. [2019-09-08 01:41:46,955 INFO L168 Benchmark]: Boogie Preprocessor took 92.30 ms. Allocated memory is still 200.3 MB. Free memory was 164.5 MB in the beginning and 161.0 MB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 7.1 GB. [2019-09-08 01:41:46,955 INFO L168 Benchmark]: RCFGBuilder took 754.25 ms. Allocated memory is still 200.3 MB. Free memory was 161.0 MB in the beginning and 107.1 MB in the end (delta: 53.9 MB). Peak memory consumption was 53.9 MB. Max. memory is 7.1 GB. [2019-09-08 01:41:46,956 INFO L168 Benchmark]: TraceAbstraction took 9221.94 ms. Allocated memory was 200.3 MB in the beginning and 351.3 MB in the end (delta: 151.0 MB). Free memory was 106.5 MB in the beginning and 154.3 MB in the end (delta: -47.8 MB). Peak memory consumption was 103.2 MB. Max. memory is 7.1 GB. [2019-09-08 01:41:46,959 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 133.2 MB. Free memory was 107.6 MB in the beginning and 107.4 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 609.29 ms. Allocated memory was 133.2 MB in the beginning and 200.3 MB in the end (delta: 67.1 MB). Free memory was 87.6 MB in the beginning and 164.5 MB in the end (delta: -76.9 MB). Peak memory consumption was 27.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 92.30 ms. Allocated memory is still 200.3 MB. Free memory was 164.5 MB in the beginning and 161.0 MB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 754.25 ms. Allocated memory is still 200.3 MB. Free memory was 161.0 MB in the beginning and 107.1 MB in the end (delta: 53.9 MB). Peak memory consumption was 53.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 9221.94 ms. Allocated memory was 200.3 MB in the beginning and 351.3 MB in the end (delta: 151.0 MB). Free memory was 106.5 MB in the beginning and 154.3 MB in the end (delta: -47.8 MB). Peak memory consumption was 103.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1025]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L991] SLL* list = malloc(sizeof(SLL)); [L992] list->next = ((void*)0) VAL [list={2:0}, malloc(sizeof(SLL))={2:0}] [L993] COND FALSE !(!(list != ((void*)0))) VAL [list={2:0}, malloc(sizeof(SLL))={2:0}] [L993] COND FALSE !(__VERIFIER_nondet_int()) [L993] list->inner = malloc(sizeof(SLL)) [L993] EXPR list->inner [L993] list->inner->next = ((void*)0) [L993] EXPR list->inner [L993] list->inner->inner = ((void*)0) [L993] EXPR list->inner [L993] EXPR list->inner != ((void*)0) || list->inner == ((void*)0) VAL [list={2:0}, list->inner={1:0}, list->inner != ((void*)0) || list->inner == ((void*)0)=1, malloc(sizeof(SLL))={1:0}, malloc(sizeof(SLL))={2:0}] [L993] COND FALSE !(!(list->inner != ((void*)0) || list->inner == ((void*)0))) [L995] SLL* end = list; VAL [end={2:0}, list={2:0}, malloc(sizeof(SLL))={1:0}, malloc(sizeof(SLL))={2:0}] [L998] COND FALSE !(__VERIFIER_nondet_int()) [L1008] end = ((void*)0) [L1009] end = list VAL [end={2:0}, list={2:0}, malloc(sizeof(SLL))={1:0}, malloc(sizeof(SLL))={2:0}] [L1012] COND FALSE !(!(((void*)0) != end)) VAL [end={2:0}, list={2:0}, malloc(sizeof(SLL))={1:0}, malloc(sizeof(SLL))={2:0}] [L1014] COND TRUE ((void*)0) != end [L1016] int len = 0; [L1017] EXPR end->inner [L1017] SLL* inner = end->inner; [L1018] COND TRUE ((void*)0) != inner VAL [end={2:0}, inner={1:0}, len=0, list={2:0}, malloc(sizeof(SLL))={1:0}, malloc(sizeof(SLL))={2:0}] [L1020] COND TRUE len == 0 [L1021] len = 1 VAL [end={2:0}, inner={1:0}, len=1, list={2:0}, malloc(sizeof(SLL))={1:0}, malloc(sizeof(SLL))={2:0}] [L1024] COND FALSE !(!(((void*)0) != inner)) VAL [end={2:0}, inner={1:0}, len=1, list={2:0}, malloc(sizeof(SLL))={1:0}, malloc(sizeof(SLL))={2:0}] [L1025] EXPR inner->inner VAL [end={2:0}, inner={1:0}, inner->inner={0:0}, len=1, list={2:0}, malloc(sizeof(SLL))={1:0}, malloc(sizeof(SLL))={2:0}] [L1025] COND FALSE !(!(((void*)0) == inner->inner)) [L1026] EXPR inner->next VAL [end={2:0}, inner={1:0}, inner->next={0:0}, len=1, list={2:0}, malloc(sizeof(SLL))={1:0}, malloc(sizeof(SLL))={2:0}] [L1026] COND FALSE !(!(((void*)0) == inner->next)) [L1027] EXPR inner->inner [L1027] inner = inner->inner [L1028] COND TRUE len == 1 [L1029] EXPR inner->inner [L1029] inner = inner->inner [L1018] COND TRUE ((void*)0) != inner VAL [end={2:0}, inner={11:1}, len=1, list={2:0}, malloc(sizeof(SLL))={1:0}, malloc(sizeof(SLL))={2:0}] [L1020] COND FALSE !(len == 0) [L1023] len = 2 VAL [end={2:0}, inner={11:1}, len=2, list={2:0}, malloc(sizeof(SLL))={1:0}, malloc(sizeof(SLL))={2:0}] [L1024] COND FALSE !(!(((void*)0) != inner)) VAL [end={2:0}, inner={11:1}, len=2, list={2:0}, malloc(sizeof(SLL))={1:0}, malloc(sizeof(SLL))={2:0}] [L1025] EXPR inner->inner VAL [end={2:0}, inner={11:1}, inner->inner={12:10}, len=2, list={2:0}, malloc(sizeof(SLL))={1:0}, malloc(sizeof(SLL))={2:0}] [L1025] COND TRUE !(((void*)0) == inner->inner) [L1025] __VERIFIER_error() VAL [end={2:0}, inner={11:1}, len=2, list={2:0}, malloc(sizeof(SLL))={1:0}, malloc(sizeof(SLL))={2:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 89 locations, 13 error locations. UNSAFE Result, 9.1s OverallTime, 20 OverallIterations, 2 TraceHistogramMax, 5.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1501 SDtfs, 3040 SDslu, 3121 SDs, 0 SdLazy, 1739 SolverSat, 323 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 257 GetRequests, 136 SyntacticMatches, 5 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 367 ImplicationChecksByTransitivity, 2.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=203occurred in iteration=19, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 19 MinimizatonAttempts, 916 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 653 NumberOfCodeBlocks, 653 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 591 ConstructedInterpolants, 10 QuantifiedInterpolants, 208131 SizeOfPredicates, 29 NumberOfNonLiveVariables, 380 ConjunctsInSsa, 69 ConjunctsInUnsatCore, 22 InterpolantComputations, 16 PerfectInterpolantSequences, 8/18 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...