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-ext3-properties/sll_of_sll_nondet_append-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 19:12:06,113 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 19:12:06,115 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 19:12:06,128 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 19:12:06,129 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 19:12:06,130 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 19:12:06,131 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 19:12:06,132 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 19:12:06,134 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 19:12:06,135 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 19:12:06,136 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 19:12:06,137 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 19:12:06,137 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 19:12:06,138 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 19:12:06,139 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 19:12:06,140 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 19:12:06,141 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 19:12:06,142 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 19:12:06,143 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 19:12:06,145 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 19:12:06,147 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 19:12:06,148 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 19:12:06,149 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 19:12:06,150 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 19:12:06,152 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 19:12:06,152 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 19:12:06,153 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 19:12:06,154 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 19:12:06,154 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 19:12:06,155 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 19:12:06,155 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 19:12:06,156 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 19:12:06,156 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 19:12:06,157 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 19:12:06,158 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 19:12:06,158 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 19:12:06,159 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 19:12:06,159 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 19:12:06,159 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 19:12:06,160 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 19:12:06,161 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 19:12:06,162 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-13 19:12:06,175 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 19:12:06,176 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 19:12:06,177 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 19:12:06,177 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 19:12:06,177 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 19:12:06,178 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 19:12:06,178 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 19:12:06,178 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 19:12:06,178 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 19:12:06,178 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 19:12:06,179 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 19:12:06,179 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 19:12:06,179 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 19:12:06,179 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 19:12:06,179 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 19:12:06,179 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 19:12:06,180 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 19:12:06,180 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 19:12:06,180 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 19:12:06,180 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 19:12:06,180 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 19:12:06,181 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 19:12:06,181 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 19:12:06,181 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 19:12:06,181 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 19:12:06,181 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 19:12:06,182 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 19:12:06,182 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 19:12:06,182 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-13 19:12:06,445 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 19:12:06,460 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 19:12:06,464 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 19:12:06,465 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 19:12:06,466 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 19:12:06,466 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext3-properties/sll_of_sll_nondet_append-2.i [2019-10-13 19:12:06,537 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7967d90f5/1ecf54933ba24212a42230159f1086d3/FLAG56ca70739 [2019-10-13 19:12:07,062 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 19:12:07,063 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-ext3-properties/sll_of_sll_nondet_append-2.i [2019-10-13 19:12:07,082 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7967d90f5/1ecf54933ba24212a42230159f1086d3/FLAG56ca70739 [2019-10-13 19:12:07,373 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7967d90f5/1ecf54933ba24212a42230159f1086d3 [2019-10-13 19:12:07,381 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 19:12:07,383 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 19:12:07,384 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 19:12:07,384 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 19:12:07,387 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 19:12:07,388 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 07:12:07" (1/1) ... [2019-10-13 19:12:07,391 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f72ceee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:12:07, skipping insertion in model container [2019-10-13 19:12:07,391 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 07:12:07" (1/1) ... [2019-10-13 19:12:07,397 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 19:12:07,451 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 19:12:07,880 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 19:12:07,892 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 19:12:07,941 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 19:12:08,004 INFO L192 MainTranslator]: Completed translation [2019-10-13 19:12:08,005 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:12:08 WrapperNode [2019-10-13 19:12:08,005 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 19:12:08,006 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 19:12:08,007 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 19:12:08,007 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 19:12:08,020 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:12:08" (1/1) ... [2019-10-13 19:12:08,021 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:12:08" (1/1) ... [2019-10-13 19:12:08,039 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:12:08" (1/1) ... [2019-10-13 19:12:08,039 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:12:08" (1/1) ... [2019-10-13 19:12:08,060 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:12:08" (1/1) ... [2019-10-13 19:12:08,076 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:12:08" (1/1) ... [2019-10-13 19:12:08,080 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:12:08" (1/1) ... [2019-10-13 19:12:08,087 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 19:12:08,087 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 19:12:08,087 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 19:12:08,087 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 19:12:08,088 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:12:08" (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-13 19:12:08,142 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 19:12:08,142 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 19:12:08,142 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-10-13 19:12:08,142 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-10-13 19:12:08,143 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2019-10-13 19:12:08,143 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_create [2019-10-13 19:12:08,143 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create_with_sublist [2019-10-13 19:12:08,143 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_length [2019-10-13 19:12:08,143 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_append [2019-10-13 19:12:08,143 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_hierarchical_destroy [2019-10-13 19:12:08,144 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 19:12:08,144 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 19:12:08,144 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 19:12:08,144 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-10-13 19:12:08,144 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-10-13 19:12:08,145 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-10-13 19:12:08,145 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-10-13 19:12:08,145 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-10-13 19:12:08,145 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-10-13 19:12:08,145 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-10-13 19:12:08,145 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-10-13 19:12:08,146 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-10-13 19:12:08,146 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-10-13 19:12:08,146 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-10-13 19:12:08,146 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-10-13 19:12:08,146 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-10-13 19:12:08,146 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-10-13 19:12:08,147 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-10-13 19:12:08,147 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-10-13 19:12:08,147 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-10-13 19:12:08,147 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-10-13 19:12:08,147 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-10-13 19:12:08,147 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-10-13 19:12:08,148 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-10-13 19:12:08,148 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-10-13 19:12:08,148 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-10-13 19:12:08,148 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-10-13 19:12:08,148 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-10-13 19:12:08,148 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-10-13 19:12:08,149 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-10-13 19:12:08,149 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-10-13 19:12:08,149 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-10-13 19:12:08,149 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-10-13 19:12:08,149 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-10-13 19:12:08,149 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-10-13 19:12:08,150 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-10-13 19:12:08,150 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-10-13 19:12:08,150 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-10-13 19:12:08,150 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-10-13 19:12:08,150 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-10-13 19:12:08,150 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-10-13 19:12:08,150 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-10-13 19:12:08,151 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-10-13 19:12:08,151 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-10-13 19:12:08,151 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-10-13 19:12:08,151 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-10-13 19:12:08,151 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-10-13 19:12:08,151 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-10-13 19:12:08,152 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-10-13 19:12:08,152 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-10-13 19:12:08,152 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-10-13 19:12:08,152 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-10-13 19:12:08,152 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-10-13 19:12:08,152 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-10-13 19:12:08,152 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-10-13 19:12:08,153 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-13 19:12:08,153 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-10-13 19:12:08,153 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-10-13 19:12:08,153 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-13 19:12:08,153 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-10-13 19:12:08,153 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-10-13 19:12:08,154 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-10-13 19:12:08,154 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-10-13 19:12:08,154 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-10-13 19:12:08,154 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-10-13 19:12:08,154 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-10-13 19:12:08,154 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-10-13 19:12:08,155 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-10-13 19:12:08,155 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-13 19:12:08,155 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-10-13 19:12:08,155 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-10-13 19:12:08,155 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-10-13 19:12:08,155 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-10-13 19:12:08,155 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-10-13 19:12:08,156 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-10-13 19:12:08,156 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-10-13 19:12:08,156 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-10-13 19:12:08,156 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-10-13 19:12:08,156 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-10-13 19:12:08,156 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-10-13 19:12:08,157 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-10-13 19:12:08,157 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-10-13 19:12:08,157 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-10-13 19:12:08,157 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-10-13 19:12:08,157 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-10-13 19:12:08,157 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-10-13 19:12:08,157 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-10-13 19:12:08,158 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-10-13 19:12:08,158 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-10-13 19:12:08,158 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-10-13 19:12:08,158 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-10-13 19:12:08,158 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-10-13 19:12:08,158 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-10-13 19:12:08,159 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-10-13 19:12:08,159 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-10-13 19:12:08,159 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-10-13 19:12:08,159 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-10-13 19:12:08,159 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-10-13 19:12:08,159 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-10-13 19:12:08,159 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-10-13 19:12:08,160 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-10-13 19:12:08,160 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-10-13 19:12:08,160 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-10-13 19:12:08,160 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-10-13 19:12:08,160 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-10-13 19:12:08,160 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-10-13 19:12:08,160 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-10-13 19:12:08,160 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-10-13 19:12:08,161 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2019-10-13 19:12:08,161 INFO L130 BoogieDeclarations]: Found specification of procedure sll_create [2019-10-13 19:12:08,161 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-13 19:12:08,161 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-13 19:12:08,161 INFO L130 BoogieDeclarations]: Found specification of procedure node_create_with_sublist [2019-10-13 19:12:08,161 INFO L130 BoogieDeclarations]: Found specification of procedure sll_length [2019-10-13 19:12:08,162 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-13 19:12:08,162 INFO L130 BoogieDeclarations]: Found specification of procedure sll_append [2019-10-13 19:12:08,162 INFO L130 BoogieDeclarations]: Found specification of procedure sll_hierarchical_destroy [2019-10-13 19:12:08,162 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-13 19:12:08,162 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 19:12:08,162 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-13 19:12:08,162 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-10-13 19:12:08,163 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 19:12:08,163 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 19:12:08,562 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2019-10-13 19:12:08,849 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 19:12:08,850 INFO L284 CfgBuilder]: Removed 9 assume(true) statements. [2019-10-13 19:12:08,851 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 07:12:08 BoogieIcfgContainer [2019-10-13 19:12:08,851 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 19:12:08,853 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 19:12:08,853 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 19:12:08,856 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 19:12:08,856 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 07:12:07" (1/3) ... [2019-10-13 19:12:08,857 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@789a971e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 07:12:08, skipping insertion in model container [2019-10-13 19:12:08,857 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:12:08" (2/3) ... [2019-10-13 19:12:08,858 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@789a971e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 07:12:08, skipping insertion in model container [2019-10-13 19:12:08,858 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 07:12:08" (3/3) ... [2019-10-13 19:12:08,859 INFO L109 eAbstractionObserver]: Analyzing ICFG sll_of_sll_nondet_append-2.i [2019-10-13 19:12:08,869 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 19:12:08,877 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 19:12:08,888 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 19:12:08,915 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 19:12:08,915 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 19:12:08,916 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 19:12:08,916 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 19:12:08,916 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 19:12:08,916 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 19:12:08,916 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 19:12:08,916 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 19:12:08,936 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states. [2019-10-13 19:12:08,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-13 19:12:08,943 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:12:08,944 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] [2019-10-13 19:12:08,946 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:12:08,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:12:08,951 INFO L82 PathProgramCache]: Analyzing trace with hash 655141366, now seen corresponding path program 1 times [2019-10-13 19:12:08,959 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:12:08,960 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78840182] [2019-10-13 19:12:08,960 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:12:08,960 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:12:08,961 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:12:09,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:09,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:09,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:09,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:09,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:09,257 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-13 19:12:09,258 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78840182] [2019-10-13 19:12:09,259 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:12:09,259 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 19:12:09,260 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811848368] [2019-10-13 19:12:09,265 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 19:12:09,266 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:12:09,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 19:12:09,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 19:12:09,283 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 4 states. [2019-10-13 19:12:09,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:12:09,569 INFO L93 Difference]: Finished difference Result 143 states and 207 transitions. [2019-10-13 19:12:09,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:12:09,571 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2019-10-13 19:12:09,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:12:09,581 INFO L225 Difference]: With dead ends: 143 [2019-10-13 19:12:09,581 INFO L226 Difference]: Without dead ends: 57 [2019-10-13 19:12:09,585 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 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-13 19:12:09,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-10-13 19:12:09,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 53. [2019-10-13 19:12:09,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-10-13 19:12:09,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 65 transitions. [2019-10-13 19:12:09,632 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 65 transitions. Word has length 29 [2019-10-13 19:12:09,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:12:09,633 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 65 transitions. [2019-10-13 19:12:09,633 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 19:12:09,633 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 65 transitions. [2019-10-13 19:12:09,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-13 19:12:09,639 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:12:09,639 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] [2019-10-13 19:12:09,639 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:12:09,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:12:09,640 INFO L82 PathProgramCache]: Analyzing trace with hash 1740250704, now seen corresponding path program 1 times [2019-10-13 19:12:09,640 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:12:09,640 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420378438] [2019-10-13 19:12:09,640 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:12:09,640 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:12:09,641 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:12:09,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:09,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:09,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:09,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:09,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:09,829 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-13 19:12:09,830 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420378438] [2019-10-13 19:12:09,830 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:12:09,830 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:12:09,831 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842123] [2019-10-13 19:12:09,832 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:12:09,833 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:12:09,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:12:09,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:12:09,835 INFO L87 Difference]: Start difference. First operand 53 states and 65 transitions. Second operand 5 states. [2019-10-13 19:12:10,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:12:10,038 INFO L93 Difference]: Finished difference Result 104 states and 129 transitions. [2019-10-13 19:12:10,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 19:12:10,038 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-10-13 19:12:10,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:12:10,040 INFO L225 Difference]: With dead ends: 104 [2019-10-13 19:12:10,040 INFO L226 Difference]: Without dead ends: 64 [2019-10-13 19:12:10,041 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 19:12:10,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-10-13 19:12:10,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 54. [2019-10-13 19:12:10,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-10-13 19:12:10,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 66 transitions. [2019-10-13 19:12:10,053 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 66 transitions. Word has length 29 [2019-10-13 19:12:10,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:12:10,053 INFO L462 AbstractCegarLoop]: Abstraction has 54 states and 66 transitions. [2019-10-13 19:12:10,053 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:12:10,053 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 66 transitions. [2019-10-13 19:12:10,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-10-13 19:12:10,054 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:12:10,055 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, 1, 1] [2019-10-13 19:12:10,055 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:12:10,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:12:10,055 INFO L82 PathProgramCache]: Analyzing trace with hash 470407865, now seen corresponding path program 1 times [2019-10-13 19:12:10,055 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:12:10,055 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752457036] [2019-10-13 19:12:10,056 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:12:10,056 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:12:10,056 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:12:10,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:10,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:10,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:10,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:10,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:10,303 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:12:10,303 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752457036] [2019-10-13 19:12:10,304 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1955761835] [2019-10-13 19:12:10,304 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-13 19:12:10,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:10,467 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-13 19:12:10,508 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 19:12:10,591 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:12:10,591 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 19:12:10,591 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 4] total 14 [2019-10-13 19:12:10,592 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320702109] [2019-10-13 19:12:10,592 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-13 19:12:10,593 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:12:10,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-13 19:12:10,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2019-10-13 19:12:10,593 INFO L87 Difference]: Start difference. First operand 54 states and 66 transitions. Second operand 14 states. [2019-10-13 19:12:11,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:12:11,182 INFO L93 Difference]: Finished difference Result 136 states and 177 transitions. [2019-10-13 19:12:11,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-13 19:12:11,183 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 34 [2019-10-13 19:12:11,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:12:11,185 INFO L225 Difference]: With dead ends: 136 [2019-10-13 19:12:11,185 INFO L226 Difference]: Without dead ends: 89 [2019-10-13 19:12:11,186 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=77, Invalid=429, Unknown=0, NotChecked=0, Total=506 [2019-10-13 19:12:11,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-10-13 19:12:11,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 85. [2019-10-13 19:12:11,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-10-13 19:12:11,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 111 transitions. [2019-10-13 19:12:11,200 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 111 transitions. Word has length 34 [2019-10-13 19:12:11,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:12:11,200 INFO L462 AbstractCegarLoop]: Abstraction has 85 states and 111 transitions. [2019-10-13 19:12:11,201 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-13 19:12:11,201 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 111 transitions. [2019-10-13 19:12:11,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-10-13 19:12:11,203 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:12:11,203 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-13 19:12:11,407 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:12:11,408 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:12:11,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:12:11,409 INFO L82 PathProgramCache]: Analyzing trace with hash -103581828, now seen corresponding path program 1 times [2019-10-13 19:12:11,409 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:12:11,410 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761310357] [2019-10-13 19:12:11,410 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:12:11,410 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:12:11,410 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:12:11,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:11,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:11,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:11,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:11,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:11,769 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:12:11,769 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761310357] [2019-10-13 19:12:11,770 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1036582158] [2019-10-13 19:12:11,770 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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-13 19:12:11,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:11,882 INFO L256 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-13 19:12:11,885 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 19:12:11,957 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-13 19:12:11,958 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 19:12:11,958 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 5] total 20 [2019-10-13 19:12:11,958 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692951830] [2019-10-13 19:12:11,959 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-10-13 19:12:11,959 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:12:11,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-10-13 19:12:11,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=328, Unknown=0, NotChecked=0, Total=380 [2019-10-13 19:12:11,960 INFO L87 Difference]: Start difference. First operand 85 states and 111 transitions. Second operand 20 states. [2019-10-13 19:12:12,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:12:12,598 INFO L93 Difference]: Finished difference Result 207 states and 288 transitions. [2019-10-13 19:12:12,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-13 19:12:12,598 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 42 [2019-10-13 19:12:12,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:12:12,600 INFO L225 Difference]: With dead ends: 207 [2019-10-13 19:12:12,600 INFO L226 Difference]: Without dead ends: 129 [2019-10-13 19:12:12,603 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=91, Invalid=611, Unknown=0, NotChecked=0, Total=702 [2019-10-13 19:12:12,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-10-13 19:12:12,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 108. [2019-10-13 19:12:12,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-10-13 19:12:12,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 145 transitions. [2019-10-13 19:12:12,628 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 145 transitions. Word has length 42 [2019-10-13 19:12:12,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:12:12,628 INFO L462 AbstractCegarLoop]: Abstraction has 108 states and 145 transitions. [2019-10-13 19:12:12,629 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-10-13 19:12:12,629 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 145 transitions. [2019-10-13 19:12:12,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-10-13 19:12:12,631 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:12:12,632 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 19:12:12,843 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:12:12,844 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:12:12,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:12:12,845 INFO L82 PathProgramCache]: Analyzing trace with hash -2115179085, now seen corresponding path program 2 times [2019-10-13 19:12:12,846 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:12:12,847 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671345385] [2019-10-13 19:12:12,847 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:12:12,847 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:12:12,847 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:12:12,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:12,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:12,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:13,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:13,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:13,104 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-10-13 19:12:13,104 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671345385] [2019-10-13 19:12:13,104 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [286456060] [2019-10-13 19:12:13,105 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 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-13 19:12:13,213 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-10-13 19:12:13,213 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 19:12:13,214 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-13 19:12:13,217 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 19:12:13,265 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-10-13 19:12:13,266 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-13 19:12:13,266 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [15] total 17 [2019-10-13 19:12:13,266 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307857180] [2019-10-13 19:12:13,267 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 19:12:13,267 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:12:13,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 19:12:13,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2019-10-13 19:12:13,268 INFO L87 Difference]: Start difference. First operand 108 states and 145 transitions. Second operand 4 states. [2019-10-13 19:12:13,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:12:13,327 INFO L93 Difference]: Finished difference Result 122 states and 163 transitions. [2019-10-13 19:12:13,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 19:12:13,327 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2019-10-13 19:12:13,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:12:13,330 INFO L225 Difference]: With dead ends: 122 [2019-10-13 19:12:13,330 INFO L226 Difference]: Without dead ends: 120 [2019-10-13 19:12:13,331 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2019-10-13 19:12:13,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-10-13 19:12:13,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 110. [2019-10-13 19:12:13,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-10-13 19:12:13,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 147 transitions. [2019-10-13 19:12:13,349 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 147 transitions. Word has length 47 [2019-10-13 19:12:13,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:12:13,350 INFO L462 AbstractCegarLoop]: Abstraction has 110 states and 147 transitions. [2019-10-13 19:12:13,350 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 19:12:13,350 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 147 transitions. [2019-10-13 19:12:13,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-10-13 19:12:13,352 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:12:13,353 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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-13 19:12:13,556 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:12:13,557 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:12:13,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:12:13,558 INFO L82 PathProgramCache]: Analyzing trace with hash -1014353226, now seen corresponding path program 1 times [2019-10-13 19:12:13,559 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:12:13,560 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626680918] [2019-10-13 19:12:13,560 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:12:13,560 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:12:13,560 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:12:13,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:13,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:13,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:13,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:13,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:13,658 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-10-13 19:12:13,658 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626680918] [2019-10-13 19:12:13,658 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:12:13,659 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:12:13,659 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880356395] [2019-10-13 19:12:13,660 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:12:13,660 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:12:13,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:12:13,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:12:13,661 INFO L87 Difference]: Start difference. First operand 110 states and 147 transitions. Second operand 5 states. [2019-10-13 19:12:13,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:12:13,817 INFO L93 Difference]: Finished difference Result 129 states and 172 transitions. [2019-10-13 19:12:13,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 19:12:13,817 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 51 [2019-10-13 19:12:13,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:12:13,820 INFO L225 Difference]: With dead ends: 129 [2019-10-13 19:12:13,820 INFO L226 Difference]: Without dead ends: 113 [2019-10-13 19:12:13,821 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 19:12:13,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-10-13 19:12:13,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 111. [2019-10-13 19:12:13,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-10-13 19:12:13,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 148 transitions. [2019-10-13 19:12:13,858 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 148 transitions. Word has length 51 [2019-10-13 19:12:13,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:12:13,859 INFO L462 AbstractCegarLoop]: Abstraction has 111 states and 148 transitions. [2019-10-13 19:12:13,859 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:12:13,859 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 148 transitions. [2019-10-13 19:12:13,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-10-13 19:12:13,862 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:12:13,862 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 19:12:13,863 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:12:13,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:12:13,869 INFO L82 PathProgramCache]: Analyzing trace with hash -1112701260, now seen corresponding path program 1 times [2019-10-13 19:12:13,869 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:12:13,869 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721016457] [2019-10-13 19:12:13,869 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:12:13,870 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:12:13,870 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:12:13,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:13,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:13,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:14,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:14,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:14,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:14,154 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-10-13 19:12:14,155 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721016457] [2019-10-13 19:12:14,155 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [272550376] [2019-10-13 19:12:14,155 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-13 19:12:14,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:14,280 INFO L256 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-13 19:12:14,288 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 19:12:14,388 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-13 19:12:14,389 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 19:12:14,389 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 16 [2019-10-13 19:12:14,390 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488548473] [2019-10-13 19:12:14,390 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-10-13 19:12:14,390 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:12:14,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-10-13 19:12:14,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-10-13 19:12:14,391 INFO L87 Difference]: Start difference. First operand 111 states and 148 transitions. Second operand 16 states. [2019-10-13 19:12:14,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:12:14,949 INFO L93 Difference]: Finished difference Result 134 states and 176 transitions. [2019-10-13 19:12:14,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-13 19:12:14,950 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 58 [2019-10-13 19:12:14,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:12:14,951 INFO L225 Difference]: With dead ends: 134 [2019-10-13 19:12:14,951 INFO L226 Difference]: Without dead ends: 114 [2019-10-13 19:12:14,952 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=79, Invalid=427, Unknown=0, NotChecked=0, Total=506 [2019-10-13 19:12:14,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-10-13 19:12:14,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 98. [2019-10-13 19:12:14,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-10-13 19:12:14,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 129 transitions. [2019-10-13 19:12:14,962 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 129 transitions. Word has length 58 [2019-10-13 19:12:14,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:12:14,963 INFO L462 AbstractCegarLoop]: Abstraction has 98 states and 129 transitions. [2019-10-13 19:12:14,963 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-10-13 19:12:14,963 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 129 transitions. [2019-10-13 19:12:14,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-10-13 19:12:14,964 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:12:14,965 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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] [2019-10-13 19:12:15,168 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:12:15,169 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:12:15,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:12:15,169 INFO L82 PathProgramCache]: Analyzing trace with hash -767305266, now seen corresponding path program 2 times [2019-10-13 19:12:15,169 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:12:15,169 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880391128] [2019-10-13 19:12:15,169 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:12:15,170 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:12:15,170 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:12:15,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:15,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:15,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:15,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:15,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:15,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:15,417 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-10-13 19:12:15,417 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880391128] [2019-10-13 19:12:15,417 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1893778782] [2019-10-13 19:12:15,418 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-13 19:12:15,544 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-13 19:12:15,545 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 19:12:15,546 INFO L256 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-13 19:12:15,549 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 19:12:15,620 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-13 19:12:15,620 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 19:12:15,621 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 17 [2019-10-13 19:12:15,621 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91261817] [2019-10-13 19:12:15,621 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-10-13 19:12:15,622 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:12:15,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-10-13 19:12:15,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2019-10-13 19:12:15,622 INFO L87 Difference]: Start difference. First operand 98 states and 129 transitions. Second operand 17 states. [2019-10-13 19:12:16,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:12:16,059 INFO L93 Difference]: Finished difference Result 211 states and 281 transitions. [2019-10-13 19:12:16,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-13 19:12:16,060 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 61 [2019-10-13 19:12:16,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:12:16,061 INFO L225 Difference]: With dead ends: 211 [2019-10-13 19:12:16,061 INFO L226 Difference]: Without dead ends: 120 [2019-10-13 19:12:16,063 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=93, Invalid=507, Unknown=0, NotChecked=0, Total=600 [2019-10-13 19:12:16,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-10-13 19:12:16,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 114. [2019-10-13 19:12:16,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-10-13 19:12:16,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 151 transitions. [2019-10-13 19:12:16,073 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 151 transitions. Word has length 61 [2019-10-13 19:12:16,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:12:16,074 INFO L462 AbstractCegarLoop]: Abstraction has 114 states and 151 transitions. [2019-10-13 19:12:16,074 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-10-13 19:12:16,074 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 151 transitions. [2019-10-13 19:12:16,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-10-13 19:12:16,075 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:12:16,075 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 19:12:16,279 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:12:16,280 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:12:16,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:12:16,280 INFO L82 PathProgramCache]: Analyzing trace with hash -1816889228, now seen corresponding path program 3 times [2019-10-13 19:12:16,281 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:12:16,281 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077171033] [2019-10-13 19:12:16,281 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:12:16,282 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:12:16,282 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:12:16,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:16,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:16,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:16,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:16,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:16,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:16,996 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 7 proven. 11 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-13 19:12:16,996 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077171033] [2019-10-13 19:12:16,996 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [244700922] [2019-10-13 19:12:16,996 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-13 19:12:17,107 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-10-13 19:12:17,107 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 19:12:17,109 INFO L256 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 68 conjunts are in the unsatisfiable core [2019-10-13 19:12:17,113 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 19:12:17,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:17,339 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:17,355 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 45 [2019-10-13 19:12:17,355 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:17,362 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:17,369 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 45 treesize of output 45 [2019-10-13 19:12:17,370 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:17,410 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:17,417 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:17,424 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 45 treesize of output 45 [2019-10-13 19:12:17,424 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:17,429 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:17,434 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 45 [2019-10-13 19:12:17,434 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:17,471 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:17,472 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-10-13 19:12:17,472 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:91, output treesize:67 [2019-10-13 19:12:17,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:17,661 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:17,676 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 56 [2019-10-13 19:12:17,677 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:17,686 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 53 [2019-10-13 19:12:17,687 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:17,731 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:17,740 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 42 [2019-10-13 19:12:17,741 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:17,748 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:17,751 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 45 [2019-10-13 19:12:17,752 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:17,787 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:17,788 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-10-13 19:12:17,788 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:123, output treesize:79 [2019-10-13 19:12:17,881 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:17,889 INFO L392 ElimStorePlain]: Different costs {2=[v_prenex_1, |v_#memory_$Pointer$.offset_34|], 4=[|v_#memory_$Pointer$.base_34|, v_prenex_3]} [2019-10-13 19:12:17,929 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:17,930 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 73 [2019-10-13 19:12:17,931 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:18,058 WARN L191 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-10-13 19:12:18,059 INFO L567 ElimStorePlain]: treesize reduction 16, result has 86.8 percent of original size [2019-10-13 19:12:18,088 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:18,089 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 73 [2019-10-13 19:12:18,090 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:18,185 INFO L567 ElimStorePlain]: treesize reduction 24, result has 80.8 percent of original size [2019-10-13 19:12:18,234 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:18,235 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 96 [2019-10-13 19:12:18,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:18,237 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:18,360 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 56 [2019-10-13 19:12:18,361 INFO L567 ElimStorePlain]: treesize reduction 32, result has 77.9 percent of original size [2019-10-13 19:12:18,410 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:18,410 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 54 treesize of output 104 [2019-10-13 19:12:18,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:18,413 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:18,533 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 53 [2019-10-13 19:12:18,534 INFO L567 ElimStorePlain]: treesize reduction 40, result has 74.5 percent of original size [2019-10-13 19:12:18,536 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-10-13 19:12:18,536 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:101, output treesize:151 [2019-10-13 19:12:18,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:18,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:19,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:19,079 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:19,088 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:19,088 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 85 treesize of output 58 [2019-10-13 19:12:19,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:19,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:19,091 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-13 19:12:19,096 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:19,096 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-13 19:12:19,103 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:19,103 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 85 treesize of output 57 [2019-10-13 19:12:19,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:19,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:19,106 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-13 19:12:19,153 INFO L567 ElimStorePlain]: treesize reduction 16, result has 83.2 percent of original size [2019-10-13 19:12:19,158 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:19,167 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:19,168 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 1 case distinctions, treesize of input 37 treesize of output 32 [2019-10-13 19:12:19,169 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:19,178 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:19,186 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:19,187 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 5 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 40 [2019-10-13 19:12:19,188 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:19,196 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:19,197 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-10-13 19:12:19,197 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:171, output treesize:9 [2019-10-13 19:12:19,326 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-10-13 19:12:19,326 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-13 19:12:19,326 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [23] total 37 [2019-10-13 19:12:19,326 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698919107] [2019-10-13 19:12:19,327 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-13 19:12:19,327 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:12:19,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-13 19:12:19,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=1248, Unknown=0, NotChecked=0, Total=1332 [2019-10-13 19:12:19,328 INFO L87 Difference]: Start difference. First operand 114 states and 151 transitions. Second operand 18 states. [2019-10-13 19:12:20,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:12:20,643 INFO L93 Difference]: Finished difference Result 210 states and 316 transitions. [2019-10-13 19:12:20,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-13 19:12:20,648 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 64 [2019-10-13 19:12:20,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:12:20,650 INFO L225 Difference]: With dead ends: 210 [2019-10-13 19:12:20,650 INFO L226 Difference]: Without dead ends: 193 [2019-10-13 19:12:20,652 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 57 SyntacticMatches, 3 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=126, Invalid=1854, Unknown=0, NotChecked=0, Total=1980 [2019-10-13 19:12:20,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2019-10-13 19:12:20,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 132. [2019-10-13 19:12:20,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-10-13 19:12:20,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 180 transitions. [2019-10-13 19:12:20,673 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 180 transitions. Word has length 64 [2019-10-13 19:12:20,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:12:20,674 INFO L462 AbstractCegarLoop]: Abstraction has 132 states and 180 transitions. [2019-10-13 19:12:20,674 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-13 19:12:20,674 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 180 transitions. [2019-10-13 19:12:20,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-10-13 19:12:20,675 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:12:20,676 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 19:12:20,880 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:12:20,881 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:12:20,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:12:20,881 INFO L82 PathProgramCache]: Analyzing trace with hash 2139714032, now seen corresponding path program 1 times [2019-10-13 19:12:20,882 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:12:20,882 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236123952] [2019-10-13 19:12:20,882 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:12:20,883 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:12:20,883 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:12:20,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:21,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:21,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:21,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:21,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:22,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:22,166 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-13 19:12:22,167 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236123952] [2019-10-13 19:12:22,167 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [277407638] [2019-10-13 19:12:22,167 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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-13 19:12:22,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:22,307 INFO L256 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 92 conjunts are in the unsatisfiable core [2019-10-13 19:12:22,322 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 19:12:22,380 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-13 19:12:22,380 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:22,386 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:22,386 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:12:22,386 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-10-13 19:12:22,473 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2019-10-13 19:12:22,473 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:22,480 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:22,481 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:12:22,482 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:3 [2019-10-13 19:12:22,741 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-13 19:12:22,742 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:22,753 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:22,754 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-13 19:12:22,754 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:44 [2019-10-13 19:12:22,938 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:22,939 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 case distinctions, treesize of input 45 treesize of output 93 [2019-10-13 19:12:22,940 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:22,963 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:22,964 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:12:22,964 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:61, output treesize:44 [2019-10-13 19:12:23,043 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_35|], 4=[|v_#memory_$Pointer$.base_36|]} [2019-10-13 19:12:23,048 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:23,049 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2019-10-13 19:12:23,049 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:23,075 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:23,078 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:23,080 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 36 [2019-10-13 19:12:23,081 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:23,125 INFO L567 ElimStorePlain]: treesize reduction 4, result has 94.5 percent of original size [2019-10-13 19:12:23,126 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-13 19:12:23,126 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:73, output treesize:84 [2019-10-13 19:12:23,313 INFO L392 ElimStorePlain]: Different costs {6=[|v_#memory_$Pointer$.offset_36|], 12=[|v_#memory_$Pointer$.base_37|]} [2019-10-13 19:12:23,318 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:23,320 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2019-10-13 19:12:23,320 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:23,353 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:23,375 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:23,394 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:23,395 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 67 treesize of output 66 [2019-10-13 19:12:23,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:23,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:23,398 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:23,474 INFO L567 ElimStorePlain]: treesize reduction 24, result has 78.9 percent of original size [2019-10-13 19:12:23,474 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:12:23,475 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:112, output treesize:90 [2019-10-13 19:12:23,571 INFO L392 ElimStorePlain]: Different costs {4=[|v_#memory_$Pointer$.offset_37|], 7=[|v_#memory_$Pointer$.base_38|]} [2019-10-13 19:12:23,608 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:23,608 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 76 [2019-10-13 19:12:23,609 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:23,674 INFO L567 ElimStorePlain]: treesize reduction 48, result has 65.0 percent of original size [2019-10-13 19:12:23,733 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:23,734 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 59 treesize of output 127 [2019-10-13 19:12:23,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:23,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:23,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:23,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:12:23,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:23,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:23,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:23,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:12:23,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:23,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:23,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:12:23,744 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-13 19:12:23,852 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 51 [2019-10-13 19:12:23,853 INFO L567 ElimStorePlain]: treesize reduction 80, result has 57.7 percent of original size [2019-10-13 19:12:23,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:23,854 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-13 19:12:23,855 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:93, output treesize:146 [2019-10-13 19:12:23,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:24,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:24,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:24,396 WARN L191 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 38 [2019-10-13 19:12:24,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:24,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:24,534 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:24,556 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:24,556 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 152 treesize of output 135 [2019-10-13 19:12:24,557 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:24,567 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:24,575 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:24,576 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 103 treesize of output 86 [2019-10-13 19:12:24,576 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:24,607 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:24,608 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 2 xjuncts. [2019-10-13 19:12:24,608 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:256, output treesize:158 [2019-10-13 19:12:25,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:25,272 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-13 19:12:25,272 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 19:12:25,272 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 45 [2019-10-13 19:12:25,272 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432664055] [2019-10-13 19:12:25,273 INFO L442 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-10-13 19:12:25,273 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:12:25,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-10-13 19:12:25,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=1866, Unknown=0, NotChecked=0, Total=1980 [2019-10-13 19:12:25,297 INFO L87 Difference]: Start difference. First operand 132 states and 180 transitions. Second operand 45 states. [2019-10-13 19:12:29,003 WARN L191 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 78 [2019-10-13 19:12:29,277 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 41 [2019-10-13 19:12:31,706 WARN L191 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 95 [2019-10-13 19:12:32,128 WARN L191 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 107 [2019-10-13 19:12:34,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:12:34,382 INFO L93 Difference]: Finished difference Result 335 states and 560 transitions. [2019-10-13 19:12:34,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-10-13 19:12:34,382 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 65 [2019-10-13 19:12:34,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:12:34,386 INFO L225 Difference]: With dead ends: 335 [2019-10-13 19:12:34,386 INFO L226 Difference]: Without dead ends: 305 [2019-10-13 19:12:34,390 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 54 SyntacticMatches, 3 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1396 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=413, Invalid=6393, Unknown=0, NotChecked=0, Total=6806 [2019-10-13 19:12:34,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2019-10-13 19:12:34,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 177. [2019-10-13 19:12:34,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2019-10-13 19:12:34,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 245 transitions. [2019-10-13 19:12:34,434 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 245 transitions. Word has length 65 [2019-10-13 19:12:34,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:12:34,435 INFO L462 AbstractCegarLoop]: Abstraction has 177 states and 245 transitions. [2019-10-13 19:12:34,435 INFO L463 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-10-13 19:12:34,436 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 245 transitions. [2019-10-13 19:12:34,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-10-13 19:12:34,438 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:12:34,438 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-10-13 19:12:34,643 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:12:34,644 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:12:34,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:12:34,644 INFO L82 PathProgramCache]: Analyzing trace with hash 240363508, now seen corresponding path program 2 times [2019-10-13 19:12:34,645 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:12:34,645 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412413558] [2019-10-13 19:12:34,645 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:12:34,646 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:12:34,646 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:12:34,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:34,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:34,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:35,145 WARN L191 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 41 [2019-10-13 19:12:35,315 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 48 [2019-10-13 19:12:35,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:35,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:36,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:36,516 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-13 19:12:36,516 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412413558] [2019-10-13 19:12:36,516 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [926230607] [2019-10-13 19:12:36,516 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 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-13 19:12:36,647 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-13 19:12:36,648 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 19:12:36,665 INFO L256 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 116 conjunts are in the unsatisfiable core [2019-10-13 19:12:36,668 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 19:12:36,743 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-13 19:12:36,743 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:36,748 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:36,749 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:12:36,749 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-10-13 19:12:36,772 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2019-10-13 19:12:36,772 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:36,776 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:36,776 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:12:36,776 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:3 [2019-10-13 19:12:37,131 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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-13 19:12:37,132 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:37,148 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:37,148 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-13 19:12:37,149 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:41 [2019-10-13 19:12:37,331 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_38|], 1=[|v_#memory_$Pointer$.base_40|]} [2019-10-13 19:12:37,335 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-10-13 19:12:37,336 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:37,356 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:37,366 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:37,367 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2019-10-13 19:12:37,368 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:37,388 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:37,389 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-13 19:12:37,389 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:65, output treesize:70 [2019-10-13 19:12:37,627 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:37,627 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 45 treesize of output 93 [2019-10-13 19:12:37,628 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:37,657 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:37,658 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:12:37,658 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:83, output treesize:66 [2019-10-13 19:12:37,760 INFO L392 ElimStorePlain]: Different costs {1=[|v_#memory_$Pointer$.offset_39|], 3=[|v_#memory_$Pointer$.base_41|]} [2019-10-13 19:12:37,776 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 25 [2019-10-13 19:12:37,777 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:37,804 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:37,825 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:37,825 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 58 treesize of output 75 [2019-10-13 19:12:37,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:37,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:37,828 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:37,925 INFO L567 ElimStorePlain]: treesize reduction 83, result has 48.8 percent of original size [2019-10-13 19:12:37,926 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-13 19:12:37,927 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:91, output treesize:96 [2019-10-13 19:12:38,137 INFO L392 ElimStorePlain]: Different costs {7=[|v_#memory_$Pointer$.offset_40|], 11=[|v_#memory_$Pointer$.base_42|]} [2019-10-13 19:12:38,142 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:38,144 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 35 [2019-10-13 19:12:38,144 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:38,184 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:38,253 INFO L341 Elim1Store]: treesize reduction 8, result has 88.7 percent of original size [2019-10-13 19:12:38,253 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 7 case distinctions, treesize of input 85 treesize of output 108 [2019-10-13 19:12:38,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:38,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:38,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:38,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:38,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:38,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:38,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:38,259 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-13 19:12:38,381 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 47 [2019-10-13 19:12:38,381 INFO L567 ElimStorePlain]: treesize reduction 52, result has 62.9 percent of original size [2019-10-13 19:12:38,382 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:12:38,382 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:131, output treesize:109 [2019-10-13 19:12:38,514 INFO L392 ElimStorePlain]: Different costs {7=[|v_#memory_$Pointer$.offset_41|], 21=[|v_#memory_$Pointer$.base_43|]} [2019-10-13 19:12:38,527 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:38,603 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:38,603 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 126 [2019-10-13 19:12:38,605 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:38,704 INFO L567 ElimStorePlain]: treesize reduction 84, result has 58.4 percent of original size [2019-10-13 19:12:38,939 WARN L191 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 63 [2019-10-13 19:12:38,940 INFO L341 Elim1Store]: treesize reduction 24, result has 87.8 percent of original size [2019-10-13 19:12:38,940 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 13 case distinctions, treesize of input 92 treesize of output 214 [2019-10-13 19:12:38,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:38,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:38,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:38,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:38,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:38,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:12:38,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:38,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:38,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:12:38,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:38,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:38,958 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:38,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:38,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:38,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:12:38,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:12:38,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:12:38,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:12:38,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:38,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:38,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:38,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:12:38,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:12:38,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:12:38,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:12:38,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:12:38,973 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:12:38,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:12:38,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:12:38,976 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:38,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:38,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:38,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:12:38,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:12:38,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:12:38,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:12:38,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:12:38,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:12:38,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:38,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:38,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:12:38,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:12:38,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:38,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:12:38,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:12:39,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:39,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:39,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:39,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:12:39,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:12:39,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:12:39,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:12:39,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:12:39,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:12:39,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:39,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:39,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:12:39,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:12:39,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:12:39,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:12:39,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:12:39,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:39,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:12:39,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:12:39,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:12:39,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:12:39,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:12:39,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:12:39,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:12:39,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:39,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:12:39,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:12:39,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:12:39,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:12:39,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:12:39,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:12:39,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:12:39,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:12:39,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:39,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:12:39,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:12:39,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:12:39,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:12:39,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:12:39,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:12:39,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:39,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:12:39,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:12:39,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:12:39,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:39,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:12:39,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:12:39,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:12:39,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:12:39,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:12:39,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:12:39,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:39,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:12:39,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:39,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:12:39,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:12:39,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:12:39,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:39,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:39,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:12:39,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:12:39,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:12:39,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:12:39,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:12:39,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:12:39,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:12:39,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:39,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:39,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:39,067 INFO L496 ElimStorePlain]: Start of recursive call 3: 10 dim-0 vars, End of recursive call: 10 dim-0 vars, and 1 xjuncts. [2019-10-13 19:12:39,422 WARN L191 SmtUtils]: Spent 354.00 ms on a formula simplification. DAG size of input: 326 DAG size of output: 65 [2019-10-13 19:12:39,423 INFO L567 ElimStorePlain]: treesize reduction 1023, result has 14.2 percent of original size [2019-10-13 19:12:39,424 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-13 19:12:39,424 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:122, output treesize:211 [2019-10-13 19:12:39,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:41,342 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-13 19:12:41,342 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 19:12:41,343 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 28] total 50 [2019-10-13 19:12:41,343 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089996084] [2019-10-13 19:12:41,344 INFO L442 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-10-13 19:12:41,344 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:12:41,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-10-13 19:12:41,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=2326, Unknown=0, NotChecked=0, Total=2450 [2019-10-13 19:12:41,346 INFO L87 Difference]: Start difference. First operand 177 states and 245 transitions. Second operand 50 states. [2019-10-13 19:12:43,485 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 58 [2019-10-13 19:12:44,411 WARN L191 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 62 [2019-10-13 19:12:44,848 WARN L191 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 98