/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 -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationWernerOverapprox_32.epf -i ../../../trunk/examples/svcomp/ldv-regression/rule60_list2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-b7b32d2 [2021-02-22 01:56:33,872 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-02-22 01:56:33,877 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-02-22 01:56:33,933 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-02-22 01:56:33,934 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-02-22 01:56:33,939 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-02-22 01:56:33,943 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-02-22 01:56:33,952 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-02-22 01:56:33,954 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-02-22 01:56:33,957 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-02-22 01:56:33,958 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-02-22 01:56:33,960 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-02-22 01:56:33,960 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-02-22 01:56:33,961 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-02-22 01:56:33,963 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-02-22 01:56:33,964 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-02-22 01:56:33,965 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-02-22 01:56:33,979 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-02-22 01:56:33,982 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-02-22 01:56:33,984 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-02-22 01:56:33,986 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-02-22 01:56:33,989 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-02-22 01:56:33,992 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-02-22 01:56:33,993 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-02-22 01:56:34,004 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-02-22 01:56:34,005 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-02-22 01:56:34,005 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-02-22 01:56:34,006 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-02-22 01:56:34,007 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-02-22 01:56:34,009 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-02-22 01:56:34,009 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-02-22 01:56:34,010 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-02-22 01:56:34,011 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-02-22 01:56:34,012 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-02-22 01:56:34,014 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-02-22 01:56:34,015 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-02-22 01:56:34,016 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-02-22 01:56:34,016 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-02-22 01:56:34,017 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-02-22 01:56:34,018 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-02-22 01:56:34,019 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-02-22 01:56:34,021 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationWernerOverapprox_32.epf [2021-02-22 01:56:34,043 INFO L113 SettingsManager]: Loading preferences was successful [2021-02-22 01:56:34,044 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-02-22 01:56:34,049 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-02-22 01:56:34,050 INFO L138 SettingsManager]: * sizeof long=4 [2021-02-22 01:56:34,050 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-02-22 01:56:34,050 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-02-22 01:56:34,050 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-02-22 01:56:34,051 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-02-22 01:56:34,051 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-02-22 01:56:34,051 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-02-22 01:56:34,052 INFO L138 SettingsManager]: * sizeof long double=12 [2021-02-22 01:56:34,053 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-02-22 01:56:34,053 INFO L138 SettingsManager]: * Use constant arrays=true [2021-02-22 01:56:34,053 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-02-22 01:56:34,053 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-02-22 01:56:34,054 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2021-02-22 01:56:34,054 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-02-22 01:56:34,054 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-02-22 01:56:34,054 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-02-22 01:56:34,055 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-02-22 01:56:34,055 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2021-02-22 01:56:34,055 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-02-22 01:56:34,055 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=WERNER_OVERAPPROX [2021-02-22 01:56:34,055 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 [2021-02-22 01:56:34,500 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-02-22 01:56:34,536 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-02-22 01:56:34,540 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-02-22 01:56:34,541 INFO L271 PluginConnector]: Initializing CDTParser... [2021-02-22 01:56:34,542 INFO L275 PluginConnector]: CDTParser initialized [2021-02-22 01:56:34,543 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-regression/rule60_list2.i [2021-02-22 01:56:34,623 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3bba076b8/47abbdd346ec44c894b9550bbf4963be/FLAG620527ee1 [2021-02-22 01:56:35,310 INFO L306 CDTParser]: Found 1 translation units. [2021-02-22 01:56:35,314 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-regression/rule60_list2.i [2021-02-22 01:56:35,352 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3bba076b8/47abbdd346ec44c894b9550bbf4963be/FLAG620527ee1 [2021-02-22 01:56:35,595 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3bba076b8/47abbdd346ec44c894b9550bbf4963be [2021-02-22 01:56:35,600 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-02-22 01:56:35,615 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2021-02-22 01:56:35,618 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-02-22 01:56:35,619 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-02-22 01:56:35,623 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-02-22 01:56:35,624 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.02 01:56:35" (1/1) ... [2021-02-22 01:56:35,627 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e27489f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.02 01:56:35, skipping insertion in model container [2021-02-22 01:56:35,627 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.02 01:56:35" (1/1) ... [2021-02-22 01:56:35,639 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-02-22 01:56:35,710 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-02-22 01:56:35,935 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-regression/rule60_list2.i[292,305] [2021-02-22 01:56:36,175 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-02-22 01:56:36,188 INFO L203 MainTranslator]: Completed pre-run [2021-02-22 01:56:36,208 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-regression/rule60_list2.i[292,305] [2021-02-22 01:56:36,274 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-02-22 01:56:36,358 INFO L208 MainTranslator]: Completed translation [2021-02-22 01:56:36,358 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.02 01:56:36 WrapperNode [2021-02-22 01:56:36,359 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-02-22 01:56:36,360 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-02-22 01:56:36,360 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-02-22 01:56:36,361 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-02-22 01:56:36,376 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.02 01:56:36" (1/1) ... [2021-02-22 01:56:36,377 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.02 01:56:36" (1/1) ... [2021-02-22 01:56:36,424 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.02 01:56:36" (1/1) ... [2021-02-22 01:56:36,425 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.02 01:56:36" (1/1) ... [2021-02-22 01:56:36,454 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.02 01:56:36" (1/1) ... [2021-02-22 01:56:36,470 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.02 01:56:36" (1/1) ... [2021-02-22 01:56:36,479 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.02 01:56:36" (1/1) ... [2021-02-22 01:56:36,489 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-02-22 01:56:36,492 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-02-22 01:56:36,492 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-02-22 01:56:36,493 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-02-22 01:56:36,494 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.02 01:56:36" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-02-22 01:56:36,625 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2021-02-22 01:56:36,626 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-02-22 01:56:36,627 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2021-02-22 01:56:36,627 INFO L138 BoogieDeclarations]: Found implementation of procedure __blast_assert [2021-02-22 01:56:36,627 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2021-02-22 01:56:36,627 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2021-02-22 01:56:36,627 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2021-02-22 01:56:36,628 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2021-02-22 01:56:36,628 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2021-02-22 01:56:36,629 INFO L138 BoogieDeclarations]: Found implementation of procedure __getMemory [2021-02-22 01:56:36,629 INFO L138 BoogieDeclarations]: Found implementation of procedure my_malloc [2021-02-22 01:56:36,629 INFO L138 BoogieDeclarations]: Found implementation of procedure list_add [2021-02-22 01:56:36,629 INFO L138 BoogieDeclarations]: Found implementation of procedure list_del [2021-02-22 01:56:36,630 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2021-02-22 01:56:36,630 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2021-02-22 01:56:36,631 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2021-02-22 01:56:36,631 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2021-02-22 01:56:36,632 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-02-22 01:56:36,632 INFO L130 BoogieDeclarations]: Found specification of procedure __blast_assert [2021-02-22 01:56:36,635 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2021-02-22 01:56:36,635 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2021-02-22 01:56:36,635 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2021-02-22 01:56:36,635 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2021-02-22 01:56:36,636 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2021-02-22 01:56:36,636 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2021-02-22 01:56:36,636 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2021-02-22 01:56:36,636 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2021-02-22 01:56:36,636 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2021-02-22 01:56:36,636 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2021-02-22 01:56:36,636 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2021-02-22 01:56:36,637 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2021-02-22 01:56:36,637 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2021-02-22 01:56:36,637 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2021-02-22 01:56:36,637 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2021-02-22 01:56:36,637 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2021-02-22 01:56:36,637 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2021-02-22 01:56:36,637 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2021-02-22 01:56:36,638 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2021-02-22 01:56:36,638 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2021-02-22 01:56:36,638 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2021-02-22 01:56:36,638 INFO L130 BoogieDeclarations]: Found specification of procedure select [2021-02-22 01:56:36,638 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2021-02-22 01:56:36,638 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2021-02-22 01:56:36,639 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2021-02-22 01:56:36,639 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2021-02-22 01:56:36,639 INFO L130 BoogieDeclarations]: Found specification of procedure random [2021-02-22 01:56:36,639 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2021-02-22 01:56:36,639 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2021-02-22 01:56:36,639 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2021-02-22 01:56:36,639 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2021-02-22 01:56:36,640 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2021-02-22 01:56:36,640 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2021-02-22 01:56:36,640 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2021-02-22 01:56:36,640 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2021-02-22 01:56:36,640 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2021-02-22 01:56:36,640 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2021-02-22 01:56:36,641 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2021-02-22 01:56:36,641 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2021-02-22 01:56:36,641 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2021-02-22 01:56:36,641 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2021-02-22 01:56:36,641 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2021-02-22 01:56:36,643 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2021-02-22 01:56:36,643 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2021-02-22 01:56:36,643 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2021-02-22 01:56:36,644 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2021-02-22 01:56:36,644 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2021-02-22 01:56:36,644 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2021-02-22 01:56:36,645 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2021-02-22 01:56:36,645 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2021-02-22 01:56:36,645 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2021-02-22 01:56:36,645 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2021-02-22 01:56:36,646 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2021-02-22 01:56:36,646 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2021-02-22 01:56:36,646 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2021-02-22 01:56:36,646 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2021-02-22 01:56:36,647 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2021-02-22 01:56:36,647 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2021-02-22 01:56:36,648 INFO L130 BoogieDeclarations]: Found specification of procedure free [2021-02-22 01:56:36,648 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2021-02-22 01:56:36,648 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2021-02-22 01:56:36,648 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2021-02-22 01:56:36,648 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2021-02-22 01:56:36,648 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2021-02-22 01:56:36,649 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2021-02-22 01:56:36,649 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2021-02-22 01:56:36,649 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2021-02-22 01:56:36,649 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2021-02-22 01:56:36,650 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2021-02-22 01:56:36,650 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2021-02-22 01:56:36,650 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2021-02-22 01:56:36,650 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2021-02-22 01:56:36,651 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2021-02-22 01:56:36,651 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2021-02-22 01:56:36,651 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2021-02-22 01:56:36,652 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2021-02-22 01:56:36,652 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2021-02-22 01:56:36,652 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2021-02-22 01:56:36,652 INFO L130 BoogieDeclarations]: Found specification of procedure system [2021-02-22 01:56:36,652 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2021-02-22 01:56:36,653 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2021-02-22 01:56:36,653 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2021-02-22 01:56:36,653 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2021-02-22 01:56:36,653 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2021-02-22 01:56:36,653 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2021-02-22 01:56:36,653 INFO L130 BoogieDeclarations]: Found specification of procedure div [2021-02-22 01:56:36,653 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2021-02-22 01:56:36,653 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2021-02-22 01:56:36,654 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2021-02-22 01:56:36,654 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2021-02-22 01:56:36,654 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2021-02-22 01:56:36,654 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2021-02-22 01:56:36,654 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2021-02-22 01:56:36,655 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2021-02-22 01:56:36,655 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2021-02-22 01:56:36,655 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2021-02-22 01:56:36,655 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2021-02-22 01:56:36,655 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2021-02-22 01:56:36,655 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2021-02-22 01:56:36,656 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2021-02-22 01:56:36,656 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2021-02-22 01:56:36,656 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2021-02-22 01:56:36,656 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2021-02-22 01:56:36,657 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2021-02-22 01:56:36,657 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2021-02-22 01:56:36,657 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2021-02-22 01:56:36,657 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2021-02-22 01:56:36,657 INFO L130 BoogieDeclarations]: Found specification of procedure __getMemory [2021-02-22 01:56:36,658 INFO L130 BoogieDeclarations]: Found specification of procedure my_malloc [2021-02-22 01:56:36,658 INFO L130 BoogieDeclarations]: Found specification of procedure list_add [2021-02-22 01:56:36,658 INFO L130 BoogieDeclarations]: Found specification of procedure list_del [2021-02-22 01:56:36,658 INFO L130 BoogieDeclarations]: Found specification of procedure main [2021-02-22 01:56:36,658 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2021-02-22 01:56:36,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-02-22 01:56:36,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-02-22 01:56:36,659 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-02-22 01:56:36,660 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-02-22 01:56:36,660 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-02-22 01:56:36,660 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-02-22 01:56:36,660 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-02-22 01:56:36,660 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-02-22 01:56:37,303 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-02-22 01:56:37,303 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2021-02-22 01:56:37,305 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.02 01:56:37 BoogieIcfgContainer [2021-02-22 01:56:37,305 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-02-22 01:56:37,307 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-02-22 01:56:37,308 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-02-22 01:56:37,311 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-02-22 01:56:37,311 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.02 01:56:35" (1/3) ... [2021-02-22 01:56:37,313 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bcf71ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.02 01:56:37, skipping insertion in model container [2021-02-22 01:56:37,314 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.02 01:56:36" (2/3) ... [2021-02-22 01:56:37,314 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bcf71ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.02 01:56:37, skipping insertion in model container [2021-02-22 01:56:37,314 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.02 01:56:37" (3/3) ... [2021-02-22 01:56:37,316 INFO L111 eAbstractionObserver]: Analyzing ICFG rule60_list2.i [2021-02-22 01:56:37,323 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2021-02-22 01:56:37,329 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-02-22 01:56:37,348 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-02-22 01:56:37,374 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-02-22 01:56:37,374 INFO L377 AbstractCegarLoop]: Hoare is true [2021-02-22 01:56:37,374 INFO L378 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2021-02-22 01:56:37,374 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-02-22 01:56:37,374 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-02-22 01:56:37,375 INFO L381 AbstractCegarLoop]: Difference is false [2021-02-22 01:56:37,375 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-02-22 01:56:37,375 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-02-22 01:56:37,392 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states. [2021-02-22 01:56:37,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-02-22 01:56:37,402 INFO L414 BasicCegarLoop]: Found error trace [2021-02-22 01:56:37,403 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] [2021-02-22 01:56:37,403 INFO L428 AbstractCegarLoop]: === Iteration 1 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-22 01:56:37,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-22 01:56:37,410 INFO L82 PathProgramCache]: Analyzing trace with hash 1772381528, now seen corresponding path program 1 times [2021-02-22 01:56:37,418 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-22 01:56:37,419 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [899586268] [2021-02-22 01:56:37,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-22 01:56:37,514 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-22 01:56:37,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 01:56:37,699 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:56:37,700 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:56:37,702 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:56:37,703 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-22 01:56:37,716 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:56:37,717 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-22 01:56:37,724 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:56:37,725 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-22 01:56:37,734 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:56:37,735 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-02-22 01:56:37,744 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:56:37,745 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:56:37,811 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-22 01:56:37,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 01:56:37,840 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:56:37,841 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:56:37,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-02-22 01:56:37,851 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [899586268] [2021-02-22 01:56:37,853 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-22 01:56:37,854 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-02-22 01:56:37,854 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517014585] [2021-02-22 01:56:37,859 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-02-22 01:56:37,860 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-22 01:56:37,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-02-22 01:56:37,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-02-22 01:56:37,878 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 7 states. [2021-02-22 01:56:38,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-22 01:56:38,497 INFO L93 Difference]: Finished difference Result 132 states and 157 transitions. [2021-02-22 01:56:38,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-02-22 01:56:38,499 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2021-02-22 01:56:38,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-22 01:56:38,511 INFO L225 Difference]: With dead ends: 132 [2021-02-22 01:56:38,511 INFO L226 Difference]: Without dead ends: 71 [2021-02-22 01:56:38,516 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2021-02-22 01:56:38,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2021-02-22 01:56:38,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 67. [2021-02-22 01:56:38,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2021-02-22 01:56:38,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 72 transitions. [2021-02-22 01:56:38,574 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 72 transitions. Word has length 26 [2021-02-22 01:56:38,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-22 01:56:38,575 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 72 transitions. [2021-02-22 01:56:38,575 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-02-22 01:56:38,575 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 72 transitions. [2021-02-22 01:56:38,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-02-22 01:56:38,578 INFO L414 BasicCegarLoop]: Found error trace [2021-02-22 01:56:38,579 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-02-22 01:56:38,579 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-02-22 01:56:38,579 INFO L428 AbstractCegarLoop]: === Iteration 2 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-22 01:56:38,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-22 01:56:38,580 INFO L82 PathProgramCache]: Analyzing trace with hash 1109674261, now seen corresponding path program 1 times [2021-02-22 01:56:38,580 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-22 01:56:38,581 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1190012196] [2021-02-22 01:56:38,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-22 01:56:38,587 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-22 01:56:38,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 01:56:38,738 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:56:38,739 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:56:38,748 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:56:38,749 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-02-22 01:56:38,756 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:56:38,757 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-02-22 01:56:38,765 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:56:38,766 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:56:38,834 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-22 01:56:38,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 01:56:38,852 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:56:38,853 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:56:38,865 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-02-22 01:56:38,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 01:56:38,893 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:56:38,894 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:56:38,895 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:56:38,896 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-02-22 01:56:38,914 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:56:38,915 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-02-22 01:56:38,933 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-02-22 01:56:38,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 01:56:38,950 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:56:38,951 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:56:38,952 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:56:38,953 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-02-22 01:56:38,974 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-02-22 01:56:38,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 01:56:38,987 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:56:38,988 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:56:38,988 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-02-22 01:56:38,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 01:56:38,996 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:56:38,997 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:56:39,012 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-02-22 01:56:39,013 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1190012196] [2021-02-22 01:56:39,013 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-22 01:56:39,013 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-02-22 01:56:39,013 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519216090] [2021-02-22 01:56:39,014 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-02-22 01:56:39,015 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-22 01:56:39,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-02-22 01:56:39,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-02-22 01:56:39,019 INFO L87 Difference]: Start difference. First operand 67 states and 72 transitions. Second operand 9 states. [2021-02-22 01:56:39,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-22 01:56:39,381 INFO L93 Difference]: Finished difference Result 105 states and 117 transitions. [2021-02-22 01:56:39,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-02-22 01:56:39,382 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 66 [2021-02-22 01:56:39,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-22 01:56:39,384 INFO L225 Difference]: With dead ends: 105 [2021-02-22 01:56:39,385 INFO L226 Difference]: Without dead ends: 77 [2021-02-22 01:56:39,386 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2021-02-22 01:56:39,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2021-02-22 01:56:39,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 73. [2021-02-22 01:56:39,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2021-02-22 01:56:39,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 78 transitions. [2021-02-22 01:56:39,407 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 78 transitions. Word has length 66 [2021-02-22 01:56:39,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-22 01:56:39,407 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 78 transitions. [2021-02-22 01:56:39,407 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-02-22 01:56:39,407 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 78 transitions. [2021-02-22 01:56:39,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-02-22 01:56:39,410 INFO L414 BasicCegarLoop]: Found error trace [2021-02-22 01:56:39,410 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-02-22 01:56:39,410 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-02-22 01:56:39,410 INFO L428 AbstractCegarLoop]: === Iteration 3 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-22 01:56:39,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-22 01:56:39,411 INFO L82 PathProgramCache]: Analyzing trace with hash -499508081, now seen corresponding path program 1 times [2021-02-22 01:56:39,411 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-22 01:56:39,412 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [471248216] [2021-02-22 01:56:39,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-22 01:56:39,417 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-22 01:56:39,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 01:56:39,506 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:56:39,508 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-02-22 01:56:39,514 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:56:39,515 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-02-22 01:56:39,517 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:56:39,517 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-02-22 01:56:39,526 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:56:39,526 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-02-22 01:56:39,536 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:56:39,538 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-02-22 01:56:39,552 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:56:39,553 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-02-22 01:56:39,567 WARN L141 QuantifierPusher]: treesize reduction 13, result has 38.1 percent of original size [2021-02-22 01:56:39,572 WARN L147 QuantifierPusher]: treesize reduction 13, result has 38.1 percent of original size 8 [2021-02-22 01:56:39,584 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:56:39,585 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:56:39,655 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-22 01:56:39,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 01:56:39,673 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:56:39,674 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:56:39,675 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:56:39,675 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-22 01:56:39,688 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:56:39,689 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-02-22 01:56:39,705 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-02-22 01:56:39,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 01:56:39,720 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:56:39,721 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-22 01:56:39,735 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:56:39,736 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-02-22 01:56:39,752 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-02-22 01:56:39,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 01:56:39,765 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:56:39,766 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-22 01:56:39,766 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:56:39,767 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-22 01:56:39,782 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:56:39,783 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-02-22 01:56:39,784 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-02-22 01:56:39,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 01:56:39,799 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:56:39,800 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-22 01:56:39,801 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:56:39,801 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-02-22 01:56:39,818 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:56:39,819 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-02-22 01:56:39,836 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-02-22 01:56:39,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 01:56:39,850 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:56:39,850 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-22 01:56:39,851 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:56:39,851 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-22 01:56:39,852 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:56:39,853 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-02-22 01:56:39,853 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:56:39,854 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-02-22 01:56:39,885 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-02-22 01:56:39,885 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [471248216] [2021-02-22 01:56:39,886 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-22 01:56:39,886 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2021-02-22 01:56:39,886 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419530661] [2021-02-22 01:56:39,887 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-02-22 01:56:39,887 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-22 01:56:39,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-02-22 01:56:39,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2021-02-22 01:56:39,888 INFO L87 Difference]: Start difference. First operand 73 states and 78 transitions. Second operand 17 states. [2021-02-22 01:56:41,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-22 01:56:41,671 INFO L93 Difference]: Finished difference Result 126 states and 143 transitions. [2021-02-22 01:56:41,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-02-22 01:56:41,672 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 66 [2021-02-22 01:56:41,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-22 01:56:41,675 INFO L225 Difference]: With dead ends: 126 [2021-02-22 01:56:41,675 INFO L226 Difference]: Without dead ends: 121 [2021-02-22 01:56:41,676 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=150, Invalid=906, Unknown=0, NotChecked=0, Total=1056 [2021-02-22 01:56:41,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2021-02-22 01:56:41,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 106. [2021-02-22 01:56:41,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2021-02-22 01:56:41,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 120 transitions. [2021-02-22 01:56:41,719 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 120 transitions. Word has length 66 [2021-02-22 01:56:41,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-22 01:56:41,719 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 120 transitions. [2021-02-22 01:56:41,719 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2021-02-22 01:56:41,720 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 120 transitions. [2021-02-22 01:56:41,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-02-22 01:56:41,724 INFO L414 BasicCegarLoop]: Found error trace [2021-02-22 01:56:41,724 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-02-22 01:56:41,724 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-02-22 01:56:41,725 INFO L428 AbstractCegarLoop]: === Iteration 4 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-22 01:56:41,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-22 01:56:41,725 INFO L82 PathProgramCache]: Analyzing trace with hash -36617582, now seen corresponding path program 1 times [2021-02-22 01:56:41,725 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-22 01:56:41,726 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [38411014] [2021-02-22 01:56:41,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-22 01:56:41,734 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-22 01:56:41,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 01:56:41,772 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:56:41,775 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:56:41,777 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:56:41,777 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-02-22 01:56:41,786 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:56:41,787 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-02-22 01:56:41,794 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:56:41,795 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:56:41,843 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-22 01:56:41,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 01:56:41,854 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:56:41,855 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:56:41,864 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-02-22 01:56:41,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 01:56:41,871 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:56:41,872 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:56:41,872 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-02-22 01:56:41,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 01:56:41,877 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:56:41,878 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:56:41,879 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-02-22 01:56:41,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 01:56:41,894 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:56:41,895 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:56:41,896 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:56:41,897 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-02-22 01:56:41,911 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:56:41,913 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-02-22 01:56:41,927 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-02-22 01:56:41,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 01:56:41,938 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:56:41,938 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:56:41,939 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:56:41,940 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-02-22 01:56:41,964 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-02-22 01:56:41,964 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [38411014] [2021-02-22 01:56:41,965 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-22 01:56:41,965 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-02-22 01:56:41,965 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644515336] [2021-02-22 01:56:41,965 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-02-22 01:56:41,966 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-22 01:56:41,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-02-22 01:56:41,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-02-22 01:56:41,967 INFO L87 Difference]: Start difference. First operand 106 states and 120 transitions. Second operand 9 states. [2021-02-22 01:56:42,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-22 01:56:42,296 INFO L93 Difference]: Finished difference Result 139 states and 156 transitions. [2021-02-22 01:56:42,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-02-22 01:56:42,296 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 66 [2021-02-22 01:56:42,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-22 01:56:42,298 INFO L225 Difference]: With dead ends: 139 [2021-02-22 01:56:42,298 INFO L226 Difference]: Without dead ends: 85 [2021-02-22 01:56:42,299 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2021-02-22 01:56:42,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2021-02-22 01:56:42,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 81. [2021-02-22 01:56:42,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2021-02-22 01:56:42,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 88 transitions. [2021-02-22 01:56:42,322 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 88 transitions. Word has length 66 [2021-02-22 01:56:42,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-22 01:56:42,322 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 88 transitions. [2021-02-22 01:56:42,322 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-02-22 01:56:42,323 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 88 transitions. [2021-02-22 01:56:42,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-02-22 01:56:42,324 INFO L414 BasicCegarLoop]: Found error trace [2021-02-22 01:56:42,324 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-02-22 01:56:42,324 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-02-22 01:56:42,325 INFO L428 AbstractCegarLoop]: === Iteration 5 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-22 01:56:42,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-22 01:56:42,325 INFO L82 PathProgramCache]: Analyzing trace with hash 1317118349, now seen corresponding path program 1 times [2021-02-22 01:56:42,325 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-22 01:56:42,326 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2136512757] [2021-02-22 01:56:42,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-22 01:56:42,330 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-22 01:56:42,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 01:56:42,381 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:56:42,382 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-02-22 01:56:42,388 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:56:42,388 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-02-22 01:56:42,389 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:56:42,390 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-02-22 01:56:42,398 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:56:42,399 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-02-22 01:56:42,409 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:56:42,410 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-02-22 01:56:42,411 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:56:42,412 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-02-22 01:56:42,428 WARN L141 QuantifierPusher]: treesize reduction 9, result has 57.1 percent of original size [2021-02-22 01:56:42,433 WARN L147 QuantifierPusher]: treesize reduction 9, result has 57.1 percent of original size 12 [2021-02-22 01:56:42,452 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:56:42,459 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:56:42,511 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-22 01:56:42,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 01:56:42,553 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:56:42,554 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:56:42,558 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:56:42,559 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-22 01:56:42,569 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:56:42,570 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-02-22 01:56:42,589 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-02-22 01:56:42,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 01:56:42,604 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:56:42,606 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-22 01:56:42,619 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:56:42,620 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-02-22 01:56:42,632 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:56:42,632 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-02-22 01:56:42,646 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-02-22 01:56:42,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 01:56:42,665 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:56:42,665 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-22 01:56:42,666 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:56:42,666 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-22 01:56:42,685 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:56:42,686 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-02-22 01:56:42,703 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:56:42,704 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-02-22 01:56:42,725 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-02-22 01:56:42,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 01:56:42,741 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:56:42,742 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:56:42,742 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-02-22 01:56:42,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 01:56:42,760 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:56:42,760 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:56:42,786 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-02-22 01:56:42,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 01:56:42,794 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:56:42,795 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-22 01:56:42,833 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-02-22 01:56:42,834 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2136512757] [2021-02-22 01:56:42,834 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-22 01:56:42,834 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-02-22 01:56:42,835 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914991187] [2021-02-22 01:56:42,835 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-02-22 01:56:42,835 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-22 01:56:42,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-02-22 01:56:42,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2021-02-22 01:56:42,836 INFO L87 Difference]: Start difference. First operand 81 states and 88 transitions. Second operand 18 states. [2021-02-22 01:56:44,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-22 01:56:44,003 INFO L93 Difference]: Finished difference Result 94 states and 101 transitions. [2021-02-22 01:56:44,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-02-22 01:56:44,004 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 75 [2021-02-22 01:56:44,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-22 01:56:44,006 INFO L225 Difference]: With dead ends: 94 [2021-02-22 01:56:44,006 INFO L226 Difference]: Without dead ends: 91 [2021-02-22 01:56:44,007 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=173, Invalid=949, Unknown=0, NotChecked=0, Total=1122 [2021-02-22 01:56:44,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2021-02-22 01:56:44,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 81. [2021-02-22 01:56:44,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2021-02-22 01:56:44,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 87 transitions. [2021-02-22 01:56:44,030 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 87 transitions. Word has length 75 [2021-02-22 01:56:44,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-22 01:56:44,031 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 87 transitions. [2021-02-22 01:56:44,031 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2021-02-22 01:56:44,031 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 87 transitions. [2021-02-22 01:56:44,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-02-22 01:56:44,033 INFO L414 BasicCegarLoop]: Found error trace [2021-02-22 01:56:44,033 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-02-22 01:56:44,033 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-02-22 01:56:44,033 INFO L428 AbstractCegarLoop]: === Iteration 6 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-22 01:56:44,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-22 01:56:44,034 INFO L82 PathProgramCache]: Analyzing trace with hash -1546910366, now seen corresponding path program 1 times [2021-02-22 01:56:44,034 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-22 01:56:44,034 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [938143006] [2021-02-22 01:56:44,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-22 01:56:44,038 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-22 01:56:44,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 01:56:44,076 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:56:44,077 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:56:44,078 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:56:44,078 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-22 01:56:44,082 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:56:44,082 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-22 01:56:44,087 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:56:44,088 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-02-22 01:56:44,094 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:56:44,094 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-02-22 01:56:44,102 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:56:44,102 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-02-22 01:56:44,110 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:56:44,111 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-02-22 01:56:44,120 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:56:44,121 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-02-22 01:56:44,131 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:56:44,132 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:56:44,177 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-22 01:56:44,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 01:56:44,186 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:56:44,187 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:56:44,202 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-02-22 01:56:44,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 01:56:44,211 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:56:44,211 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:56:44,213 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:56:44,215 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-22 01:56:44,235 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:56:44,236 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-22 01:56:44,250 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-02-22 01:56:44,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 01:56:44,257 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:56:44,258 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:56:44,258 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:56:44,259 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-22 01:56:44,275 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-02-22 01:56:44,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 01:56:44,285 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:56:44,286 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-22 01:56:44,302 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:56:44,302 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-02-22 01:56:44,320 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:56:44,320 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-02-22 01:56:44,343 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-02-22 01:56:44,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 01:56:44,356 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:56:44,356 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-22 01:56:44,357 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:56:44,357 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-22 01:56:44,376 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:56:44,378 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-02-22 01:56:44,402 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:56:44,403 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-02-22 01:56:44,449 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-02-22 01:56:44,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 01:56:44,457 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:56:44,458 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-22 01:56:44,479 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:56:44,480 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-22 01:56:44,511 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-02-22 01:56:44,512 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [938143006] [2021-02-22 01:56:44,512 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-22 01:56:44,512 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2021-02-22 01:56:44,512 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816827973] [2021-02-22 01:56:44,513 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2021-02-22 01:56:44,513 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-22 01:56:44,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-02-22 01:56:44,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=459, Unknown=0, NotChecked=0, Total=506 [2021-02-22 01:56:44,514 INFO L87 Difference]: Start difference. First operand 81 states and 87 transitions. Second operand 23 states. [2021-02-22 01:56:45,791 WARN L202 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 55 [2021-02-22 01:56:46,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-22 01:56:46,168 INFO L93 Difference]: Finished difference Result 98 states and 106 transitions. [2021-02-22 01:56:46,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-02-22 01:56:46,168 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 76 [2021-02-22 01:56:46,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-22 01:56:46,170 INFO L225 Difference]: With dead ends: 98 [2021-02-22 01:56:46,170 INFO L226 Difference]: Without dead ends: 90 [2021-02-22 01:56:46,172 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=210, Invalid=1682, Unknown=0, NotChecked=0, Total=1892 [2021-02-22 01:56:46,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2021-02-22 01:56:46,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 84. [2021-02-22 01:56:46,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2021-02-22 01:56:46,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 89 transitions. [2021-02-22 01:56:46,195 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 89 transitions. Word has length 76 [2021-02-22 01:56:46,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-22 01:56:46,195 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 89 transitions. [2021-02-22 01:56:46,196 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2021-02-22 01:56:46,196 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 89 transitions. [2021-02-22 01:56:46,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2021-02-22 01:56:46,198 INFO L414 BasicCegarLoop]: Found error trace [2021-02-22 01:56:46,198 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-02-22 01:56:46,198 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-02-22 01:56:46,198 INFO L428 AbstractCegarLoop]: === Iteration 7 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-22 01:56:46,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-22 01:56:46,199 INFO L82 PathProgramCache]: Analyzing trace with hash -1420644118, now seen corresponding path program 1 times [2021-02-22 01:56:46,199 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-22 01:56:46,200 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [364264590] [2021-02-22 01:56:46,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-22 01:56:46,203 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-22 01:56:46,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 01:56:46,243 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:56:46,244 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:56:46,245 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:56:46,245 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-22 01:56:46,248 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:56:46,249 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-22 01:56:46,254 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:56:46,254 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-02-22 01:56:46,260 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:56:46,261 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-02-22 01:56:46,267 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:56:46,268 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-02-22 01:56:46,276 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:56:46,277 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-02-22 01:56:46,277 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:56:46,278 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-02-22 01:56:46,288 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:56:46,288 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-02-22 01:56:46,297 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:56:46,298 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:56:46,342 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-22 01:56:46,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 01:56:46,350 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:56:46,351 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:56:46,365 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-02-22 01:56:46,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 01:56:46,373 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:56:46,374 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:56:46,374 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:56:46,375 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-22 01:56:46,388 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:56:46,388 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-22 01:56:46,403 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-02-22 01:56:46,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 01:56:46,411 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:56:46,412 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:56:46,413 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:56:46,413 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-22 01:56:46,429 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-02-22 01:56:46,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 01:56:46,465 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:56:46,466 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-22 01:56:46,482 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:56:46,482 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-02-22 01:56:46,504 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:56:46,506 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-02-22 01:56:46,525 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-02-22 01:56:46,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 01:56:46,534 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:56:46,535 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-22 01:56:46,535 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:56:46,535 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-22 01:56:46,554 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:56:46,556 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-02-22 01:56:46,577 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:56:46,577 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-02-22 01:56:46,629 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-02-22 01:56:46,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 01:56:46,647 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:56:46,648 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:56:46,648 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2021-02-22 01:56:46,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 01:56:46,671 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:56:46,671 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-22 01:56:46,696 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:56:46,697 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-22 01:56:46,721 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-02-22 01:56:46,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 01:56:46,728 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:56:46,728 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-22 01:56:46,768 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-02-22 01:56:46,770 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [364264590] [2021-02-22 01:56:46,770 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-22 01:56:46,770 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2021-02-22 01:56:46,770 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990514216] [2021-02-22 01:56:46,772 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states [2021-02-22 01:56:46,772 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-22 01:56:46,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-02-22 01:56:46,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=501, Unknown=0, NotChecked=0, Total=552 [2021-02-22 01:56:46,777 INFO L87 Difference]: Start difference. First operand 84 states and 89 transitions. Second operand 24 states. [2021-02-22 01:56:48,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-22 01:56:48,282 INFO L93 Difference]: Finished difference Result 94 states and 100 transitions. [2021-02-22 01:56:48,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-02-22 01:56:48,282 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 90 [2021-02-22 01:56:48,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-22 01:56:48,284 INFO L225 Difference]: With dead ends: 94 [2021-02-22 01:56:48,284 INFO L226 Difference]: Without dead ends: 87 [2021-02-22 01:56:48,286 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=232, Invalid=1748, Unknown=0, NotChecked=0, Total=1980 [2021-02-22 01:56:48,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2021-02-22 01:56:48,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2021-02-22 01:56:48,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2021-02-22 01:56:48,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 93 transitions. [2021-02-22 01:56:48,308 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 93 transitions. Word has length 90 [2021-02-22 01:56:48,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-22 01:56:48,308 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 93 transitions. [2021-02-22 01:56:48,309 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2021-02-22 01:56:48,309 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 93 transitions. [2021-02-22 01:56:48,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2021-02-22 01:56:48,311 INFO L414 BasicCegarLoop]: Found error trace [2021-02-22 01:56:48,311 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-02-22 01:56:48,311 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-02-22 01:56:48,311 INFO L428 AbstractCegarLoop]: === Iteration 8 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-22 01:56:48,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-22 01:56:48,312 INFO L82 PathProgramCache]: Analyzing trace with hash 1561940976, now seen corresponding path program 2 times [2021-02-22 01:56:48,312 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-22 01:56:48,312 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1899137226] [2021-02-22 01:56:48,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-22 01:56:48,316 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-22 01:56:48,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 01:56:48,362 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:56:48,362 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-22 01:56:48,365 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:56:48,366 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-22 01:56:48,367 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:56:48,368 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-02-22 01:56:48,375 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:56:48,375 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-02-22 01:56:48,384 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:56:48,384 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-02-22 01:56:48,394 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:56:48,395 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-02-22 01:56:48,407 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:56:48,409 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-02-22 01:56:48,413 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:56:48,416 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-02-22 01:56:48,430 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:56:48,431 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-02-22 01:56:48,467 WARN L141 QuantifierPusher]: treesize reduction 17, result has 55.3 percent of original size [2021-02-22 01:56:48,471 WARN L147 QuantifierPusher]: treesize reduction 17, result has 55.3 percent of original size 21 [2021-02-22 01:56:48,495 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:56:48,495 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:56:48,543 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-22 01:56:48,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 01:56:48,565 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:56:48,566 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:56:48,566 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:56:48,567 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-22 01:56:48,582 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-02-22 01:56:48,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 01:56:48,595 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:56:48,596 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-22 01:56:48,610 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:56:48,611 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-02-22 01:56:48,629 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-02-22 01:56:48,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 01:56:48,642 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:56:48,643 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-22 01:56:48,643 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:56:48,644 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-22 01:56:48,658 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:56:48,659 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-02-22 01:56:48,660 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-02-22 01:56:48,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 01:56:48,680 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:56:48,680 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-22 01:56:48,681 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:56:48,682 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-02-22 01:56:48,706 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:56:48,707 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-02-22 01:56:48,729 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-02-22 01:56:48,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 01:56:48,758 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:56:48,758 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-22 01:56:48,759 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:56:48,759 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-22 01:56:48,760 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:56:48,762 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-02-22 01:56:48,764 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:56:48,765 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-02-22 01:56:48,816 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-02-22 01:56:48,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 01:56:48,823 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:56:48,823 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-22 01:56:48,843 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:56:48,844 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-22 01:56:48,864 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2021-02-22 01:56:48,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 01:56:48,871 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:56:48,872 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-22 01:56:48,895 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-02-22 01:56:48,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 01:56:48,903 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:56:48,903 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-02-22 01:56:48,931 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:56:48,932 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-22 01:56:48,974 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-02-22 01:56:48,975 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1899137226] [2021-02-22 01:56:48,975 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-22 01:56:48,975 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2021-02-22 01:56:48,975 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102557068] [2021-02-22 01:56:48,976 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states [2021-02-22 01:56:48,976 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-22 01:56:48,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-02-22 01:56:48,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=498, Unknown=0, NotChecked=0, Total=552 [2021-02-22 01:56:48,977 INFO L87 Difference]: Start difference. First operand 87 states and 93 transitions. Second operand 24 states. [2021-02-22 01:56:50,776 WARN L202 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 60 [2021-02-22 01:56:51,086 WARN L202 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 61 [2021-02-22 01:56:51,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-22 01:56:51,230 INFO L93 Difference]: Finished difference Result 111 states and 115 transitions. [2021-02-22 01:56:51,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-02-22 01:56:51,231 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 90 [2021-02-22 01:56:51,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-22 01:56:51,233 INFO L225 Difference]: With dead ends: 111 [2021-02-22 01:56:51,233 INFO L226 Difference]: Without dead ends: 102 [2021-02-22 01:56:51,235 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 493 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=309, Invalid=2447, Unknown=0, NotChecked=0, Total=2756 [2021-02-22 01:56:51,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2021-02-22 01:56:51,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 101. [2021-02-22 01:56:51,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2021-02-22 01:56:51,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 104 transitions. [2021-02-22 01:56:51,258 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 104 transitions. Word has length 90 [2021-02-22 01:56:51,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-22 01:56:51,258 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 104 transitions. [2021-02-22 01:56:51,258 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2021-02-22 01:56:51,258 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 104 transitions. [2021-02-22 01:56:51,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2021-02-22 01:56:51,260 INFO L414 BasicCegarLoop]: Found error trace [2021-02-22 01:56:51,260 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-02-22 01:56:51,261 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-02-22 01:56:51,261 INFO L428 AbstractCegarLoop]: === Iteration 9 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-22 01:56:51,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-22 01:56:51,261 INFO L82 PathProgramCache]: Analyzing trace with hash 176174744, now seen corresponding path program 1 times [2021-02-22 01:56:51,261 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-22 01:56:51,262 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1174340495] [2021-02-22 01:56:51,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-22 01:56:51,268 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-22 01:56:51,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 01:56:51,302 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:56:51,302 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-22 01:56:51,305 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:56:51,306 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-22 01:56:51,306 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:56:51,307 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-22 01:56:51,312 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:56:51,313 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-22 01:56:51,319 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:56:51,319 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-22 01:56:51,326 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:56:51,327 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-02-22 01:56:51,337 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:56:51,338 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-02-22 01:56:51,350 WARN L141 QuantifierPusher]: treesize reduction 13, result has 38.1 percent of original size [2021-02-22 01:56:51,351 WARN L147 QuantifierPusher]: treesize reduction 13, result has 38.1 percent of original size 8 [2021-02-22 01:56:51,363 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:56:51,363 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:56:51,407 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-22 01:56:51,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 01:56:51,422 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:56:51,422 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:56:51,423 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:56:51,423 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-22 01:56:51,437 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-02-22 01:56:51,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 01:56:51,447 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:56:51,448 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-22 01:56:51,460 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:56:51,461 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-02-22 01:56:51,474 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-02-22 01:56:51,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 01:56:51,484 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:56:51,485 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-22 01:56:51,487 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:56:51,488 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-22 01:56:51,503 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:56:51,503 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-02-22 01:56:51,505 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-02-22 01:56:51,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 01:56:51,527 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:56:51,527 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-22 01:56:51,528 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:56:51,528 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-02-22 01:56:51,544 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:56:51,545 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-02-22 01:56:51,565 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-02-22 01:56:51,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 01:56:51,574 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:56:51,574 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-22 01:56:51,575 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:56:51,575 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-22 01:56:51,576 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:56:51,576 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-02-22 01:56:51,577 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:56:51,577 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-02-22 01:56:51,616 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-02-22 01:56:51,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 01:56:51,622 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:56:51,623 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:56:51,623 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2021-02-22 01:56:51,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 01:56:51,629 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:56:51,629 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:56:51,630 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-02-22 01:56:51,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 01:56:51,633 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:56:51,634 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:56:51,635 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:56:51,635 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-22 01:56:51,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-02-22 01:56:51,666 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1174340495] [2021-02-22 01:56:51,666 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-22 01:56:51,667 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-02-22 01:56:51,667 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281296250] [2021-02-22 01:56:51,667 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-02-22 01:56:51,667 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-22 01:56:51,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-02-22 01:56:51,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2021-02-22 01:56:51,668 INFO L87 Difference]: Start difference. First operand 101 states and 104 transitions. Second operand 19 states. [2021-02-22 01:56:53,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-22 01:56:53,160 INFO L93 Difference]: Finished difference Result 105 states and 108 transitions. [2021-02-22 01:56:53,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-02-22 01:56:53,161 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 91 [2021-02-22 01:56:53,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-22 01:56:53,162 INFO L225 Difference]: With dead ends: 105 [2021-02-22 01:56:53,162 INFO L226 Difference]: Without dead ends: 0 [2021-02-22 01:56:53,164 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 279 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=253, Invalid=1469, Unknown=0, NotChecked=0, Total=1722 [2021-02-22 01:56:53,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-02-22 01:56:53,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-02-22 01:56:53,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2021-02-22 01:56:53,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-02-22 01:56:53,164 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 91 [2021-02-22 01:56:53,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-22 01:56:53,165 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-02-22 01:56:53,165 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2021-02-22 01:56:53,165 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-02-22 01:56:53,165 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-02-22 01:56:53,165 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-02-22 01:56:53,168 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-02-22 01:56:54,530 WARN L202 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 40 [2021-02-22 01:56:54,812 WARN L202 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 48 [2021-02-22 01:56:55,086 WARN L202 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 28 [2021-02-22 01:56:55,429 WARN L202 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 27 [2021-02-22 01:56:55,614 WARN L202 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 43 [2021-02-22 01:56:55,988 WARN L202 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 38 [2021-02-22 01:56:56,308 WARN L202 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 45 [2021-02-22 01:56:56,595 WARN L202 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 36 [2021-02-22 01:56:56,937 WARN L202 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 26 [2021-02-22 01:56:57,514 WARN L202 SmtUtils]: Spent 349.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 45 [2021-02-22 01:56:57,744 WARN L202 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 28 [2021-02-22 01:56:57,922 WARN L202 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 31 [2021-02-22 01:56:58,187 WARN L202 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 43 [2021-02-22 01:56:58,387 WARN L202 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 27 [2021-02-22 01:56:58,653 WARN L202 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 38 [2021-02-22 01:56:59,025 WARN L202 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 36 [2021-02-22 01:56:59,280 WARN L202 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 43 [2021-02-22 01:56:59,433 WARN L202 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 27 [2021-02-22 01:56:59,586 WARN L202 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 27 [2021-02-22 01:57:00,032 WARN L202 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 43 [2021-02-22 01:57:00,423 WARN L202 SmtUtils]: Spent 364.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 45 [2021-02-22 01:57:00,775 WARN L202 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 29 [2021-02-22 01:57:01,088 WARN L202 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 30 [2021-02-22 01:57:01,191 WARN L202 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 30 [2021-02-22 01:57:01,413 WARN L202 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 43 [2021-02-22 01:57:01,688 WARN L202 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 45 [2021-02-22 01:57:01,797 INFO L189 CegarLoopUtils]: For program point reach_errorEXIT(line 3) no Hoare annotation was computed. [2021-02-22 01:57:01,798 INFO L189 CegarLoopUtils]: For program point reach_errorENTRY(line 3) no Hoare annotation was computed. [2021-02-22 01:57:01,798 INFO L189 CegarLoopUtils]: For program point reach_errorFINAL(line 3) no Hoare annotation was computed. [2021-02-22 01:57:01,798 INFO L189 CegarLoopUtils]: For program point __bswap_32ENTRY(lines 166 170) no Hoare annotation was computed. [2021-02-22 01:57:01,798 INFO L189 CegarLoopUtils]: For program point L169(line 169) no Hoare annotation was computed. [2021-02-22 01:57:01,798 INFO L189 CegarLoopUtils]: For program point L169-1(line 169) no Hoare annotation was computed. [2021-02-22 01:57:01,799 INFO L189 CegarLoopUtils]: For program point __bswap_32FINAL(lines 166 170) no Hoare annotation was computed. [2021-02-22 01:57:01,799 INFO L189 CegarLoopUtils]: For program point __bswap_32EXIT(lines 166 170) no Hoare annotation was computed. [2021-02-22 01:57:01,799 INFO L189 CegarLoopUtils]: For program point __uint64_identityFINAL(lines 186 190) no Hoare annotation was computed. [2021-02-22 01:57:01,799 INFO L189 CegarLoopUtils]: For program point L189(line 189) no Hoare annotation was computed. [2021-02-22 01:57:01,799 INFO L189 CegarLoopUtils]: For program point __uint64_identityENTRY(lines 186 190) no Hoare annotation was computed. [2021-02-22 01:57:01,799 INFO L189 CegarLoopUtils]: For program point __uint64_identityEXIT(lines 186 190) no Hoare annotation was computed. [2021-02-22 01:57:01,799 INFO L192 CegarLoopUtils]: At program point __blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 6) the Hoare annotation is: true [2021-02-22 01:57:01,799 INFO L192 CegarLoopUtils]: At program point __blast_assertEXIT(lines 4 7) the Hoare annotation is: true [2021-02-22 01:57:01,799 INFO L192 CegarLoopUtils]: At program point L6(line 6) the Hoare annotation is: true [2021-02-22 01:57:01,800 INFO L192 CegarLoopUtils]: At program point __blast_assertFINAL(lines 4 7) the Hoare annotation is: true [2021-02-22 01:57:01,800 INFO L192 CegarLoopUtils]: At program point __blast_assertENTRY(lines 4 7) the Hoare annotation is: true [2021-02-22 01:57:01,800 INFO L189 CegarLoopUtils]: For program point __bswap_64ENTRY(lines 171 175) no Hoare annotation was computed. [2021-02-22 01:57:01,800 INFO L189 CegarLoopUtils]: For program point L174(line 174) no Hoare annotation was computed. [2021-02-22 01:57:01,800 INFO L189 CegarLoopUtils]: For program point L174-1(line 174) no Hoare annotation was computed. [2021-02-22 01:57:01,800 INFO L189 CegarLoopUtils]: For program point __bswap_64FINAL(lines 171 175) no Hoare annotation was computed. [2021-02-22 01:57:01,800 INFO L189 CegarLoopUtils]: For program point __bswap_64EXIT(lines 171 175) no Hoare annotation was computed. [2021-02-22 01:57:01,800 INFO L185 CegarLoopUtils]: At program point L547-2(line 547) the Hoare annotation is: (or (and (<= ~guard_malloc_counter~0.offset (+ |old(~guard_malloc_counter~0.offset)| 1)) (<= 1 |main_#t~ret13.offset|) (<= 1 main_~dev1~0.offset) (<= main_~dev1~0.offset ~guard_malloc_counter~0.offset) (<= |main_#t~ret13.offset| ~guard_malloc_counter~0.offset) (= |old(~elem~0.base)| ~elem~0.base) (= |old(~elem~0.offset)| ~elem~0.offset)) (and (= main_~dev1~0.base 0) (= |main_#t~ret13.offset| 0) (= main_~dev1~0.offset 0) (= |main_#t~ret13.base| 0)) (not (= |old(~guard_malloc_counter~0.offset)| 0)) (not (= |old(~elem~0.offset)| 0))) [2021-02-22 01:57:01,801 INFO L185 CegarLoopUtils]: At program point mainENTRY(lines 545 556) the Hoare annotation is: (or (not (= |old(~guard_malloc_counter~0.offset)| 0)) (not (= |old(~elem~0.offset)| 0)) (and (= ~guard_malloc_counter~0.base |old(~guard_malloc_counter~0.base)|) (= ~elem~0.offset 0) (= |old(~elem~0.base)| ~elem~0.base) (= ~guard_malloc_counter~0.offset 0))) [2021-02-22 01:57:01,801 INFO L192 CegarLoopUtils]: At program point mainEXIT(lines 545 556) the Hoare annotation is: true [2021-02-22 01:57:01,801 INFO L192 CegarLoopUtils]: At program point mainFINAL(lines 545 556) the Hoare annotation is: true [2021-02-22 01:57:01,801 INFO L185 CegarLoopUtils]: At program point L552(line 552) the Hoare annotation is: (let ((.cse1 (<= (+ |old(~guard_malloc_counter~0.offset)| 1) ~guard_malloc_counter~0.offset)) (.cse0 (<= 2 main_~dev2~0.offset)) (.cse2 (<= (+ main_~dev1~0.offset 1) main_~dev2~0.offset))) (or (and .cse0 (= ~elem~0.offset 0) (<= 1 ~guard_malloc_counter~0.offset)) (and .cse1 (<= (+ ~elem~0.offset 1) main_~dev2~0.offset) (<= main_~dev1~0.offset ~guard_malloc_counter~0.offset) .cse2) (and .cse1 (<= main_~dev2~0.offset 2) (not (= 2 ~elem~0.offset)) .cse0 (= main_~dev2~0.base ~elem~0.base) .cse2) (not (= |old(~guard_malloc_counter~0.offset)| 0)) (not (= |old(~elem~0.offset)| 0)))) [2021-02-22 01:57:01,801 INFO L185 CegarLoopUtils]: At program point L551(line 551) the Hoare annotation is: (let ((.cse0 (<= 2 main_~dev2~0.offset)) (.cse1 (<= 1 ~guard_malloc_counter~0.offset))) (or (and .cse0 (= ~elem~0.offset 0) .cse1) (not (= |old(~guard_malloc_counter~0.offset)| 0)) (not (= |old(~elem~0.offset)| 0)) (and (let ((.cse2 (<= main_~dev2~0.offset 2)) (.cse3 (<= (+ main_~dev1~0.offset 1) main_~dev2~0.offset))) (or (and .cse2 .cse0 (= main_~dev2~0.base ~elem~0.base) .cse3) (and .cse2 .cse0 (<= (+ ~elem~0.offset 1) main_~dev2~0.offset) .cse3))) .cse1))) [2021-02-22 01:57:01,802 INFO L185 CegarLoopUtils]: At program point L550(line 550) the Hoare annotation is: (or (and (<= main_~dev2~0.offset 2) (<= 1 main_~dev1~0.offset) (= |old(~elem~0.base)| ~elem~0.base) (= |old(~elem~0.offset)| ~elem~0.offset) (<= (+ main_~dev1~0.offset 1) main_~dev2~0.offset) (<= 1 ~guard_malloc_counter~0.offset)) (not (= |old(~guard_malloc_counter~0.offset)| 0)) (not (= |old(~elem~0.offset)| 0))) [2021-02-22 01:57:01,802 INFO L185 CegarLoopUtils]: At program point L549(lines 549 554) the Hoare annotation is: (let ((.cse0 (<= 1 ~guard_malloc_counter~0.offset))) (or (and (= main_~dev2~0.offset 0) (= ~elem~0.offset 0) (= main_~dev2~0.base 0) .cse0) (and (<= main_~dev2~0.offset 2) (<= 1 main_~dev1~0.offset) (= |old(~elem~0.base)| ~elem~0.base) (= |old(~elem~0.offset)| ~elem~0.offset) (<= (+ main_~dev1~0.offset 1) main_~dev2~0.offset) .cse0) (not (= |old(~guard_malloc_counter~0.offset)| 0)) (and (= main_~dev1~0.base 0) (= main_~dev1~0.offset 0)) (not (= |old(~elem~0.offset)| 0)))) [2021-02-22 01:57:01,802 INFO L185 CegarLoopUtils]: At program point L550-1(line 550) the Hoare annotation is: (let ((.cse1 (+ main_~dev1~0.offset 1))) (let ((.cse0 (<= main_~dev2~0.offset 2)) (.cse2 (<= .cse1 main_~dev2~0.offset)) (.cse3 (<= 1 ~guard_malloc_counter~0.offset))) (or (and .cse0 (<= 2 main_~dev2~0.offset) (= main_~dev2~0.base ~elem~0.base) (<= .cse1 ~elem~0.offset) .cse2 .cse3) (and .cse0 (<= 1 main_~dev1~0.offset) (= |old(~elem~0.base)| ~elem~0.base) (= |old(~elem~0.offset)| ~elem~0.offset) .cse2 .cse3) (not (= |old(~guard_malloc_counter~0.offset)| 0)) (not (= |old(~elem~0.offset)| 0))))) [2021-02-22 01:57:01,802 INFO L185 CegarLoopUtils]: At program point L548(line 548) the Hoare annotation is: (or (and (<= ~guard_malloc_counter~0.offset (+ |old(~guard_malloc_counter~0.offset)| 1)) (<= 1 main_~dev1~0.offset) (<= main_~dev1~0.offset ~guard_malloc_counter~0.offset) (= |old(~elem~0.base)| ~elem~0.base) (= |old(~elem~0.offset)| ~elem~0.offset)) (not (= |old(~guard_malloc_counter~0.offset)| 0)) (and (= main_~dev1~0.base 0) (= main_~dev1~0.offset 0)) (not (= |old(~elem~0.offset)| 0))) [2021-02-22 01:57:01,802 INFO L192 CegarLoopUtils]: At program point L549-1(lines 549 554) the Hoare annotation is: true [2021-02-22 01:57:01,803 INFO L185 CegarLoopUtils]: At program point L547(line 547) the Hoare annotation is: (or (not (= |old(~guard_malloc_counter~0.offset)| 0)) (not (= |old(~elem~0.offset)| 0)) (and (= ~guard_malloc_counter~0.base |old(~guard_malloc_counter~0.base)|) (= ~elem~0.offset 0) (= |old(~elem~0.base)| ~elem~0.base) (= ~guard_malloc_counter~0.offset 0))) [2021-02-22 01:57:01,803 INFO L185 CegarLoopUtils]: At program point L548-1(line 548) the Hoare annotation is: (let ((.cse0 (<= 1 ~guard_malloc_counter~0.offset))) (or (not (= |old(~guard_malloc_counter~0.offset)| 0)) (and (<= (+ main_~dev1~0.offset 1) |main_#t~ret14.offset|) (<= 1 main_~dev1~0.offset) (<= |main_#t~ret14.offset| 2) (= |old(~elem~0.base)| ~elem~0.base) (= |old(~elem~0.offset)| ~elem~0.offset) .cse0) (and (= |main_#t~ret14.offset| 0) (= |main_#t~ret14.base| 0) (= ~elem~0.offset 0) .cse0) (and (= main_~dev1~0.base 0) (= main_~dev1~0.offset 0)) (not (= |old(~elem~0.offset)| 0)))) [2021-02-22 01:57:01,803 INFO L185 CegarLoopUtils]: At program point L546(line 546) the Hoare annotation is: (or (not (= |old(~guard_malloc_counter~0.offset)| 0)) (not (= |old(~elem~0.offset)| 0)) (and (= ~guard_malloc_counter~0.base |old(~guard_malloc_counter~0.base)|) (= ~elem~0.offset 0) (= |old(~elem~0.base)| ~elem~0.base) (= ~guard_malloc_counter~0.offset 0))) [2021-02-22 01:57:01,803 INFO L185 CegarLoopUtils]: At program point L547-1(line 547) the Hoare annotation is: (or (and (= |main_#t~ret13.offset| 0) (= |main_#t~ret13.base| 0)) (and (<= ~guard_malloc_counter~0.offset (+ |old(~guard_malloc_counter~0.offset)| 1)) (<= 1 |main_#t~ret13.offset|) (<= |main_#t~ret13.offset| ~guard_malloc_counter~0.offset) (= |old(~elem~0.base)| ~elem~0.base) (= |old(~elem~0.offset)| ~elem~0.offset)) (not (= |old(~guard_malloc_counter~0.offset)| 0)) (not (= |old(~elem~0.offset)| 0))) [2021-02-22 01:57:01,803 INFO L185 CegarLoopUtils]: At program point L548-2(line 548) the Hoare annotation is: (let ((.cse0 (= ~elem~0.offset 0)) (.cse1 (<= 1 ~guard_malloc_counter~0.offset))) (or (and (<= main_~dev2~0.offset 2) (<= 1 main_~dev1~0.offset) .cse0 (<= |main_#t~ret14.offset| 2) (= |old(~elem~0.base)| ~elem~0.base) (<= 2 |main_#t~ret14.offset|) (<= (+ main_~dev1~0.offset 1) main_~dev2~0.offset) .cse1) (and (= |main_#t~ret14.offset| 0) (= main_~dev2~0.offset 0) (= |main_#t~ret14.base| 0) .cse0 (= main_~dev2~0.base 0) .cse1) (not (= |old(~guard_malloc_counter~0.offset)| 0)) (and (= main_~dev1~0.base 0) (= main_~dev1~0.offset 0)) (not (= |old(~elem~0.offset)| 0)))) [2021-02-22 01:57:01,804 INFO L185 CegarLoopUtils]: At program point __getMemoryENTRY(lines 520 527) the Hoare annotation is: (or (not (<= |old(~guard_malloc_counter~0.offset)| 1)) (and (= ~guard_malloc_counter~0.base |old(~guard_malloc_counter~0.base)|) (= ~guard_malloc_counter~0.offset |old(~guard_malloc_counter~0.offset)|)) (let ((.cse0 (not (= |__getMemory_#in~size| 8)))) (and (or .cse0 (not (<= 1 |old(~guard_malloc_counter~0.offset)|))) (or .cse0 (not (= |old(~guard_malloc_counter~0.offset)| 0))))) (not (= ~elem~0.offset 0))) [2021-02-22 01:57:01,804 INFO L185 CegarLoopUtils]: At program point __getMemoryEXIT(lines 520 527) the Hoare annotation is: (let ((.cse3 (+ |old(~guard_malloc_counter~0.offset)| 1))) (let ((.cse0 (<= .cse3 ~guard_malloc_counter~0.offset)) (.cse1 (= 8 __getMemory_~size))) (or (not (<= |old(~guard_malloc_counter~0.offset)| 1)) (and (<= |__getMemory_#res.offset| 0) .cse0 (<= |__getMemory_#res.base| 0) .cse1 (<= 0 |__getMemory_#res.offset|) (<= 0 |__getMemory_#res.base|)) (let ((.cse2 (not (= |__getMemory_#in~size| 8)))) (and (or .cse2 (not (<= 1 |old(~guard_malloc_counter~0.offset)|))) (or .cse2 (not (= |old(~guard_malloc_counter~0.offset)| 0))))) (and (<= ~guard_malloc_counter~0.offset .cse3) .cse0 (<= .cse3 |__getMemory_#res.offset|) .cse1 (<= |__getMemory_#res.offset| .cse3)) (not (= ~elem~0.offset 0))))) [2021-02-22 01:57:01,804 INFO L185 CegarLoopUtils]: At program point __getMemoryFINAL(lines 520 527) the Hoare annotation is: (let ((.cse3 (+ |old(~guard_malloc_counter~0.offset)| 1))) (let ((.cse0 (<= .cse3 ~guard_malloc_counter~0.offset)) (.cse1 (= 8 __getMemory_~size))) (or (not (<= |old(~guard_malloc_counter~0.offset)| 1)) (and (<= |__getMemory_#res.offset| 0) .cse0 (<= |__getMemory_#res.base| 0) .cse1 (<= 0 |__getMemory_#res.offset|) (<= 0 |__getMemory_#res.base|)) (let ((.cse2 (not (= |__getMemory_#in~size| 8)))) (and (or .cse2 (not (<= 1 |old(~guard_malloc_counter~0.offset)|))) (or .cse2 (not (= |old(~guard_malloc_counter~0.offset)| 0))))) (and (<= ~guard_malloc_counter~0.offset .cse3) .cse0 (<= .cse3 |__getMemory_#res.offset|) .cse1 (<= |__getMemory_#res.offset| .cse3)) (not (= ~elem~0.offset 0))))) [2021-02-22 01:57:01,804 INFO L185 CegarLoopUtils]: At program point L526(line 526) the Hoare annotation is: (or (not (<= |old(~guard_malloc_counter~0.offset)| 1)) (let ((.cse0 (+ |old(~guard_malloc_counter~0.offset)| 1))) (and (<= ~guard_malloc_counter~0.offset .cse0) (<= .cse0 ~guard_malloc_counter~0.offset) (= 8 __getMemory_~size))) (let ((.cse1 (not (= |__getMemory_#in~size| 8)))) (and (or .cse1 (not (<= 1 |old(~guard_malloc_counter~0.offset)|))) (or .cse1 (not (= |old(~guard_malloc_counter~0.offset)| 0))))) (not (= ~elem~0.offset 0))) [2021-02-22 01:57:01,804 INFO L185 CegarLoopUtils]: At program point L525(line 525) the Hoare annotation is: (or (not (<= |old(~guard_malloc_counter~0.offset)| 1)) (let ((.cse0 (not (= |__getMemory_#in~size| 8)))) (and (or .cse0 (not (<= 1 |old(~guard_malloc_counter~0.offset)|))) (or .cse0 (not (= |old(~guard_malloc_counter~0.offset)| 0))))) (not (= ~elem~0.offset 0)) (and (<= (+ |old(~guard_malloc_counter~0.offset)| 1) ~guard_malloc_counter~0.offset) (= 8 __getMemory_~size))) [2021-02-22 01:57:01,805 INFO L185 CegarLoopUtils]: At program point L524(line 524) the Hoare annotation is: (or (not (<= |old(~guard_malloc_counter~0.offset)| 1)) (let ((.cse0 (+ |old(~guard_malloc_counter~0.offset)| 1))) (and (<= ~guard_malloc_counter~0.offset .cse0) (<= .cse0 ~guard_malloc_counter~0.offset) (= 8 __getMemory_~size))) (let ((.cse1 (not (= |__getMemory_#in~size| 8)))) (and (or .cse1 (not (<= 1 |old(~guard_malloc_counter~0.offset)|))) (or .cse1 (not (= |old(~guard_malloc_counter~0.offset)| 0))))) (not (= ~elem~0.offset 0))) [2021-02-22 01:57:01,805 INFO L185 CegarLoopUtils]: At program point L523(line 523) the Hoare annotation is: (or (not (<= |old(~guard_malloc_counter~0.offset)| 1)) (let ((.cse0 (not (= |__getMemory_#in~size| 8)))) (and (or .cse0 (not (<= 1 |old(~guard_malloc_counter~0.offset)|))) (or .cse0 (not (= |old(~guard_malloc_counter~0.offset)| 0))))) (and (= ~guard_malloc_counter~0.base |old(~guard_malloc_counter~0.base)|) (= |__getMemory_#t~post9.offset| |old(~guard_malloc_counter~0.offset)|) (= ~guard_malloc_counter~0.offset |old(~guard_malloc_counter~0.offset)|) (= 8 __getMemory_~size)) (not (= ~elem~0.offset 0))) [2021-02-22 01:57:01,805 INFO L185 CegarLoopUtils]: At program point L524-1(lines 524 525) the Hoare annotation is: (or (not (<= |old(~guard_malloc_counter~0.offset)| 1)) (let ((.cse0 (+ |old(~guard_malloc_counter~0.offset)| 1))) (and (<= ~guard_malloc_counter~0.offset .cse0) (<= .cse0 ~guard_malloc_counter~0.offset) (= 8 __getMemory_~size))) (let ((.cse1 (not (= |__getMemory_#in~size| 8)))) (and (or .cse1 (not (<= 1 |old(~guard_malloc_counter~0.offset)|))) (or .cse1 (not (= |old(~guard_malloc_counter~0.offset)| 0))))) (not (= ~elem~0.offset 0))) [2021-02-22 01:57:01,805 INFO L185 CegarLoopUtils]: At program point L522(line 522) the Hoare annotation is: (or (not (<= |old(~guard_malloc_counter~0.offset)| 1)) (let ((.cse0 (not (= |__getMemory_#in~size| 8)))) (and (or .cse0 (not (<= 1 |old(~guard_malloc_counter~0.offset)|))) (or .cse0 (not (= |old(~guard_malloc_counter~0.offset)| 0))))) (and (= ~guard_malloc_counter~0.base |old(~guard_malloc_counter~0.base)|) (= ~guard_malloc_counter~0.offset |old(~guard_malloc_counter~0.offset)|) (= 8 __getMemory_~size)) (not (= ~elem~0.offset 0))) [2021-02-22 01:57:01,806 INFO L185 CegarLoopUtils]: At program point L523-1(line 523) the Hoare annotation is: (or (not (<= |old(~guard_malloc_counter~0.offset)| 1)) (let ((.cse0 (not (= |__getMemory_#in~size| 8)))) (and (or .cse0 (not (<= 1 |old(~guard_malloc_counter~0.offset)|))) (or .cse0 (not (= |old(~guard_malloc_counter~0.offset)| 0))))) (let ((.cse1 (+ |old(~guard_malloc_counter~0.offset)| 1))) (and (= |__getMemory_#t~post9.offset| |old(~guard_malloc_counter~0.offset)|) (<= ~guard_malloc_counter~0.offset .cse1) (<= .cse1 ~guard_malloc_counter~0.offset) (= 8 __getMemory_~size))) (not (= ~elem~0.offset 0))) [2021-02-22 01:57:01,806 INFO L185 CegarLoopUtils]: At program point L524-2(line 524) the Hoare annotation is: (or (not (<= |old(~guard_malloc_counter~0.offset)| 1)) (let ((.cse0 (not (= |__getMemory_#in~size| 8)))) (and (or .cse0 (not (<= 1 |old(~guard_malloc_counter~0.offset)|))) (or .cse0 (not (= |old(~guard_malloc_counter~0.offset)| 0))))) (not (= ~elem~0.offset 0)) (and (<= (+ |old(~guard_malloc_counter~0.offset)| 1) ~guard_malloc_counter~0.offset) (= 8 __getMemory_~size))) [2021-02-22 01:57:01,806 INFO L185 CegarLoopUtils]: At program point L524-3(line 524) the Hoare annotation is: (or (not (<= |old(~guard_malloc_counter~0.offset)| 1)) (let ((.cse0 (+ |old(~guard_malloc_counter~0.offset)| 1))) (and (<= ~guard_malloc_counter~0.offset .cse0) (<= .cse0 ~guard_malloc_counter~0.offset) (= 8 __getMemory_~size))) (let ((.cse1 (not (= |__getMemory_#in~size| 8)))) (and (or .cse1 (not (<= 1 |old(~guard_malloc_counter~0.offset)|))) (or .cse1 (not (= |old(~guard_malloc_counter~0.offset)| 0))))) (not (= ~elem~0.offset 0))) [2021-02-22 01:57:01,806 INFO L185 CegarLoopUtils]: At program point L522-2(line 522) the Hoare annotation is: (or (not (<= |old(~guard_malloc_counter~0.offset)| 1)) (let ((.cse0 (not (= |__getMemory_#in~size| 8)))) (and (or .cse0 (not (<= 1 |old(~guard_malloc_counter~0.offset)|))) (or .cse0 (not (= |old(~guard_malloc_counter~0.offset)| 0))))) (not (= ~elem~0.offset 0))) [2021-02-22 01:57:01,806 INFO L185 CegarLoopUtils]: At program point L522-3(line 522) the Hoare annotation is: (or (not (<= |old(~guard_malloc_counter~0.offset)| 1)) (let ((.cse0 (not (= |__getMemory_#in~size| 8)))) (and (or .cse0 (not (<= 1 |old(~guard_malloc_counter~0.offset)|))) (or .cse0 (not (= |old(~guard_malloc_counter~0.offset)| 0))))) (and (= ~guard_malloc_counter~0.base |old(~guard_malloc_counter~0.base)|) (= ~guard_malloc_counter~0.offset |old(~guard_malloc_counter~0.offset)|) (= 8 __getMemory_~size)) (not (= ~elem~0.offset 0))) [2021-02-22 01:57:01,806 INFO L189 CegarLoopUtils]: For program point __uint32_identityFINAL(lines 181 185) no Hoare annotation was computed. [2021-02-22 01:57:01,806 INFO L189 CegarLoopUtils]: For program point __uint32_identityENTRY(lines 181 185) no Hoare annotation was computed. [2021-02-22 01:57:01,807 INFO L189 CegarLoopUtils]: For program point L184(line 184) no Hoare annotation was computed. [2021-02-22 01:57:01,807 INFO L189 CegarLoopUtils]: For program point __uint32_identityEXIT(lines 181 185) no Hoare annotation was computed. [2021-02-22 01:57:01,807 INFO L185 CegarLoopUtils]: At program point L529(line 529) the Hoare annotation is: (or (not (= |my_malloc_#in~size| 8)) (and (= ~guard_malloc_counter~0.base |old(~guard_malloc_counter~0.base)|) (= ~guard_malloc_counter~0.offset |old(~guard_malloc_counter~0.offset)|) (= my_malloc_~size 8))) [2021-02-22 01:57:01,807 INFO L185 CegarLoopUtils]: At program point my_mallocFINAL(lines 528 530) the Hoare annotation is: (let ((.cse8 (+ |old(~guard_malloc_counter~0.offset)| 1)) (.cse11 (not (<= 1 |old(~guard_malloc_counter~0.offset)|))) (.cse4 (not (= |old(~guard_malloc_counter~0.offset)| 0))) (.cse10 (not (= |my_malloc_#in~size| 8)))) (let ((.cse0 (<= 0 |my_malloc_#res.base|)) (.cse1 (<= |my_malloc_#res.base| 0)) (.cse2 (<= 0 |my_malloc_#res.offset|)) (.cse3 (<= |my_malloc_#res.offset| 0)) (.cse5 (and (or .cse11 .cse10) (or .cse4 .cse10))) (.cse9 (not (= ~elem~0.offset 0))) (.cse6 (<= ~guard_malloc_counter~0.offset .cse8)) (.cse7 (<= .cse8 |my_malloc_#res.offset|))) (and (or (and .cse0 .cse1 .cse2 .cse3) .cse4 .cse5 (and .cse6 .cse7 (<= |my_malloc_#res.offset| .cse8) (<= 1 ~guard_malloc_counter~0.offset)) .cse9) (or .cse10 (= my_malloc_~size 8)) (or (not (<= |old(~guard_malloc_counter~0.offset)| 1)) .cse11 (and (<= .cse8 ~guard_malloc_counter~0.offset) .cse0 .cse1 .cse2 .cse3) .cse5 .cse9 (and .cse6 (<= |my_malloc_#res.offset| ~guard_malloc_counter~0.offset) .cse7))))) [2021-02-22 01:57:01,807 INFO L185 CegarLoopUtils]: At program point L529-1(line 529) the Hoare annotation is: (let ((.cse1 (not (<= 1 |old(~guard_malloc_counter~0.offset)|))) (.cse10 (not (= |old(~guard_malloc_counter~0.offset)| 0))) (.cse9 (not (= |my_malloc_#in~size| 8))) (.cse4 (+ |old(~guard_malloc_counter~0.offset)| 1))) (let ((.cse0 (and (<= ~guard_malloc_counter~0.offset .cse4) (<= |my_malloc_#t~ret11.offset| ~guard_malloc_counter~0.offset) (<= .cse4 |my_malloc_#t~ret11.offset|))) (.cse2 (and (or .cse1 .cse9) (or .cse10 .cse9))) (.cse5 (<= 0 |my_malloc_#t~ret11.offset|)) (.cse6 (<= |my_malloc_#t~ret11.offset| 0)) (.cse7 (<= |my_malloc_#t~ret11.base| 0)) (.cse8 (<= 0 |my_malloc_#t~ret11.base|)) (.cse3 (not (= ~elem~0.offset 0)))) (and (or (not (<= |old(~guard_malloc_counter~0.offset)| 1)) .cse0 .cse1 .cse2 .cse3 (and (<= .cse4 ~guard_malloc_counter~0.offset) .cse5 .cse6 .cse7 .cse8)) (or .cse9 (= my_malloc_~size 8)) (or .cse0 .cse10 .cse2 (and .cse5 .cse6 .cse7 .cse8) .cse3)))) [2021-02-22 01:57:01,808 INFO L185 CegarLoopUtils]: At program point L529-2(line 529) the Hoare annotation is: (let ((.cse1 (+ |old(~guard_malloc_counter~0.offset)| 1)) (.cse10 (not (<= 1 |old(~guard_malloc_counter~0.offset)|))) (.cse14 (not (= |old(~guard_malloc_counter~0.offset)| 0))) (.cse0 (not (= |my_malloc_#in~size| 8)))) (let ((.cse2 (<= 0 |my_malloc_#t~ret11.offset|)) (.cse3 (<= 0 |my_malloc_#res.base|)) (.cse4 (<= |my_malloc_#res.base| 0)) (.cse5 (<= 0 |my_malloc_#res.offset|)) (.cse6 (<= |my_malloc_#t~ret11.offset| 0)) (.cse7 (<= |my_malloc_#t~ret11.base| 0)) (.cse8 (<= |my_malloc_#res.offset| 0)) (.cse9 (<= 0 |my_malloc_#t~ret11.base|)) (.cse11 (and (or .cse10 .cse0) (or .cse14 .cse0))) (.cse12 (and (<= ~guard_malloc_counter~0.offset .cse1) (<= |my_malloc_#t~ret11.offset| ~guard_malloc_counter~0.offset) (<= |my_malloc_#res.offset| ~guard_malloc_counter~0.offset) (<= .cse1 |my_malloc_#res.offset|) (<= .cse1 |my_malloc_#t~ret11.offset|))) (.cse13 (not (= ~elem~0.offset 0)))) (and (or .cse0 (= my_malloc_~size 8)) (or (not (<= |old(~guard_malloc_counter~0.offset)| 1)) (and (<= .cse1 ~guard_malloc_counter~0.offset) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) .cse10 .cse11 .cse12 .cse13) (or (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) .cse14 .cse11 .cse12 .cse13)))) [2021-02-22 01:57:01,808 INFO L185 CegarLoopUtils]: At program point my_mallocENTRY(lines 528 530) the Hoare annotation is: (or (and (= ~guard_malloc_counter~0.base |old(~guard_malloc_counter~0.base)|) (= ~guard_malloc_counter~0.offset |old(~guard_malloc_counter~0.offset)|)) (not (= |my_malloc_#in~size| 8))) [2021-02-22 01:57:01,808 INFO L185 CegarLoopUtils]: At program point my_mallocEXIT(lines 528 530) the Hoare annotation is: (let ((.cse8 (+ |old(~guard_malloc_counter~0.offset)| 1)) (.cse11 (not (<= 1 |old(~guard_malloc_counter~0.offset)|))) (.cse4 (not (= |old(~guard_malloc_counter~0.offset)| 0))) (.cse10 (not (= |my_malloc_#in~size| 8)))) (let ((.cse0 (<= 0 |my_malloc_#res.base|)) (.cse1 (<= |my_malloc_#res.base| 0)) (.cse2 (<= 0 |my_malloc_#res.offset|)) (.cse3 (<= |my_malloc_#res.offset| 0)) (.cse5 (and (or .cse11 .cse10) (or .cse4 .cse10))) (.cse9 (not (= ~elem~0.offset 0))) (.cse6 (<= ~guard_malloc_counter~0.offset .cse8)) (.cse7 (<= .cse8 |my_malloc_#res.offset|))) (and (or (and .cse0 .cse1 .cse2 .cse3) .cse4 .cse5 (and .cse6 .cse7 (<= |my_malloc_#res.offset| .cse8) (<= 1 ~guard_malloc_counter~0.offset)) .cse9) (or .cse10 (= my_malloc_~size 8)) (or (not (<= |old(~guard_malloc_counter~0.offset)| 1)) .cse11 (and (<= .cse8 ~guard_malloc_counter~0.offset) .cse0 .cse1 .cse2 .cse3) .cse5 .cse9 (and .cse6 (<= |my_malloc_#res.offset| ~guard_malloc_counter~0.offset) .cse7))))) [2021-02-22 01:57:01,808 INFO L185 CegarLoopUtils]: At program point L3-2(line 3) the Hoare annotation is: (and (= ~guard_malloc_counter~0.base |old(~guard_malloc_counter~0.base)|) (= ~guard_malloc_counter~0.offset |old(~guard_malloc_counter~0.offset)|) (= ~elem~0.offset |old(~elem~0.offset)|) (= ~elem~0.base |old(~elem~0.base)|)) [2021-02-22 01:57:01,808 INFO L185 CegarLoopUtils]: At program point L3-3(line 3) the Hoare annotation is: (and (= ~guard_malloc_counter~0.base |old(~guard_malloc_counter~0.base)|) (= ~guard_malloc_counter~0.offset |old(~guard_malloc_counter~0.offset)|) (= ~elem~0.offset |old(~elem~0.offset)|) (= ~elem~0.base |old(~elem~0.base)|)) [2021-02-22 01:57:01,809 INFO L185 CegarLoopUtils]: At program point L544(line 544) the Hoare annotation is: (and (= ~elem~0.offset 0) (= ~guard_malloc_counter~0.offset 0)) [2021-02-22 01:57:01,809 INFO L185 CegarLoopUtils]: At program point L-1(line -1) the Hoare annotation is: (and (= ~guard_malloc_counter~0.base |old(~guard_malloc_counter~0.base)|) (= ~guard_malloc_counter~0.offset |old(~guard_malloc_counter~0.offset)|) (= ~elem~0.offset |old(~elem~0.offset)|) (= ~elem~0.base |old(~elem~0.base)|)) [2021-02-22 01:57:01,809 INFO L185 CegarLoopUtils]: At program point L3-4(line 3) the Hoare annotation is: (and (= ~guard_malloc_counter~0.base |old(~guard_malloc_counter~0.base)|) (= ~guard_malloc_counter~0.offset |old(~guard_malloc_counter~0.offset)|) (= ~elem~0.offset |old(~elem~0.offset)|) (= ~elem~0.base |old(~elem~0.base)|)) [2021-02-22 01:57:01,809 INFO L185 CegarLoopUtils]: At program point L544-1(line 544) the Hoare annotation is: (and (= ~elem~0.offset 0) (= ~guard_malloc_counter~0.offset 0)) [2021-02-22 01:57:01,809 INFO L185 CegarLoopUtils]: At program point L-1-1(line -1) the Hoare annotation is: (and (= ~guard_malloc_counter~0.base |old(~guard_malloc_counter~0.base)|) (= ~guard_malloc_counter~0.offset |old(~guard_malloc_counter~0.offset)|) (= ~elem~0.offset |old(~elem~0.offset)|) (= ~elem~0.base |old(~elem~0.base)|)) [2021-02-22 01:57:01,809 INFO L185 CegarLoopUtils]: At program point L3-5(line 3) the Hoare annotation is: (and (= ~guard_malloc_counter~0.base |old(~guard_malloc_counter~0.base)|) (= ~guard_malloc_counter~0.offset |old(~guard_malloc_counter~0.offset)|) (= ~elem~0.offset |old(~elem~0.offset)|) (= ~elem~0.base |old(~elem~0.base)|)) [2021-02-22 01:57:01,809 INFO L185 CegarLoopUtils]: At program point L544-2(line 544) the Hoare annotation is: (and (= ~elem~0.offset 0) (= ~guard_malloc_counter~0.offset 0)) [2021-02-22 01:57:01,810 INFO L185 CegarLoopUtils]: At program point ULTIMATE.initFINAL(line 544) the Hoare annotation is: (and (= ~elem~0.offset 0) (= ~guard_malloc_counter~0.offset 0)) [2021-02-22 01:57:01,810 INFO L185 CegarLoopUtils]: At program point L534(line 534) the Hoare annotation is: (and (= ~elem~0.offset |old(~elem~0.offset)|) (= ~elem~0.base |old(~elem~0.base)|) (= ~guard_malloc_counter~0.offset 0)) [2021-02-22 01:57:01,810 INFO L185 CegarLoopUtils]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~guard_malloc_counter~0.base |old(~guard_malloc_counter~0.base)|) (= |#t~string5.offset| |old(#t~string5.offset)|) (= |old(#length)| |#length|) (= |#t~string6.base| |old(#t~string6.base)|) (= |#t~string6.offset| |old(#t~string6.offset)|) (= |~#head~0.offset| |old(~#head~0.offset)|) (= |#t~string4.offset| |old(#t~string4.offset)|) (= ~elem~0.offset |old(~elem~0.offset)|) (= |old(#valid)| |#valid|) (= |#t~string5.base| |old(#t~string5.base)|) (= |~#head~0.base| |old(~#head~0.base)|) (= ~guard_malloc_counter~0.offset |old(~guard_malloc_counter~0.offset)|) (= |#t~string4.base| |old(#t~string4.base)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~elem~0.base |old(~elem~0.base)|)) [2021-02-22 01:57:01,810 INFO L185 CegarLoopUtils]: At program point L3(line 3) the Hoare annotation is: (and (= ~guard_malloc_counter~0.base |old(~guard_malloc_counter~0.base)|) (= ~guard_malloc_counter~0.offset |old(~guard_malloc_counter~0.offset)|) (= ~elem~0.offset |old(~elem~0.offset)|) (= ~elem~0.base |old(~elem~0.base)|)) [2021-02-22 01:57:01,810 INFO L185 CegarLoopUtils]: At program point L3-1(line 3) the Hoare annotation is: (and (= ~guard_malloc_counter~0.base |old(~guard_malloc_counter~0.base)|) (= ~guard_malloc_counter~0.offset |old(~guard_malloc_counter~0.offset)|) (= ~elem~0.offset |old(~elem~0.offset)|) (= ~elem~0.base |old(~elem~0.base)|)) [2021-02-22 01:57:01,810 INFO L185 CegarLoopUtils]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: (and (= ~elem~0.offset 0) (= ~guard_malloc_counter~0.offset 0)) [2021-02-22 01:57:01,811 INFO L185 CegarLoopUtils]: At program point L542(line 542) the Hoare annotation is: (or (not (<= 1 ~guard_malloc_counter~0.offset)) (and (= |old(~elem~0.base)| ~elem~0.base) (= list_del_~entry.base |list_del_#in~entry.base|) (= |old(~elem~0.offset)| ~elem~0.offset) (= |list_del_#in~entry.offset| list_del_~entry.offset))) [2021-02-22 01:57:01,811 INFO L185 CegarLoopUtils]: At program point L541(lines 541 542) the Hoare annotation is: (or (not (<= 1 ~guard_malloc_counter~0.offset)) (and (= |old(~elem~0.base)| ~elem~0.base) (= list_del_~entry.base |list_del_#in~entry.base|) (= |old(~elem~0.offset)| ~elem~0.offset) (= |list_del_#in~entry.offset| list_del_~entry.offset))) [2021-02-22 01:57:01,811 INFO L185 CegarLoopUtils]: At program point L541-2(lines 540 543) the Hoare annotation is: (or (not (<= 1 ~guard_malloc_counter~0.offset)) (= ~elem~0.offset 0) (and (= |old(~elem~0.base)| ~elem~0.base) (= |old(~elem~0.offset)| ~elem~0.offset))) [2021-02-22 01:57:01,811 INFO L185 CegarLoopUtils]: At program point list_delEXIT(lines 540 543) the Hoare annotation is: (or (not (<= 1 ~guard_malloc_counter~0.offset)) (= ~elem~0.offset 0) (and (= |old(~elem~0.base)| ~elem~0.base) (= |old(~elem~0.offset)| ~elem~0.offset))) [2021-02-22 01:57:01,811 INFO L185 CegarLoopUtils]: At program point list_delENTRY(lines 540 543) the Hoare annotation is: (or (not (<= 1 ~guard_malloc_counter~0.offset)) (and (= |old(~elem~0.base)| ~elem~0.base) (= |old(~elem~0.offset)| ~elem~0.offset))) [2021-02-22 01:57:01,811 INFO L185 CegarLoopUtils]: At program point list_addENTRY(lines 535 539) the Hoare annotation is: (let ((.cse0 (and (= |old(~elem~0.base)| ~elem~0.base) (= |old(~elem~0.offset)| ~elem~0.offset)))) (and (or (= |old(~elem~0.offset)| 2) (not (= |old(~elem~0.base)| |list_add_#in~new.base|)) (not (<= 2 |list_add_#in~new.offset|)) .cse0 (not (<= |list_add_#in~new.offset| 2))) (or (not (<= 1 ~guard_malloc_counter~0.offset)) (not (<= (+ |list_add_#in~new.offset| 1) |old(~elem~0.offset)|)) .cse0) (or (not (<= (+ |old(~elem~0.offset)| 1) |list_add_#in~new.offset|)) .cse0))) [2021-02-22 01:57:01,812 INFO L185 CegarLoopUtils]: At program point L538(line 538) the Hoare annotation is: (let ((.cse4 (= |old(~elem~0.base)| ~elem~0.base)) (.cse5 (= |old(~elem~0.offset)| ~elem~0.offset))) (let ((.cse2 (= list_add_~new.base |list_add_#in~new.base|)) (.cse3 (= |list_add_#in~new.offset| list_add_~new.offset)) (.cse1 (not (<= 1 ~guard_malloc_counter~0.offset))) (.cse0 (and .cse4 .cse5))) (and (or (= |old(~elem~0.offset)| 2) (not (= |old(~elem~0.base)| |list_add_#in~new.base|)) (not (<= 2 |list_add_#in~new.offset|)) .cse0 (not (<= |list_add_#in~new.offset| 2))) (or .cse1 (not (<= (+ |list_add_#in~new.offset| 1) |old(~elem~0.offset)|)) (and .cse2 .cse3 .cse4 .cse5)) (or (and .cse2 .cse3) .cse1 (not (<= 1 |list_add_#in~new.offset|)) (not (= |old(~elem~0.offset)| 0))) (or (not (<= (+ |old(~elem~0.offset)| 1) |list_add_#in~new.offset|)) .cse0)))) [2021-02-22 01:57:01,812 INFO L185 CegarLoopUtils]: At program point L537(lines 537 538) the Hoare annotation is: (let ((.cse4 (= |old(~elem~0.base)| ~elem~0.base)) (.cse5 (= |old(~elem~0.offset)| ~elem~0.offset))) (let ((.cse1 (not (<= 1 ~guard_malloc_counter~0.offset))) (.cse2 (= list_add_~new.base |list_add_#in~new.base|)) (.cse3 (= |list_add_#in~new.offset| list_add_~new.offset)) (.cse0 (and .cse4 .cse5))) (and (or (= |old(~elem~0.offset)| 2) (not (= |old(~elem~0.base)| |list_add_#in~new.base|)) (not (<= 2 |list_add_#in~new.offset|)) .cse0 (not (<= |list_add_#in~new.offset| 2))) (or .cse1 (and .cse2 .cse3) (not (<= 1 |list_add_#in~new.offset|)) (not (= |old(~elem~0.offset)| 0))) (or .cse1 (not (<= (+ |list_add_#in~new.offset| 1) |old(~elem~0.offset)|)) (and .cse2 .cse3 .cse4 .cse5)) (or (not (<= (+ |old(~elem~0.offset)| 1) |list_add_#in~new.offset|)) .cse0)))) [2021-02-22 01:57:01,812 INFO L185 CegarLoopUtils]: At program point L536(line 536) the Hoare annotation is: (let ((.cse1 (= |list_add_#in~new.offset| list_add_~new.offset)) (.cse3 (= |old(~elem~0.base)| ~elem~0.base)) (.cse2 (= |old(~elem~0.offset)| ~elem~0.offset)) (.cse4 (not (<= 1 ~guard_malloc_counter~0.offset))) (.cse0 (= list_add_~new.base |list_add_#in~new.base|))) (and (or (= |old(~elem~0.offset)| 2) (not (= |old(~elem~0.base)| |list_add_#in~new.base|)) (not (<= 2 |list_add_#in~new.offset|)) (and .cse0 (= ~elem~0.base |list_add_#in~new.base|) .cse1 .cse2) (not (<= |list_add_#in~new.offset| 2))) (or (not (<= (+ |old(~elem~0.offset)| 1) |list_add_#in~new.offset|)) (and .cse1 .cse3 .cse2)) (or .cse4 (not (<= (+ |list_add_#in~new.offset| 1) |old(~elem~0.offset)|)) (and .cse0 .cse1 .cse3 .cse2)) (or .cse4 .cse0 (not (<= 1 |list_add_#in~new.offset|)) (not (= |old(~elem~0.offset)| 0))))) [2021-02-22 01:57:01,812 INFO L185 CegarLoopUtils]: At program point L537-1(line 537) the Hoare annotation is: (let ((.cse4 (= |old(~elem~0.base)| ~elem~0.base)) (.cse5 (= |old(~elem~0.offset)| ~elem~0.offset))) (let ((.cse2 (= list_add_~new.base |list_add_#in~new.base|)) (.cse3 (= |list_add_#in~new.offset| list_add_~new.offset)) (.cse1 (not (<= 1 ~guard_malloc_counter~0.offset))) (.cse0 (and .cse4 .cse5))) (and (or (= |old(~elem~0.offset)| 2) (not (= |old(~elem~0.base)| |list_add_#in~new.base|)) (not (<= 2 |list_add_#in~new.offset|)) .cse0 (not (<= |list_add_#in~new.offset| 2))) (or .cse1 (not (<= (+ |list_add_#in~new.offset| 1) |old(~elem~0.offset)|)) (and .cse2 .cse3 .cse4 .cse5)) (or (and .cse2 .cse3) .cse1 (not (<= 1 |list_add_#in~new.offset|)) (not (= |old(~elem~0.offset)| 0))) (or (not (<= (+ |old(~elem~0.offset)| 1) |list_add_#in~new.offset|)) .cse0)))) [2021-02-22 01:57:01,813 INFO L185 CegarLoopUtils]: At program point L535(lines 535 539) the Hoare annotation is: (let ((.cse1 (= |list_add_#in~new.offset| list_add_~new.offset)) (.cse3 (= |old(~elem~0.base)| ~elem~0.base)) (.cse2 (= |old(~elem~0.offset)| ~elem~0.offset)) (.cse4 (not (<= 1 ~guard_malloc_counter~0.offset))) (.cse0 (= list_add_~new.base |list_add_#in~new.base|))) (and (or (= |old(~elem~0.offset)| 2) (not (= |old(~elem~0.base)| |list_add_#in~new.base|)) (not (<= 2 |list_add_#in~new.offset|)) (and .cse0 (= ~elem~0.base |list_add_#in~new.base|) .cse1 .cse2) (not (<= |list_add_#in~new.offset| 2))) (or (not (<= (+ |old(~elem~0.offset)| 1) |list_add_#in~new.offset|)) (and .cse1 .cse3 .cse2)) (or .cse4 (not (<= (+ |list_add_#in~new.offset| 1) |old(~elem~0.offset)|)) (and .cse0 .cse1 .cse3 .cse2)) (or .cse4 .cse0 (not (<= 1 |list_add_#in~new.offset|)) (not (= |old(~elem~0.offset)| 0))))) [2021-02-22 01:57:01,813 INFO L185 CegarLoopUtils]: At program point L536-2(line 536) the Hoare annotation is: (and (not (<= (+ |old(~elem~0.offset)| 1) |list_add_#in~new.offset|)) (or (not (<= 1 ~guard_malloc_counter~0.offset)) (not (<= (+ |list_add_#in~new.offset| 1) |old(~elem~0.offset)|))) (or (= |old(~elem~0.offset)| 2) (not (= |old(~elem~0.base)| |list_add_#in~new.base|)) (not (<= 2 |list_add_#in~new.offset|)) (not (<= |list_add_#in~new.offset| 2)))) [2021-02-22 01:57:01,813 INFO L185 CegarLoopUtils]: At program point L537-3(line 537) the Hoare annotation is: (let ((.cse5 (= |old(~elem~0.base)| ~elem~0.base)) (.cse6 (= |old(~elem~0.offset)| ~elem~0.offset))) (let ((.cse2 (not (<= 1 ~guard_malloc_counter~0.offset))) (.cse3 (= list_add_~new.base |list_add_#in~new.base|)) (.cse4 (= |list_add_#in~new.offset| list_add_~new.offset)) (.cse0 (not (<= 2 |list_add_#in~new.offset|))) (.cse1 (and .cse5 .cse6))) (and (or (= |old(~elem~0.offset)| 2) (not (= |old(~elem~0.base)| |list_add_#in~new.base|)) .cse0 .cse1 (not (<= |list_add_#in~new.offset| 2))) (or .cse2 (not (<= (+ |list_add_#in~new.offset| 1) |old(~elem~0.offset)|)) (and .cse3 .cse4 .cse5 .cse6)) (or .cse2 (and .cse3 .cse4) .cse0 (not (= |old(~elem~0.offset)| 0))) (or (not (<= (+ |old(~elem~0.offset)| 1) |list_add_#in~new.offset|)) .cse1)))) [2021-02-22 01:57:01,813 INFO L185 CegarLoopUtils]: At program point L536-3(line 536) the Hoare annotation is: (let ((.cse4 (= |old(~elem~0.base)| ~elem~0.base)) (.cse5 (= |old(~elem~0.offset)| ~elem~0.offset))) (let ((.cse1 (not (<= 1 ~guard_malloc_counter~0.offset))) (.cse2 (= list_add_~new.base |list_add_#in~new.base|)) (.cse3 (= |list_add_#in~new.offset| list_add_~new.offset)) (.cse0 (and .cse4 .cse5))) (and (or (= |old(~elem~0.offset)| 2) (not (= |old(~elem~0.base)| |list_add_#in~new.base|)) (not (<= 2 |list_add_#in~new.offset|)) .cse0 (not (<= |list_add_#in~new.offset| 2))) (or .cse1 (and .cse2 .cse3) (not (<= 1 |list_add_#in~new.offset|)) (not (= |old(~elem~0.offset)| 0))) (or .cse1 (not (<= (+ |list_add_#in~new.offset| 1) |old(~elem~0.offset)|)) (and .cse2 .cse3 .cse4 .cse5)) (or (not (<= (+ |old(~elem~0.offset)| 1) |list_add_#in~new.offset|)) .cse0)))) [2021-02-22 01:57:01,814 INFO L185 CegarLoopUtils]: At program point L537-4(lines 535 539) the Hoare annotation is: (let ((.cse4 (= list_add_~new.base |list_add_#in~new.base|)) (.cse5 (= |list_add_#in~new.offset| list_add_~new.offset)) (.cse6 (<= 1 ~guard_malloc_counter~0.offset))) (let ((.cse2 (= |old(~elem~0.base)| ~elem~0.base)) (.cse3 (and .cse4 (= ~elem~0.base |list_add_#in~new.base|) (= ~elem~0.offset |list_add_#in~new.offset|) .cse5 .cse6)) (.cse0 (not .cse6)) (.cse1 (not (= |old(~elem~0.offset)| 0)))) (and (or .cse0 (not (<= 1 |list_add_#in~new.offset|)) .cse1 (and (= ~elem~0.offset 0) .cse2) .cse3) (or .cse0 (not (<= (+ |list_add_#in~new.offset| 1) |old(~elem~0.offset)|)) (and .cse4 .cse5 .cse2 (= |old(~elem~0.offset)| ~elem~0.offset)) .cse3) (or (and .cse4 .cse5) .cse0 (not (<= 2 |list_add_#in~new.offset|)) .cse1)))) [2021-02-22 01:57:01,814 INFO L185 CegarLoopUtils]: At program point list_addEXIT(lines 535 539) the Hoare annotation is: (let ((.cse4 (= list_add_~new.base |list_add_#in~new.base|)) (.cse5 (= |list_add_#in~new.offset| list_add_~new.offset)) (.cse6 (<= 1 ~guard_malloc_counter~0.offset))) (let ((.cse2 (= |old(~elem~0.base)| ~elem~0.base)) (.cse3 (and .cse4 (= ~elem~0.base |list_add_#in~new.base|) (= ~elem~0.offset |list_add_#in~new.offset|) .cse5 .cse6)) (.cse0 (not .cse6)) (.cse1 (not (= |old(~elem~0.offset)| 0)))) (and (or .cse0 (not (<= 1 |list_add_#in~new.offset|)) .cse1 (and (= ~elem~0.offset 0) .cse2) .cse3) (or .cse0 (not (<= (+ |list_add_#in~new.offset| 1) |old(~elem~0.offset)|)) (and .cse4 .cse5 .cse2 (= |old(~elem~0.offset)| ~elem~0.offset)) .cse3) (or (and .cse4 .cse5) .cse0 (not (<= 2 |list_add_#in~new.offset|)) .cse1)))) [2021-02-22 01:57:01,814 INFO L189 CegarLoopUtils]: For program point __uint16_identityENTRY(lines 176 180) no Hoare annotation was computed. [2021-02-22 01:57:01,814 INFO L189 CegarLoopUtils]: For program point __uint16_identityEXIT(lines 176 180) no Hoare annotation was computed. [2021-02-22 01:57:01,814 INFO L189 CegarLoopUtils]: For program point __uint16_identityFINAL(lines 176 180) no Hoare annotation was computed. [2021-02-22 01:57:01,814 INFO L189 CegarLoopUtils]: For program point L179(line 179) no Hoare annotation was computed. [2021-02-22 01:57:01,814 INFO L192 CegarLoopUtils]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2021-02-22 01:57:01,814 INFO L185 CegarLoopUtils]: At program point L-1(line -1) the Hoare annotation is: (and (= ~elem~0.offset 0) (= ~guard_malloc_counter~0.offset 0)) [2021-02-22 01:57:01,815 INFO L192 CegarLoopUtils]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2021-02-22 01:57:01,815 INFO L192 CegarLoopUtils]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2021-02-22 01:57:01,840 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.02 01:57:01 BoogieIcfgContainer [2021-02-22 01:57:01,841 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-02-22 01:57:01,841 INFO L168 Benchmark]: Toolchain (without parser) took 26239.74 ms. Allocated memory was 152.0 MB in the beginning and 316.7 MB in the end (delta: 164.6 MB). Free memory was 127.0 MB in the beginning and 253.2 MB in the end (delta: -126.2 MB). Peak memory consumption was 185.8 MB. Max. memory is 8.0 GB. [2021-02-22 01:57:01,842 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 152.0 MB. Free memory is still 125.8 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-02-22 01:57:01,842 INFO L168 Benchmark]: CACSL2BoogieTranslator took 741.01 ms. Allocated memory is still 152.0 MB. Free memory was 125.9 MB in the beginning and 103.9 MB in the end (delta: 22.0 MB). Peak memory consumption was 22.0 MB. Max. memory is 8.0 GB. [2021-02-22 01:57:01,842 INFO L168 Benchmark]: Boogie Preprocessor took 128.94 ms. Allocated memory is still 152.0 MB. Free memory was 103.7 MB in the beginning and 133.8 MB in the end (delta: -30.1 MB). Peak memory consumption was 3.6 MB. Max. memory is 8.0 GB. [2021-02-22 01:57:01,843 INFO L168 Benchmark]: RCFGBuilder took 813.47 ms. Allocated memory is still 152.0 MB. Free memory was 133.8 MB in the beginning and 88.7 MB in the end (delta: 45.1 MB). Peak memory consumption was 44.0 MB. Max. memory is 8.0 GB. [2021-02-22 01:57:01,843 INFO L168 Benchmark]: TraceAbstraction took 24533.28 ms. Allocated memory was 152.0 MB in the beginning and 316.7 MB in the end (delta: 164.6 MB). Free memory was 88.2 MB in the beginning and 253.2 MB in the end (delta: -165.0 MB). Peak memory consumption was 146.5 MB. Max. memory is 8.0 GB. [2021-02-22 01:57:01,844 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 152.0 MB. Free memory is still 125.8 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 741.01 ms. Allocated memory is still 152.0 MB. Free memory was 125.9 MB in the beginning and 103.9 MB in the end (delta: 22.0 MB). Peak memory consumption was 22.0 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 128.94 ms. Allocated memory is still 152.0 MB. Free memory was 103.7 MB in the beginning and 133.8 MB in the end (delta: -30.1 MB). Peak memory consumption was 3.6 MB. Max. memory is 8.0 GB. * RCFGBuilder took 813.47 ms. Allocated memory is still 152.0 MB. Free memory was 133.8 MB in the beginning and 88.7 MB in the end (delta: 45.1 MB). Peak memory consumption was 44.0 MB. Max. memory is 8.0 GB. * TraceAbstraction took 24533.28 ms. Allocated memory was 152.0 MB in the beginning and 316.7 MB in the end (delta: 164.6 MB). Free memory was 88.2 MB in the beginning and 253.2 MB in the end (delta: -165.0 MB). Peak memory consumption was 146.5 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 6]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - ProcedureContractResult [Line: 4]: Procedure Contract for __blast_assert Derived contract for procedure __blast_assert: 1 - ProcedureContractResult [Line: 545]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 520]: Procedure Contract for __getMemory Derived contract for procedure __getMemory: (((!(\old(guard_malloc_counter) <= 1) || (((((\result <= 0 && \old(guard_malloc_counter) + 1 <= guard_malloc_counter) && \result <= 0) && 8 == size) && 0 <= \result) && 0 <= \result)) || ((!(\old(size) == 8) || !(1 <= \old(guard_malloc_counter))) && (!(\old(size) == 8) || !(\old(guard_malloc_counter) == 0)))) || ((((guard_malloc_counter <= \old(guard_malloc_counter) + 1 && \old(guard_malloc_counter) + 1 <= guard_malloc_counter) && \old(guard_malloc_counter) + 1 <= \result) && 8 == size) && \result <= \old(guard_malloc_counter) + 1)) || !(elem == 0) - ProcedureContractResult [Line: 528]: Procedure Contract for my_malloc Derived contract for procedure my_malloc: ((((((((0 <= \result && \result <= 0) && 0 <= \result) && \result <= 0) || !(\old(guard_malloc_counter) == 0)) || ((!(1 <= \old(guard_malloc_counter)) || !(\old(size) == 8)) && (!(\old(guard_malloc_counter) == 0) || !(\old(size) == 8)))) || (((guard_malloc_counter <= \old(guard_malloc_counter) + 1 && \old(guard_malloc_counter) + 1 <= \result) && \result <= \old(guard_malloc_counter) + 1) && 1 <= guard_malloc_counter)) || !(elem == 0)) && (!(\old(size) == 8) || size == 8)) && (((((!(\old(guard_malloc_counter) <= 1) || !(1 <= \old(guard_malloc_counter))) || ((((\old(guard_malloc_counter) + 1 <= guard_malloc_counter && 0 <= \result) && \result <= 0) && 0 <= \result) && \result <= 0)) || ((!(1 <= \old(guard_malloc_counter)) || !(\old(size) == 8)) && (!(\old(guard_malloc_counter) == 0) || !(\old(size) == 8)))) || !(elem == 0)) || ((guard_malloc_counter <= \old(guard_malloc_counter) + 1 && \result <= guard_malloc_counter) && \old(guard_malloc_counter) + 1 <= \result)) - ProcedureContractResult [Line: 540]: Procedure Contract for list_del Derived contract for procedure list_del: (!(1 <= guard_malloc_counter) || elem == 0) || (\old(elem) == elem && \old(elem) == elem) - ProcedureContractResult [Line: 535]: Procedure Contract for list_add Derived contract for procedure list_add: (((((!(1 <= guard_malloc_counter) || !(1 <= new)) || !(\old(elem) == 0)) || (elem == 0 && \old(elem) == elem)) || ((((new == new && elem == new) && elem == new) && new == new) && 1 <= guard_malloc_counter)) && (((!(1 <= guard_malloc_counter) || !(new + 1 <= \old(elem))) || (((new == new && new == new) && \old(elem) == elem) && \old(elem) == elem)) || ((((new == new && elem == new) && elem == new) && new == new) && 1 <= guard_malloc_counter))) && ((((new == new && new == new) || !(1 <= guard_malloc_counter)) || !(2 <= new)) || !(\old(elem) == 0)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 14 procedures, 101 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 15.7s, OverallIterations: 9, TraceHistogramMax: 3, AutomataDifference: 11.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 8.6s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 570 SDtfs, 908 SDslu, 2582 SDs, 0 SdLazy, 5942 SolverSat, 387 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 376 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 268 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1452 ImplicationChecksByTransitivity, 7.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=106occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 9 MinimizatonAttempts, 44 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 76 LocationsWithAnnotation, 379 PreInvPairs, 637 NumberOfFragments, 2907 HoareAnnotationTreeSize, 379 FomulaSimplifications, 27510 FormulaSimplificationTreeSizeReduction, 1.0s HoareSimplificationTime, 76 FomulaSimplificationsInter, 8318 FormulaSimplificationTreeSizeReductionInter, 7.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, 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 correct! Received shutdown request...