/usr/bin/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 --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.use.separate.solver.for.trace.checks true -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/list-ext3-properties/sll_nondet_insert-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-3af5e1f [2020-09-04 22:08:37,675 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-09-04 22:08:37,679 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-09-04 22:08:37,720 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-09-04 22:08:37,720 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-09-04 22:08:37,728 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-09-04 22:08:37,732 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-09-04 22:08:37,736 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-09-04 22:08:37,739 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-09-04 22:08:37,742 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-09-04 22:08:37,743 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-09-04 22:08:37,744 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-09-04 22:08:37,744 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-09-04 22:08:37,747 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-09-04 22:08:37,750 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-09-04 22:08:37,751 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-09-04 22:08:37,753 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-09-04 22:08:37,754 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-09-04 22:08:37,756 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-09-04 22:08:37,764 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-09-04 22:08:37,766 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-09-04 22:08:37,767 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-09-04 22:08:37,768 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-09-04 22:08:37,769 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-09-04 22:08:37,781 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-09-04 22:08:37,781 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-09-04 22:08:37,782 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-09-04 22:08:37,789 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-09-04 22:08:37,790 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-09-04 22:08:37,791 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-09-04 22:08:37,791 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-09-04 22:08:37,796 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-09-04 22:08:37,797 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-09-04 22:08:37,798 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-09-04 22:08:37,799 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-09-04 22:08:37,799 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-09-04 22:08:37,800 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-09-04 22:08:37,800 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-09-04 22:08:37,800 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-09-04 22:08:37,801 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-09-04 22:08:37,802 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-09-04 22:08:37,803 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-09-04 22:08:37,821 INFO L113 SettingsManager]: Loading preferences was successful [2020-09-04 22:08:37,821 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-09-04 22:08:37,823 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-09-04 22:08:37,823 INFO L138 SettingsManager]: * sizeof long=4 [2020-09-04 22:08:37,823 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-09-04 22:08:37,823 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-09-04 22:08:37,824 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-09-04 22:08:37,824 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-09-04 22:08:37,824 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-09-04 22:08:37,824 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-09-04 22:08:37,825 INFO L138 SettingsManager]: * sizeof long double=12 [2020-09-04 22:08:37,826 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-09-04 22:08:37,826 INFO L138 SettingsManager]: * Use constant arrays=true [2020-09-04 22:08:37,826 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-09-04 22:08:37,826 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-09-04 22:08:37,827 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-09-04 22:08:37,827 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-09-04 22:08:37,827 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-09-04 22:08:37,827 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-04 22:08:37,827 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-09-04 22:08:37,828 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-09-04 22:08:37,828 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-09-04 22:08:37,828 INFO L138 SettingsManager]: * Use separate solver for trace checks=false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use separate solver for trace checks -> true [2020-09-04 22:08:38,301 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-09-04 22:08:38,326 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-09-04 22:08:38,330 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-09-04 22:08:38,332 INFO L271 PluginConnector]: Initializing CDTParser... [2020-09-04 22:08:38,332 INFO L275 PluginConnector]: CDTParser initialized [2020-09-04 22:08:38,334 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext3-properties/sll_nondet_insert-1.i [2020-09-04 22:08:38,423 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/65306d3d9/3ce4262f3ff5435289e2528dc4d76537/FLAG2fe9ebb50 [2020-09-04 22:08:39,027 INFO L306 CDTParser]: Found 1 translation units. [2020-09-04 22:08:39,028 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/list-ext3-properties/sll_nondet_insert-1.i [2020-09-04 22:08:39,044 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/65306d3d9/3ce4262f3ff5435289e2528dc4d76537/FLAG2fe9ebb50 [2020-09-04 22:08:39,311 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/65306d3d9/3ce4262f3ff5435289e2528dc4d76537 [2020-09-04 22:08:39,325 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-09-04 22:08:39,327 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-09-04 22:08:39,328 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-09-04 22:08:39,328 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-09-04 22:08:39,332 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-09-04 22:08:39,333 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 10:08:39" (1/1) ... [2020-09-04 22:08:39,337 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42c12cd4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 10:08:39, skipping insertion in model container [2020-09-04 22:08:39,337 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 10:08:39" (1/1) ... [2020-09-04 22:08:39,346 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-09-04 22:08:39,395 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-09-04 22:08:39,876 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 22:08:39,886 INFO L203 MainTranslator]: Completed pre-run [2020-09-04 22:08:39,939 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 22:08:40,000 INFO L208 MainTranslator]: Completed translation [2020-09-04 22:08:40,001 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 10:08:40 WrapperNode [2020-09-04 22:08:40,001 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-09-04 22:08:40,002 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-09-04 22:08:40,002 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-09-04 22:08:40,002 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-09-04 22:08:40,021 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 10:08:40" (1/1) ... [2020-09-04 22:08:40,021 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 10:08:40" (1/1) ... [2020-09-04 22:08:40,041 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 10:08:40" (1/1) ... [2020-09-04 22:08:40,041 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 10:08:40" (1/1) ... [2020-09-04 22:08:40,061 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 10:08:40" (1/1) ... [2020-09-04 22:08:40,068 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 10:08:40" (1/1) ... [2020-09-04 22:08:40,072 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 10:08:40" (1/1) ... [2020-09-04 22:08:40,080 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-09-04 22:08:40,081 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-09-04 22:08:40,081 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-09-04 22:08:40,081 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-09-04 22:08:40,082 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 10:08:40" (1/1) ... No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-04 22:08:40,180 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-09-04 22:08:40,181 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-09-04 22:08:40,182 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2020-09-04 22:08:40,182 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2020-09-04 22:08:40,182 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2020-09-04 22:08:40,183 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_create [2020-09-04 22:08:40,183 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_length [2020-09-04 22:08:40,183 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_destroy [2020-09-04 22:08:40,183 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_insert [2020-09-04 22:08:40,183 INFO L138 BoogieDeclarations]: Found implementation of procedure _get_nondet_int [2020-09-04 22:08:40,184 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-09-04 22:08:40,184 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-09-04 22:08:40,185 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-09-04 22:08:40,185 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2020-09-04 22:08:40,185 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2020-09-04 22:08:40,185 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2020-09-04 22:08:40,186 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2020-09-04 22:08:40,186 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2020-09-04 22:08:40,186 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2020-09-04 22:08:40,187 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2020-09-04 22:08:40,187 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2020-09-04 22:08:40,188 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2020-09-04 22:08:40,190 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2020-09-04 22:08:40,190 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2020-09-04 22:08:40,190 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2020-09-04 22:08:40,190 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2020-09-04 22:08:40,191 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2020-09-04 22:08:40,191 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2020-09-04 22:08:40,192 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2020-09-04 22:08:40,192 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2020-09-04 22:08:40,192 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2020-09-04 22:08:40,193 INFO L130 BoogieDeclarations]: Found specification of procedure select [2020-09-04 22:08:40,194 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2020-09-04 22:08:40,194 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2020-09-04 22:08:40,194 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2020-09-04 22:08:40,194 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2020-09-04 22:08:40,195 INFO L130 BoogieDeclarations]: Found specification of procedure random [2020-09-04 22:08:40,195 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2020-09-04 22:08:40,195 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2020-09-04 22:08:40,195 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2020-09-04 22:08:40,195 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2020-09-04 22:08:40,195 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2020-09-04 22:08:40,196 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2020-09-04 22:08:40,196 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2020-09-04 22:08:40,196 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2020-09-04 22:08:40,196 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2020-09-04 22:08:40,196 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2020-09-04 22:08:40,196 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2020-09-04 22:08:40,196 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2020-09-04 22:08:40,197 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2020-09-04 22:08:40,197 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2020-09-04 22:08:40,197 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2020-09-04 22:08:40,197 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2020-09-04 22:08:40,197 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2020-09-04 22:08:40,197 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2020-09-04 22:08:40,197 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2020-09-04 22:08:40,198 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2020-09-04 22:08:40,198 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2020-09-04 22:08:40,198 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2020-09-04 22:08:40,198 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2020-09-04 22:08:40,199 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2020-09-04 22:08:40,199 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2020-09-04 22:08:40,199 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2020-09-04 22:08:40,199 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2020-09-04 22:08:40,199 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2020-09-04 22:08:40,199 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-09-04 22:08:40,199 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2020-09-04 22:08:40,200 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2020-09-04 22:08:40,200 INFO L130 BoogieDeclarations]: Found specification of procedure free [2020-09-04 22:08:40,200 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2020-09-04 22:08:40,200 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2020-09-04 22:08:40,200 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2020-09-04 22:08:40,201 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2020-09-04 22:08:40,201 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2020-09-04 22:08:40,202 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-09-04 22:08:40,202 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2020-09-04 22:08:40,202 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2020-09-04 22:08:40,202 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2020-09-04 22:08:40,202 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-09-04 22:08:40,202 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2020-09-04 22:08:40,203 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2020-09-04 22:08:40,203 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2020-09-04 22:08:40,203 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2020-09-04 22:08:40,203 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2020-09-04 22:08:40,203 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2020-09-04 22:08:40,203 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2020-09-04 22:08:40,204 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2020-09-04 22:08:40,204 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2020-09-04 22:08:40,204 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2020-09-04 22:08:40,204 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2020-09-04 22:08:40,204 INFO L130 BoogieDeclarations]: Found specification of procedure system [2020-09-04 22:08:40,204 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2020-09-04 22:08:40,204 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2020-09-04 22:08:40,205 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2020-09-04 22:08:40,205 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2020-09-04 22:08:40,205 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2020-09-04 22:08:40,205 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2020-09-04 22:08:40,205 INFO L130 BoogieDeclarations]: Found specification of procedure div [2020-09-04 22:08:40,205 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2020-09-04 22:08:40,206 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2020-09-04 22:08:40,206 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2020-09-04 22:08:40,206 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2020-09-04 22:08:40,206 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2020-09-04 22:08:40,206 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2020-09-04 22:08:40,206 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2020-09-04 22:08:40,206 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2020-09-04 22:08:40,206 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2020-09-04 22:08:40,207 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2020-09-04 22:08:40,207 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2020-09-04 22:08:40,207 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2020-09-04 22:08:40,207 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2020-09-04 22:08:40,207 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2020-09-04 22:08:40,207 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2020-09-04 22:08:40,207 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2020-09-04 22:08:40,207 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2020-09-04 22:08:40,207 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2020-09-04 22:08:40,207 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2020-09-04 22:08:40,208 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2020-09-04 22:08:40,208 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2020-09-04 22:08:40,208 INFO L130 BoogieDeclarations]: Found specification of procedure sll_create [2020-09-04 22:08:40,208 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-09-04 22:08:40,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-09-04 22:08:40,208 INFO L130 BoogieDeclarations]: Found specification of procedure sll_length [2020-09-04 22:08:40,208 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-09-04 22:08:40,208 INFO L130 BoogieDeclarations]: Found specification of procedure sll_destroy [2020-09-04 22:08:40,209 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-09-04 22:08:40,209 INFO L130 BoogieDeclarations]: Found specification of procedure sll_insert [2020-09-04 22:08:40,209 INFO L130 BoogieDeclarations]: Found specification of procedure _get_nondet_int [2020-09-04 22:08:40,209 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-09-04 22:08:40,210 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-09-04 22:08:40,210 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2020-09-04 22:08:40,210 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-09-04 22:08:40,210 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-09-04 22:08:40,579 INFO L732 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2020-09-04 22:08:40,892 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-09-04 22:08:40,892 INFO L295 CfgBuilder]: Removed 6 assume(true) statements. [2020-09-04 22:08:40,898 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 10:08:40 BoogieIcfgContainer [2020-09-04 22:08:40,899 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-09-04 22:08:40,900 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-09-04 22:08:40,900 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-09-04 22:08:40,905 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-09-04 22:08:40,905 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.09 10:08:39" (1/3) ... [2020-09-04 22:08:40,906 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11508c93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 10:08:40, skipping insertion in model container [2020-09-04 22:08:40,906 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 10:08:40" (2/3) ... [2020-09-04 22:08:40,907 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11508c93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 10:08:40, skipping insertion in model container [2020-09-04 22:08:40,907 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 10:08:40" (3/3) ... [2020-09-04 22:08:40,909 INFO L109 eAbstractionObserver]: Analyzing ICFG sll_nondet_insert-1.i [2020-09-04 22:08:40,922 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-09-04 22:08:40,934 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-09-04 22:08:40,958 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-09-04 22:08:40,990 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-09-04 22:08:40,991 INFO L376 AbstractCegarLoop]: Hoare is true [2020-09-04 22:08:40,991 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-09-04 22:08:40,991 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-09-04 22:08:40,991 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-09-04 22:08:40,991 INFO L380 AbstractCegarLoop]: Difference is false [2020-09-04 22:08:40,992 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-09-04 22:08:40,992 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-09-04 22:08:41,014 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states. [2020-09-04 22:08:41,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2020-09-04 22:08:41,032 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 22:08:41,033 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 22:08:41,034 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 22:08:41,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 22:08:41,043 INFO L82 PathProgramCache]: Analyzing trace with hash 422432984, now seen corresponding path program 1 times [2020-09-04 22:08:41,055 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 22:08:41,056 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [933724257] [2020-09-04 22:08:41,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 22:08:41,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:08:41,273 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 22:08:41,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:08:41,304 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-09-04 22:08:41,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:08:41,334 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-09-04 22:08:41,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:08:41,344 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 22:08:41,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:08:41,351 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2020-09-04 22:08:41,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:08:41,373 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-09-04 22:08:41,374 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [933724257] [2020-09-04 22:08:41,379 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 22:08:41,379 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-09-04 22:08:41,380 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226961926] [2020-09-04 22:08:41,389 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-09-04 22:08:41,390 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 22:08:41,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-09-04 22:08:41,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-09-04 22:08:41,410 INFO L87 Difference]: Start difference. First operand 142 states. Second operand 4 states. [2020-09-04 22:08:41,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 22:08:41,785 INFO L93 Difference]: Finished difference Result 289 states and 337 transitions. [2020-09-04 22:08:41,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-09-04 22:08:41,787 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2020-09-04 22:08:41,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 22:08:41,803 INFO L225 Difference]: With dead ends: 289 [2020-09-04 22:08:41,804 INFO L226 Difference]: Without dead ends: 123 [2020-09-04 22:08:41,810 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-09-04 22:08:41,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2020-09-04 22:08:41,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 114. [2020-09-04 22:08:41,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2020-09-04 22:08:41,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 123 transitions. [2020-09-04 22:08:41,884 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 123 transitions. Word has length 54 [2020-09-04 22:08:41,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 22:08:41,884 INFO L479 AbstractCegarLoop]: Abstraction has 114 states and 123 transitions. [2020-09-04 22:08:41,885 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-09-04 22:08:41,885 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 123 transitions. [2020-09-04 22:08:41,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2020-09-04 22:08:41,889 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 22:08:41,890 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 22:08:41,890 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-09-04 22:08:41,890 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 22:08:41,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 22:08:41,891 INFO L82 PathProgramCache]: Analyzing trace with hash 333013349, now seen corresponding path program 1 times [2020-09-04 22:08:41,891 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 22:08:41,892 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1530477212] [2020-09-04 22:08:41,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 22:08:41,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:08:42,003 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 22:08:42,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:08:42,010 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-09-04 22:08:42,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:08:42,178 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-04 22:08:42,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:08:42,188 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2020-09-04 22:08:42,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:08:42,198 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2020-09-04 22:08:42,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:08:42,226 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-09-04 22:08:42,227 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1530477212] [2020-09-04 22:08:42,227 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 22:08:42,227 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-09-04 22:08:42,228 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298249211] [2020-09-04 22:08:42,246 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-09-04 22:08:42,246 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 22:08:42,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-09-04 22:08:42,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2020-09-04 22:08:42,247 INFO L87 Difference]: Start difference. First operand 114 states and 123 transitions. Second operand 9 states. [2020-09-04 22:08:43,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 22:08:43,117 INFO L93 Difference]: Finished difference Result 275 states and 301 transitions. [2020-09-04 22:08:43,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-09-04 22:08:43,117 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 69 [2020-09-04 22:08:43,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 22:08:43,121 INFO L225 Difference]: With dead ends: 275 [2020-09-04 22:08:43,123 INFO L226 Difference]: Without dead ends: 169 [2020-09-04 22:08:43,126 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=117, Invalid=225, Unknown=0, NotChecked=0, Total=342 [2020-09-04 22:08:43,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2020-09-04 22:08:43,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 134. [2020-09-04 22:08:43,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2020-09-04 22:08:43,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 145 transitions. [2020-09-04 22:08:43,165 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 145 transitions. Word has length 69 [2020-09-04 22:08:43,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 22:08:43,166 INFO L479 AbstractCegarLoop]: Abstraction has 134 states and 145 transitions. [2020-09-04 22:08:43,166 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-09-04 22:08:43,166 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 145 transitions. [2020-09-04 22:08:43,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2020-09-04 22:08:43,175 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 22:08:43,175 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 22:08:43,175 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-09-04 22:08:43,176 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 22:08:43,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 22:08:43,176 INFO L82 PathProgramCache]: Analyzing trace with hash -1735568478, now seen corresponding path program 1 times [2020-09-04 22:08:43,176 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 22:08:43,177 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [255677521] [2020-09-04 22:08:43,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 22:08:43,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:08:43,324 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 22:08:43,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:08:43,330 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-09-04 22:08:43,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:08:43,428 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2020-09-04 22:08:43,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:08:43,496 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-09-04 22:08:43,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:08:43,503 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2020-09-04 22:08:43,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:08:43,515 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-09-04 22:08:43,515 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [255677521] [2020-09-04 22:08:43,516 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 22:08:43,516 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-09-04 22:08:43,516 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905024752] [2020-09-04 22:08:43,517 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-09-04 22:08:43,517 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 22:08:43,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-09-04 22:08:43,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2020-09-04 22:08:43,518 INFO L87 Difference]: Start difference. First operand 134 states and 145 transitions. Second operand 12 states. [2020-09-04 22:08:44,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 22:08:44,645 INFO L93 Difference]: Finished difference Result 313 states and 348 transitions. [2020-09-04 22:08:44,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-09-04 22:08:44,646 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 71 [2020-09-04 22:08:44,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 22:08:44,652 INFO L225 Difference]: With dead ends: 313 [2020-09-04 22:08:44,652 INFO L226 Difference]: Without dead ends: 206 [2020-09-04 22:08:44,659 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=123, Invalid=527, Unknown=0, NotChecked=0, Total=650 [2020-09-04 22:08:44,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2020-09-04 22:08:44,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 154. [2020-09-04 22:08:44,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2020-09-04 22:08:44,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 167 transitions. [2020-09-04 22:08:44,716 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 167 transitions. Word has length 71 [2020-09-04 22:08:44,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 22:08:44,716 INFO L479 AbstractCegarLoop]: Abstraction has 154 states and 167 transitions. [2020-09-04 22:08:44,716 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-09-04 22:08:44,717 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 167 transitions. [2020-09-04 22:08:44,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2020-09-04 22:08:44,718 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 22:08:44,718 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 22:08:44,718 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-09-04 22:08:44,718 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 22:08:44,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 22:08:44,722 INFO L82 PathProgramCache]: Analyzing trace with hash -472966004, now seen corresponding path program 1 times [2020-09-04 22:08:44,722 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 22:08:44,722 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [709714049] [2020-09-04 22:08:44,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 22:08:44,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:08:44,782 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 22:08:44,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:08:44,787 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-09-04 22:08:44,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:08:44,996 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2020-09-04 22:08:45,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:08:45,006 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2020-09-04 22:08:45,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:08:45,010 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2020-09-04 22:08:45,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:08:45,024 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-09-04 22:08:45,025 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [709714049] [2020-09-04 22:08:45,025 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 22:08:45,025 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-09-04 22:08:45,025 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67756310] [2020-09-04 22:08:45,026 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-09-04 22:08:45,026 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 22:08:45,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-09-04 22:08:45,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2020-09-04 22:08:45,027 INFO L87 Difference]: Start difference. First operand 154 states and 167 transitions. Second operand 11 states. [2020-09-04 22:08:46,328 WARN L193 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 45 [2020-09-04 22:08:46,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 22:08:46,832 INFO L93 Difference]: Finished difference Result 342 states and 375 transitions. [2020-09-04 22:08:46,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-09-04 22:08:46,833 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 79 [2020-09-04 22:08:46,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 22:08:46,835 INFO L225 Difference]: With dead ends: 342 [2020-09-04 22:08:46,835 INFO L226 Difference]: Without dead ends: 204 [2020-09-04 22:08:46,836 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=224, Invalid=478, Unknown=0, NotChecked=0, Total=702 [2020-09-04 22:08:46,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2020-09-04 22:08:46,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 161. [2020-09-04 22:08:46,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2020-09-04 22:08:46,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 174 transitions. [2020-09-04 22:08:46,865 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 174 transitions. Word has length 79 [2020-09-04 22:08:46,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 22:08:46,866 INFO L479 AbstractCegarLoop]: Abstraction has 161 states and 174 transitions. [2020-09-04 22:08:46,866 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-09-04 22:08:46,866 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 174 transitions. [2020-09-04 22:08:46,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2020-09-04 22:08:46,867 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 22:08:46,868 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 22:08:46,868 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-09-04 22:08:46,868 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 22:08:46,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 22:08:46,869 INFO L82 PathProgramCache]: Analyzing trace with hash -1820928426, now seen corresponding path program 1 times [2020-09-04 22:08:46,869 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 22:08:46,870 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1614139091] [2020-09-04 22:08:46,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 22:08:46,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:08:46,970 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 22:08:46,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:08:46,975 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-09-04 22:08:46,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:08:47,049 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2020-09-04 22:08:47,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:08:47,147 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-09-04 22:08:47,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:08:47,153 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2020-09-04 22:08:47,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:08:47,166 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-09-04 22:08:47,166 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1614139091] [2020-09-04 22:08:47,167 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 22:08:47,167 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2020-09-04 22:08:47,167 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020945692] [2020-09-04 22:08:47,168 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-09-04 22:08:47,168 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 22:08:47,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-09-04 22:08:47,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2020-09-04 22:08:47,169 INFO L87 Difference]: Start difference. First operand 161 states and 174 transitions. Second operand 14 states. [2020-09-04 22:08:48,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 22:08:48,553 INFO L93 Difference]: Finished difference Result 307 states and 339 transitions. [2020-09-04 22:08:48,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-09-04 22:08:48,554 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 80 [2020-09-04 22:08:48,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 22:08:48,557 INFO L225 Difference]: With dead ends: 307 [2020-09-04 22:08:48,557 INFO L226 Difference]: Without dead ends: 221 [2020-09-04 22:08:48,559 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=160, Invalid=770, Unknown=0, NotChecked=0, Total=930 [2020-09-04 22:08:48,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2020-09-04 22:08:48,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 170. [2020-09-04 22:08:48,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2020-09-04 22:08:48,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 184 transitions. [2020-09-04 22:08:48,595 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 184 transitions. Word has length 80 [2020-09-04 22:08:48,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 22:08:48,596 INFO L479 AbstractCegarLoop]: Abstraction has 170 states and 184 transitions. [2020-09-04 22:08:48,597 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-09-04 22:08:48,597 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 184 transitions. [2020-09-04 22:08:48,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2020-09-04 22:08:48,600 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 22:08:48,600 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 22:08:48,601 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-09-04 22:08:48,601 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 22:08:48,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 22:08:48,602 INFO L82 PathProgramCache]: Analyzing trace with hash 1107353865, now seen corresponding path program 2 times [2020-09-04 22:08:48,604 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 22:08:48,605 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1520020357] [2020-09-04 22:08:48,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 22:08:48,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:08:48,697 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 22:08:48,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:08:48,705 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-09-04 22:08:48,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:08:48,832 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2020-09-04 22:08:48,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:08:48,882 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2020-09-04 22:08:48,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:08:48,887 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2020-09-04 22:08:48,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:08:48,898 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-09-04 22:08:48,899 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1520020357] [2020-09-04 22:08:48,899 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 22:08:48,899 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2020-09-04 22:08:48,899 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103924380] [2020-09-04 22:08:48,900 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-09-04 22:08:48,900 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 22:08:48,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-09-04 22:08:48,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2020-09-04 22:08:48,901 INFO L87 Difference]: Start difference. First operand 170 states and 184 transitions. Second operand 14 states. [2020-09-04 22:08:50,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 22:08:50,563 INFO L93 Difference]: Finished difference Result 306 states and 337 transitions. [2020-09-04 22:08:50,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-09-04 22:08:50,564 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 81 [2020-09-04 22:08:50,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 22:08:50,567 INFO L225 Difference]: With dead ends: 306 [2020-09-04 22:08:50,567 INFO L226 Difference]: Without dead ends: 216 [2020-09-04 22:08:50,568 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=172, Invalid=820, Unknown=0, NotChecked=0, Total=992 [2020-09-04 22:08:50,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2020-09-04 22:08:50,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 170. [2020-09-04 22:08:50,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2020-09-04 22:08:50,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 183 transitions. [2020-09-04 22:08:50,592 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 183 transitions. Word has length 81 [2020-09-04 22:08:50,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 22:08:50,593 INFO L479 AbstractCegarLoop]: Abstraction has 170 states and 183 transitions. [2020-09-04 22:08:50,593 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-09-04 22:08:50,593 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 183 transitions. [2020-09-04 22:08:50,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2020-09-04 22:08:50,594 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 22:08:50,595 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 22:08:50,595 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-09-04 22:08:50,595 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 22:08:50,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 22:08:50,595 INFO L82 PathProgramCache]: Analyzing trace with hash -574415326, now seen corresponding path program 2 times [2020-09-04 22:08:50,596 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 22:08:50,596 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1908752279] [2020-09-04 22:08:50,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 22:08:50,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:08:50,667 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 22:08:50,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:08:50,670 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-09-04 22:08:50,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:08:50,687 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2020-09-04 22:08:50,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:08:50,783 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2020-09-04 22:08:50,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:08:50,790 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2020-09-04 22:08:50,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:08:50,846 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2020-09-04 22:08:50,847 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1908752279] [2020-09-04 22:08:50,847 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 22:08:50,848 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-09-04 22:08:50,848 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702100140] [2020-09-04 22:08:50,849 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-09-04 22:08:50,849 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 22:08:50,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-09-04 22:08:50,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2020-09-04 22:08:50,850 INFO L87 Difference]: Start difference. First operand 170 states and 183 transitions. Second operand 13 states. [2020-09-04 22:08:51,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 22:08:51,681 INFO L93 Difference]: Finished difference Result 207 states and 225 transitions. [2020-09-04 22:08:51,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-09-04 22:08:51,682 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 89 [2020-09-04 22:08:51,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 22:08:51,687 INFO L225 Difference]: With dead ends: 207 [2020-09-04 22:08:51,687 INFO L226 Difference]: Without dead ends: 201 [2020-09-04 22:08:51,689 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=67, Invalid=353, Unknown=0, NotChecked=0, Total=420 [2020-09-04 22:08:51,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2020-09-04 22:08:51,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 183. [2020-09-04 22:08:51,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2020-09-04 22:08:51,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 200 transitions. [2020-09-04 22:08:51,744 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 200 transitions. Word has length 89 [2020-09-04 22:08:51,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 22:08:51,745 INFO L479 AbstractCegarLoop]: Abstraction has 183 states and 200 transitions. [2020-09-04 22:08:51,745 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-09-04 22:08:51,746 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 200 transitions. [2020-09-04 22:08:51,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2020-09-04 22:08:51,747 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 22:08:51,748 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 22:08:51,748 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-09-04 22:08:51,748 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 22:08:51,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 22:08:51,749 INFO L82 PathProgramCache]: Analyzing trace with hash 263120297, now seen corresponding path program 1 times [2020-09-04 22:08:51,750 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 22:08:51,750 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1759471553] [2020-09-04 22:08:51,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 22:08:51,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:08:51,851 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 22:08:51,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:08:51,854 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-09-04 22:08:51,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:08:51,873 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2020-09-04 22:08:51,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:08:51,996 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2020-09-04 22:08:51,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:08:52,009 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2020-09-04 22:08:52,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:08:52,127 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-09-04 22:08:52,127 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1759471553] [2020-09-04 22:08:52,127 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 22:08:52,128 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2020-09-04 22:08:52,128 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299976456] [2020-09-04 22:08:52,128 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-09-04 22:08:52,128 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 22:08:52,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-09-04 22:08:52,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2020-09-04 22:08:52,130 INFO L87 Difference]: Start difference. First operand 183 states and 200 transitions. Second operand 18 states. [2020-09-04 22:08:53,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 22:08:53,606 INFO L93 Difference]: Finished difference Result 239 states and 263 transitions. [2020-09-04 22:08:53,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-09-04 22:08:53,608 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 96 [2020-09-04 22:08:53,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 22:08:53,611 INFO L225 Difference]: With dead ends: 239 [2020-09-04 22:08:53,611 INFO L226 Difference]: Without dead ends: 233 [2020-09-04 22:08:53,613 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=169, Invalid=1021, Unknown=0, NotChecked=0, Total=1190 [2020-09-04 22:08:53,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2020-09-04 22:08:53,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 209. [2020-09-04 22:08:53,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2020-09-04 22:08:53,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 232 transitions. [2020-09-04 22:08:53,645 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 232 transitions. Word has length 96 [2020-09-04 22:08:53,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 22:08:53,647 INFO L479 AbstractCegarLoop]: Abstraction has 209 states and 232 transitions. [2020-09-04 22:08:53,647 INFO L480 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-09-04 22:08:53,647 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 232 transitions. [2020-09-04 22:08:53,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2020-09-04 22:08:53,649 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 22:08:53,649 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 22:08:53,649 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-09-04 22:08:53,650 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 22:08:53,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 22:08:53,650 INFO L82 PathProgramCache]: Analyzing trace with hash 1940597340, now seen corresponding path program 1 times [2020-09-04 22:08:53,651 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 22:08:53,651 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [615018038] [2020-09-04 22:08:53,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 22:08:53,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:08:53,735 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 22:08:53,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:08:53,739 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-09-04 22:08:53,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:08:53,836 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2020-09-04 22:08:53,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:08:53,926 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2020-09-04 22:08:53,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:08:53,930 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2020-09-04 22:08:53,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:08:53,946 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-09-04 22:08:53,946 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [615018038] [2020-09-04 22:08:53,947 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 22:08:53,947 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2020-09-04 22:08:53,947 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759011682] [2020-09-04 22:08:53,948 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-09-04 22:08:53,948 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 22:08:53,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-09-04 22:08:53,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=209, Unknown=0, NotChecked=0, Total=240 [2020-09-04 22:08:53,949 INFO L87 Difference]: Start difference. First operand 209 states and 232 transitions. Second operand 16 states. [2020-09-04 22:08:55,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 22:08:55,722 INFO L93 Difference]: Finished difference Result 358 states and 404 transitions. [2020-09-04 22:08:55,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2020-09-04 22:08:55,724 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 97 [2020-09-04 22:08:55,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 22:08:55,727 INFO L225 Difference]: With dead ends: 358 [2020-09-04 22:08:55,727 INFO L226 Difference]: Without dead ends: 245 [2020-09-04 22:08:55,728 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=187, Invalid=1003, Unknown=0, NotChecked=0, Total=1190 [2020-09-04 22:08:55,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2020-09-04 22:08:55,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 176. [2020-09-04 22:08:55,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2020-09-04 22:08:55,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 192 transitions. [2020-09-04 22:08:55,751 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 192 transitions. Word has length 97 [2020-09-04 22:08:55,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 22:08:55,752 INFO L479 AbstractCegarLoop]: Abstraction has 176 states and 192 transitions. [2020-09-04 22:08:55,752 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-09-04 22:08:55,752 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 192 transitions. [2020-09-04 22:08:55,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2020-09-04 22:08:55,753 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 22:08:55,753 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 22:08:55,753 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-09-04 22:08:55,754 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 22:08:55,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 22:08:55,754 INFO L82 PathProgramCache]: Analyzing trace with hash -1056708542, now seen corresponding path program 2 times [2020-09-04 22:08:55,754 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 22:08:55,755 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [470027053] [2020-09-04 22:08:55,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 22:08:55,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:08:55,816 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 22:08:55,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:08:55,819 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-09-04 22:08:55,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:08:55,878 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2020-09-04 22:08:55,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:08:55,892 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2020-09-04 22:08:55,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:08:55,990 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2020-09-04 22:08:55,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:08:56,007 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2020-09-04 22:08:56,007 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [470027053] [2020-09-04 22:08:56,007 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 22:08:56,008 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2020-09-04 22:08:56,008 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540713919] [2020-09-04 22:08:56,008 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-09-04 22:08:56,008 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 22:08:56,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-09-04 22:08:56,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2020-09-04 22:08:56,009 INFO L87 Difference]: Start difference. First operand 176 states and 192 transitions. Second operand 13 states. [2020-09-04 22:08:57,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 22:08:57,384 INFO L93 Difference]: Finished difference Result 369 states and 420 transitions. [2020-09-04 22:08:57,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-09-04 22:08:57,385 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 103 [2020-09-04 22:08:57,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 22:08:57,387 INFO L225 Difference]: With dead ends: 369 [2020-09-04 22:08:57,387 INFO L226 Difference]: Without dead ends: 266 [2020-09-04 22:08:57,389 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=211, Invalid=659, Unknown=0, NotChecked=0, Total=870 [2020-09-04 22:08:57,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2020-09-04 22:08:57,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 206. [2020-09-04 22:08:57,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2020-09-04 22:08:57,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 228 transitions. [2020-09-04 22:08:57,427 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 228 transitions. Word has length 103 [2020-09-04 22:08:57,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 22:08:57,428 INFO L479 AbstractCegarLoop]: Abstraction has 206 states and 228 transitions. [2020-09-04 22:08:57,428 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-09-04 22:08:57,428 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 228 transitions. [2020-09-04 22:08:57,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2020-09-04 22:08:57,429 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 22:08:57,430 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 22:08:57,430 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-09-04 22:08:57,430 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 22:08:57,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 22:08:57,431 INFO L82 PathProgramCache]: Analyzing trace with hash 2144765375, now seen corresponding path program 1 times [2020-09-04 22:08:57,431 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 22:08:57,431 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2128571767] [2020-09-04 22:08:57,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 22:08:57,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:08:57,600 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 22:08:57,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:08:57,603 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-09-04 22:08:57,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:08:57,697 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2020-09-04 22:08:57,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:08:57,733 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2020-09-04 22:08:57,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:08:57,819 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2020-09-04 22:08:57,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:08:58,076 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-09-04 22:08:58,077 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2128571767] [2020-09-04 22:08:58,077 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 22:08:58,078 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2020-09-04 22:08:58,078 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573233550] [2020-09-04 22:08:58,079 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-09-04 22:08:58,080 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 22:08:58,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-09-04 22:08:58,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=341, Unknown=0, NotChecked=0, Total=380 [2020-09-04 22:08:58,081 INFO L87 Difference]: Start difference. First operand 206 states and 228 transitions. Second operand 20 states. [2020-09-04 22:09:00,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 22:09:00,274 INFO L93 Difference]: Finished difference Result 325 states and 381 transitions. [2020-09-04 22:09:00,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2020-09-04 22:09:00,275 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 105 [2020-09-04 22:09:00,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 22:09:00,277 INFO L225 Difference]: With dead ends: 325 [2020-09-04 22:09:00,278 INFO L226 Difference]: Without dead ends: 319 [2020-09-04 22:09:00,279 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 263 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=209, Invalid=1513, Unknown=0, NotChecked=0, Total=1722 [2020-09-04 22:09:00,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2020-09-04 22:09:00,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 256. [2020-09-04 22:09:00,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2020-09-04 22:09:00,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 294 transitions. [2020-09-04 22:09:00,337 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 294 transitions. Word has length 105 [2020-09-04 22:09:00,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 22:09:00,338 INFO L479 AbstractCegarLoop]: Abstraction has 256 states and 294 transitions. [2020-09-04 22:09:00,338 INFO L480 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-09-04 22:09:00,338 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 294 transitions. [2020-09-04 22:09:00,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2020-09-04 22:09:00,340 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 22:09:00,340 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 22:09:00,341 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-09-04 22:09:00,341 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 22:09:00,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 22:09:00,341 INFO L82 PathProgramCache]: Analyzing trace with hash -798874772, now seen corresponding path program 2 times [2020-09-04 22:09:00,342 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 22:09:00,342 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1540646763] [2020-09-04 22:09:00,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 22:09:00,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:09:00,452 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 22:09:00,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:09:00,457 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-09-04 22:09:00,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:09:00,481 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2020-09-04 22:09:00,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:09:00,713 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2020-09-04 22:09:00,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:09:00,720 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2020-09-04 22:09:00,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:09:00,994 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2020-09-04 22:09:00,994 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1540646763] [2020-09-04 22:09:00,994 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 22:09:00,995 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2020-09-04 22:09:00,995 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567659330] [2020-09-04 22:09:00,995 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2020-09-04 22:09:00,995 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 22:09:00,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2020-09-04 22:09:00,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=461, Unknown=0, NotChecked=0, Total=506 [2020-09-04 22:09:00,996 INFO L87 Difference]: Start difference. First operand 256 states and 294 transitions. Second operand 23 states. [2020-09-04 22:09:03,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 22:09:03,578 INFO L93 Difference]: Finished difference Result 340 states and 399 transitions. [2020-09-04 22:09:03,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2020-09-04 22:09:03,579 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 112 [2020-09-04 22:09:03,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 22:09:03,582 INFO L225 Difference]: With dead ends: 340 [2020-09-04 22:09:03,582 INFO L226 Difference]: Without dead ends: 330 [2020-09-04 22:09:03,584 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 255 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=172, Invalid=1720, Unknown=0, NotChecked=0, Total=1892 [2020-09-04 22:09:03,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2020-09-04 22:09:03,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 297. [2020-09-04 22:09:03,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2020-09-04 22:09:03,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 346 transitions. [2020-09-04 22:09:03,625 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 346 transitions. Word has length 112 [2020-09-04 22:09:03,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 22:09:03,625 INFO L479 AbstractCegarLoop]: Abstraction has 297 states and 346 transitions. [2020-09-04 22:09:03,626 INFO L480 AbstractCegarLoop]: Interpolant automaton has 23 states. [2020-09-04 22:09:03,626 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 346 transitions. [2020-09-04 22:09:03,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2020-09-04 22:09:03,628 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 22:09:03,628 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 22:09:03,629 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-09-04 22:09:03,629 INFO L427 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 22:09:03,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 22:09:03,629 INFO L82 PathProgramCache]: Analyzing trace with hash -861453783, now seen corresponding path program 2 times [2020-09-04 22:09:03,629 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 22:09:03,630 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1402022394] [2020-09-04 22:09:03,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 22:09:03,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:09:03,727 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 22:09:03,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:09:03,731 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-09-04 22:09:03,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:09:03,749 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2020-09-04 22:09:03,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:09:03,757 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2020-09-04 22:09:03,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:09:03,888 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2020-09-04 22:09:03,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:09:03,905 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 15 proven. 3 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2020-09-04 22:09:03,905 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1402022394] [2020-09-04 22:09:03,905 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 22:09:03,906 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2020-09-04 22:09:03,906 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108495059] [2020-09-04 22:09:03,906 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-09-04 22:09:03,907 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 22:09:03,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-09-04 22:09:03,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2020-09-04 22:09:03,908 INFO L87 Difference]: Start difference. First operand 297 states and 346 transitions. Second operand 15 states. [2020-09-04 22:09:05,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 22:09:05,516 INFO L93 Difference]: Finished difference Result 542 states and 648 transitions. [2020-09-04 22:09:05,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2020-09-04 22:09:05,516 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 113 [2020-09-04 22:09:05,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 22:09:05,521 INFO L225 Difference]: With dead ends: 542 [2020-09-04 22:09:05,521 INFO L226 Difference]: Without dead ends: 407 [2020-09-04 22:09:05,522 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 242 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=262, Invalid=998, Unknown=0, NotChecked=0, Total=1260 [2020-09-04 22:09:05,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2020-09-04 22:09:05,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 321. [2020-09-04 22:09:05,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 321 states. [2020-09-04 22:09:05,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 380 transitions. [2020-09-04 22:09:05,575 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 380 transitions. Word has length 113 [2020-09-04 22:09:05,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 22:09:05,576 INFO L479 AbstractCegarLoop]: Abstraction has 321 states and 380 transitions. [2020-09-04 22:09:05,576 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-09-04 22:09:05,576 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 380 transitions. [2020-09-04 22:09:05,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2020-09-04 22:09:05,578 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 22:09:05,578 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 22:09:05,578 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-09-04 22:09:05,578 INFO L427 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 22:09:05,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 22:09:05,579 INFO L82 PathProgramCache]: Analyzing trace with hash 1389369769, now seen corresponding path program 3 times [2020-09-04 22:09:05,579 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 22:09:05,579 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [418950265] [2020-09-04 22:09:05,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 22:09:05,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:09:05,638 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 22:09:05,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:09:05,642 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-09-04 22:09:05,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:09:05,739 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2020-09-04 22:09:05,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:09:05,888 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2020-09-04 22:09:05,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:09:05,891 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2020-09-04 22:09:05,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:09:05,919 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-09-04 22:09:05,920 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [418950265] [2020-09-04 22:09:05,920 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 22:09:05,920 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2020-09-04 22:09:05,921 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211958948] [2020-09-04 22:09:05,921 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-09-04 22:09:05,922 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 22:09:05,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-09-04 22:09:05,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2020-09-04 22:09:05,923 INFO L87 Difference]: Start difference. First operand 321 states and 380 transitions. Second operand 18 states. [2020-09-04 22:09:07,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 22:09:07,936 INFO L93 Difference]: Finished difference Result 536 states and 631 transitions. [2020-09-04 22:09:07,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-09-04 22:09:07,938 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 113 [2020-09-04 22:09:07,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 22:09:07,941 INFO L225 Difference]: With dead ends: 536 [2020-09-04 22:09:07,941 INFO L226 Difference]: Without dead ends: 377 [2020-09-04 22:09:07,943 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=219, Invalid=1263, Unknown=0, NotChecked=0, Total=1482 [2020-09-04 22:09:07,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2020-09-04 22:09:07,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 318. [2020-09-04 22:09:07,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 318 states. [2020-09-04 22:09:07,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 371 transitions. [2020-09-04 22:09:07,993 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 371 transitions. Word has length 113 [2020-09-04 22:09:07,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 22:09:07,994 INFO L479 AbstractCegarLoop]: Abstraction has 318 states and 371 transitions. [2020-09-04 22:09:07,994 INFO L480 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-09-04 22:09:07,994 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 371 transitions. [2020-09-04 22:09:07,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2020-09-04 22:09:07,996 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 22:09:07,996 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 22:09:07,996 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-09-04 22:09:07,997 INFO L427 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 22:09:07,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 22:09:07,997 INFO L82 PathProgramCache]: Analyzing trace with hash 2144590086, now seen corresponding path program 1 times [2020-09-04 22:09:07,997 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 22:09:07,997 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1968527664] [2020-09-04 22:09:07,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 22:09:08,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-09-04 22:09:08,021 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-09-04 22:09:08,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-09-04 22:09:08,043 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-09-04 22:09:08,086 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-09-04 22:09:08,086 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-09-04 22:09:08,087 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-09-04 22:09:08,155 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.09 10:09:08 BoogieIcfgContainer [2020-09-04 22:09:08,155 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-09-04 22:09:08,157 INFO L168 Benchmark]: Toolchain (without parser) took 28830.28 ms. Allocated memory was 146.8 MB in the beginning and 472.9 MB in the end (delta: 326.1 MB). Free memory was 102.4 MB in the beginning and 194.0 MB in the end (delta: -91.7 MB). Peak memory consumption was 234.5 MB. Max. memory is 7.1 GB. [2020-09-04 22:09:08,158 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 146.8 MB. Free memory was 122.3 MB in the beginning and 122.1 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. [2020-09-04 22:09:08,158 INFO L168 Benchmark]: CACSL2BoogieTranslator took 673.90 ms. Allocated memory was 146.8 MB in the beginning and 205.0 MB in the end (delta: 58.2 MB). Free memory was 101.9 MB in the beginning and 170.7 MB in the end (delta: -68.8 MB). Peak memory consumption was 22.7 MB. Max. memory is 7.1 GB. [2020-09-04 22:09:08,159 INFO L168 Benchmark]: Boogie Preprocessor took 78.23 ms. Allocated memory is still 205.0 MB. Free memory was 170.7 MB in the beginning and 167.2 MB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 7.1 GB. [2020-09-04 22:09:08,159 INFO L168 Benchmark]: RCFGBuilder took 818.17 ms. Allocated memory is still 205.0 MB. Free memory was 167.2 MB in the beginning and 109.8 MB in the end (delta: 57.4 MB). Peak memory consumption was 57.4 MB. Max. memory is 7.1 GB. [2020-09-04 22:09:08,160 INFO L168 Benchmark]: TraceAbstraction took 27254.67 ms. Allocated memory was 205.0 MB in the beginning and 472.9 MB in the end (delta: 267.9 MB). Free memory was 109.8 MB in the beginning and 194.0 MB in the end (delta: -84.2 MB). Peak memory consumption was 183.7 MB. Max. memory is 7.1 GB. [2020-09-04 22:09:08,163 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.29 ms. Allocated memory is still 146.8 MB. Free memory was 122.3 MB in the beginning and 122.1 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 673.90 ms. Allocated memory was 146.8 MB in the beginning and 205.0 MB in the end (delta: 58.2 MB). Free memory was 101.9 MB in the beginning and 170.7 MB in the end (delta: -68.8 MB). Peak memory consumption was 22.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 78.23 ms. Allocated memory is still 205.0 MB. Free memory was 170.7 MB in the beginning and 167.2 MB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 818.17 ms. Allocated memory is still 205.0 MB. Free memory was 167.2 MB in the beginning and 109.8 MB in the end (delta: 57.4 MB). Peak memory consumption was 57.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 27254.67 ms. Allocated memory was 205.0 MB in the beginning and 472.9 MB in the end (delta: 267.9 MB). Free memory was 109.8 MB in the beginning and 194.0 MB in the end (delta: -84.2 MB). Peak memory consumption was 183.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 630]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L616] CALL, EXPR _get_nondet_int(2, 5) VAL [\old(from)=2, \old(until)=5] [L609] int len = from; VAL [\old(from)=2, \old(until)=5, from=2, len=2, until=5] [L610] len < until && __VERIFIER_nondet_int() VAL [\old(from)=2, \old(until)=5, from=2, len=2, len < until && __VERIFIER_nondet_int()=1, until=5] [L610] len < until && __VERIFIER_nondet_int() VAL [\old(from)=2, \old(until)=5, __VERIFIER_nondet_int()=0, from=2, len=2, len < until && __VERIFIER_nondet_int()=0, until=5] [L610] COND FALSE !(len < until && __VERIFIER_nondet_int()) VAL [\old(from)=2, \old(until)=5, __VERIFIER_nondet_int()=0, from=2, len=2, len < until && __VERIFIER_nondet_int()=0, until=5] [L613] return len; VAL [\old(from)=2, \old(until)=5, \result=2, from=2, len=2, until=5] [L616] RET, EXPR _get_nondet_int(2, 5) VAL [_get_nondet_int(2, 5)=2] [L616] const int len = _get_nondet_int(2, 5); VAL [_get_nondet_int(2, 5)=2, len=2] [L617] SLL s = sll_create(len); VAL [len=2, s={2:0}] [L617] CALL, EXPR sll_create(len) VAL [\old(len)=2] [L564] SLL head = ((void *)0); VAL [\old(len)=2, head={0:0}, len=2] [L565] EXPR len-- VAL [\old(len)=2, head={0:0}, len=1, len--=2] [L565] COND TRUE len-- > 0 VAL [\old(len)=2, head={0:0}, len=1, len--=2] [L566] SLL new_head = (SLL) malloc(sizeof(struct node)); VAL [\old(len)=2, head={0:0}, len=1, malloc(sizeof(struct node))={-1:0}, new_head={-1:0}] [L567] COND FALSE !(((void *)0) == new_head) VAL [\old(len)=2, head={0:0}, len=1, malloc(sizeof(struct node))={-1:0}, new_head={-1:0}] [L570] new_head->next = head VAL [\old(len)=2, head={0:0}, len=1, malloc(sizeof(struct node))={-1:0}, new_head={-1:0}] [L571] head = new_head VAL [\old(len)=2, head={-1:0}, len=1, malloc(sizeof(struct node))={-1:0}, new_head={-1:0}] [L565] EXPR len-- VAL [\old(len)=2, head={-1:0}, len=0, len--=1, malloc(sizeof(struct node))={-1:0}, new_head={-1:0}] [L565] COND TRUE len-- > 0 VAL [\old(len)=2, head={-1:0}, len=0, len--=1, malloc(sizeof(struct node))={-1:0}, new_head={-1:0}] [L566] SLL new_head = (SLL) malloc(sizeof(struct node)); VAL [\old(len)=2, head={-1:0}, len=0, malloc(sizeof(struct node))={-2:0}, new_head={-2:0}] [L567] COND FALSE !(((void *)0) == new_head) VAL [\old(len)=2, head={-1:0}, len=0, malloc(sizeof(struct node))={-2:0}, new_head={-2:0}] [L570] new_head->next = head VAL [\old(len)=2, head={-1:0}, len=0, malloc(sizeof(struct node))={-2:0}, new_head={-2:0}] [L571] head = new_head VAL [\old(len)=2, head={-2:0}, len=0, malloc(sizeof(struct node))={-2:0}, new_head={-2:0}] [L565] EXPR len-- VAL [\old(len)=2, head={-2:0}, len=-1, len--=0, malloc(sizeof(struct node))={-2:0}, new_head={-2:0}] [L565] COND FALSE !(len-- > 0) VAL [\old(len)=2, head={-2:0}, len=-1, len--=0, malloc(sizeof(struct node))={-2:0}, new_head={-2:0}] [L573] return head; VAL [\old(len)=2, \result={-2:0}, head={-2:0}, len=-1, malloc(sizeof(struct node))={-2:0}, new_head={-2:0}] [L617] RET, EXPR sll_create(len) VAL [len=2, s={2:0}, sll_create(len)={-2:0}] [L617] SLL s = sll_create(len); VAL [len=2, s={2:0}, sll_create(len)={-2:0}] [L618] CALL, EXPR _get_nondet_int(0, len - 1) VAL [\old(from)=0, \old(until)=1] [L609] int len = from; VAL [\old(from)=0, \old(until)=1, from=0, len=0, until=1] [L610] len < until && __VERIFIER_nondet_int() VAL [\old(from)=0, \old(until)=1, from=0, len=0, len < until && __VERIFIER_nondet_int()=1, until=1] [L610] len < until && __VERIFIER_nondet_int() VAL [\old(from)=0, \old(until)=1, __VERIFIER_nondet_int()=1, from=0, len=0, len < until && __VERIFIER_nondet_int()=1, until=1] [L610] COND TRUE len < until && __VERIFIER_nondet_int() VAL [\old(from)=0, \old(until)=1, __VERIFIER_nondet_int()=1, from=0, len=0, len < until && __VERIFIER_nondet_int()=1, until=1] [L611] len++ VAL [\old(from)=0, \old(until)=1, from=0, len=1, until=1] [L610] len < until && __VERIFIER_nondet_int() VAL [\old(from)=0, \old(until)=1, from=0, len=1, len < until && __VERIFIER_nondet_int()=0, until=1] [L610] COND FALSE !(len < until && __VERIFIER_nondet_int()) VAL [\old(from)=0, \old(until)=1, from=0, len=1, len < until && __VERIFIER_nondet_int()=0, until=1] [L613] return len; VAL [\old(from)=0, \old(until)=1, \result=1, from=0, len=1, until=1] [L618] RET, EXPR _get_nondet_int(0, len - 1) VAL [_get_nondet_int(0, len - 1)=1, len=2, s={2:0}] [L618] const int k = _get_nondet_int(0, len - 1); VAL [_get_nondet_int(0, len - 1)=1, k=1, len=2, s={2:0}] [L619] int i = 0; VAL [i=0, k=1, len=2, s={2:0}] [L620] i < k && __VERIFIER_nondet_int() VAL [i=0, i < k && __VERIFIER_nondet_int()=1, k=1, len=2, s={2:0}] [L620] i < k && __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=0, i=0, i < k && __VERIFIER_nondet_int()=0, k=1, len=2, s={2:0}] [L620] COND FALSE !(i < k && __VERIFIER_nondet_int()) VAL [__VERIFIER_nondet_int()=0, i=0, i < k && __VERIFIER_nondet_int()=0, k=1, len=2, s={2:0}] [L625] EXPR \read(s) VAL [\read(s)={-2:0}, i=0, k=1, len=2, s={2:0}] [L625] CALL, EXPR sll_length(s) VAL [head={-2:0}] [L576] int len = 0; VAL [head={-2:0}, head={-2:0}, len=0] [L577] COND TRUE \read(head) VAL [head={-2:0}, head={-2:0}, len=0] [L578] len++ VAL [head={-2:0}, head={-2:0}, len=1] [L579] EXPR head->next VAL [head={-2:0}, head={-2:0}, head->next={-1:0}, len=1] [L579] head = head->next VAL [head={-1:0}, head={-2:0}, head->next={-1:0}, len=1] [L577] COND TRUE \read(head) VAL [head={-1:0}, head={-2:0}, len=1] [L578] len++ VAL [head={-2:0}, head={-1:0}, len=2] [L579] EXPR head->next VAL [head={-1:0}, head={-2:0}, head->next={0:0}, len=2] [L579] head = head->next VAL [head={-2:0}, head={0:0}, head->next={0:0}, len=2] [L577] COND FALSE !(\read(head)) VAL [head={-2:0}, head={0:0}, len=2] [L581] return len; VAL [\result=2, head={0:0}, head={-2:0}, len=2] [L625] RET, EXPR sll_length(s) VAL [\read(s)={-2:0}, i=0, k=1, len=2, s={2:0}, sll_length(s)=2] [L625] COND TRUE k + len != sll_length(s) VAL [\read(s)={-2:0}, i=0, k=1, len=2, s={2:0}, sll_length(s)=2] [L630] __VERIFIER_error() VAL [i=0, k=1, len=2, s={2:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 11 procedures, 153 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 27.1s, OverallIterations: 15, TraceHistogramMax: 3, AutomataDifference: 21.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1930 SDtfs, 4099 SDslu, 11478 SDs, 0 SdLazy, 12874 SolverSat, 560 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 589 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 394 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1761 ImplicationChecksByTransitivity, 10.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=321occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 14 MinimizatonAttempts, 648 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.1s InterpolantComputationTime, 1377 NumberOfCodeBlocks, 1377 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 1248 ConstructedInterpolants, 0 QuantifiedInterpolants, 573141 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 2 PerfectInterpolantSequences, 167/365 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...