java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/list-simple/dll2c_update_all.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-14 23:11:52,529 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-14 23:11:52,531 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-14 23:11:52,549 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-14 23:11:52,549 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-14 23:11:52,551 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-14 23:11:52,554 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-14 23:11:52,567 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-14 23:11:52,569 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-14 23:11:52,570 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-14 23:11:52,573 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-14 23:11:52,574 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-14 23:11:52,575 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-14 23:11:52,578 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-14 23:11:52,581 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-14 23:11:52,583 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-14 23:11:52,584 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-14 23:11:52,587 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-14 23:11:52,588 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-14 23:11:52,594 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-14 23:11:52,598 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-14 23:11:52,601 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-14 23:11:52,602 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-14 23:11:52,603 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-14 23:11:52,608 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-14 23:11:52,609 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-14 23:11:52,609 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-14 23:11:52,611 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-14 23:11:52,612 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-14 23:11:52,614 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-14 23:11:52,614 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-14 23:11:52,617 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-14 23:11:52,618 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-14 23:11:52,618 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-14 23:11:52,620 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-14 23:11:52,621 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-14 23:11:52,621 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-14 23:11:52,622 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-14 23:11:52,622 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-14 23:11:52,623 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-14 23:11:52,624 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-14 23:11:52,625 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-14 23:11:52,646 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-14 23:11:52,646 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-14 23:11:52,647 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-14 23:11:52,648 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-14 23:11:52,648 INFO L138 SettingsManager]: * Use SBE=true [2019-10-14 23:11:52,648 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-14 23:11:52,648 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-14 23:11:52,649 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-14 23:11:52,649 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-14 23:11:52,649 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-14 23:11:52,650 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-14 23:11:52,650 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-14 23:11:52,650 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-14 23:11:52,651 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-14 23:11:52,651 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-14 23:11:52,651 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-14 23:11:52,651 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-14 23:11:52,652 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-14 23:11:52,652 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-14 23:11:52,652 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-14 23:11:52,652 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-14 23:11:52,652 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-14 23:11:52,653 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-14 23:11:52,653 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-14 23:11:52,653 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-14 23:11:52,653 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-14 23:11:52,653 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-14 23:11:52,654 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-14 23:11:52,654 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-14 23:11:52,941 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-14 23:11:52,957 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-14 23:11:52,962 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-14 23:11:52,964 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-14 23:11:52,964 INFO L275 PluginConnector]: CDTParser initialized [2019-10-14 23:11:52,965 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-simple/dll2c_update_all.i [2019-10-14 23:11:53,040 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d01a2390/76d53b5951e04b40af2e03aade92dae4/FLAG676a7615c [2019-10-14 23:11:53,620 INFO L306 CDTParser]: Found 1 translation units. [2019-10-14 23:11:53,621 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/dll2c_update_all.i [2019-10-14 23:11:53,636 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d01a2390/76d53b5951e04b40af2e03aade92dae4/FLAG676a7615c [2019-10-14 23:11:53,962 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d01a2390/76d53b5951e04b40af2e03aade92dae4 [2019-10-14 23:11:53,972 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-14 23:11:53,973 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-14 23:11:53,974 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-14 23:11:53,975 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-14 23:11:53,978 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-14 23:11:53,979 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:11:53" (1/1) ... [2019-10-14 23:11:53,982 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@320bbd13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:11:53, skipping insertion in model container [2019-10-14 23:11:53,983 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:11:53" (1/1) ... [2019-10-14 23:11:53,990 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-14 23:11:54,040 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-14 23:11:54,537 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 23:11:54,557 INFO L188 MainTranslator]: Completed pre-run [2019-10-14 23:11:54,627 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 23:11:54,690 INFO L192 MainTranslator]: Completed translation [2019-10-14 23:11:54,691 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:11:54 WrapperNode [2019-10-14 23:11:54,691 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-14 23:11:54,692 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-14 23:11:54,692 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-14 23:11:54,692 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-14 23:11:54,705 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:11:54" (1/1) ... [2019-10-14 23:11:54,706 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:11:54" (1/1) ... [2019-10-14 23:11:54,722 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:11:54" (1/1) ... [2019-10-14 23:11:54,722 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:11:54" (1/1) ... [2019-10-14 23:11:54,740 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:11:54" (1/1) ... [2019-10-14 23:11:54,747 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:11:54" (1/1) ... [2019-10-14 23:11:54,752 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:11:54" (1/1) ... [2019-10-14 23:11:54,759 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-14 23:11:54,760 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-14 23:11:54,760 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-14 23:11:54,760 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-14 23:11:54,761 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:11:54" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-14 23:11:54,816 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-14 23:11:54,817 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-14 23:11:54,817 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-10-14 23:11:54,817 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-10-14 23:11:54,817 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2019-10-14 23:11:54,817 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2019-10-14 23:11:54,818 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_circular_create [2019-10-14 23:11:54,818 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_circular_destroy [2019-10-14 23:11:54,818 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_circular_get_data_at [2019-10-14 23:11:54,818 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_circular_update_at [2019-10-14 23:11:54,818 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-14 23:11:54,819 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-14 23:11:54,819 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-10-14 23:11:54,819 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-10-14 23:11:54,819 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-10-14 23:11:54,819 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-10-14 23:11:54,820 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-10-14 23:11:54,820 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-10-14 23:11:54,820 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-10-14 23:11:54,820 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-10-14 23:11:54,820 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-10-14 23:11:54,820 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-10-14 23:11:54,821 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-10-14 23:11:54,821 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-10-14 23:11:54,821 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-10-14 23:11:54,821 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-10-14 23:11:54,821 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-10-14 23:11:54,822 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-10-14 23:11:54,822 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-10-14 23:11:54,822 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-10-14 23:11:54,822 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-10-14 23:11:54,822 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-10-14 23:11:54,822 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-10-14 23:11:54,823 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-10-14 23:11:54,823 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-10-14 23:11:54,823 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-10-14 23:11:54,823 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-10-14 23:11:54,823 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-10-14 23:11:54,823 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-10-14 23:11:54,824 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-10-14 23:11:54,824 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-10-14 23:11:54,824 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-10-14 23:11:54,824 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-10-14 23:11:54,824 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-10-14 23:11:54,824 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-10-14 23:11:54,825 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-10-14 23:11:54,825 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-10-14 23:11:54,825 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-10-14 23:11:54,825 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-10-14 23:11:54,825 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-10-14 23:11:54,825 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-10-14 23:11:54,826 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-10-14 23:11:54,826 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-10-14 23:11:54,826 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-10-14 23:11:54,826 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-10-14 23:11:54,826 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-10-14 23:11:54,826 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-10-14 23:11:54,826 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-10-14 23:11:54,827 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-10-14 23:11:54,827 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-10-14 23:11:54,827 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-10-14 23:11:54,827 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-10-14 23:11:54,827 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-10-14 23:11:54,828 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-10-14 23:11:54,828 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-14 23:11:54,828 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-10-14 23:11:54,828 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-10-14 23:11:54,828 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-14 23:11:54,828 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-10-14 23:11:54,829 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-10-14 23:11:54,829 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-10-14 23:11:54,829 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-10-14 23:11:54,829 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-10-14 23:11:54,829 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-10-14 23:11:54,829 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-10-14 23:11:54,830 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-10-14 23:11:54,830 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-10-14 23:11:54,830 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-14 23:11:54,830 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-10-14 23:11:54,830 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-10-14 23:11:54,830 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-10-14 23:11:54,831 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-10-14 23:11:54,831 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-10-14 23:11:54,831 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-10-14 23:11:54,831 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-10-14 23:11:54,831 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-10-14 23:11:54,831 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-10-14 23:11:54,832 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-10-14 23:11:54,832 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-10-14 23:11:54,832 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-10-14 23:11:54,832 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-10-14 23:11:54,832 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-10-14 23:11:54,832 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-10-14 23:11:54,832 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-10-14 23:11:54,833 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-10-14 23:11:54,833 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-10-14 23:11:54,833 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-10-14 23:11:54,833 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-10-14 23:11:54,833 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-10-14 23:11:54,833 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-10-14 23:11:54,834 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-10-14 23:11:54,834 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-10-14 23:11:54,834 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-10-14 23:11:54,834 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-10-14 23:11:54,834 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-10-14 23:11:54,834 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-10-14 23:11:54,834 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-10-14 23:11:54,835 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-10-14 23:11:54,835 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-10-14 23:11:54,835 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-10-14 23:11:54,835 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-10-14 23:11:54,835 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-10-14 23:11:54,835 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-10-14 23:11:54,835 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-10-14 23:11:54,836 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-10-14 23:11:54,836 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-10-14 23:11:54,836 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-10-14 23:11:54,836 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2019-10-14 23:11:54,836 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2019-10-14 23:11:54,836 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-14 23:11:54,836 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-14 23:11:54,837 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-14 23:11:54,837 INFO L130 BoogieDeclarations]: Found specification of procedure dll_circular_create [2019-10-14 23:11:54,837 INFO L130 BoogieDeclarations]: Found specification of procedure dll_circular_destroy [2019-10-14 23:11:54,837 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-14 23:11:54,837 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-14 23:11:54,837 INFO L130 BoogieDeclarations]: Found specification of procedure dll_circular_get_data_at [2019-10-14 23:11:54,838 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-14 23:11:54,838 INFO L130 BoogieDeclarations]: Found specification of procedure dll_circular_update_at [2019-10-14 23:11:54,838 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-14 23:11:54,838 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-14 23:11:54,838 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-14 23:11:55,398 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2019-10-14 23:11:55,507 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-14 23:11:55,508 INFO L284 CfgBuilder]: Removed 6 assume(true) statements. [2019-10-14 23:11:55,509 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:11:55 BoogieIcfgContainer [2019-10-14 23:11:55,509 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-14 23:11:55,510 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-14 23:11:55,510 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-14 23:11:55,513 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-14 23:11:55,514 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 11:11:53" (1/3) ... [2019-10-14 23:11:55,515 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@943e74c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:11:55, skipping insertion in model container [2019-10-14 23:11:55,515 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:11:54" (2/3) ... [2019-10-14 23:11:55,515 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@943e74c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:11:55, skipping insertion in model container [2019-10-14 23:11:55,516 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:11:55" (3/3) ... [2019-10-14 23:11:55,517 INFO L109 eAbstractionObserver]: Analyzing ICFG dll2c_update_all.i [2019-10-14 23:11:55,526 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-14 23:11:55,534 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-14 23:11:55,543 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-14 23:11:55,566 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-14 23:11:55,566 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-14 23:11:55,566 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-14 23:11:55,566 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-14 23:11:55,566 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-14 23:11:55,567 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-14 23:11:55,567 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-14 23:11:55,567 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-14 23:11:55,586 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states. [2019-10-14 23:11:55,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-14 23:11:55,594 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:11:55,595 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:11:55,597 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:11:55,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:11:55,603 INFO L82 PathProgramCache]: Analyzing trace with hash 1661227511, now seen corresponding path program 1 times [2019-10-14 23:11:55,612 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:11:55,612 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399029858] [2019-10-14 23:11:55,613 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:11:55,613 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:11:55,613 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:11:55,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:55,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:55,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:55,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:55,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:55,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:11:55,964 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399029858] [2019-10-14 23:11:55,965 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:11:55,965 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-14 23:11:55,966 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109043946] [2019-10-14 23:11:55,972 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-14 23:11:55,972 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:11:55,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-14 23:11:55,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:11:55,990 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 4 states. [2019-10-14 23:11:56,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:11:56,254 INFO L93 Difference]: Finished difference Result 101 states and 133 transitions. [2019-10-14 23:11:56,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-14 23:11:56,257 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2019-10-14 23:11:56,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:11:56,265 INFO L225 Difference]: With dead ends: 101 [2019-10-14 23:11:56,265 INFO L226 Difference]: Without dead ends: 45 [2019-10-14 23:11:56,269 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:11:56,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-10-14 23:11:56,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-10-14 23:11:56,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-10-14 23:11:56,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 51 transitions. [2019-10-14 23:11:56,315 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 51 transitions. Word has length 32 [2019-10-14 23:11:56,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:11:56,317 INFO L462 AbstractCegarLoop]: Abstraction has 45 states and 51 transitions. [2019-10-14 23:11:56,317 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-14 23:11:56,317 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2019-10-14 23:11:56,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-14 23:11:56,319 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:11:56,320 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:11:56,320 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:11:56,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:11:56,320 INFO L82 PathProgramCache]: Analyzing trace with hash 1248070634, now seen corresponding path program 1 times [2019-10-14 23:11:56,321 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:11:56,321 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208376057] [2019-10-14 23:11:56,321 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:11:56,321 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:11:56,321 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:11:56,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:56,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:56,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:56,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:56,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:56,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:11:56,584 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208376057] [2019-10-14 23:11:56,585 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:11:56,585 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-14 23:11:56,585 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698396682] [2019-10-14 23:11:56,587 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-14 23:11:56,588 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:11:56,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-14 23:11:56,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-14 23:11:56,589 INFO L87 Difference]: Start difference. First operand 45 states and 51 transitions. Second operand 7 states. [2019-10-14 23:11:56,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:11:56,868 INFO L93 Difference]: Finished difference Result 75 states and 87 transitions. [2019-10-14 23:11:56,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-14 23:11:56,869 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 32 [2019-10-14 23:11:56,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:11:56,871 INFO L225 Difference]: With dead ends: 75 [2019-10-14 23:11:56,871 INFO L226 Difference]: Without dead ends: 50 [2019-10-14 23:11:56,873 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-10-14 23:11:56,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-10-14 23:11:56,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 46. [2019-10-14 23:11:56,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-10-14 23:11:56,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 52 transitions. [2019-10-14 23:11:56,900 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 52 transitions. Word has length 32 [2019-10-14 23:11:56,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:11:56,900 INFO L462 AbstractCegarLoop]: Abstraction has 46 states and 52 transitions. [2019-10-14 23:11:56,900 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-14 23:11:56,900 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 52 transitions. [2019-10-14 23:11:56,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-10-14 23:11:56,904 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:11:56,904 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:11:56,904 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:11:56,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:11:56,905 INFO L82 PathProgramCache]: Analyzing trace with hash -820838434, now seen corresponding path program 1 times [2019-10-14 23:11:56,905 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:11:56,905 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736009968] [2019-10-14 23:11:56,905 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:11:56,905 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:11:56,906 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:11:56,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:57,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:57,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:57,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:57,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:57,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:57,141 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-14 23:11:57,141 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736009968] [2019-10-14 23:11:57,142 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:11:57,142 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-14 23:11:57,142 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368432518] [2019-10-14 23:11:57,144 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-14 23:11:57,145 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:11:57,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-14 23:11:57,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:11:57,150 INFO L87 Difference]: Start difference. First operand 46 states and 52 transitions. Second operand 6 states. [2019-10-14 23:11:57,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:11:57,387 INFO L93 Difference]: Finished difference Result 69 states and 79 transitions. [2019-10-14 23:11:57,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-14 23:11:57,388 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 42 [2019-10-14 23:11:57,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:11:57,389 INFO L225 Difference]: With dead ends: 69 [2019-10-14 23:11:57,404 INFO L226 Difference]: Without dead ends: 56 [2019-10-14 23:11:57,405 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-10-14 23:11:57,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-10-14 23:11:57,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 47. [2019-10-14 23:11:57,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-10-14 23:11:57,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 53 transitions. [2019-10-14 23:11:57,417 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 53 transitions. Word has length 42 [2019-10-14 23:11:57,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:11:57,417 INFO L462 AbstractCegarLoop]: Abstraction has 47 states and 53 transitions. [2019-10-14 23:11:57,417 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-14 23:11:57,417 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions. [2019-10-14 23:11:57,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-10-14 23:11:57,419 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:11:57,419 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:11:57,419 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:11:57,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:11:57,420 INFO L82 PathProgramCache]: Analyzing trace with hash -1202630968, now seen corresponding path program 1 times [2019-10-14 23:11:57,420 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:11:57,420 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542501438] [2019-10-14 23:11:57,420 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:11:57,420 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:11:57,421 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:11:57,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:57,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:57,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:57,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:57,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:57,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:57,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:57,586 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-14 23:11:57,587 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542501438] [2019-10-14 23:11:57,587 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1339238407] [2019-10-14 23:11:57,587 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:11:57,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:57,727 INFO L256 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-14 23:11:57,735 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:11:57,799 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-14 23:11:57,799 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 23:11:57,800 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 10 [2019-10-14 23:11:57,800 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717857242] [2019-10-14 23:11:57,801 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-14 23:11:57,801 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:11:57,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-14 23:11:57,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-10-14 23:11:57,802 INFO L87 Difference]: Start difference. First operand 47 states and 53 transitions. Second operand 10 states. [2019-10-14 23:11:58,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:11:58,145 INFO L93 Difference]: Finished difference Result 79 states and 91 transitions. [2019-10-14 23:11:58,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-14 23:11:58,145 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 50 [2019-10-14 23:11:58,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:11:58,147 INFO L225 Difference]: With dead ends: 79 [2019-10-14 23:11:58,147 INFO L226 Difference]: Without dead ends: 66 [2019-10-14 23:11:58,148 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2019-10-14 23:11:58,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-10-14 23:11:58,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 50. [2019-10-14 23:11:58,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-10-14 23:11:58,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 57 transitions. [2019-10-14 23:11:58,169 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 57 transitions. Word has length 50 [2019-10-14 23:11:58,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:11:58,170 INFO L462 AbstractCegarLoop]: Abstraction has 50 states and 57 transitions. [2019-10-14 23:11:58,170 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-14 23:11:58,170 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 57 transitions. [2019-10-14 23:11:58,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-10-14 23:11:58,175 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:11:58,175 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-14 23:11:58,376 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:11:58,377 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:11:58,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:11:58,378 INFO L82 PathProgramCache]: Analyzing trace with hash -470871118, now seen corresponding path program 2 times [2019-10-14 23:11:58,378 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:11:58,379 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120612751] [2019-10-14 23:11:58,379 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:11:58,379 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:11:58,379 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:11:58,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:58,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:58,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:58,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:58,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:58,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:58,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:58,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:58,590 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-14 23:11:58,590 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120612751] [2019-10-14 23:11:58,591 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1599421451] [2019-10-14 23:11:58,591 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:11:58,884 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-14 23:11:58,885 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 23:11:58,886 INFO L256 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-14 23:11:58,890 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:11:58,980 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-10-14 23:11:58,981 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-14 23:11:58,981 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 13 [2019-10-14 23:11:58,981 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831536754] [2019-10-14 23:11:58,982 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-14 23:11:58,982 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:11:58,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-14 23:11:58,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-10-14 23:11:58,983 INFO L87 Difference]: Start difference. First operand 50 states and 57 transitions. Second operand 6 states. [2019-10-14 23:11:59,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:11:59,056 INFO L93 Difference]: Finished difference Result 82 states and 95 transitions. [2019-10-14 23:11:59,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-14 23:11:59,057 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 58 [2019-10-14 23:11:59,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:11:59,060 INFO L225 Difference]: With dead ends: 82 [2019-10-14 23:11:59,060 INFO L226 Difference]: Without dead ends: 61 [2019-10-14 23:11:59,061 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-10-14 23:11:59,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-10-14 23:11:59,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 54. [2019-10-14 23:11:59,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-10-14 23:11:59,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 62 transitions. [2019-10-14 23:11:59,074 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 62 transitions. Word has length 58 [2019-10-14 23:11:59,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:11:59,074 INFO L462 AbstractCegarLoop]: Abstraction has 54 states and 62 transitions. [2019-10-14 23:11:59,075 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-14 23:11:59,075 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 62 transitions. [2019-10-14 23:11:59,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-14 23:11:59,077 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:11:59,077 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-14 23:11:59,283 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:11:59,284 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:11:59,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:11:59,284 INFO L82 PathProgramCache]: Analyzing trace with hash -1967505627, now seen corresponding path program 1 times [2019-10-14 23:11:59,285 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:11:59,286 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603572159] [2019-10-14 23:11:59,286 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:11:59,286 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:11:59,287 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:11:59,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:59,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:59,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:12:00,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:12:00,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:12:00,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:12:00,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:12:00,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:12:00,867 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-14 23:12:00,867 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603572159] [2019-10-14 23:12:00,868 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1353239569] [2019-10-14 23:12:00,868 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:12:01,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:12:01,022 INFO L256 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 96 conjunts are in the unsatisfiable core [2019-10-14 23:12:01,027 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:12:01,117 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-14 23:12:01,118 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:12:01,121 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:12:01,121 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:12:01,121 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-10-14 23:12:01,301 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:12:01,301 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-10-14 23:12:01,302 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:12:01,306 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:12:01,307 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:12:01,307 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2019-10-14 23:12:01,361 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-10-14 23:12:01,361 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:12:01,366 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:12:01,367 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:12:01,367 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2019-10-14 23:12:01,425 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2019-10-14 23:12:01,426 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:12:01,432 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:12:01,433 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 23:12:01,433 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2019-10-14 23:12:01,710 WARN L191 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 43 [2019-10-14 23:12:01,711 INFO L341 Elim1Store]: treesize reduction 67, result has 62.8 percent of original size [2019-10-14 23:12:01,712 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 71 treesize of output 132 [2019-10-14 23:12:01,713 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:12:01,747 INFO L567 ElimStorePlain]: treesize reduction 155, result has 25.1 percent of original size [2019-10-14 23:12:01,749 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-14 23:12:01,749 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:71, output treesize:52 [2019-10-14 23:12:02,263 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-10-14 23:12:02,264 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:12:02,268 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:12:02,269 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:12:02,269 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:29 [2019-10-14 23:12:02,373 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:12:02,374 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:12:02,375 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:12:02,425 INFO L341 Elim1Store]: treesize reduction 28, result has 65.0 percent of original size [2019-10-14 23:12:02,425 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 58 treesize of output 81 [2019-10-14 23:12:02,427 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:12:02,452 INFO L567 ElimStorePlain]: treesize reduction 72, result has 41.5 percent of original size [2019-10-14 23:12:02,453 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 23:12:02,453 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:70, output treesize:51 [2019-10-14 23:12:03,386 WARN L860 $PredicateComparison]: unable to prove that (exists ((dll_circular_update_at_~data Int) (dll_circular_update_at_~head.offset Int)) (= (let ((.cse0 (select (select |c_old(#memory_$Pointer$.base)| |c_dll_circular_update_at_#in~head.base|) |c_dll_circular_update_at_#in~head.offset|))) (store |c_old(#memory_int)| .cse0 (store (select |c_old(#memory_int)| .cse0) (+ dll_circular_update_at_~head.offset 8) dll_circular_update_at_~data))) |c_#memory_int|)) is different from true [2019-10-14 23:12:03,396 INFO L392 ElimStorePlain]: Different costs {2=[|v_old(#memory_int)_AFTER_CALL_14|], 6=[|v_old(#memory_$Pointer$.base)_AFTER_CALL_14|]} [2019-10-14 23:12:03,405 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:12:03,406 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-10-14 23:12:03,407 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:12:03,420 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:12:03,437 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:12:03,452 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:12:03,453 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 53 [2019-10-14 23:12:03,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:03,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:03,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:03,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:03,460 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 23:12:03,484 INFO L567 ElimStorePlain]: treesize reduction 30, result has 46.4 percent of original size [2019-10-14 23:12:03,485 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:12:03,485 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:72, output treesize:13 [2019-10-14 23:12:04,469 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:12:04,470 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 29 [2019-10-14 23:12:04,470 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:12:04,480 INFO L567 ElimStorePlain]: treesize reduction 16, result has 30.4 percent of original size [2019-10-14 23:12:04,480 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:12:04,480 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:37, output treesize:7 [2019-10-14 23:12:04,550 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2019-10-14 23:12:04,550 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 23:12:04,550 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 33] total 60 [2019-10-14 23:12:04,551 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111705671] [2019-10-14 23:12:04,551 INFO L442 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-10-14 23:12:04,552 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:12:04,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-10-14 23:12:04,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=3249, Unknown=2, NotChecked=114, Total=3540 [2019-10-14 23:12:04,554 INFO L87 Difference]: Start difference. First operand 54 states and 62 transitions. Second operand 60 states. [2019-10-14 23:12:10,312 WARN L191 SmtUtils]: Spent 1.46 s on a formula simplification. DAG size of input: 33 DAG size of output: 26 [2019-10-14 23:12:17,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:12:17,930 INFO L93 Difference]: Finished difference Result 128 states and 165 transitions. [2019-10-14 23:12:17,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-10-14 23:12:17,931 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 59 [2019-10-14 23:12:17,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:12:17,934 INFO L225 Difference]: With dead ends: 128 [2019-10-14 23:12:17,935 INFO L226 Difference]: Without dead ends: 125 [2019-10-14 23:12:17,939 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 95 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1747 ImplicationChecksByTransitivity, 14.1s TimeCoverageRelationStatistics Valid=562, Invalid=8549, Unknown=13, NotChecked=188, Total=9312 [2019-10-14 23:12:17,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-10-14 23:12:17,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 107. [2019-10-14 23:12:17,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-10-14 23:12:17,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 139 transitions. [2019-10-14 23:12:17,962 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 139 transitions. Word has length 59 [2019-10-14 23:12:17,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:12:17,963 INFO L462 AbstractCegarLoop]: Abstraction has 107 states and 139 transitions. [2019-10-14 23:12:17,963 INFO L463 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-10-14 23:12:17,963 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 139 transitions. [2019-10-14 23:12:17,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-14 23:12:17,966 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:12:17,966 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-14 23:12:18,182 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:12:18,183 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:12:18,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:12:18,184 INFO L82 PathProgramCache]: Analyzing trace with hash 1479492828, now seen corresponding path program 1 times [2019-10-14 23:12:18,184 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:12:18,185 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482633632] [2019-10-14 23:12:18,185 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:12:18,185 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:12:18,185 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:12:18,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:12:18,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:12:18,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:12:18,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:12:18,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:12:18,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:12:18,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:12:18,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:12:18,330 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-14 23:12:18,331 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482633632] [2019-10-14 23:12:18,331 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2115247110] [2019-10-14 23:12:18,331 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:12:18,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:12:18,487 INFO L256 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-14 23:12:18,510 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:12:18,554 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-14 23:12:18,555 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 23:12:18,555 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 10 [2019-10-14 23:12:18,555 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144496635] [2019-10-14 23:12:18,557 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-14 23:12:18,557 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:12:18,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-14 23:12:18,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-10-14 23:12:18,558 INFO L87 Difference]: Start difference. First operand 107 states and 139 transitions. Second operand 10 states. [2019-10-14 23:12:18,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:12:18,885 INFO L93 Difference]: Finished difference Result 145 states and 184 transitions. [2019-10-14 23:12:18,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-14 23:12:18,885 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 60 [2019-10-14 23:12:18,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:12:18,889 INFO L225 Difference]: With dead ends: 145 [2019-10-14 23:12:18,889 INFO L226 Difference]: Without dead ends: 119 [2019-10-14 23:12:18,890 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-10-14 23:12:18,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-10-14 23:12:18,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 113. [2019-10-14 23:12:18,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-10-14 23:12:18,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 146 transitions. [2019-10-14 23:12:18,918 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 146 transitions. Word has length 60 [2019-10-14 23:12:18,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:12:18,919 INFO L462 AbstractCegarLoop]: Abstraction has 113 states and 146 transitions. [2019-10-14 23:12:18,919 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-14 23:12:18,919 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 146 transitions. [2019-10-14 23:12:18,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-14 23:12:18,921 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:12:18,921 INFO L380 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] [2019-10-14 23:12:19,127 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:12:19,128 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:12:19,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:12:19,129 INFO L82 PathProgramCache]: Analyzing trace with hash -1118535150, now seen corresponding path program 2 times [2019-10-14 23:12:19,129 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:12:19,129 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251680454] [2019-10-14 23:12:19,130 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:12:19,130 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:12:19,130 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:12:19,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:12:19,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:12:19,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:12:19,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:12:19,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:12:19,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:12:19,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:12:19,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:12:19,287 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-14 23:12:19,287 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251680454] [2019-10-14 23:12:19,287 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [924035259] [2019-10-14 23:12:19,288 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:12:19,551 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-14 23:12:19,551 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 23:12:19,554 INFO L256 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-14 23:12:19,557 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:12:19,589 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-10-14 23:12:19,589 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 23:12:19,589 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 12 [2019-10-14 23:12:19,590 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104298908] [2019-10-14 23:12:19,590 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-14 23:12:19,590 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:12:19,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-14 23:12:19,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-10-14 23:12:19,591 INFO L87 Difference]: Start difference. First operand 113 states and 146 transitions. Second operand 12 states. [2019-10-14 23:12:20,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:12:20,053 INFO L93 Difference]: Finished difference Result 158 states and 197 transitions. [2019-10-14 23:12:20,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-14 23:12:20,054 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 60 [2019-10-14 23:12:20,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:12:20,056 INFO L225 Difference]: With dead ends: 158 [2019-10-14 23:12:20,056 INFO L226 Difference]: Without dead ends: 117 [2019-10-14 23:12:20,062 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=368, Unknown=0, NotChecked=0, Total=462 [2019-10-14 23:12:20,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-10-14 23:12:20,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 109. [2019-10-14 23:12:20,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-10-14 23:12:20,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 134 transitions. [2019-10-14 23:12:20,098 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 134 transitions. Word has length 60 [2019-10-14 23:12:20,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:12:20,099 INFO L462 AbstractCegarLoop]: Abstraction has 109 states and 134 transitions. [2019-10-14 23:12:20,099 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-14 23:12:20,099 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 134 transitions. [2019-10-14 23:12:20,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-14 23:12:20,106 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:12:20,106 INFO L380 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] [2019-10-14 23:12:20,317 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:12:20,318 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:12:20,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:12:20,318 INFO L82 PathProgramCache]: Analyzing trace with hash 1221148414, now seen corresponding path program 3 times [2019-10-14 23:12:20,319 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:12:20,319 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820099984] [2019-10-14 23:12:20,319 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:12:20,319 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:12:20,319 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:12:20,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:12:20,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:12:20,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:12:20,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:12:20,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:12:20,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:12:20,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:12:20,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:12:20,498 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-14 23:12:20,498 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820099984] [2019-10-14 23:12:20,498 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1666721718] [2019-10-14 23:12:20,499 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:12:21,137 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-10-14 23:12:21,137 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 23:12:21,139 INFO L256 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-14 23:12:21,142 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:12:21,178 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-14 23:12:21,179 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 23:12:21,179 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 10 [2019-10-14 23:12:21,179 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630792240] [2019-10-14 23:12:21,180 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-14 23:12:21,180 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:12:21,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-14 23:12:21,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-10-14 23:12:21,181 INFO L87 Difference]: Start difference. First operand 109 states and 134 transitions. Second operand 10 states. [2019-10-14 23:12:21,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:12:21,492 INFO L93 Difference]: Finished difference Result 148 states and 177 transitions. [2019-10-14 23:12:21,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-14 23:12:21,492 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 60 [2019-10-14 23:12:21,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:12:21,494 INFO L225 Difference]: With dead ends: 148 [2019-10-14 23:12:21,494 INFO L226 Difference]: Without dead ends: 115 [2019-10-14 23:12:21,495 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2019-10-14 23:12:21,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-10-14 23:12:21,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 109. [2019-10-14 23:12:21,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-10-14 23:12:21,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 131 transitions. [2019-10-14 23:12:21,511 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 131 transitions. Word has length 60 [2019-10-14 23:12:21,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:12:21,511 INFO L462 AbstractCegarLoop]: Abstraction has 109 states and 131 transitions. [2019-10-14 23:12:21,515 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-14 23:12:21,515 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 131 transitions. [2019-10-14 23:12:21,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-10-14 23:12:21,517 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:12:21,517 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:12:21,723 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:12:21,724 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:12:21,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:12:21,724 INFO L82 PathProgramCache]: Analyzing trace with hash -2045941912, now seen corresponding path program 4 times [2019-10-14 23:12:21,725 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:12:21,725 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748984670] [2019-10-14 23:12:21,725 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:12:21,725 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:12:21,726 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:12:21,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:12:21,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:12:21,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:12:21,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:12:21,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:12:21,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:12:21,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:12:21,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:12:21,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:12:21,880 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 12 proven. 11 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-10-14 23:12:21,880 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748984670] [2019-10-14 23:12:21,881 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [383326818] [2019-10-14 23:12:21,881 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:12:22,014 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-14 23:12:22,015 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 23:12:22,016 INFO L256 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-14 23:12:22,019 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:12:22,091 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-10-14 23:12:22,091 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-14 23:12:22,091 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 13 [2019-10-14 23:12:22,092 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090765356] [2019-10-14 23:12:22,095 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-14 23:12:22,095 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:12:22,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-14 23:12:22,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2019-10-14 23:12:22,096 INFO L87 Difference]: Start difference. First operand 109 states and 131 transitions. Second operand 6 states. [2019-10-14 23:12:22,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:12:22,145 INFO L93 Difference]: Finished difference Result 164 states and 193 transitions. [2019-10-14 23:12:22,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-14 23:12:22,146 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2019-10-14 23:12:22,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:12:22,148 INFO L225 Difference]: With dead ends: 164 [2019-10-14 23:12:22,149 INFO L226 Difference]: Without dead ends: 112 [2019-10-14 23:12:22,149 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2019-10-14 23:12:22,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-10-14 23:12:22,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 108. [2019-10-14 23:12:22,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-10-14 23:12:22,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 126 transitions. [2019-10-14 23:12:22,173 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 126 transitions. Word has length 68 [2019-10-14 23:12:22,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:12:22,175 INFO L462 AbstractCegarLoop]: Abstraction has 108 states and 126 transitions. [2019-10-14 23:12:22,175 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-14 23:12:22,175 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 126 transitions. [2019-10-14 23:12:22,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-10-14 23:12:22,176 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:12:22,176 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:12:22,387 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:12:22,388 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:12:22,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:12:22,388 INFO L82 PathProgramCache]: Analyzing trace with hash 715119440, now seen corresponding path program 1 times [2019-10-14 23:12:22,389 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:12:22,389 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118683171] [2019-10-14 23:12:22,389 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:12:22,389 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:12:22,390 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:12:22,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:12:22,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:12:22,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:12:22,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:12:22,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:12:22,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:12:22,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:12:22,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:12:22,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:12:22,558 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-10-14 23:12:22,559 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118683171] [2019-10-14 23:12:22,559 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [595455444] [2019-10-14 23:12:22,559 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:12:22,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:12:22,729 INFO L256 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-14 23:12:22,736 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:12:22,774 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-10-14 23:12:22,775 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-14 23:12:22,775 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 11 [2019-10-14 23:12:22,775 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562729520] [2019-10-14 23:12:22,777 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-14 23:12:22,777 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:12:22,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-14 23:12:22,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-10-14 23:12:22,779 INFO L87 Difference]: Start difference. First operand 108 states and 126 transitions. Second operand 6 states. [2019-10-14 23:12:22,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:12:22,841 INFO L93 Difference]: Finished difference Result 114 states and 130 transitions. [2019-10-14 23:12:22,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-14 23:12:22,844 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 69 [2019-10-14 23:12:22,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:12:22,846 INFO L225 Difference]: With dead ends: 114 [2019-10-14 23:12:22,846 INFO L226 Difference]: Without dead ends: 110 [2019-10-14 23:12:22,847 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-10-14 23:12:22,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-10-14 23:12:22,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 108. [2019-10-14 23:12:22,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-10-14 23:12:22,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 124 transitions. [2019-10-14 23:12:22,859 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 124 transitions. Word has length 69 [2019-10-14 23:12:22,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:12:22,859 INFO L462 AbstractCegarLoop]: Abstraction has 108 states and 124 transitions. [2019-10-14 23:12:22,860 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-14 23:12:22,860 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 124 transitions. [2019-10-14 23:12:22,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-10-14 23:12:22,861 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:12:22,861 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2019-10-14 23:12:23,065 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:12:23,066 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:12:23,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:12:23,067 INFO L82 PathProgramCache]: Analyzing trace with hash 2055631537, now seen corresponding path program 5 times [2019-10-14 23:12:23,067 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:12:23,067 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000175168] [2019-10-14 23:12:23,068 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:12:23,068 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:12:23,068 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:12:23,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:12:23,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:12:23,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:12:23,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:12:23,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:12:23,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:12:23,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:12:23,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:12:23,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:12:23,262 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-10-14 23:12:23,262 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000175168] [2019-10-14 23:12:23,262 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1166146745] [2019-10-14 23:12:23,263 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:12:23,508 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2019-10-14 23:12:23,508 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 23:12:23,509 INFO L256 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-14 23:12:23,511 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:12:23,534 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-10-14 23:12:23,535 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 23:12:23,535 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 10 [2019-10-14 23:12:23,535 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376676701] [2019-10-14 23:12:23,536 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-14 23:12:23,536 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:12:23,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-14 23:12:23,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-10-14 23:12:23,537 INFO L87 Difference]: Start difference. First operand 108 states and 124 transitions. Second operand 10 states. [2019-10-14 23:12:23,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:12:23,870 INFO L93 Difference]: Finished difference Result 121 states and 135 transitions. [2019-10-14 23:12:23,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-14 23:12:23,871 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 69 [2019-10-14 23:12:23,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:12:23,872 INFO L225 Difference]: With dead ends: 121 [2019-10-14 23:12:23,872 INFO L226 Difference]: Without dead ends: 75 [2019-10-14 23:12:23,873 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2019-10-14 23:12:23,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-10-14 23:12:23,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-10-14 23:12:23,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-10-14 23:12:23,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 81 transitions. [2019-10-14 23:12:23,881 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 81 transitions. Word has length 69 [2019-10-14 23:12:23,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:12:23,882 INFO L462 AbstractCegarLoop]: Abstraction has 75 states and 81 transitions. [2019-10-14 23:12:23,882 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-14 23:12:23,882 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 81 transitions. [2019-10-14 23:12:23,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-10-14 23:12:23,883 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:12:23,883 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:12:24,089 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:12:24,089 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:12:24,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:12:24,090 INFO L82 PathProgramCache]: Analyzing trace with hash -1258476015, now seen corresponding path program 1 times [2019-10-14 23:12:24,090 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:12:24,090 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601995541] [2019-10-14 23:12:24,091 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:12:24,091 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:12:24,091 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:12:24,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:12:24,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:12:24,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:12:24,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:12:24,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:12:25,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:12:25,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:12:25,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:12:25,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:12:25,728 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 20 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-14 23:12:25,728 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601995541] [2019-10-14 23:12:25,728 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1868570657] [2019-10-14 23:12:25,728 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:12:25,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:12:25,869 INFO L256 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 106 conjunts are in the unsatisfiable core [2019-10-14 23:12:25,872 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:12:25,920 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-14 23:12:25,920 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:12:25,922 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:12:25,923 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:12:25,923 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-10-14 23:12:26,206 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:12:26,206 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-10-14 23:12:26,207 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:12:26,211 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:12:26,211 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:12:26,211 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2019-10-14 23:12:26,258 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-10-14 23:12:26,259 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:12:26,264 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:12:26,264 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:12:26,265 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2019-10-14 23:12:26,322 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2019-10-14 23:12:26,323 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:12:26,330 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:12:26,331 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 23:12:26,332 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2019-10-14 23:12:26,608 WARN L191 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 43 [2019-10-14 23:12:26,609 INFO L341 Elim1Store]: treesize reduction 67, result has 62.8 percent of original size [2019-10-14 23:12:26,609 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 71 treesize of output 132 [2019-10-14 23:12:26,611 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:12:26,669 INFO L567 ElimStorePlain]: treesize reduction 155, result has 25.1 percent of original size [2019-10-14 23:12:26,671 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-14 23:12:26,671 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:71, output treesize:52 [2019-10-14 23:12:27,114 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2019-10-14 23:12:27,114 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:12:27,120 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:12:27,120 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 23:12:27,121 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:42, output treesize:23 [2019-10-14 23:12:27,897 WARN L860 $PredicateComparison]: unable to prove that (exists ((dll_circular_update_at_~head.offset Int)) (and (= (store |c_old(#memory_$Pointer$.base)| |c_dll_circular_update_at_#in~head.base| (let ((.cse0 (+ dll_circular_update_at_~head.offset 8))) (store (select |c_old(#memory_$Pointer$.base)| |c_dll_circular_update_at_#in~head.base|) .cse0 (select (select |c_#memory_$Pointer$.base| |c_dll_circular_update_at_#in~head.base|) .cse0)))) |c_#memory_$Pointer$.base|) (<= |c_dll_circular_update_at_#in~head.offset| dll_circular_update_at_~head.offset))) is different from true [2019-10-14 23:12:27,916 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:12:27,918 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:12:27,919 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:12:27,976 INFO L341 Elim1Store]: treesize reduction 28, result has 65.0 percent of original size [2019-10-14 23:12:27,977 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 58 treesize of output 81 [2019-10-14 23:12:27,978 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:12:28,009 INFO L567 ElimStorePlain]: treesize reduction 72, result has 40.0 percent of original size [2019-10-14 23:12:28,011 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 23:12:28,011 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:67, output treesize:45 [2019-10-14 23:12:28,365 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2019-10-14 23:12:28,365 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:12:28,376 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:12:28,377 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:12:28,377 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:104, output treesize:96 [2019-10-14 23:12:28,484 INFO L392 ElimStorePlain]: Different costs {2=[|v_old(#memory_$Pointer$.offset)_AFTER_CALL_51|], 12=[|v_#memory_$Pointer$.base_BEFORE_CALL_8|]} [2019-10-14 23:12:28,487 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:12:28,488 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 80 [2019-10-14 23:12:28,489 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:12:28,506 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:12:28,682 WARN L191 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-10-14 23:12:28,682 INFO L341 Elim1Store]: treesize reduction 10, result has 95.4 percent of original size [2019-10-14 23:12:28,683 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 97 treesize of output 260 [2019-10-14 23:12:28,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:28,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:28,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:12:28,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:28,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:28,688 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2019-10-14 23:12:28,795 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 34 [2019-10-14 23:12:28,796 INFO L567 ElimStorePlain]: treesize reduction 566, result has 11.0 percent of original size [2019-10-14 23:12:28,797 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:12:28,797 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:139, output treesize:44 [2019-10-14 23:12:29,867 INFO L392 ElimStorePlain]: Different costs {2=[|#memory_$Pointer$.offset|, |#memory_int|], 12=[|#memory_$Pointer$.base|]} [2019-10-14 23:12:29,878 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:12:29,879 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 52 [2019-10-14 23:12:29,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:29,881 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:29,882 INFO L496 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-14 23:12:29,910 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:12:29,931 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:12:29,932 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 34 [2019-10-14 23:12:29,932 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:12:29,975 INFO L567 ElimStorePlain]: treesize reduction 24, result has 71.8 percent of original size [2019-10-14 23:12:29,995 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:12:29,999 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:12:30,045 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:12:30,045 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 43 treesize of output 71 [2019-10-14 23:12:30,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:30,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:30,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:30,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:30,053 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 23:12:30,062 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:12:30,064 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:12:30,065 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 7 variables, input treesize:97, output treesize:7 [2019-10-14 23:12:30,162 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 8 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2019-10-14 23:12:30,162 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 23:12:30,162 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 67 [2019-10-14 23:12:30,163 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625207804] [2019-10-14 23:12:30,163 INFO L442 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-10-14 23:12:30,163 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:12:30,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-10-14 23:12:30,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=4094, Unknown=1, NotChecked=128, Total=4422 [2019-10-14 23:12:30,166 INFO L87 Difference]: Start difference. First operand 75 states and 81 transitions. Second operand 67 states.