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/heap-data/shared_mem2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fea9116 [2019-09-20 13:03:24,485 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-20 13:03:24,488 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-20 13:03:24,506 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-20 13:03:24,506 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-20 13:03:24,508 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-20 13:03:24,510 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-20 13:03:24,521 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-20 13:03:24,523 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-20 13:03:24,525 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-20 13:03:24,528 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-20 13:03:24,530 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-20 13:03:24,530 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-20 13:03:24,532 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-20 13:03:24,535 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-20 13:03:24,537 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-20 13:03:24,538 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-20 13:03:24,542 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-20 13:03:24,544 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-20 13:03:24,548 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-20 13:03:24,552 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-20 13:03:24,554 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-20 13:03:24,555 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-20 13:03:24,556 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-20 13:03:24,560 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-20 13:03:24,560 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-20 13:03:24,561 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-20 13:03:24,563 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-20 13:03:24,564 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-20 13:03:24,566 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-20 13:03:24,567 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-20 13:03:24,567 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-20 13:03:24,568 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-20 13:03:24,569 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-20 13:03:24,569 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-20 13:03:24,570 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-20 13:03:24,570 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-20 13:03:24,570 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-20 13:03:24,571 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-20 13:03:24,571 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-20 13:03:24,572 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-20 13:03:24,573 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-09-20 13:03:24,586 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-20 13:03:24,586 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-20 13:03:24,588 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-20 13:03:24,588 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-20 13:03:24,588 INFO L138 SettingsManager]: * Use SBE=true [2019-09-20 13:03:24,588 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-20 13:03:24,589 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-20 13:03:24,589 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-20 13:03:24,589 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-20 13:03:24,589 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-20 13:03:24,589 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-20 13:03:24,590 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-20 13:03:24,590 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-20 13:03:24,590 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-20 13:03:24,590 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-20 13:03:24,591 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-20 13:03:24,591 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-20 13:03:24,591 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-20 13:03:24,591 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-20 13:03:24,591 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-20 13:03:24,592 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-20 13:03:24,592 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-20 13:03:24,592 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-20 13:03:24,592 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-20 13:03:24,592 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-20 13:03:24,593 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-20 13:03:24,593 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-20 13:03:24,593 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-20 13:03:24,593 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-20 13:03:24,621 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-20 13:03:24,636 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-20 13:03:24,640 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-20 13:03:24,642 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-20 13:03:24,642 INFO L275 PluginConnector]: CDTParser initialized [2019-09-20 13:03:24,643 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/heap-data/shared_mem2.i [2019-09-20 13:03:24,717 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4fab08c77/4676552ad65a475fa288b50ecfeee845/FLAG509be46ef [2019-09-20 13:03:25,226 INFO L306 CDTParser]: Found 1 translation units. [2019-09-20 13:03:25,227 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/heap-data/shared_mem2.i [2019-09-20 13:03:25,241 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4fab08c77/4676552ad65a475fa288b50ecfeee845/FLAG509be46ef [2019-09-20 13:03:25,524 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4fab08c77/4676552ad65a475fa288b50ecfeee845 [2019-09-20 13:03:25,534 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-20 13:03:25,536 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-20 13:03:25,537 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-20 13:03:25,537 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-20 13:03:25,540 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-20 13:03:25,541 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:03:25" (1/1) ... [2019-09-20 13:03:25,543 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e8c44ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:03:25, skipping insertion in model container [2019-09-20 13:03:25,544 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:03:25" (1/1) ... [2019-09-20 13:03:25,549 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-20 13:03:25,589 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-20 13:03:26,024 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 13:03:26,040 INFO L188 MainTranslator]: Completed pre-run [2019-09-20 13:03:26,118 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 13:03:26,177 INFO L192 MainTranslator]: Completed translation [2019-09-20 13:03:26,178 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:03:26 WrapperNode [2019-09-20 13:03:26,178 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-20 13:03:26,178 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-20 13:03:26,179 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-20 13:03:26,179 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-20 13:03:26,188 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:03:26" (1/1) ... [2019-09-20 13:03:26,189 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:03:26" (1/1) ... [2019-09-20 13:03:26,203 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:03:26" (1/1) ... [2019-09-20 13:03:26,203 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:03:26" (1/1) ... [2019-09-20 13:03:26,219 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:03:26" (1/1) ... [2019-09-20 13:03:26,224 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:03:26" (1/1) ... [2019-09-20 13:03:26,227 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:03:26" (1/1) ... [2019-09-20 13:03:26,233 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-20 13:03:26,234 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-20 13:03:26,234 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-20 13:03:26,234 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-20 13:03:26,235 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:03:26" (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-09-20 13:03:26,303 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-20 13:03:26,303 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-20 13:03:26,304 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-09-20 13:03:26,304 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-09-20 13:03:26,305 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-20 13:03:26,305 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-20 13:03:26,305 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-20 13:03:26,305 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-09-20 13:03:26,306 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-09-20 13:03:26,306 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-09-20 13:03:26,306 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-09-20 13:03:26,306 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-09-20 13:03:26,307 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-09-20 13:03:26,307 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-09-20 13:03:26,308 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-09-20 13:03:26,308 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-09-20 13:03:26,310 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-09-20 13:03:26,311 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-09-20 13:03:26,311 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-09-20 13:03:26,311 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-09-20 13:03:26,312 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-09-20 13:03:26,312 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-09-20 13:03:26,312 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-09-20 13:03:26,312 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-09-20 13:03:26,312 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-09-20 13:03:26,312 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-09-20 13:03:26,312 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-09-20 13:03:26,313 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-09-20 13:03:26,313 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-09-20 13:03:26,313 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-09-20 13:03:26,314 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-09-20 13:03:26,314 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-09-20 13:03:26,314 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-09-20 13:03:26,314 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-09-20 13:03:26,314 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-09-20 13:03:26,314 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-09-20 13:03:26,314 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-09-20 13:03:26,315 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-09-20 13:03:26,315 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-09-20 13:03:26,315 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-09-20 13:03:26,315 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-09-20 13:03:26,316 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-09-20 13:03:26,316 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-09-20 13:03:26,316 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-09-20 13:03:26,316 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-09-20 13:03:26,316 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-09-20 13:03:26,316 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-09-20 13:03:26,316 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-09-20 13:03:26,317 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-09-20 13:03:26,317 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-09-20 13:03:26,317 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-09-20 13:03:26,317 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-09-20 13:03:26,317 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-09-20 13:03:26,317 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-09-20 13:03:26,317 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-09-20 13:03:26,318 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-09-20 13:03:26,318 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-09-20 13:03:26,318 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-09-20 13:03:26,318 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-09-20 13:03:26,318 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-20 13:03:26,318 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-09-20 13:03:26,318 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-09-20 13:03:26,319 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-09-20 13:03:26,319 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-09-20 13:03:26,319 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-09-20 13:03:26,319 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-09-20 13:03:26,319 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-09-20 13:03:26,319 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-09-20 13:03:26,320 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-09-20 13:03:26,321 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-09-20 13:03:26,321 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-09-20 13:03:26,321 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-09-20 13:03:26,321 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-09-20 13:03:26,321 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-09-20 13:03:26,322 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-09-20 13:03:26,322 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-09-20 13:03:26,322 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-09-20 13:03:26,323 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-09-20 13:03:26,323 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-09-20 13:03:26,323 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-09-20 13:03:26,323 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-09-20 13:03:26,323 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-09-20 13:03:26,324 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-09-20 13:03:26,324 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-09-20 13:03:26,324 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-09-20 13:03:26,324 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-09-20 13:03:26,324 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-09-20 13:03:26,325 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-09-20 13:03:26,326 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-09-20 13:03:26,326 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-09-20 13:03:26,326 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-09-20 13:03:26,327 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-09-20 13:03:26,327 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-09-20 13:03:26,327 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-09-20 13:03:26,327 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-09-20 13:03:26,327 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-09-20 13:03:26,327 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-09-20 13:03:26,328 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-09-20 13:03:26,328 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-09-20 13:03:26,328 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-09-20 13:03:26,328 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-09-20 13:03:26,328 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-09-20 13:03:26,328 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-09-20 13:03:26,328 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-09-20 13:03:26,329 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-09-20 13:03:26,329 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-09-20 13:03:26,329 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-09-20 13:03:26,329 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-09-20 13:03:26,329 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-09-20 13:03:26,329 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-09-20 13:03:26,329 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-09-20 13:03:26,330 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-09-20 13:03:26,330 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-20 13:03:26,330 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-20 13:03:26,330 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-20 13:03:26,330 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-20 13:03:26,330 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-20 13:03:26,330 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-20 13:03:26,331 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-20 13:03:26,331 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-20 13:03:26,331 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-20 13:03:26,853 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-20 13:03:26,853 INFO L283 CfgBuilder]: Removed 2 assume(true) statements. [2019-09-20 13:03:26,854 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:03:26 BoogieIcfgContainer [2019-09-20 13:03:26,855 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-20 13:03:26,856 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-20 13:03:26,856 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-20 13:03:26,859 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-20 13:03:26,860 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 01:03:25" (1/3) ... [2019-09-20 13:03:26,861 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3652a339 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:03:26, skipping insertion in model container [2019-09-20 13:03:26,861 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:03:26" (2/3) ... [2019-09-20 13:03:26,861 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3652a339 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:03:26, skipping insertion in model container [2019-09-20 13:03:26,862 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:03:26" (3/3) ... [2019-09-20 13:03:26,863 INFO L109 eAbstractionObserver]: Analyzing ICFG shared_mem2.i [2019-09-20 13:03:26,874 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-20 13:03:26,883 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-20 13:03:26,901 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-20 13:03:26,932 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-20 13:03:26,933 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-20 13:03:26,933 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-20 13:03:26,933 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-20 13:03:26,936 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-20 13:03:26,936 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-20 13:03:26,937 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-20 13:03:26,939 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-20 13:03:26,940 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-20 13:03:26,955 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states. [2019-09-20 13:03:26,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-09-20 13:03:26,961 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:03:26,962 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:03:26,964 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:03:26,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:03:26,969 INFO L82 PathProgramCache]: Analyzing trace with hash 976014476, now seen corresponding path program 1 times [2019-09-20 13:03:26,970 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:03:26,971 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:03:27,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:03:27,041 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:03:27,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:03:27,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:03:27,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:03:27,156 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:03:27,156 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-20 13:03:27,160 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-20 13:03:27,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-20 13:03:27,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-20 13:03:27,179 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 2 states. [2019-09-20 13:03:27,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:03:27,203 INFO L93 Difference]: Finished difference Result 35 states and 44 transitions. [2019-09-20 13:03:27,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-20 13:03:27,205 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2019-09-20 13:03:27,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:03:27,217 INFO L225 Difference]: With dead ends: 35 [2019-09-20 13:03:27,217 INFO L226 Difference]: Without dead ends: 18 [2019-09-20 13:03:27,222 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-20 13:03:27,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-09-20 13:03:27,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-09-20 13:03:27,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-09-20 13:03:27,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2019-09-20 13:03:27,270 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 21 transitions. Word has length 12 [2019-09-20 13:03:27,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:03:27,270 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 21 transitions. [2019-09-20 13:03:27,270 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-20 13:03:27,271 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2019-09-20 13:03:27,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-09-20 13:03:27,272 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:03:27,272 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:03:27,272 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:03:27,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:03:27,273 INFO L82 PathProgramCache]: Analyzing trace with hash 2140991581, now seen corresponding path program 1 times [2019-09-20 13:03:27,273 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:03:27,273 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:03:27,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:03:27,279 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:03:27,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:03:27,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:03:27,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:03:27,497 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:03:27,497 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-20 13:03:27,501 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-20 13:03:27,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-20 13:03:27,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:03:27,503 INFO L87 Difference]: Start difference. First operand 18 states and 21 transitions. Second operand 5 states. [2019-09-20 13:03:27,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:03:27,605 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2019-09-20 13:03:27,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:03:27,606 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-09-20 13:03:27,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:03:27,607 INFO L225 Difference]: With dead ends: 30 [2019-09-20 13:03:27,608 INFO L226 Difference]: Without dead ends: 26 [2019-09-20 13:03:27,609 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-20 13:03:27,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-09-20 13:03:27,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-09-20 13:03:27,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-09-20 13:03:27,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2019-09-20 13:03:27,616 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 32 transitions. Word has length 14 [2019-09-20 13:03:27,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:03:27,616 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 32 transitions. [2019-09-20 13:03:27,616 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-20 13:03:27,616 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2019-09-20 13:03:27,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-20 13:03:27,617 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:03:27,618 INFO L407 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:03:27,618 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:03:27,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:03:27,618 INFO L82 PathProgramCache]: Analyzing trace with hash -295797189, now seen corresponding path program 1 times [2019-09-20 13:03:27,619 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:03:27,619 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:03:27,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:03:27,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:03:27,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:03:27,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:03:27,820 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:03:27,822 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:03:27,822 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 13:03:27,915 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:03:27,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:03:27,963 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-20 13:03:27,973 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 13:03:28,072 INFO L341 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-09-20 13:03:28,072 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 18 [2019-09-20 13:03:28,073 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:03:28,100 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:28,104 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_24|], 2=[|v_#memory_int_21|]} [2019-09-20 13:03:28,115 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:03:28,128 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 15 [2019-09-20 13:03:28,129 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:03:28,157 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:28,180 INFO L341 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-09-20 13:03:28,181 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 1 case distinctions, treesize of input 34 treesize of output 21 [2019-09-20 13:03:28,183 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-20 13:03:28,195 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:28,196 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-20 13:03:28,196 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:75, output treesize:29 [2019-09-20 13:03:28,276 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:28,276 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 26 [2019-09-20 13:03:28,278 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:03:28,318 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:28,324 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_22|, |v_#memory_int_23|], 10=[|v_#memory_int_25|]} [2019-09-20 13:03:28,333 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-20 13:03:28,375 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:28,381 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-20 13:03:28,409 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:28,459 INFO L341 Elim1Store]: treesize reduction 90, result has 25.0 percent of original size [2019-09-20 13:03:28,460 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 70 treesize of output 52 [2019-09-20 13:03:28,462 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-09-20 13:03:28,488 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:28,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:28,496 INFO L496 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:03:28,496 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 10 variables, input treesize:94, output treesize:7 [2019-09-20 13:03:28,538 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:03:28,544 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-20 13:03:28,544 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 8 [2019-09-20 13:03:28,544 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-20 13:03:28,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-20 13:03:28,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-09-20 13:03:28,546 INFO L87 Difference]: Start difference. First operand 26 states and 32 transitions. Second operand 8 states. [2019-09-20 13:03:28,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:03:28,791 INFO L93 Difference]: Finished difference Result 42 states and 52 transitions. [2019-09-20 13:03:28,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-20 13:03:28,792 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2019-09-20 13:03:28,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:03:28,795 INFO L225 Difference]: With dead ends: 42 [2019-09-20 13:03:28,795 INFO L226 Difference]: Without dead ends: 38 [2019-09-20 13:03:28,799 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2019-09-20 13:03:28,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-09-20 13:03:28,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 22. [2019-09-20 13:03:28,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-09-20 13:03:28,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2019-09-20 13:03:28,810 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 17 [2019-09-20 13:03:28,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:03:28,811 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2019-09-20 13:03:28,811 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-20 13:03:28,811 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2019-09-20 13:03:28,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-20 13:03:28,812 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:03:28,812 INFO L407 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:03:28,813 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:03:28,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:03:28,813 INFO L82 PathProgramCache]: Analyzing trace with hash -1470664204, now seen corresponding path program 1 times [2019-09-20 13:03:28,813 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:03:28,813 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:03:28,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:03:28,820 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:03:28,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:03:28,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:03:29,139 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:03:29,139 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:03:29,139 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 13:03:29,235 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:03:29,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:03:29,259 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-20 13:03:29,261 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 13:03:29,279 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 10 treesize of output 8 [2019-09-20 13:03:29,280 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:03:29,298 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:29,299 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_27|], 2=[|v_#memory_int_26|]} [2019-09-20 13:03:29,314 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:03:29,321 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 15 [2019-09-20 13:03:29,321 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:03:29,331 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:29,341 INFO L341 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-09-20 13:03:29,341 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 1 case distinctions, treesize of input 34 treesize of output 21 [2019-09-20 13:03:29,342 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-20 13:03:29,349 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:29,350 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-09-20 13:03:29,350 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:66, output treesize:19 [2019-09-20 13:03:29,421 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_20|, |v_#memory_$Pointer$.offset_20|], 20=[|v_#memory_int_28|]} [2019-09-20 13:03:29,425 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 77 treesize of output 53 [2019-09-20 13:03:29,426 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-20 13:03:29,440 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:29,443 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 53 treesize of output 35 [2019-09-20 13:03:29,444 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-20 13:03:29,456 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:29,637 WARN L191 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 57 [2019-09-20 13:03:29,637 INFO L341 Elim1Store]: treesize reduction 24, result has 85.0 percent of original size [2019-09-20 13:03:29,638 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 4 new quantified variables, introduced 8 case distinctions, treesize of input 49 treesize of output 156 [2019-09-20 13:03:29,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:29,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:29,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:29,658 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-20 13:03:29,827 WARN L191 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 62 [2019-09-20 13:03:29,828 INFO L567 ElimStorePlain]: treesize reduction 106, result has 61.9 percent of original size [2019-09-20 13:03:29,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:29,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:29,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:29,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:29,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:29,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:29,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:29,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:29,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:29,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:29,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:29,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:29,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:29,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:29,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:29,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:29,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:29,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:29,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:29,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:29,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:29,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:29,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:29,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:29,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:29,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:29,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:29,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:29,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:29,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:29,884 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 3 dim-2 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-09-20 13:03:29,884 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 7 variables, input treesize:95, output treesize:171 [2019-09-20 13:03:29,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:29,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:29,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:29,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:29,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:29,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:29,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:29,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:29,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:29,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:29,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:29,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:29,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:29,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:29,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:29,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:29,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:29,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:29,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:29,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:29,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:29,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:29,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:29,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:29,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:29,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:29,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:29,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:29,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:29,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:29,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:29,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:03:29,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:03:29,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:03:29,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:29,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:29,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:29,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:29,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:29,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:29,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:29,976 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:29,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:29,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:03:29,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:29,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:29,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:29,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:29,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:29,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:29,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:03:29,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:29,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:29,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:29,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:29,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:29,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:29,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:03:29,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:03:29,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:29,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:29,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:30,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:30,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:30,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:30,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:03:30,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:30,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:30,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:30,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:30,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:30,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:30,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:03:30,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:30,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:30,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:30,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:30,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:30,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:30,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:30,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:30,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:30,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:03:30,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:03:30,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:30,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:30,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:30,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:30,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:30,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:30,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:30,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:30,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:30,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:03:30,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:30,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:30,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:30,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:30,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:30,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:30,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:03:30,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:30,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:30,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:30,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:30,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:30,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:30,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:03:30,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:30,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:30,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:30,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:30,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:30,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:30,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:30,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:30,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:30,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:30,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:30,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:30,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:30,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:30,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:30,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:30,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:31,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:31,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:03:31,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:03:31,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:03:31,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:31,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:31,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:31,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:31,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:31,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:31,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:31,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:31,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:31,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:03:31,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:31,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:31,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:31,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:31,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:31,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:31,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:03:31,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:31,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:31,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:31,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:31,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:31,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:31,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:03:31,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:03:31,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:31,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:31,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:31,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:31,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:31,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:31,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:03:31,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:31,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:31,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:31,492 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:31,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:31,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:31,495 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:03:31,495 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:31,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:31,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:31,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:31,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:31,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:31,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:31,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:31,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:31,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:03:31,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:03:31,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:31,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:31,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:31,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:31,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:31,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:31,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:31,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:31,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:31,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:03:31,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:31,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:31,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:31,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:31,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:31,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:31,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:03:31,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:31,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:31,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:31,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:31,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:31,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:31,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:03:31,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:31,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:31,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:31,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:31,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:31,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:31,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:31,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:31,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:31,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:31,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:31,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:31,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:31,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:31,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:31,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:31,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:34,049 WARN L191 SmtUtils]: Spent 2.19 s on a formula simplification. DAG size of input: 221 DAG size of output: 65 [2019-09-20 13:03:34,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-09-20 13:03:34,231 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 48 [2019-09-20 13:03:34,233 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:34,258 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:34,259 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 36 [2019-09-20 13:03:34,259 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:03:34,272 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:34,273 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 36 [2019-09-20 13:03:34,273 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:03:34,345 INFO L567 ElimStorePlain]: treesize reduction 8, result has 85.5 percent of original size [2019-09-20 13:03:34,348 INFO L496 ElimStorePlain]: Start of recursive call 1: 10 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:03:34,349 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 11 variables, input treesize:97, output treesize:7 [2019-09-20 13:03:34,376 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:03:34,380 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-20 13:03:34,380 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2019-09-20 13:03:34,381 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-20 13:03:34,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-20 13:03:34,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2019-09-20 13:03:34,382 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand 14 states. [2019-09-20 13:03:39,489 WARN L191 SmtUtils]: Spent 1.23 s on a formula simplification. DAG size of input: 92 DAG size of output: 47 [2019-09-20 13:03:40,350 WARN L191 SmtUtils]: Spent 587.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 67 [2019-09-20 13:03:40,542 WARN L191 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 24 [2019-09-20 13:03:40,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:03:40,813 INFO L93 Difference]: Finished difference Result 48 states and 59 transitions. [2019-09-20 13:03:40,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-20 13:03:40,814 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 18 [2019-09-20 13:03:40,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:03:40,816 INFO L225 Difference]: With dead ends: 48 [2019-09-20 13:03:40,817 INFO L226 Difference]: Without dead ends: 42 [2019-09-20 13:03:40,818 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=130, Invalid=422, Unknown=0, NotChecked=0, Total=552 [2019-09-20 13:03:40,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-09-20 13:03:40,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 30. [2019-09-20 13:03:40,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-09-20 13:03:40,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2019-09-20 13:03:40,825 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 18 [2019-09-20 13:03:40,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:03:40,825 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2019-09-20 13:03:40,825 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-20 13:03:40,825 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2019-09-20 13:03:40,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-20 13:03:40,826 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:03:40,826 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:03:40,827 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:03:40,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:03:40,827 INFO L82 PathProgramCache]: Analyzing trace with hash -1648172846, now seen corresponding path program 1 times [2019-09-20 13:03:40,827 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:03:40,827 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:03:40,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:03:40,831 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:03:40,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:03:40,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:03:41,134 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:03:41,135 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:03:41,135 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 13:03:41,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:03:41,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:03:41,233 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-20 13:03:41,235 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 13:03:41,278 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_21|, |v_#memory_$Pointer$.base_21|], 12=[|v_#memory_int_29|]} [2019-09-20 13:03:41,283 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 77 treesize of output 59 [2019-09-20 13:03:41,284 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-20 13:03:41,296 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:41,300 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 59 treesize of output 35 [2019-09-20 13:03:41,301 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-20 13:03:41,313 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:41,423 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 40 [2019-09-20 13:03:41,424 INFO L341 Elim1Store]: treesize reduction 12, result has 88.3 percent of original size [2019-09-20 13:03:41,424 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 42 treesize of output 108 [2019-09-20 13:03:41,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:41,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:41,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:41,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:41,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:41,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:41,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:41,431 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-20 13:03:41,586 WARN L191 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 41 [2019-09-20 13:03:41,586 INFO L567 ElimStorePlain]: treesize reduction 174, result has 35.8 percent of original size [2019-09-20 13:03:41,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:41,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:41,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:41,591 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-09-20 13:03:41,591 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:84, output treesize:96 [2019-09-20 13:03:41,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:41,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:41,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:45,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:45,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:45,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:45,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:45,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:45,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:45,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:45,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:45,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:45,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:45,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:45,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:45,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:45,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:51,875 WARN L191 SmtUtils]: Spent 6.06 s on a formula simplification. DAG size of input: 55 DAG size of output: 10 [2019-09-20 13:03:51,899 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 22 treesize of output 10 [2019-09-20 13:03:51,900 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:03:51,902 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:51,903 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:03:51,903 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:7 [2019-09-20 13:03:51,921 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-20 13:03:51,924 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-20 13:03:51,925 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 15 [2019-09-20 13:03:51,925 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-20 13:03:51,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-20 13:03:51,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=169, Unknown=2, NotChecked=0, Total=210 [2019-09-20 13:03:51,926 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand 15 states. [2019-09-20 13:03:54,526 WARN L191 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 43 [2019-09-20 13:04:00,709 WARN L191 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 57 [2019-09-20 13:04:10,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:04:10,903 INFO L93 Difference]: Finished difference Result 61 states and 74 transitions. [2019-09-20 13:04:10,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-20 13:04:10,904 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 21 [2019-09-20 13:04:10,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:04:10,904 INFO L225 Difference]: With dead ends: 61 [2019-09-20 13:04:10,904 INFO L226 Difference]: Without dead ends: 0 [2019-09-20 13:04:10,905 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 21.1s TimeCoverageRelationStatistics Valid=136, Invalid=509, Unknown=5, NotChecked=0, Total=650 [2019-09-20 13:04:10,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-20 13:04:10,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-20 13:04:10,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-20 13:04:10,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-20 13:04:10,906 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 21 [2019-09-20 13:04:10,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:04:10,906 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-20 13:04:10,907 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-20 13:04:10,907 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-20 13:04:10,907 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-20 13:04:10,911 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-09-20 13:04:11,062 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 50