/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.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-ext2-properties/list_and_tree_cnstr-1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.0-b8ad66e [2020-10-24 01:09:11,909 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-24 01:09:11,912 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-24 01:09:11,948 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-24 01:09:11,949 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-24 01:09:11,950 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-24 01:09:11,952 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-24 01:09:11,954 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-24 01:09:11,956 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-24 01:09:11,957 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-24 01:09:11,958 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-24 01:09:11,960 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-24 01:09:11,960 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-24 01:09:11,962 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-24 01:09:11,963 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-24 01:09:11,964 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-24 01:09:11,965 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-24 01:09:11,966 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-24 01:09:11,969 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-24 01:09:11,971 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-24 01:09:11,973 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-24 01:09:11,979 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-24 01:09:11,981 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-24 01:09:11,982 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-24 01:09:11,996 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-24 01:09:11,996 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-24 01:09:11,997 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-24 01:09:12,000 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-24 01:09:12,004 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-24 01:09:12,005 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-24 01:09:12,006 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-24 01:09:12,007 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-24 01:09:12,008 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-24 01:09:12,009 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-24 01:09:12,011 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-24 01:09:12,011 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-24 01:09:12,012 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-24 01:09:12,012 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-24 01:09:12,012 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-24 01:09:12,013 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-24 01:09:12,015 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-24 01:09:12,016 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-10-24 01:09:12,034 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-24 01:09:12,035 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-24 01:09:12,039 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-24 01:09:12,039 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-24 01:09:12,040 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-24 01:09:12,040 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-24 01:09:12,040 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-24 01:09:12,040 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-24 01:09:12,040 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-24 01:09:12,041 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-24 01:09:12,042 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-24 01:09:12,042 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-24 01:09:12,042 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-24 01:09:12,042 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-24 01:09:12,043 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-24 01:09:12,043 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-10-24 01:09:12,044 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-24 01:09:12,044 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-24 01:09:12,044 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-24 01:09:12,044 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-24 01:09:12,044 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-10-24 01:09:12,045 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-24 01:09:12,045 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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-10-24 01:09:12,453 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-24 01:09:12,486 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-24 01:09:12,488 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-24 01:09:12,490 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-24 01:09:12,490 INFO L275 PluginConnector]: CDTParser initialized [2020-10-24 01:09:12,491 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext2-properties/list_and_tree_cnstr-1.i [2020-10-24 01:09:12,588 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb458a738/f5bed8185ddc4898addaec51f71e0bf1/FLAGfe7f07510 [2020-10-24 01:09:13,385 INFO L306 CDTParser]: Found 1 translation units. [2020-10-24 01:09:13,386 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-ext2-properties/list_and_tree_cnstr-1.i [2020-10-24 01:09:13,404 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb458a738/f5bed8185ddc4898addaec51f71e0bf1/FLAGfe7f07510 [2020-10-24 01:09:13,665 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb458a738/f5bed8185ddc4898addaec51f71e0bf1 [2020-10-24 01:09:13,669 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-24 01:09:13,679 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-10-24 01:09:13,685 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-24 01:09:13,685 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-24 01:09:13,694 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-24 01:09:13,695 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 01:09:13" (1/1) ... [2020-10-24 01:09:13,699 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54ab810a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:09:13, skipping insertion in model container [2020-10-24 01:09:13,699 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 01:09:13" (1/1) ... [2020-10-24 01:09:13,708 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-24 01:09:13,780 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-24 01:09:14,073 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-24 01:09:14,083 INFO L203 MainTranslator]: Completed pre-run [2020-10-24 01:09:14,137 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-24 01:09:14,201 INFO L208 MainTranslator]: Completed translation [2020-10-24 01:09:14,201 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:09:14 WrapperNode [2020-10-24 01:09:14,201 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-24 01:09:14,203 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-24 01:09:14,203 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-24 01:09:14,203 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-24 01:09:14,216 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:09:14" (1/1) ... [2020-10-24 01:09:14,216 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:09:14" (1/1) ... [2020-10-24 01:09:14,236 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:09:14" (1/1) ... [2020-10-24 01:09:14,247 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:09:14" (1/1) ... [2020-10-24 01:09:14,275 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:09:14" (1/1) ... [2020-10-24 01:09:14,283 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:09:14" (1/1) ... [2020-10-24 01:09:14,287 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:09:14" (1/1) ... [2020-10-24 01:09:14,295 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-24 01:09:14,296 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-24 01:09:14,296 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-24 01:09:14,296 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-24 01:09:14,297 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:09:14" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-24 01:09:14,377 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-10-24 01:09:14,378 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-24 01:09:14,378 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-10-24 01:09:14,378 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2020-10-24 01:09:14,378 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2020-10-24 01:09:14,378 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2020-10-24 01:09:14,379 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-10-24 01:09:14,379 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-10-24 01:09:14,379 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-10-24 01:09:14,379 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2020-10-24 01:09:14,379 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2020-10-24 01:09:14,380 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-10-24 01:09:14,380 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-24 01:09:14,380 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-10-24 01:09:14,380 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2020-10-24 01:09:14,381 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2020-10-24 01:09:14,381 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2020-10-24 01:09:14,381 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2020-10-24 01:09:14,382 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2020-10-24 01:09:14,382 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2020-10-24 01:09:14,383 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2020-10-24 01:09:14,383 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2020-10-24 01:09:14,385 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2020-10-24 01:09:14,385 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2020-10-24 01:09:14,386 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2020-10-24 01:09:14,386 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2020-10-24 01:09:14,386 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2020-10-24 01:09:14,386 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2020-10-24 01:09:14,386 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2020-10-24 01:09:14,386 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2020-10-24 01:09:14,386 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2020-10-24 01:09:14,387 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2020-10-24 01:09:14,387 INFO L130 BoogieDeclarations]: Found specification of procedure select [2020-10-24 01:09:14,387 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2020-10-24 01:09:14,387 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2020-10-24 01:09:14,387 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2020-10-24 01:09:14,387 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2020-10-24 01:09:14,387 INFO L130 BoogieDeclarations]: Found specification of procedure random [2020-10-24 01:09:14,388 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2020-10-24 01:09:14,388 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2020-10-24 01:09:14,388 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2020-10-24 01:09:14,388 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2020-10-24 01:09:14,388 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2020-10-24 01:09:14,388 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2020-10-24 01:09:14,388 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2020-10-24 01:09:14,388 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2020-10-24 01:09:14,389 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2020-10-24 01:09:14,389 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2020-10-24 01:09:14,389 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2020-10-24 01:09:14,389 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2020-10-24 01:09:14,389 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2020-10-24 01:09:14,389 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2020-10-24 01:09:14,389 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2020-10-24 01:09:14,389 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2020-10-24 01:09:14,390 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2020-10-24 01:09:14,390 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2020-10-24 01:09:14,390 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2020-10-24 01:09:14,390 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2020-10-24 01:09:14,390 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2020-10-24 01:09:14,390 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2020-10-24 01:09:14,390 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2020-10-24 01:09:14,391 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2020-10-24 01:09:14,392 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2020-10-24 01:09:14,392 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2020-10-24 01:09:14,392 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2020-10-24 01:09:14,392 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2020-10-24 01:09:14,392 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-10-24 01:09:14,392 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2020-10-24 01:09:14,393 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2020-10-24 01:09:14,393 INFO L130 BoogieDeclarations]: Found specification of procedure free [2020-10-24 01:09:14,393 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2020-10-24 01:09:14,393 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2020-10-24 01:09:14,393 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2020-10-24 01:09:14,394 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2020-10-24 01:09:14,394 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2020-10-24 01:09:14,394 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2020-10-24 01:09:14,394 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2020-10-24 01:09:14,394 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2020-10-24 01:09:14,394 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-10-24 01:09:14,394 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2020-10-24 01:09:14,395 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2020-10-24 01:09:14,395 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2020-10-24 01:09:14,396 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2020-10-24 01:09:14,396 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2020-10-24 01:09:14,396 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2020-10-24 01:09:14,396 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2020-10-24 01:09:14,397 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2020-10-24 01:09:14,398 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2020-10-24 01:09:14,398 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2020-10-24 01:09:14,398 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2020-10-24 01:09:14,399 INFO L130 BoogieDeclarations]: Found specification of procedure system [2020-10-24 01:09:14,399 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2020-10-24 01:09:14,399 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2020-10-24 01:09:14,399 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2020-10-24 01:09:14,399 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2020-10-24 01:09:14,400 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2020-10-24 01:09:14,400 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2020-10-24 01:09:14,400 INFO L130 BoogieDeclarations]: Found specification of procedure div [2020-10-24 01:09:14,400 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2020-10-24 01:09:14,400 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2020-10-24 01:09:14,400 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2020-10-24 01:09:14,400 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2020-10-24 01:09:14,400 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2020-10-24 01:09:14,401 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2020-10-24 01:09:14,401 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2020-10-24 01:09:14,401 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2020-10-24 01:09:14,401 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2020-10-24 01:09:14,401 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2020-10-24 01:09:14,401 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2020-10-24 01:09:14,401 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2020-10-24 01:09:14,402 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2020-10-24 01:09:14,402 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2020-10-24 01:09:14,402 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2020-10-24 01:09:14,402 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2020-10-24 01:09:14,402 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2020-10-24 01:09:14,402 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2020-10-24 01:09:14,402 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2020-10-24 01:09:14,402 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2020-10-24 01:09:14,403 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2020-10-24 01:09:14,403 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-10-24 01:09:14,403 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-10-24 01:09:14,403 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-10-24 01:09:14,404 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-10-24 01:09:14,404 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-24 01:09:14,404 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-24 01:09:14,404 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-24 01:09:14,404 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-10-24 01:09:14,404 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-24 01:09:14,408 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-24 01:09:14,858 INFO L751 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2020-10-24 01:09:15,389 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-24 01:09:15,389 INFO L298 CfgBuilder]: Removed 8 assume(true) statements. [2020-10-24 01:09:15,392 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 01:09:15 BoogieIcfgContainer [2020-10-24 01:09:15,392 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-24 01:09:15,395 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-24 01:09:15,395 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-24 01:09:15,400 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-24 01:09:15,400 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 01:09:13" (1/3) ... [2020-10-24 01:09:15,401 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ee3909d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 01:09:15, skipping insertion in model container [2020-10-24 01:09:15,402 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:09:14" (2/3) ... [2020-10-24 01:09:15,402 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ee3909d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 01:09:15, skipping insertion in model container [2020-10-24 01:09:15,402 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 01:09:15" (3/3) ... [2020-10-24 01:09:15,405 INFO L111 eAbstractionObserver]: Analyzing ICFG list_and_tree_cnstr-1.i [2020-10-24 01:09:15,420 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-24 01:09:15,429 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-10-24 01:09:15,444 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-10-24 01:09:15,485 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-24 01:09:15,486 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-24 01:09:15,486 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-24 01:09:15,488 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-24 01:09:15,492 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-24 01:09:15,492 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-24 01:09:15,492 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-24 01:09:15,493 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-24 01:09:15,522 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states. [2020-10-24 01:09:15,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-10-24 01:09:15,547 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 01:09:15,548 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 01:09:15,549 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 01:09:15,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 01:09:15,557 INFO L82 PathProgramCache]: Analyzing trace with hash -1423555653, now seen corresponding path program 1 times [2020-10-24 01:09:15,569 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 01:09:15,570 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [944901921] [2020-10-24 01:09:15,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 01:09:15,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:09:15,813 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 01:09:15,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:09:15,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 01:09:15,839 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [944901921] [2020-10-24 01:09:15,841 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-24 01:09:15,841 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-24 01:09:15,842 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532363502] [2020-10-24 01:09:15,849 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-24 01:09:15,850 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 01:09:15,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-24 01:09:15,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-24 01:09:15,866 INFO L87 Difference]: Start difference. First operand 187 states. Second operand 3 states. [2020-10-24 01:09:16,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 01:09:16,353 INFO L93 Difference]: Finished difference Result 354 states and 415 transitions. [2020-10-24 01:09:16,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-24 01:09:16,355 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2020-10-24 01:09:16,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 01:09:16,366 INFO L225 Difference]: With dead ends: 354 [2020-10-24 01:09:16,366 INFO L226 Difference]: Without dead ends: 172 [2020-10-24 01:09:16,371 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-24 01:09:16,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2020-10-24 01:09:16,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 172. [2020-10-24 01:09:16,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2020-10-24 01:09:16,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 189 transitions. [2020-10-24 01:09:16,427 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 189 transitions. Word has length 37 [2020-10-24 01:09:16,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 01:09:16,427 INFO L481 AbstractCegarLoop]: Abstraction has 172 states and 189 transitions. [2020-10-24 01:09:16,427 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-24 01:09:16,428 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 189 transitions. [2020-10-24 01:09:16,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2020-10-24 01:09:16,430 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 01:09:16,431 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 01:09:16,431 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-24 01:09:16,431 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 01:09:16,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 01:09:16,432 INFO L82 PathProgramCache]: Analyzing trace with hash -1825754480, now seen corresponding path program 1 times [2020-10-24 01:09:16,432 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 01:09:16,433 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [771126764] [2020-10-24 01:09:16,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 01:09:16,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:09:16,590 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 01:09:16,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:09:16,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 01:09:16,621 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [771126764] [2020-10-24 01:09:16,621 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-24 01:09:16,622 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-24 01:09:16,622 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278834415] [2020-10-24 01:09:16,624 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-24 01:09:16,624 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 01:09:16,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-24 01:09:16,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-24 01:09:16,626 INFO L87 Difference]: Start difference. First operand 172 states and 189 transitions. Second operand 5 states. [2020-10-24 01:09:17,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 01:09:17,166 INFO L93 Difference]: Finished difference Result 259 states and 285 transitions. [2020-10-24 01:09:17,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-24 01:09:17,167 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2020-10-24 01:09:17,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 01:09:17,173 INFO L225 Difference]: With dead ends: 259 [2020-10-24 01:09:17,173 INFO L226 Difference]: Without dead ends: 207 [2020-10-24 01:09:17,174 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-24 01:09:17,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2020-10-24 01:09:17,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 206. [2020-10-24 01:09:17,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2020-10-24 01:09:17,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 228 transitions. [2020-10-24 01:09:17,205 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 228 transitions. Word has length 47 [2020-10-24 01:09:17,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 01:09:17,205 INFO L481 AbstractCegarLoop]: Abstraction has 206 states and 228 transitions. [2020-10-24 01:09:17,206 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-24 01:09:17,206 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 228 transitions. [2020-10-24 01:09:17,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2020-10-24 01:09:17,209 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 01:09:17,209 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 01:09:17,209 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-24 01:09:17,210 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 01:09:17,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 01:09:17,210 INFO L82 PathProgramCache]: Analyzing trace with hash 1787311828, now seen corresponding path program 1 times [2020-10-24 01:09:17,211 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 01:09:17,211 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1250099270] [2020-10-24 01:09:17,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 01:09:17,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:09:17,366 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 01:09:17,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:09:17,384 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 01:09:17,385 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1250099270] [2020-10-24 01:09:17,385 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-24 01:09:17,385 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-24 01:09:17,385 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727896862] [2020-10-24 01:09:17,386 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-24 01:09:17,386 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 01:09:17,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-24 01:09:17,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-10-24 01:09:17,387 INFO L87 Difference]: Start difference. First operand 206 states and 228 transitions. Second operand 7 states. [2020-10-24 01:09:18,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 01:09:18,309 INFO L93 Difference]: Finished difference Result 538 states and 604 transitions. [2020-10-24 01:09:18,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-24 01:09:18,310 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 60 [2020-10-24 01:09:18,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 01:09:18,314 INFO L225 Difference]: With dead ends: 538 [2020-10-24 01:09:18,314 INFO L226 Difference]: Without dead ends: 417 [2020-10-24 01:09:18,317 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2020-10-24 01:09:18,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2020-10-24 01:09:18,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 290. [2020-10-24 01:09:18,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 290 states. [2020-10-24 01:09:18,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 325 transitions. [2020-10-24 01:09:18,402 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 325 transitions. Word has length 60 [2020-10-24 01:09:18,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 01:09:18,402 INFO L481 AbstractCegarLoop]: Abstraction has 290 states and 325 transitions. [2020-10-24 01:09:18,402 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-24 01:09:18,402 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 325 transitions. [2020-10-24 01:09:18,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2020-10-24 01:09:18,414 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 01:09:18,415 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 01:09:18,415 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-24 01:09:18,415 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 01:09:18,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 01:09:18,418 INFO L82 PathProgramCache]: Analyzing trace with hash -534721967, now seen corresponding path program 1 times [2020-10-24 01:09:18,419 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 01:09:18,419 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2083260692] [2020-10-24 01:09:18,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 01:09:18,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:09:18,558 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 01:09:18,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:09:18,573 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-24 01:09:18,573 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2083260692] [2020-10-24 01:09:18,574 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-24 01:09:18,574 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-24 01:09:18,574 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176380274] [2020-10-24 01:09:18,575 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-24 01:09:18,575 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 01:09:18,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-24 01:09:18,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-10-24 01:09:18,576 INFO L87 Difference]: Start difference. First operand 290 states and 325 transitions. Second operand 7 states. [2020-10-24 01:09:19,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 01:09:19,148 INFO L93 Difference]: Finished difference Result 367 states and 409 transitions. [2020-10-24 01:09:19,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-24 01:09:19,149 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 62 [2020-10-24 01:09:19,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 01:09:19,153 INFO L225 Difference]: With dead ends: 367 [2020-10-24 01:09:19,154 INFO L226 Difference]: Without dead ends: 359 [2020-10-24 01:09:19,154 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2020-10-24 01:09:19,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2020-10-24 01:09:19,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 303. [2020-10-24 01:09:19,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303 states. [2020-10-24 01:09:19,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 341 transitions. [2020-10-24 01:09:19,192 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 341 transitions. Word has length 62 [2020-10-24 01:09:19,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 01:09:19,192 INFO L481 AbstractCegarLoop]: Abstraction has 303 states and 341 transitions. [2020-10-24 01:09:19,192 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-24 01:09:19,193 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 341 transitions. [2020-10-24 01:09:19,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2020-10-24 01:09:19,194 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 01:09:19,195 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 01:09:19,195 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-24 01:09:19,195 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 01:09:19,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 01:09:19,196 INFO L82 PathProgramCache]: Analyzing trace with hash 846185769, now seen corresponding path program 1 times [2020-10-24 01:09:19,196 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 01:09:19,196 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1872371284] [2020-10-24 01:09:19,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 01:09:19,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:09:19,297 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 01:09:19,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:09:19,311 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-24 01:09:19,311 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1872371284] [2020-10-24 01:09:19,311 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-24 01:09:19,312 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-24 01:09:19,312 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6254830] [2020-10-24 01:09:19,312 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-24 01:09:19,313 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 01:09:19,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-24 01:09:19,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-10-24 01:09:19,314 INFO L87 Difference]: Start difference. First operand 303 states and 341 transitions. Second operand 7 states. [2020-10-24 01:09:19,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 01:09:19,851 INFO L93 Difference]: Finished difference Result 370 states and 412 transitions. [2020-10-24 01:09:19,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-24 01:09:19,852 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 68 [2020-10-24 01:09:19,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 01:09:19,855 INFO L225 Difference]: With dead ends: 370 [2020-10-24 01:09:19,855 INFO L226 Difference]: Without dead ends: 353 [2020-10-24 01:09:19,856 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2020-10-24 01:09:19,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2020-10-24 01:09:19,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 300. [2020-10-24 01:09:19,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300 states. [2020-10-24 01:09:19,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 337 transitions. [2020-10-24 01:09:19,898 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 337 transitions. Word has length 68 [2020-10-24 01:09:19,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 01:09:19,901 INFO L481 AbstractCegarLoop]: Abstraction has 300 states and 337 transitions. [2020-10-24 01:09:19,901 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-24 01:09:19,901 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 337 transitions. [2020-10-24 01:09:19,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2020-10-24 01:09:19,903 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 01:09:19,903 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 01:09:19,903 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-24 01:09:19,903 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 01:09:19,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 01:09:19,904 INFO L82 PathProgramCache]: Analyzing trace with hash 664959833, now seen corresponding path program 1 times [2020-10-24 01:09:19,904 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 01:09:19,904 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1484332519] [2020-10-24 01:09:19,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 01:09:19,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:09:20,040 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 01:09:20,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:09:20,052 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-24 01:09:20,053 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1484332519] [2020-10-24 01:09:20,053 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-24 01:09:20,053 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-24 01:09:20,054 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527730258] [2020-10-24 01:09:20,054 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-24 01:09:20,054 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 01:09:20,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-24 01:09:20,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-10-24 01:09:20,055 INFO L87 Difference]: Start difference. First operand 300 states and 337 transitions. Second operand 7 states. [2020-10-24 01:09:20,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 01:09:20,564 INFO L93 Difference]: Finished difference Result 353 states and 393 transitions. [2020-10-24 01:09:20,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-24 01:09:20,564 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 68 [2020-10-24 01:09:20,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 01:09:20,567 INFO L225 Difference]: With dead ends: 353 [2020-10-24 01:09:20,567 INFO L226 Difference]: Without dead ends: 327 [2020-10-24 01:09:20,568 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2020-10-24 01:09:20,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2020-10-24 01:09:20,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 295. [2020-10-24 01:09:20,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states. [2020-10-24 01:09:20,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 331 transitions. [2020-10-24 01:09:20,605 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 331 transitions. Word has length 68 [2020-10-24 01:09:20,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 01:09:20,605 INFO L481 AbstractCegarLoop]: Abstraction has 295 states and 331 transitions. [2020-10-24 01:09:20,605 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-24 01:09:20,605 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 331 transitions. [2020-10-24 01:09:20,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2020-10-24 01:09:20,608 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 01:09:20,608 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 01:09:20,608 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-24 01:09:20,608 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 01:09:20,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 01:09:20,612 INFO L82 PathProgramCache]: Analyzing trace with hash 41938962, now seen corresponding path program 1 times [2020-10-24 01:09:20,612 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 01:09:20,612 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2109982414] [2020-10-24 01:09:20,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 01:09:20,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:09:20,980 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 01:09:20,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:09:21,002 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-24 01:09:21,002 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2109982414] [2020-10-24 01:09:21,002 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 01:09:21,003 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2020-10-24 01:09:21,003 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084479878] [2020-10-24 01:09:21,003 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-10-24 01:09:21,004 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 01:09:21,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-10-24 01:09:21,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2020-10-24 01:09:21,005 INFO L87 Difference]: Start difference. First operand 295 states and 331 transitions. Second operand 15 states. [2020-10-24 01:09:22,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 01:09:22,056 INFO L93 Difference]: Finished difference Result 390 states and 433 transitions. [2020-10-24 01:09:22,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-10-24 01:09:22,056 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 73 [2020-10-24 01:09:22,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 01:09:22,060 INFO L225 Difference]: With dead ends: 390 [2020-10-24 01:09:22,060 INFO L226 Difference]: Without dead ends: 375 [2020-10-24 01:09:22,061 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=228, Invalid=764, Unknown=0, NotChecked=0, Total=992 [2020-10-24 01:09:22,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2020-10-24 01:09:22,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 311. [2020-10-24 01:09:22,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 311 states. [2020-10-24 01:09:22,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 348 transitions. [2020-10-24 01:09:22,094 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 348 transitions. Word has length 73 [2020-10-24 01:09:22,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 01:09:22,095 INFO L481 AbstractCegarLoop]: Abstraction has 311 states and 348 transitions. [2020-10-24 01:09:22,096 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-10-24 01:09:22,096 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 348 transitions. [2020-10-24 01:09:22,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2020-10-24 01:09:22,097 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 01:09:22,097 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 01:09:22,098 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-24 01:09:22,098 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 01:09:22,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 01:09:22,098 INFO L82 PathProgramCache]: Analyzing trace with hash 1285786464, now seen corresponding path program 1 times [2020-10-24 01:09:22,098 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 01:09:22,099 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1939355843] [2020-10-24 01:09:22,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 01:09:22,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:09:22,430 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 01:09:22,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:09:22,446 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-24 01:09:22,447 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1939355843] [2020-10-24 01:09:22,447 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 01:09:22,447 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2020-10-24 01:09:22,447 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870451973] [2020-10-24 01:09:22,448 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-10-24 01:09:22,448 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 01:09:22,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-10-24 01:09:22,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2020-10-24 01:09:22,449 INFO L87 Difference]: Start difference. First operand 311 states and 348 transitions. Second operand 15 states. [2020-10-24 01:09:23,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 01:09:23,772 INFO L93 Difference]: Finished difference Result 414 states and 460 transitions. [2020-10-24 01:09:23,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-10-24 01:09:23,773 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 73 [2020-10-24 01:09:23,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 01:09:23,775 INFO L225 Difference]: With dead ends: 414 [2020-10-24 01:09:23,776 INFO L226 Difference]: Without dead ends: 406 [2020-10-24 01:09:23,777 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=228, Invalid=764, Unknown=0, NotChecked=0, Total=992 [2020-10-24 01:09:23,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2020-10-24 01:09:23,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 333. [2020-10-24 01:09:23,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333 states. [2020-10-24 01:09:23,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 373 transitions. [2020-10-24 01:09:23,808 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 373 transitions. Word has length 73 [2020-10-24 01:09:23,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 01:09:23,809 INFO L481 AbstractCegarLoop]: Abstraction has 333 states and 373 transitions. [2020-10-24 01:09:23,809 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-10-24 01:09:23,809 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 373 transitions. [2020-10-24 01:09:23,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2020-10-24 01:09:23,810 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 01:09:23,811 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 01:09:23,811 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-24 01:09:23,811 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 01:09:23,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 01:09:23,812 INFO L82 PathProgramCache]: Analyzing trace with hash -287011750, now seen corresponding path program 1 times [2020-10-24 01:09:23,812 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 01:09:23,812 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [644657489] [2020-10-24 01:09:23,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 01:09:23,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:09:24,398 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 01:09:24,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:09:24,429 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-24 01:09:24,429 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [644657489] [2020-10-24 01:09:24,429 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 01:09:24,429 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2020-10-24 01:09:24,430 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936305776] [2020-10-24 01:09:24,430 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-10-24 01:09:24,430 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 01:09:24,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-10-24 01:09:24,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=240, Unknown=0, NotChecked=0, Total=272 [2020-10-24 01:09:24,432 INFO L87 Difference]: Start difference. First operand 333 states and 373 transitions. Second operand 17 states. [2020-10-24 01:09:26,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 01:09:26,145 INFO L93 Difference]: Finished difference Result 398 states and 443 transitions. [2020-10-24 01:09:26,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-10-24 01:09:26,148 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 79 [2020-10-24 01:09:26,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 01:09:26,150 INFO L225 Difference]: With dead ends: 398 [2020-10-24 01:09:26,150 INFO L226 Difference]: Without dead ends: 390 [2020-10-24 01:09:26,151 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=215, Invalid=907, Unknown=0, NotChecked=0, Total=1122 [2020-10-24 01:09:26,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2020-10-24 01:09:26,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 337. [2020-10-24 01:09:26,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337 states. [2020-10-24 01:09:26,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 377 transitions. [2020-10-24 01:09:26,191 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 377 transitions. Word has length 79 [2020-10-24 01:09:26,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 01:09:26,192 INFO L481 AbstractCegarLoop]: Abstraction has 337 states and 377 transitions. [2020-10-24 01:09:26,192 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-10-24 01:09:26,192 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 377 transitions. [2020-10-24 01:09:26,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2020-10-24 01:09:26,193 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 01:09:26,194 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 01:09:26,194 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-24 01:09:26,194 INFO L429 AbstractCegarLoop]: === Iteration 10 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 01:09:26,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 01:09:26,194 INFO L82 PathProgramCache]: Analyzing trace with hash 1637564152, now seen corresponding path program 1 times [2020-10-24 01:09:26,195 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 01:09:26,195 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1464724351] [2020-10-24 01:09:26,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 01:09:26,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:09:26,644 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 01:09:26,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:09:26,670 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-24 01:09:26,670 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1464724351] [2020-10-24 01:09:26,670 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 01:09:26,670 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2020-10-24 01:09:26,671 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845615699] [2020-10-24 01:09:26,671 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-10-24 01:09:26,671 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 01:09:26,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-10-24 01:09:26,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=240, Unknown=0, NotChecked=0, Total=272 [2020-10-24 01:09:26,672 INFO L87 Difference]: Start difference. First operand 337 states and 377 transitions. Second operand 17 states. [2020-10-24 01:09:28,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 01:09:28,583 INFO L93 Difference]: Finished difference Result 412 states and 457 transitions. [2020-10-24 01:09:28,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-10-24 01:09:28,584 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 79 [2020-10-24 01:09:28,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 01:09:28,587 INFO L225 Difference]: With dead ends: 412 [2020-10-24 01:09:28,587 INFO L226 Difference]: Without dead ends: 404 [2020-10-24 01:09:28,588 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=215, Invalid=907, Unknown=0, NotChecked=0, Total=1122 [2020-10-24 01:09:28,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2020-10-24 01:09:28,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 346. [2020-10-24 01:09:28,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 346 states. [2020-10-24 01:09:28,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 387 transitions. [2020-10-24 01:09:28,629 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 387 transitions. Word has length 79 [2020-10-24 01:09:28,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 01:09:28,629 INFO L481 AbstractCegarLoop]: Abstraction has 346 states and 387 transitions. [2020-10-24 01:09:28,629 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-10-24 01:09:28,629 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 387 transitions. [2020-10-24 01:09:28,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2020-10-24 01:09:28,631 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 01:09:28,631 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 01:09:28,631 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-24 01:09:28,631 INFO L429 AbstractCegarLoop]: === Iteration 11 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 01:09:28,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 01:09:28,632 INFO L82 PathProgramCache]: Analyzing trace with hash 1456338216, now seen corresponding path program 1 times [2020-10-24 01:09:28,632 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 01:09:28,632 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [461372152] [2020-10-24 01:09:28,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 01:09:28,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:09:28,962 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 01:09:28,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:09:28,987 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-24 01:09:28,988 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [461372152] [2020-10-24 01:09:28,988 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 01:09:28,988 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2020-10-24 01:09:28,988 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274318657] [2020-10-24 01:09:28,989 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-10-24 01:09:28,989 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 01:09:28,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-10-24 01:09:28,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2020-10-24 01:09:28,990 INFO L87 Difference]: Start difference. First operand 346 states and 387 transitions. Second operand 15 states. [2020-10-24 01:09:30,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 01:09:30,475 INFO L93 Difference]: Finished difference Result 429 states and 476 transitions. [2020-10-24 01:09:30,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-10-24 01:09:30,476 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 79 [2020-10-24 01:09:30,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 01:09:30,478 INFO L225 Difference]: With dead ends: 429 [2020-10-24 01:09:30,478 INFO L226 Difference]: Without dead ends: 408 [2020-10-24 01:09:30,480 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=201, Invalid=611, Unknown=0, NotChecked=0, Total=812 [2020-10-24 01:09:30,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2020-10-24 01:09:30,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 346. [2020-10-24 01:09:30,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 346 states. [2020-10-24 01:09:30,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 386 transitions. [2020-10-24 01:09:30,519 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 386 transitions. Word has length 79 [2020-10-24 01:09:30,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 01:09:30,520 INFO L481 AbstractCegarLoop]: Abstraction has 346 states and 386 transitions. [2020-10-24 01:09:30,520 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-10-24 01:09:30,520 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 386 transitions. [2020-10-24 01:09:30,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2020-10-24 01:09:30,521 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 01:09:30,522 INFO L422 BasicCegarLoop]: trace histogram [3, 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] [2020-10-24 01:09:30,522 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-24 01:09:30,522 INFO L429 AbstractCegarLoop]: === Iteration 12 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 01:09:30,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 01:09:30,523 INFO L82 PathProgramCache]: Analyzing trace with hash 2023053233, now seen corresponding path program 2 times [2020-10-24 01:09:30,523 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 01:09:30,523 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1618787375] [2020-10-24 01:09:30,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 01:09:30,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:09:31,012 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 01:09:31,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:09:31,036 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-24 01:09:31,037 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1618787375] [2020-10-24 01:09:31,037 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 01:09:31,037 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2020-10-24 01:09:31,037 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319758903] [2020-10-24 01:09:31,038 INFO L461 AbstractCegarLoop]: Interpolant automaton has 22 states [2020-10-24 01:09:31,038 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 01:09:31,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-10-24 01:09:31,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=397, Unknown=0, NotChecked=0, Total=462 [2020-10-24 01:09:31,039 INFO L87 Difference]: Start difference. First operand 346 states and 386 transitions. Second operand 22 states. [2020-10-24 01:09:33,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 01:09:33,590 INFO L93 Difference]: Finished difference Result 434 states and 481 transitions. [2020-10-24 01:09:33,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2020-10-24 01:09:33,591 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 84 [2020-10-24 01:09:33,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 01:09:33,594 INFO L225 Difference]: With dead ends: 434 [2020-10-24 01:09:33,595 INFO L226 Difference]: Without dead ends: 426 [2020-10-24 01:09:33,596 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 504 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=493, Invalid=2263, Unknown=0, NotChecked=0, Total=2756 [2020-10-24 01:09:33,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2020-10-24 01:09:33,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 371. [2020-10-24 01:09:33,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2020-10-24 01:09:33,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 413 transitions. [2020-10-24 01:09:33,640 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 413 transitions. Word has length 84 [2020-10-24 01:09:33,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 01:09:33,640 INFO L481 AbstractCegarLoop]: Abstraction has 371 states and 413 transitions. [2020-10-24 01:09:33,641 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2020-10-24 01:09:33,641 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 413 transitions. [2020-10-24 01:09:33,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2020-10-24 01:09:33,642 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 01:09:33,643 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 01:09:33,643 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-24 01:09:33,643 INFO L429 AbstractCegarLoop]: === Iteration 13 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 01:09:33,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 01:09:33,644 INFO L82 PathProgramCache]: Analyzing trace with hash 1909669795, now seen corresponding path program 1 times [2020-10-24 01:09:33,644 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 01:09:33,644 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1828234326] [2020-10-24 01:09:33,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 01:09:33,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:09:34,171 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 01:09:34,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:09:34,212 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-24 01:09:34,212 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1828234326] [2020-10-24 01:09:34,212 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 01:09:34,213 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2020-10-24 01:09:34,213 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173992893] [2020-10-24 01:09:34,213 INFO L461 AbstractCegarLoop]: Interpolant automaton has 22 states [2020-10-24 01:09:34,214 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 01:09:34,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-10-24 01:09:34,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=397, Unknown=0, NotChecked=0, Total=462 [2020-10-24 01:09:34,215 INFO L87 Difference]: Start difference. First operand 371 states and 413 transitions. Second operand 22 states. [2020-10-24 01:09:36,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 01:09:36,749 INFO L93 Difference]: Finished difference Result 471 states and 522 transitions. [2020-10-24 01:09:36,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2020-10-24 01:09:36,749 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 84 [2020-10-24 01:09:36,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 01:09:36,752 INFO L225 Difference]: With dead ends: 471 [2020-10-24 01:09:36,752 INFO L226 Difference]: Without dead ends: 463 [2020-10-24 01:09:36,753 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 463 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=459, Invalid=2193, Unknown=0, NotChecked=0, Total=2652 [2020-10-24 01:09:36,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2020-10-24 01:09:36,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 383. [2020-10-24 01:09:36,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-10-24 01:09:36,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 426 transitions. [2020-10-24 01:09:36,801 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 426 transitions. Word has length 84 [2020-10-24 01:09:36,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 01:09:36,801 INFO L481 AbstractCegarLoop]: Abstraction has 383 states and 426 transitions. [2020-10-24 01:09:36,801 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2020-10-24 01:09:36,802 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 426 transitions. [2020-10-24 01:09:36,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2020-10-24 01:09:36,803 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 01:09:36,803 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 01:09:36,803 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-24 01:09:36,804 INFO L429 AbstractCegarLoop]: === Iteration 14 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 01:09:36,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 01:09:36,804 INFO L82 PathProgramCache]: Analyzing trace with hash 938613874, now seen corresponding path program 1 times [2020-10-24 01:09:36,804 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 01:09:36,805 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1976450965] [2020-10-24 01:09:36,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 01:09:36,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:09:37,229 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 01:09:37,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:09:37,252 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-24 01:09:37,253 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1976450965] [2020-10-24 01:09:37,253 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 01:09:37,253 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2020-10-24 01:09:37,254 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925413622] [2020-10-24 01:09:37,254 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-10-24 01:09:37,254 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 01:09:37,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-10-24 01:09:37,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=240, Unknown=0, NotChecked=0, Total=272 [2020-10-24 01:09:37,255 INFO L87 Difference]: Start difference. First operand 383 states and 426 transitions. Second operand 17 states. [2020-10-24 01:09:38,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 01:09:38,923 INFO L93 Difference]: Finished difference Result 441 states and 489 transitions. [2020-10-24 01:09:38,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-10-24 01:09:38,924 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 85 [2020-10-24 01:09:38,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 01:09:38,926 INFO L225 Difference]: With dead ends: 441 [2020-10-24 01:09:38,926 INFO L226 Difference]: Without dead ends: 424 [2020-10-24 01:09:38,927 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=215, Invalid=907, Unknown=0, NotChecked=0, Total=1122 [2020-10-24 01:09:38,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2020-10-24 01:09:38,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 385. [2020-10-24 01:09:38,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-10-24 01:09:38,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 428 transitions. [2020-10-24 01:09:38,977 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 428 transitions. Word has length 85 [2020-10-24 01:09:38,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 01:09:38,977 INFO L481 AbstractCegarLoop]: Abstraction has 385 states and 428 transitions. [2020-10-24 01:09:38,977 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-10-24 01:09:38,977 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 428 transitions. [2020-10-24 01:09:38,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2020-10-24 01:09:38,979 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 01:09:38,979 INFO L422 BasicCegarLoop]: trace histogram [3, 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, 1, 1] [2020-10-24 01:09:38,979 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-24 01:09:38,980 INFO L429 AbstractCegarLoop]: === Iteration 15 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 01:09:38,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 01:09:38,980 INFO L82 PathProgramCache]: Analyzing trace with hash 757387938, now seen corresponding path program 2 times [2020-10-24 01:09:38,980 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 01:09:38,981 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1019821950] [2020-10-24 01:09:38,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 01:09:38,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:09:39,383 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 01:09:39,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:09:39,405 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-24 01:09:39,406 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1019821950] [2020-10-24 01:09:39,406 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 01:09:39,406 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2020-10-24 01:09:39,406 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469710521] [2020-10-24 01:09:39,407 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-10-24 01:09:39,407 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 01:09:39,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-10-24 01:09:39,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=240, Unknown=0, NotChecked=0, Total=272 [2020-10-24 01:09:39,408 INFO L87 Difference]: Start difference. First operand 385 states and 428 transitions. Second operand 17 states. [2020-10-24 01:09:40,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 01:09:40,962 INFO L93 Difference]: Finished difference Result 424 states and 470 transitions. [2020-10-24 01:09:40,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-10-24 01:09:40,962 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 85 [2020-10-24 01:09:40,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 01:09:40,965 INFO L225 Difference]: With dead ends: 424 [2020-10-24 01:09:40,965 INFO L226 Difference]: Without dead ends: 392 [2020-10-24 01:09:40,967 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=201, Invalid=855, Unknown=0, NotChecked=0, Total=1056 [2020-10-24 01:09:40,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2020-10-24 01:09:41,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 374. [2020-10-24 01:09:41,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2020-10-24 01:09:41,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 416 transitions. [2020-10-24 01:09:41,019 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 416 transitions. Word has length 85 [2020-10-24 01:09:41,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 01:09:41,019 INFO L481 AbstractCegarLoop]: Abstraction has 374 states and 416 transitions. [2020-10-24 01:09:41,020 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-10-24 01:09:41,020 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 416 transitions. [2020-10-24 01:09:41,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2020-10-24 01:09:41,021 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 01:09:41,021 INFO L422 BasicCegarLoop]: trace histogram [3, 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, 1, 1] [2020-10-24 01:09:41,022 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-24 01:09:41,022 INFO L429 AbstractCegarLoop]: === Iteration 16 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 01:09:41,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 01:09:41,022 INFO L82 PathProgramCache]: Analyzing trace with hash 91480208, now seen corresponding path program 2 times [2020-10-24 01:09:41,023 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 01:09:41,023 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [636320315] [2020-10-24 01:09:41,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 01:09:41,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:09:41,438 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 01:09:41,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:09:41,463 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-24 01:09:41,463 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [636320315] [2020-10-24 01:09:41,464 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 01:09:41,464 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2020-10-24 01:09:41,464 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674786775] [2020-10-24 01:09:41,464 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-10-24 01:09:41,465 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 01:09:41,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-10-24 01:09:41,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=240, Unknown=0, NotChecked=0, Total=272 [2020-10-24 01:09:41,466 INFO L87 Difference]: Start difference. First operand 374 states and 416 transitions. Second operand 17 states. [2020-10-24 01:09:43,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 01:09:43,106 INFO L93 Difference]: Finished difference Result 414 states and 458 transitions. [2020-10-24 01:09:43,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-10-24 01:09:43,107 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 85 [2020-10-24 01:09:43,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 01:09:43,109 INFO L225 Difference]: With dead ends: 414 [2020-10-24 01:09:43,110 INFO L226 Difference]: Without dead ends: 386 [2020-10-24 01:09:43,111 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=201, Invalid=855, Unknown=0, NotChecked=0, Total=1056 [2020-10-24 01:09:43,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2020-10-24 01:09:43,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 362. [2020-10-24 01:09:43,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 362 states. [2020-10-24 01:09:43,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 403 transitions. [2020-10-24 01:09:43,157 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 403 transitions. Word has length 85 [2020-10-24 01:09:43,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 01:09:43,157 INFO L481 AbstractCegarLoop]: Abstraction has 362 states and 403 transitions. [2020-10-24 01:09:43,157 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-10-24 01:09:43,157 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 403 transitions. [2020-10-24 01:09:43,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2020-10-24 01:09:43,159 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 01:09:43,159 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 01:09:43,159 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-24 01:09:43,159 INFO L429 AbstractCegarLoop]: === Iteration 17 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 01:09:43,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 01:09:43,160 INFO L82 PathProgramCache]: Analyzing trace with hash 1222429321, now seen corresponding path program 1 times [2020-10-24 01:09:43,160 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 01:09:43,160 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [59193685] [2020-10-24 01:09:43,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 01:09:43,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:09:43,670 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 01:09:43,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:09:43,690 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-24 01:09:43,691 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [59193685] [2020-10-24 01:09:43,691 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 01:09:43,691 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2020-10-24 01:09:43,691 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548898502] [2020-10-24 01:09:43,692 INFO L461 AbstractCegarLoop]: Interpolant automaton has 22 states [2020-10-24 01:09:43,692 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 01:09:43,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-10-24 01:09:43,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=397, Unknown=0, NotChecked=0, Total=462 [2020-10-24 01:09:43,693 INFO L87 Difference]: Start difference. First operand 362 states and 403 transitions. Second operand 22 states. [2020-10-24 01:09:46,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 01:09:46,101 INFO L93 Difference]: Finished difference Result 440 states and 487 transitions. [2020-10-24 01:09:46,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2020-10-24 01:09:46,101 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 90 [2020-10-24 01:09:46,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 01:09:46,105 INFO L225 Difference]: With dead ends: 440 [2020-10-24 01:09:46,105 INFO L226 Difference]: Without dead ends: 423 [2020-10-24 01:09:46,107 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 458 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=451, Invalid=2099, Unknown=0, NotChecked=0, Total=2550 [2020-10-24 01:09:46,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2020-10-24 01:09:46,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 378. [2020-10-24 01:09:46,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2020-10-24 01:09:46,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 420 transitions. [2020-10-24 01:09:46,170 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 420 transitions. Word has length 90 [2020-10-24 01:09:46,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 01:09:46,171 INFO L481 AbstractCegarLoop]: Abstraction has 378 states and 420 transitions. [2020-10-24 01:09:46,171 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2020-10-24 01:09:46,171 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 420 transitions. [2020-10-24 01:09:46,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2020-10-24 01:09:46,172 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 01:09:46,172 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 01:09:46,173 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-24 01:09:46,173 INFO L429 AbstractCegarLoop]: === Iteration 18 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 01:09:46,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 01:09:46,173 INFO L82 PathProgramCache]: Analyzing trace with hash 1041203385, now seen corresponding path program 3 times [2020-10-24 01:09:46,174 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 01:09:46,174 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [928745992] [2020-10-24 01:09:46,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 01:09:46,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:09:47,165 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 01:09:47,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:09:47,205 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-24 01:09:47,205 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [928745992] [2020-10-24 01:09:47,206 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 01:09:47,206 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2020-10-24 01:09:47,206 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664950059] [2020-10-24 01:09:47,206 INFO L461 AbstractCegarLoop]: Interpolant automaton has 25 states [2020-10-24 01:09:47,206 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 01:09:47,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2020-10-24 01:09:47,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=536, Unknown=0, NotChecked=0, Total=600 [2020-10-24 01:09:47,208 INFO L87 Difference]: Start difference. First operand 378 states and 420 transitions. Second operand 25 states. [2020-10-24 01:09:49,359 WARN L193 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2020-10-24 01:09:49,522 WARN L193 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 63 [2020-10-24 01:09:50,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 01:09:50,919 INFO L93 Difference]: Finished difference Result 441 states and 488 transitions. [2020-10-24 01:09:50,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2020-10-24 01:09:50,920 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 90 [2020-10-24 01:09:50,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 01:09:50,922 INFO L225 Difference]: With dead ends: 441 [2020-10-24 01:09:50,923 INFO L226 Difference]: Without dead ends: 426 [2020-10-24 01:09:50,924 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 477 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=490, Invalid=2590, Unknown=0, NotChecked=0, Total=3080 [2020-10-24 01:09:50,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2020-10-24 01:09:50,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 387. [2020-10-24 01:09:50,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-10-24 01:09:50,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 429 transitions. [2020-10-24 01:09:50,977 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 429 transitions. Word has length 90 [2020-10-24 01:09:50,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 01:09:50,977 INFO L481 AbstractCegarLoop]: Abstraction has 387 states and 429 transitions. [2020-10-24 01:09:50,977 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2020-10-24 01:09:50,978 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 429 transitions. [2020-10-24 01:09:50,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2020-10-24 01:09:50,979 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 01:09:50,979 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 01:09:50,979 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-10-24 01:09:50,979 INFO L429 AbstractCegarLoop]: === Iteration 19 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 01:09:50,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 01:09:50,980 INFO L82 PathProgramCache]: Analyzing trace with hash 1635087611, now seen corresponding path program 1 times [2020-10-24 01:09:50,980 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 01:09:50,980 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [51672862] [2020-10-24 01:09:50,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 01:09:51,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-24 01:09:51,003 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-24 01:09:51,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-24 01:09:51,033 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-24 01:09:51,095 INFO L173 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-10-24 01:09:51,095 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-24 01:09:51,096 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-10-24 01:09:51,213 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 01:09:51 BoogieIcfgContainer [2020-10-24 01:09:51,213 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-24 01:09:51,215 INFO L168 Benchmark]: Toolchain (without parser) took 37542.93 ms. Allocated memory was 153.1 MB in the beginning and 320.9 MB in the end (delta: 167.8 MB). Free memory was 128.2 MB in the beginning and 233.1 MB in the end (delta: -105.0 MB). Peak memory consumption was 62.9 MB. Max. memory is 8.0 GB. [2020-10-24 01:09:51,215 INFO L168 Benchmark]: CDTParser took 3.51 ms. Allocated memory is still 125.8 MB. Free memory was 101.5 MB in the beginning and 101.4 MB in the end (delta: 68.3 kB). There was no memory consumed. Max. memory is 8.0 GB. [2020-10-24 01:09:51,216 INFO L168 Benchmark]: CACSL2BoogieTranslator took 516.98 ms. Allocated memory is still 153.1 MB. Free memory was 127.6 MB in the beginning and 105.2 MB in the end (delta: 22.3 MB). Peak memory consumption was 22.0 MB. Max. memory is 8.0 GB. [2020-10-24 01:09:51,217 INFO L168 Benchmark]: Boogie Preprocessor took 92.39 ms. Allocated memory is still 153.1 MB. Free memory was 105.2 MB in the beginning and 134.8 MB in the end (delta: -29.6 MB). Peak memory consumption was 5.6 MB. Max. memory is 8.0 GB. [2020-10-24 01:09:51,217 INFO L168 Benchmark]: RCFGBuilder took 1096.86 ms. Allocated memory is still 153.1 MB. Free memory was 134.8 MB in the beginning and 113.6 MB in the end (delta: 21.2 MB). Peak memory consumption was 46.8 MB. Max. memory is 8.0 GB. [2020-10-24 01:09:51,218 INFO L168 Benchmark]: TraceAbstraction took 35818.17 ms. Allocated memory was 153.1 MB in the beginning and 320.9 MB in the end (delta: 167.8 MB). Free memory was 113.6 MB in the beginning and 233.1 MB in the end (delta: -119.5 MB). Peak memory consumption was 48.3 MB. Max. memory is 8.0 GB. [2020-10-24 01:09:51,221 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 3.51 ms. Allocated memory is still 125.8 MB. Free memory was 101.5 MB in the beginning and 101.4 MB in the end (delta: 68.3 kB). There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 516.98 ms. Allocated memory is still 153.1 MB. Free memory was 127.6 MB in the beginning and 105.2 MB in the end (delta: 22.3 MB). Peak memory consumption was 22.0 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 92.39 ms. Allocated memory is still 153.1 MB. Free memory was 105.2 MB in the beginning and 134.8 MB in the end (delta: -29.6 MB). Peak memory consumption was 5.6 MB. Max. memory is 8.0 GB. * RCFGBuilder took 1096.86 ms. Allocated memory is still 153.1 MB. Free memory was 134.8 MB in the beginning and 113.6 MB in the end (delta: 21.2 MB). Peak memory consumption was 46.8 MB. Max. memory is 8.0 GB. * TraceAbstraction took 35818.17 ms. Allocated memory was 153.1 MB in the beginning and 320.9 MB in the end (delta: 167.8 MB). Free memory was 113.6 MB in the beginning and 233.1 MB in the end (delta: -119.5 MB). Peak memory consumption was 48.3 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 12]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L552] struct TreeNode* root = malloc(sizeof(*root)), *n; VAL [malloc(sizeof(*root))={-1:0}, root={-1:0}] [L553] root->left = ((void *)0) VAL [malloc(sizeof(*root))={-1:0}, root={-1:0}] [L554] root->right = ((void *)0) VAL [malloc(sizeof(*root))={-1:0}, root={-1:0}] [L555] COND FALSE !(__VERIFIER_nondet_int()) VAL [__VERIFIER_nondet_int()=0, malloc(sizeof(*root))={-1:0}, root={-1:0}] [L574] n = ((void *)0) VAL [malloc(sizeof(*root))={-1:0}, n={0:0}, root={-1:0}] [L575] struct TreeNode* pred; VAL [malloc(sizeof(*root))={-1:0}, n={0:0}, root={-1:0}] [L576] COND TRUE \read(*root) VAL [malloc(sizeof(*root))={-1:0}, n={0:0}, root={-1:0}] [L577] pred = ((void *)0) VAL [malloc(sizeof(*root))={-1:0}, n={0:0}, pred={0:0}, root={-1:0}] [L578] n = root VAL [malloc(sizeof(*root))={-1:0}, n={-1:0}, pred={0:0}, root={-1:0}] [L579] EXPR n->left VAL [malloc(sizeof(*root))={-1:0}, n={-1:0}, n->left={0:0}, pred={0:0}, root={-1:0}] [L579] n->left || n->right VAL [malloc(sizeof(*root))={-1:0}, n={-1:0}, n->left={0:0}, n->left || n->right=0, pred={0:0}, root={-1:0}] [L579] EXPR n->right VAL [malloc(sizeof(*root))={-1:0}, n={-1:0}, n->left={0:0}, n->left || n->right=0, n->right={0:0}, pred={0:0}, root={-1:0}] [L579] n->left || n->right VAL [malloc(sizeof(*root))={-1:0}, n={-1:0}, n->left={0:0}, n->left || n->right=0, n->right={0:0}, pred={0:0}, root={-1:0}] [L579] COND FALSE !(n->left || n->right) VAL [malloc(sizeof(*root))={-1:0}, n={-1:0}, n->left={0:0}, n->left || n->right=0, n->right={0:0}, pred={0:0}, root={-1:0}] [L586] COND FALSE !(\read(*pred)) VAL [malloc(sizeof(*root))={-1:0}, n={-1:0}, pred={0:0}, root={-1:0}] [L592] root = ((void *)0) VAL [malloc(sizeof(*root))={-1:0}, n={-1:0}, pred={0:0}, root={0:0}] [L576] COND FALSE !(\read(*root)) VAL [malloc(sizeof(*root))={-1:0}, n={-1:0}, pred={0:0}, root={0:0}] [L595] List a = (List) malloc(sizeof(struct node)); VAL [a={-2:0}, malloc(sizeof(*root))={-1:0}, malloc(sizeof(struct node))={-2:0}, n={-1:0}, pred={0:0}, root={0:0}] [L596] COND FALSE !(a == 0) VAL [a={-2:0}, malloc(sizeof(*root))={-1:0}, malloc(sizeof(struct node))={-2:0}, n={-1:0}, pred={0:0}, root={0:0}] [L597] List t; VAL [a={-2:0}, malloc(sizeof(*root))={-1:0}, malloc(sizeof(struct node))={-2:0}, n={-1:0}, pred={0:0}, root={0:0}] [L598] List p = a; VAL [a={-2:0}, malloc(sizeof(*root))={-1:0}, malloc(sizeof(struct node))={-2:0}, n={-1:0}, p={-2:0}, pred={0:0}, root={0:0}] [L599] COND TRUE __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=1, a={-2:0}, malloc(sizeof(*root))={-1:0}, malloc(sizeof(struct node))={-2:0}, n={-1:0}, p={-2:0}, pred={0:0}, root={0:0}] [L600] p->h = 1 VAL [a={-2:0}, malloc(sizeof(*root))={-1:0}, malloc(sizeof(struct node))={-2:0}, n={-1:0}, p={-2:0}, pred={0:0}, root={0:0}] [L601] t = (List) malloc(sizeof(struct node)) VAL [a={-2:0}, malloc(sizeof(*root))={-1:0}, malloc(sizeof(struct node))={-2:0}, malloc(sizeof(struct node))={-3:0}, n={-1:0}, p={-2:0}, pred={0:0}, root={0:0}, t={-3:0}] [L602] COND FALSE !(t == 0) VAL [a={-2:0}, malloc(sizeof(*root))={-1:0}, malloc(sizeof(struct node))={-2:0}, malloc(sizeof(struct node))={-3:0}, n={-1:0}, p={-2:0}, pred={0:0}, root={0:0}, t={-3:0}] [L603] p->n = t VAL [a={-2:0}, malloc(sizeof(*root))={-1:0}, malloc(sizeof(struct node))={-2:0}, malloc(sizeof(struct node))={-3:0}, n={-1:0}, p={-2:0}, pred={0:0}, root={0:0}, t={-3:0}] [L604] EXPR p->n VAL [a={-2:0}, malloc(sizeof(*root))={-1:0}, malloc(sizeof(struct node))={-2:0}, malloc(sizeof(struct node))={-3:0}, n={-1:0}, p={-2:0}, p->n={-3:0}, pred={0:0}, root={0:0}, t={-3:0}] [L604] p = p->n VAL [a={-2:0}, malloc(sizeof(*root))={-1:0}, malloc(sizeof(struct node))={-2:0}, malloc(sizeof(struct node))={-3:0}, n={-1:0}, p={-3:0}, p->n={-3:0}, pred={0:0}, root={0:0}, t={-3:0}] [L599] COND FALSE !(__VERIFIER_nondet_int()) VAL [__VERIFIER_nondet_int()=0, a={-2:0}, malloc(sizeof(*root))={-1:0}, malloc(sizeof(struct node))={-2:0}, malloc(sizeof(struct node))={-3:0}, n={-1:0}, p={-3:0}, pred={0:0}, root={0:0}, t={-3:0}] [L606] COND TRUE __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=1, a={-2:0}, malloc(sizeof(*root))={-1:0}, malloc(sizeof(struct node))={-2:0}, malloc(sizeof(struct node))={-3:0}, n={-1:0}, p={-3:0}, pred={0:0}, root={0:0}, t={-3:0}] [L607] p->h = 2 VAL [a={-2:0}, malloc(sizeof(*root))={-1:0}, malloc(sizeof(struct node))={-2:0}, malloc(sizeof(struct node))={-3:0}, n={-1:0}, p={-3:0}, pred={0:0}, root={0:0}, t={-3:0}] [L608] t = (List) malloc(sizeof(struct node)) VAL [a={-2:0}, malloc(sizeof(*root))={-1:0}, malloc(sizeof(struct node))={-4:0}, malloc(sizeof(struct node))={-2:0}, malloc(sizeof(struct node))={-3:0}, n={-1:0}, p={-3:0}, pred={0:0}, root={0:0}, t={-4:0}] [L609] COND FALSE !(t == 0) VAL [a={-2:0}, malloc(sizeof(*root))={-1:0}, malloc(sizeof(struct node))={-4:0}, malloc(sizeof(struct node))={-2:0}, malloc(sizeof(struct node))={-3:0}, n={-1:0}, p={-3:0}, pred={0:0}, root={0:0}, t={-4:0}] [L610] p->n = t VAL [a={-2:0}, malloc(sizeof(*root))={-1:0}, malloc(sizeof(struct node))={-4:0}, malloc(sizeof(struct node))={-2:0}, malloc(sizeof(struct node))={-3:0}, n={-1:0}, p={-3:0}, pred={0:0}, root={0:0}, t={-4:0}] [L611] EXPR p->n VAL [a={-2:0}, malloc(sizeof(*root))={-1:0}, malloc(sizeof(struct node))={-4:0}, malloc(sizeof(struct node))={-2:0}, malloc(sizeof(struct node))={-3:0}, n={-1:0}, p={-3:0}, p->n={-4:0}, pred={0:0}, root={0:0}, t={-4:0}] [L611] p = p->n VAL [a={-2:0}, malloc(sizeof(*root))={-1:0}, malloc(sizeof(struct node))={-4:0}, malloc(sizeof(struct node))={-2:0}, malloc(sizeof(struct node))={-3:0}, n={-1:0}, p={-4:0}, p->n={-4:0}, pred={0:0}, root={0:0}, t={-4:0}] [L606] COND FALSE !(__VERIFIER_nondet_int()) VAL [__VERIFIER_nondet_int()=0, a={-2:0}, malloc(sizeof(*root))={-1:0}, malloc(sizeof(struct node))={-4:0}, malloc(sizeof(struct node))={-2:0}, malloc(sizeof(struct node))={-3:0}, n={-1:0}, p={-4:0}, pred={0:0}, root={0:0}, t={-4:0}] [L613] p->h = 3 VAL [a={-2:0}, malloc(sizeof(*root))={-1:0}, malloc(sizeof(struct node))={-4:0}, malloc(sizeof(struct node))={-2:0}, malloc(sizeof(struct node))={-3:0}, n={-1:0}, p={-4:0}, pred={0:0}, root={0:0}, t={-4:0}] [L614] p = a VAL [a={-2:0}, malloc(sizeof(*root))={-1:0}, malloc(sizeof(struct node))={-4:0}, malloc(sizeof(struct node))={-2:0}, malloc(sizeof(struct node))={-3:0}, n={-1:0}, p={-2:0}, pred={0:0}, root={0:0}, t={-4:0}] [L615] EXPR p->h VAL [a={-2:0}, malloc(sizeof(*root))={-1:0}, malloc(sizeof(struct node))={-4:0}, malloc(sizeof(struct node))={-2:0}, malloc(sizeof(struct node))={-3:0}, n={-1:0}, p={-2:0}, p->h=1, pred={0:0}, root={0:0}, t={-4:0}] [L615] COND FALSE !(p->h == 2) VAL [a={-2:0}, malloc(sizeof(*root))={-1:0}, malloc(sizeof(struct node))={-4:0}, malloc(sizeof(struct node))={-2:0}, malloc(sizeof(struct node))={-3:0}, n={-1:0}, p={-2:0}, p->h=1, pred={0:0}, root={0:0}, t={-4:0}] [L617] EXPR p->h VAL [a={-2:0}, malloc(sizeof(*root))={-1:0}, malloc(sizeof(struct node))={-4:0}, malloc(sizeof(struct node))={-2:0}, malloc(sizeof(struct node))={-3:0}, n={-1:0}, p={-2:0}, p->h=1, pred={0:0}, root={0:0}, t={-4:0}] [L617] COND TRUE p->h == 1 VAL [a={-2:0}, malloc(sizeof(*root))={-1:0}, malloc(sizeof(struct node))={-4:0}, malloc(sizeof(struct node))={-2:0}, malloc(sizeof(struct node))={-3:0}, n={-1:0}, p={-2:0}, p->h=1, pred={0:0}, root={0:0}, t={-4:0}] [L618] EXPR p->n VAL [a={-2:0}, malloc(sizeof(*root))={-1:0}, malloc(sizeof(struct node))={-4:0}, malloc(sizeof(struct node))={-2:0}, malloc(sizeof(struct node))={-3:0}, n={-1:0}, p={-2:0}, p->n={-3:0}, pred={0:0}, root={0:0}, t={-4:0}] [L618] p = p->n VAL [a={-2:0}, malloc(sizeof(*root))={-1:0}, malloc(sizeof(struct node))={-4:0}, malloc(sizeof(struct node))={-2:0}, malloc(sizeof(struct node))={-3:0}, n={-1:0}, p={-3:0}, p->n={-3:0}, pred={0:0}, root={0:0}, t={-4:0}] [L617] EXPR p->h VAL [a={-2:0}, malloc(sizeof(*root))={-1:0}, malloc(sizeof(struct node))={-4:0}, malloc(sizeof(struct node))={-2:0}, malloc(sizeof(struct node))={-3:0}, n={-1:0}, p={-3:0}, p->h=2, pred={0:0}, root={0:0}, t={-4:0}] [L617] COND FALSE !(p->h == 1) VAL [a={-2:0}, malloc(sizeof(*root))={-1:0}, malloc(sizeof(struct node))={-4:0}, malloc(sizeof(struct node))={-2:0}, malloc(sizeof(struct node))={-3:0}, n={-1:0}, p={-3:0}, p->h=2, pred={0:0}, root={0:0}, t={-4:0}] [L619] EXPR p->h VAL [a={-2:0}, malloc(sizeof(*root))={-1:0}, malloc(sizeof(struct node))={-4:0}, malloc(sizeof(struct node))={-2:0}, malloc(sizeof(struct node))={-3:0}, n={-1:0}, p={-3:0}, p->h=2, pred={0:0}, root={0:0}, t={-4:0}] [L619] COND TRUE p->h != 3 VAL [a={-2:0}, malloc(sizeof(*root))={-1:0}, malloc(sizeof(struct node))={-4:0}, malloc(sizeof(struct node))={-2:0}, malloc(sizeof(struct node))={-3:0}, n={-1:0}, p={-3:0}, p->h=2, pred={0:0}, root={0:0}, t={-4:0}] [L620] CALL reach_error() [L12] COND FALSE !(0) [L12] __assert_fail ("0", "list_and_tree_cnstr-1.c", 3, __extension__ __PRETTY_FUNCTION__) - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 198 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 35.6s, OverallIterations: 19, TraceHistogramMax: 3, AutomataDifference: 27.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 3345 SDtfs, 5932 SDslu, 27385 SDs, 0 SdLazy, 12467 SolverSat, 783 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 11.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 548 GetRequests, 63 SyntacticMatches, 1 SemanticMatches, 484 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2768 ImplicationChecksByTransitivity, 15.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=387occurred in iteration=18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 18 MinimizatonAttempts, 879 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 6.2s InterpolantComputationTime, 1418 NumberOfCodeBlocks, 1418 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 1310 ConstructedInterpolants, 0 QuantifiedInterpolants, 646113 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 6 PerfectInterpolantSequences, 42/119 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...