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/list-simple/sll2n_insert_equal.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 11:03:00,397 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 11:03:00,399 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 11:03:00,412 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 11:03:00,412 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 11:03:00,413 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 11:03:00,414 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 11:03:00,416 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 11:03:00,418 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 11:03:00,419 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 11:03:00,420 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 11:03:00,421 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 11:03:00,421 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 11:03:00,422 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 11:03:00,423 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 11:03:00,424 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 11:03:00,425 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 11:03:00,426 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 11:03:00,427 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 11:03:00,429 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 11:03:00,430 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 11:03:00,431 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 11:03:00,432 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 11:03:00,433 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 11:03:00,435 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 11:03:00,436 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 11:03:00,436 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 11:03:00,437 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 11:03:00,437 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 11:03:00,438 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 11:03:00,438 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 11:03:00,439 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 11:03:00,440 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 11:03:00,440 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 11:03:00,441 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 11:03:00,441 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 11:03:00,442 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 11:03:00,442 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 11:03:00,443 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 11:03:00,443 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 11:03:00,444 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 11:03:00,445 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-02 11:03:00,458 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 11:03:00,459 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 11:03:00,460 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 11:03:00,460 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 11:03:00,460 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 11:03:00,461 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 11:03:00,461 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 11:03:00,461 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 11:03:00,461 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 11:03:00,461 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 11:03:00,462 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 11:03:00,462 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 11:03:00,462 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 11:03:00,462 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 11:03:00,462 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 11:03:00,463 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 11:03:00,463 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 11:03:00,463 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 11:03:00,463 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 11:03:00,464 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 11:03:00,464 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 11:03:00,464 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 11:03:00,464 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 11:03:00,464 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 11:03:00,465 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 11:03:00,465 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 11:03:00,465 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 11:03:00,465 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 11:03:00,466 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 11:03:00,494 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 11:03:00,507 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 11:03:00,510 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 11:03:00,512 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 11:03:00,512 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 11:03:00,513 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-simple/sll2n_insert_equal.i [2019-10-02 11:03:00,587 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e146cea87/0391156d014640bda6514f6beaab1bdb/FLAG1f403cef2 [2019-10-02 11:03:01,070 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 11:03:01,071 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/sll2n_insert_equal.i [2019-10-02 11:03:01,085 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e146cea87/0391156d014640bda6514f6beaab1bdb/FLAG1f403cef2 [2019-10-02 11:03:01,426 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e146cea87/0391156d014640bda6514f6beaab1bdb [2019-10-02 11:03:01,437 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 11:03:01,439 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 11:03:01,439 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 11:03:01,439 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 11:03:01,442 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 11:03:01,443 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 11:03:01" (1/1) ... [2019-10-02 11:03:01,445 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f6ad32f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:03:01, skipping insertion in model container [2019-10-02 11:03:01,446 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 11:03:01" (1/1) ... [2019-10-02 11:03:01,453 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 11:03:01,499 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 11:03:01,997 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 11:03:02,010 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 11:03:02,090 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 11:03:02,148 INFO L192 MainTranslator]: Completed translation [2019-10-02 11:03:02,148 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:03:02 WrapperNode [2019-10-02 11:03:02,149 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 11:03:02,149 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 11:03:02,149 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 11:03:02,150 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 11:03:02,164 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:03:02" (1/1) ... [2019-10-02 11:03:02,165 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:03:02" (1/1) ... [2019-10-02 11:03:02,196 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:03:02" (1/1) ... [2019-10-02 11:03:02,197 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:03:02" (1/1) ... [2019-10-02 11:03:02,216 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:03:02" (1/1) ... [2019-10-02 11:03:02,222 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:03:02" (1/1) ... [2019-10-02 11:03:02,226 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:03:02" (1/1) ... [2019-10-02 11:03:02,233 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 11:03:02,233 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 11:03:02,233 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 11:03:02,234 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 11:03:02,235 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:03:02" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 11:03:02,298 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 11:03:02,298 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 11:03:02,298 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-10-02 11:03:02,298 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-10-02 11:03:02,299 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2019-10-02 11:03:02,299 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2019-10-02 11:03:02,299 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_create [2019-10-02 11:03:02,299 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_destroy [2019-10-02 11:03:02,299 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_insert [2019-10-02 11:03:02,299 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 11:03:02,300 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 11:03:02,300 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-10-02 11:03:02,300 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-10-02 11:03:02,300 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-10-02 11:03:02,300 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-10-02 11:03:02,301 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-10-02 11:03:02,301 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-10-02 11:03:02,301 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-10-02 11:03:02,301 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-10-02 11:03:02,301 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-10-02 11:03:02,301 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-10-02 11:03:02,302 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-10-02 11:03:02,302 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-10-02 11:03:02,302 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-10-02 11:03:02,302 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-10-02 11:03:02,302 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-10-02 11:03:02,303 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-10-02 11:03:02,303 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-10-02 11:03:02,303 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-10-02 11:03:02,303 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-10-02 11:03:02,303 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-10-02 11:03:02,303 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-10-02 11:03:02,303 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-10-02 11:03:02,304 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-10-02 11:03:02,304 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-10-02 11:03:02,304 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-10-02 11:03:02,304 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-10-02 11:03:02,304 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-10-02 11:03:02,305 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-10-02 11:03:02,306 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-10-02 11:03:02,306 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-10-02 11:03:02,306 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-10-02 11:03:02,306 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-10-02 11:03:02,306 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-10-02 11:03:02,306 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-10-02 11:03:02,307 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-10-02 11:03:02,307 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-10-02 11:03:02,307 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-10-02 11:03:02,308 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-10-02 11:03:02,308 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-10-02 11:03:02,308 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-10-02 11:03:02,309 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-10-02 11:03:02,309 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-10-02 11:03:02,309 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-10-02 11:03:02,309 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-10-02 11:03:02,309 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-10-02 11:03:02,309 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-10-02 11:03:02,310 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-10-02 11:03:02,310 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-10-02 11:03:02,310 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-10-02 11:03:02,310 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-10-02 11:03:02,310 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-10-02 11:03:02,310 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-10-02 11:03:02,311 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-02 11:03:02,311 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-10-02 11:03:02,311 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-10-02 11:03:02,311 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-02 11:03:02,311 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-10-02 11:03:02,311 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-10-02 11:03:02,312 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-10-02 11:03:02,314 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-10-02 11:03:02,314 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-10-02 11:03:02,314 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-10-02 11:03:02,314 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-10-02 11:03:02,314 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-10-02 11:03:02,315 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-10-02 11:03:02,315 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-02 11:03:02,315 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-10-02 11:03:02,315 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-10-02 11:03:02,317 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-10-02 11:03:02,317 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-10-02 11:03:02,317 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-10-02 11:03:02,317 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-10-02 11:03:02,317 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-10-02 11:03:02,317 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-10-02 11:03:02,317 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-10-02 11:03:02,318 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-10-02 11:03:02,318 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-10-02 11:03:02,318 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-10-02 11:03:02,319 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-10-02 11:03:02,319 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-10-02 11:03:02,319 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-10-02 11:03:02,319 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-10-02 11:03:02,319 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-10-02 11:03:02,320 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-10-02 11:03:02,320 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-10-02 11:03:02,320 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-10-02 11:03:02,320 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-10-02 11:03:02,321 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-10-02 11:03:02,321 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-10-02 11:03:02,322 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-10-02 11:03:02,322 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-10-02 11:03:02,322 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-10-02 11:03:02,322 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-10-02 11:03:02,322 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-10-02 11:03:02,322 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-10-02 11:03:02,322 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-10-02 11:03:02,323 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-10-02 11:03:02,323 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-10-02 11:03:02,323 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-10-02 11:03:02,323 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-10-02 11:03:02,323 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-10-02 11:03:02,323 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-10-02 11:03:02,324 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-10-02 11:03:02,324 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-10-02 11:03:02,324 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-10-02 11:03:02,324 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2019-10-02 11:03:02,325 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2019-10-02 11:03:02,325 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-02 11:03:02,325 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-02 11:03:02,325 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-02 11:03:02,326 INFO L130 BoogieDeclarations]: Found specification of procedure sll_create [2019-10-02 11:03:02,326 INFO L130 BoogieDeclarations]: Found specification of procedure sll_destroy [2019-10-02 11:03:02,327 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-02 11:03:02,327 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-02 11:03:02,327 INFO L130 BoogieDeclarations]: Found specification of procedure sll_insert [2019-10-02 11:03:02,327 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 11:03:02,327 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-02 11:03:02,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-10-02 11:03:02,328 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-02 11:03:02,328 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 11:03:02,328 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 11:03:02,702 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2019-10-02 11:03:02,915 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 11:03:02,915 INFO L283 CfgBuilder]: Removed 4 assume(true) statements. [2019-10-02 11:03:02,916 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 11:03:02 BoogieIcfgContainer [2019-10-02 11:03:02,917 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 11:03:02,918 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 11:03:02,918 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 11:03:02,921 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 11:03:02,921 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 11:03:01" (1/3) ... [2019-10-02 11:03:02,922 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56d3fae5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 11:03:02, skipping insertion in model container [2019-10-02 11:03:02,922 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:03:02" (2/3) ... [2019-10-02 11:03:02,923 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56d3fae5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 11:03:02, skipping insertion in model container [2019-10-02 11:03:02,923 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 11:03:02" (3/3) ... [2019-10-02 11:03:02,925 INFO L109 eAbstractionObserver]: Analyzing ICFG sll2n_insert_equal.i [2019-10-02 11:03:02,935 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 11:03:02,943 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 11:03:02,960 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 11:03:02,983 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 11:03:02,984 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 11:03:02,984 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 11:03:02,984 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 11:03:02,984 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 11:03:02,985 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 11:03:02,985 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 11:03:02,985 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 11:03:02,985 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 11:03:03,003 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states. [2019-10-02 11:03:03,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-02 11:03:03,011 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:03:03,012 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:03:03,014 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:03:03,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:03:03,020 INFO L82 PathProgramCache]: Analyzing trace with hash 1950085846, now seen corresponding path program 1 times [2019-10-02 11:03:03,022 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:03:03,023 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:03:03,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:03:03,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:03:03,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:03:03,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:03:03,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:03:03,200 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:03:03,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-02 11:03:03,205 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-02 11:03:03,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-02 11:03:03,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-02 11:03:03,223 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 2 states. [2019-10-02 11:03:03,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:03:03,264 INFO L93 Difference]: Finished difference Result 86 states and 109 transitions. [2019-10-02 11:03:03,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-02 11:03:03,265 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 31 [2019-10-02 11:03:03,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:03:03,273 INFO L225 Difference]: With dead ends: 86 [2019-10-02 11:03:03,273 INFO L226 Difference]: Without dead ends: 36 [2019-10-02 11:03:03,276 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-02 11:03:03,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-10-02 11:03:03,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-10-02 11:03:03,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-10-02 11:03:03,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2019-10-02 11:03:03,314 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 31 [2019-10-02 11:03:03,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:03:03,314 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2019-10-02 11:03:03,314 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-02 11:03:03,314 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2019-10-02 11:03:03,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-02 11:03:03,317 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:03:03,317 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:03:03,317 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:03:03,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:03:03,318 INFO L82 PathProgramCache]: Analyzing trace with hash -778212150, now seen corresponding path program 1 times [2019-10-02 11:03:03,318 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:03:03,319 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:03:03,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:03:03,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:03:03,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:03:03,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:03:03,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:03:03,484 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:03:03,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:03:03,486 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:03:03,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:03:03,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:03:03,489 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. Second operand 3 states. [2019-10-02 11:03:03,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:03:03,509 INFO L93 Difference]: Finished difference Result 50 states and 58 transitions. [2019-10-02 11:03:03,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:03:03,510 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-10-02 11:03:03,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:03:03,513 INFO L225 Difference]: With dead ends: 50 [2019-10-02 11:03:03,513 INFO L226 Difference]: Without dead ends: 41 [2019-10-02 11:03:03,514 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:03:03,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-10-02 11:03:03,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 38. [2019-10-02 11:03:03,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-10-02 11:03:03,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 44 transitions. [2019-10-02 11:03:03,525 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 44 transitions. Word has length 31 [2019-10-02 11:03:03,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:03:03,529 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 44 transitions. [2019-10-02 11:03:03,530 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:03:03,530 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions. [2019-10-02 11:03:03,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-02 11:03:03,552 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:03:03,552 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:03:03,552 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:03:03,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:03:03,553 INFO L82 PathProgramCache]: Analyzing trace with hash -1587558776, now seen corresponding path program 1 times [2019-10-02 11:03:03,553 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:03:03,553 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:03:03,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:03:03,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:03:03,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:03:03,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:03:03,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:03:03,761 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:03:03,762 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-02 11:03:03,762 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 11:03:03,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 11:03:03,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-10-02 11:03:03,763 INFO L87 Difference]: Start difference. First operand 38 states and 44 transitions. Second operand 8 states. [2019-10-02 11:03:03,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:03:03,890 INFO L93 Difference]: Finished difference Result 71 states and 83 transitions. [2019-10-02 11:03:03,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 11:03:03,891 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 31 [2019-10-02 11:03:03,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:03:03,892 INFO L225 Difference]: With dead ends: 71 [2019-10-02 11:03:03,892 INFO L226 Difference]: Without dead ends: 41 [2019-10-02 11:03:03,893 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-10-02 11:03:03,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-10-02 11:03:03,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 38. [2019-10-02 11:03:03,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-10-02 11:03:03,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2019-10-02 11:03:03,901 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 43 transitions. Word has length 31 [2019-10-02 11:03:03,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:03:03,901 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 43 transitions. [2019-10-02 11:03:03,901 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 11:03:03,901 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2019-10-02 11:03:03,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-10-02 11:03:03,903 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:03:03,903 INFO L411 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, 1] [2019-10-02 11:03:03,903 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:03:03,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:03:03,904 INFO L82 PathProgramCache]: Analyzing trace with hash 1489805475, now seen corresponding path program 1 times [2019-10-02 11:03:03,904 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:03:03,904 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:03:03,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:03:03,908 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:03:03,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:03:03,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:03:04,015 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-02 11:03:04,016 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:03:04,016 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:03:04,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:03:04,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:03:04,189 INFO L256 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-02 11:03:04,199 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:03:04,265 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-02 11:03:04,269 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:03:04,270 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2019-10-02 11:03:04,277 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 11:03:04,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 11:03:04,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-02 11:03:04,280 INFO L87 Difference]: Start difference. First operand 38 states and 43 transitions. Second operand 6 states. [2019-10-02 11:03:04,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:03:04,354 INFO L93 Difference]: Finished difference Result 70 states and 81 transitions. [2019-10-02 11:03:04,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 11:03:04,355 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2019-10-02 11:03:04,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:03:04,356 INFO L225 Difference]: With dead ends: 70 [2019-10-02 11:03:04,357 INFO L226 Difference]: Without dead ends: 45 [2019-10-02 11:03:04,357 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-10-02 11:03:04,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-10-02 11:03:04,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 42. [2019-10-02 11:03:04,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-10-02 11:03:04,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 48 transitions. [2019-10-02 11:03:04,365 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 48 transitions. Word has length 41 [2019-10-02 11:03:04,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:03:04,365 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 48 transitions. [2019-10-02 11:03:04,365 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 11:03:04,365 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2019-10-02 11:03:04,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-10-02 11:03:04,367 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:03:04,367 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:03:04,367 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:03:04,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:03:04,368 INFO L82 PathProgramCache]: Analyzing trace with hash 341969372, now seen corresponding path program 2 times [2019-10-02 11:03:04,368 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:03:04,368 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:03:04,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:03:04,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:03:04,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:03:04,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:03:05,592 WARN L191 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 49 [2019-10-02 11:03:05,883 WARN L191 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2019-10-02 11:03:06,168 WARN L191 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 65 [2019-10-02 11:03:06,565 WARN L191 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 70 [2019-10-02 11:03:06,970 WARN L191 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 63 [2019-10-02 11:03:07,129 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 10 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-02 11:03:07,132 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:03:07,133 INFO L224 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) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:03:07,211 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 11:03:07,304 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 11:03:07,305 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:03:07,310 INFO L256 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 109 conjunts are in the unsatisfiable core [2019-10-02 11:03:07,318 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:03:07,413 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-02 11:03:07,414 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:03:07,434 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:03:07,435 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-02 11:03:07,435 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-10-02 11:03:07,466 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-10-02 11:03:07,466 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:03:07,476 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:03:07,476 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 11:03:07,476 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2019-10-02 11:03:07,492 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 23 treesize of output 11 [2019-10-02 11:03:07,493 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:03:07,500 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:03:07,501 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 11:03:07,501 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:21 [2019-10-02 11:03:07,680 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2019-10-02 11:03:07,681 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:03:07,698 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:03:07,709 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-10-02 11:03:07,709 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 11:03:07,720 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:03:07,733 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 9 treesize of output 5 [2019-10-02 11:03:07,733 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-02 11:03:07,751 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:03:07,752 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-10-02 11:03:07,752 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:48, output treesize:13 [2019-10-02 11:03:07,837 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 11:03:07,854 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:03:07,856 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-10-02 11:03:07,856 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:81, output treesize:67 [2019-10-02 11:03:11,987 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 42 [2019-10-02 11:03:16,090 WARN L191 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 48 [2019-10-02 11:03:16,325 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 11:03:16,366 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:03:16,371 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 11:03:16,413 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:03:16,415 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-10-02 11:03:16,415 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:166, output treesize:321 [2019-10-02 11:03:20,595 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 11:03:20,673 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:03:20,674 INFO L496 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 1 dim-2 vars, End of recursive call: 10 dim-0 vars, and 1 xjuncts. [2019-10-02 11:03:20,675 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 10 variables, input treesize:534, output treesize:578 [2019-10-02 11:03:37,891 WARN L191 SmtUtils]: Spent 166.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2019-10-02 11:03:37,943 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:03:37,944 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 15 treesize of output 19 [2019-10-02 11:03:37,944 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:03:38,082 WARN L191 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2019-10-02 11:03:38,082 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:03:38,086 INFO L392 ElimStorePlain]: Different costs {8=[|v_#memory_int_BEFORE_CALL_4|], 20=[|v_#memory_$Pointer$.base_BEFORE_CALL_4|, |v_#memory_$Pointer$.offset_BEFORE_CALL_4|]} [2019-10-02 11:03:38,098 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-02 11:03:38,102 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:03:38,105 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:03:38,145 INFO L341 Elim1Store]: treesize reduction 44, result has 41.3 percent of original size [2019-10-02 11:03:38,146 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 205 treesize of output 88 [2019-10-02 11:03:38,147 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 11:03:38,259 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2019-10-02 11:03:38,260 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:03:38,264 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:03:38,273 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:03:38,274 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:03:38,509 WARN L191 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 65 [2019-10-02 11:03:38,510 INFO L341 Elim1Store]: treesize reduction 86, result has 77.5 percent of original size [2019-10-02 11:03:38,511 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 2 new quantified variables, introduced 4 case distinctions, treesize of input 329 treesize of output 470 [2019-10-02 11:03:38,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 11:03:38,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:03:38,518 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-02 11:03:38,986 WARN L191 SmtUtils]: Spent 466.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 80 [2019-10-02 11:03:38,986 INFO L567 ElimStorePlain]: treesize reduction 302, result has 67.4 percent of original size [2019-10-02 11:03:38,989 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:03:38,993 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:03:38,995 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:03:39,212 WARN L191 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 59 [2019-10-02 11:03:39,212 INFO L341 Elim1Store]: treesize reduction 56, result has 76.0 percent of original size [2019-10-02 11:03:39,213 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 446 treesize of output 392 [2019-10-02 11:03:39,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 11:03:39,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:03:39,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:03:39,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 11:03:39,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:03:39,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:03:39,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 11:03:39,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 11:03:39,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:03:39,227 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:03:39,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 11:03:39,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:03:39,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:03:39,233 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:03:39,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:03:39,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 11:03:39,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:03:39,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:03:39,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:03:39,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:03:39,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 11:03:39,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:03:39,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:03:39,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 11:03:39,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 11:03:39,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:03:39,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:03:39,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 11:03:39,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:03:39,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:03:39,286 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 6 xjuncts. [2019-10-02 11:03:40,013 WARN L191 SmtUtils]: Spent 725.00 ms on a formula simplification. DAG size of input: 193 DAG size of output: 83 [2019-10-02 11:03:40,014 INFO L567 ElimStorePlain]: treesize reduction 11534, result has 4.0 percent of original size [2019-10-02 11:03:40,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:03:40,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:03:40,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:03:40,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:03:40,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:03:40,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:03:40,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:03:40,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:03:40,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 11:03:40,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:03:40,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 11:03:40,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:03:40,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:03:40,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 11:03:40,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:03:40,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:03:40,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 11:03:40,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:03:40,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:03:40,040 INFO L496 ElimStorePlain]: Start of recursive call 1: 10 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 11:03:40,041 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 14 variables, input treesize:624, output treesize:945 [2019-10-02 11:03:40,265 INFO L392 ElimStorePlain]: Different costs {0=[|#memory_$Pointer$.offset|], 2=[|#memory_$Pointer$.base|]} [2019-10-02 11:03:40,274 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 63 treesize of output 43 [2019-10-02 11:03:40,275 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:03:40,291 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:03:40,295 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:03:40,296 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:03:40,296 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 28 [2019-10-02 11:03:40,297 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 11:03:40,305 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:03:40,306 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 11:03:40,306 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:90, output treesize:14 [2019-10-02 11:03:40,410 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-02 11:03:40,412 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:03:40,412 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 15 treesize of output 10 [2019-10-02 11:03:40,413 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:03:40,418 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:03:40,419 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 11:03:40,419 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:21, output treesize:3 [2019-10-02 11:03:40,437 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 10 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (3)] Exception during sending of exit command (exit): Stream closed [2019-10-02 11:03:40,451 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:03:40,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 35 [2019-10-02 11:03:40,452 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-10-02 11:03:40,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-10-02 11:03:40,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=1072, Unknown=12, NotChecked=0, Total=1190 [2019-10-02 11:03:40,454 INFO L87 Difference]: Start difference. First operand 42 states and 48 transitions. Second operand 35 states. [2019-10-02 11:03:40,901 WARN L191 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2019-10-02 11:03:53,310 WARN L191 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 57 [2019-10-02 11:03:57,645 WARN L191 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2019-10-02 11:04:27,810 WARN L191 SmtUtils]: Spent 341.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 87 [2019-10-02 11:04:32,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:04:32,565 INFO L93 Difference]: Finished difference Result 60 states and 69 transitions. [2019-10-02 11:04:32,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-10-02 11:04:32,567 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 50 [2019-10-02 11:04:32,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:04:32,569 INFO L225 Difference]: With dead ends: 60 [2019-10-02 11:04:32,569 INFO L226 Difference]: Without dead ends: 58 [2019-10-02 11:04:32,570 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 37 SyntacticMatches, 4 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 382 ImplicationChecksByTransitivity, 40.0s TimeCoverageRelationStatistics Valid=179, Invalid=1969, Unknown=14, NotChecked=0, Total=2162 [2019-10-02 11:04:32,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-10-02 11:04:32,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 50. [2019-10-02 11:04:32,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-10-02 11:04:32,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 59 transitions. [2019-10-02 11:04:32,581 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 59 transitions. Word has length 50 [2019-10-02 11:04:32,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:04:32,581 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 59 transitions. [2019-10-02 11:04:32,581 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-10-02 11:04:32,581 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 59 transitions. [2019-10-02 11:04:32,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-10-02 11:04:32,583 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:04:32,583 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:04:32,583 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:04:32,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:04:32,584 INFO L82 PathProgramCache]: Analyzing trace with hash 341967698, now seen corresponding path program 1 times [2019-10-02 11:04:32,584 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:04:32,584 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:04:32,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:04:32,587 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:04:32,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:04:32,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:04:33,072 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-02 11:04:33,073 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:04:33,073 INFO L224 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) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:04:33,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:04:33,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:04:33,202 INFO L256 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 44 conjunts are in the unsatisfiable core [2019-10-02 11:04:33,214 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:04:33,397 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 8 treesize of output 4 [2019-10-02 11:04:33,398 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:04:33,402 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:04:33,403 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 11:04:33,403 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:17, output treesize:3 [2019-10-02 11:04:33,645 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 11:04:33,655 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:04:33,656 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-10-02 11:04:33,656 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:41, output treesize:45 [2019-10-02 11:04:35,865 WARN L191 SmtUtils]: Spent 1.13 s on a formula simplification that was a NOOP. DAG size: 25 [2019-10-02 11:04:37,881 WARN L860 $PredicateComparison]: unable to prove that (exists ((sll_insert_~new_node~0.base Int) (sll_insert_~snd_to_last~0.offset Int) (sll_insert_~last~0.base Int) (sll_insert_~snd_to_last~0.base Int) (sll_insert_~new_node~0.offset Int) (v_DerPreprocessor_5 Int)) (and (<= (+ |c_#StackHeapBarrier| 1) sll_insert_~new_node~0.base) (= (let ((.cse0 (let ((.cse1 (store |c_old(#memory_$Pointer$.base)| sll_insert_~new_node~0.base (store (store (select |c_old(#memory_$Pointer$.base)| sll_insert_~new_node~0.base) 4 0) 0 v_DerPreprocessor_5)))) (store .cse1 sll_insert_~snd_to_last~0.base (store (select .cse1 sll_insert_~snd_to_last~0.base) (+ sll_insert_~snd_to_last~0.offset 4) sll_insert_~new_node~0.base))))) (store .cse0 sll_insert_~new_node~0.base (store (select .cse0 sll_insert_~new_node~0.base) (+ sll_insert_~new_node~0.offset 4) sll_insert_~last~0.base))) |c_#memory_$Pointer$.base|) (not (= 0 sll_insert_~new_node~0.base)))) is different from true [2019-10-02 11:04:37,891 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:04:38,059 WARN L191 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2019-10-02 11:04:38,060 INFO L341 Elim1Store]: treesize reduction 46, result has 76.6 percent of original size [2019-10-02 11:04:38,060 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 86 treesize of output 164 [2019-10-02 11:04:38,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:04:38,063 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:04:38,172 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 45 [2019-10-02 11:04:38,173 INFO L567 ElimStorePlain]: treesize reduction 78, result has 54.1 percent of original size [2019-10-02 11:04:38,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 11:04:38,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:04:38,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:04:38,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 11:04:38,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:04:38,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:04:38,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:04:38,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:04:38,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:04:38,185 INFO L496 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 11:04:38,186 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:95, output treesize:8 [2019-10-02 11:04:38,194 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 16 treesize of output 8 [2019-10-02 11:04:38,195 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:04:38,196 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:04:38,196 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 11:04:38,197 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:16, output treesize:4 [2019-10-02 11:04:38,204 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 17 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-02 11:04:38,212 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:04:38,212 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20] total 35 [2019-10-02 11:04:38,214 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-10-02 11:04:38,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-10-02 11:04:38,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=1020, Unknown=2, NotChecked=64, Total=1190 [2019-10-02 11:04:38,215 INFO L87 Difference]: Start difference. First operand 50 states and 59 transitions. Second operand 35 states. [2019-10-02 11:04:54,741 WARN L191 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 52 DAG size of output: 37 [2019-10-02 11:05:07,004 WARN L191 SmtUtils]: Spent 4.09 s on a formula simplification. DAG size of input: 56 DAG size of output: 50 [2019-10-02 11:05:09,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:05:09,192 INFO L93 Difference]: Finished difference Result 71 states and 82 transitions. [2019-10-02 11:05:09,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-10-02 11:05:09,195 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 50 [2019-10-02 11:05:09,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:05:09,197 INFO L225 Difference]: With dead ends: 71 [2019-10-02 11:05:09,197 INFO L226 Difference]: Without dead ends: 68 [2019-10-02 11:05:09,198 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 400 ImplicationChecksByTransitivity, 22.0s TimeCoverageRelationStatistics Valid=192, Invalid=2061, Unknown=7, NotChecked=92, Total=2352 [2019-10-02 11:05:09,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-10-02 11:05:09,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 55. [2019-10-02 11:05:09,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-10-02 11:05:09,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 63 transitions. [2019-10-02 11:05:09,208 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 63 transitions. Word has length 50 [2019-10-02 11:05:09,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:05:09,209 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 63 transitions. [2019-10-02 11:05:09,209 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-10-02 11:05:09,209 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2019-10-02 11:05:09,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-10-02 11:05:09,210 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:05:09,210 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:05:09,211 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:05:09,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:05:09,211 INFO L82 PathProgramCache]: Analyzing trace with hash -467377254, now seen corresponding path program 1 times [2019-10-02 11:05:09,211 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:05:09,211 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:05:09,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:05:09,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:05:09,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:05:09,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:05:09,521 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-02 11:05:09,522 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:05:09,522 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:05:09,600 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:05:09,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:05:09,658 INFO L256 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 43 conjunts are in the unsatisfiable core [2019-10-02 11:05:09,662 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:05:09,785 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 8 treesize of output 4 [2019-10-02 11:05:09,786 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:05:09,790 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:05:09,791 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 11:05:09,791 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-10-02 11:05:11,842 WARN L860 $PredicateComparison]: unable to prove that (exists ((node_create_~temp~0.offset Int) (node_create_~temp~0.base Int)) (and (<= (+ |c_#StackHeapBarrier| 1) node_create_~temp~0.base) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| node_create_~temp~0.base (store (store (select |c_old(#memory_$Pointer$.base)| node_create_~temp~0.base) (+ node_create_~temp~0.offset 4) 0) node_create_~temp~0.offset (select (select |c_#memory_$Pointer$.base| node_create_~temp~0.base) node_create_~temp~0.offset)))))) is different from true